← Back to Patent Explorer
US5606258A Expired / Lapsed US ⏱️ 0.0 years remaining

Control interface for an MRI system

Assignee: University of California
•
Filing: 1993-03-17
•
Granted: 1997-02-25
•
Expires: 2013-03-17
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A control interface for a magnetic resonance imaging (MRI) system provides extended, improved linker syntax/techniques that maximize reuse of program segments, allow optimal compromise between detailed representation and efficient sequence program design and maintenance, and permit uniform application of the loop syntax to link commands for MRI sequencers with a wide range of hardware implementations. The control interface provides, among other features, generalized loops at the link level; loop symbols representing loop identity can be associated with scope and/or range (with some kind of limited grammar in the link command itself that supports identification of scope and/or range); parameter tables that can be associated with loop symbols (any given table can be associated with N loop symbols in order to provide multidimensional sequences); multiple levels of loop nesting; and directed limited syntax that provides limited grammar, and range and syntax checking and requires the user to explicitly enter information into the interface.

Inventors

  • 👤 John C. Hoenninger, III
  • 👤 Lawrence E. Crooks

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-08 03:56
CPC Classifications
G; G01; G01R; G01R33/00; G01R33/20; G01R33/44; G01R33/48; G01R33/54; G16; G16H; G16H40/00; G16H40/60; G16H40/63; G01R33/543

Claims Analysis

Total Claims: 32
Claim 1
Independent Claim 176 words
In a magnetic resonance imaging (MRI) system having a sequencer which controls generation of at least one of (1) a spatially varying magnetic field, and (2) a spatially varying RF field, the system further including a linking computer coupled to the sequencer the linking computer linking code to provide linked executable code for execution by the sequencer, a method for linking code for loading into and execution by the sequencer, said method including: linking code on a linking computer by performing at least the following steps: (a) providing, on the host computer, at least one link loop definition associated with plural sets of parameter values, and (b) generating, with the linking computer, linked executable code in response to said link loop definition and said plural sets of parameter values; (c) loading the linked code from the linking computer into said sequencer; (d) executing said provided linked code with said sequencer; and (e) controlling at least one of (1) a spatially varying magnetic field, and (2) a spatially varying RF field in accordance with said sequencer execution.
Claim 2
Dependent Claim 176 words
In a magnetic resonance imaging (MRI) system having a sequencer which controls generation of at least one of (1) a spatially varying magnetic field, and (2) a spatially varying RF field, the system further including a linking computer coupled to the sequencer the linking computer linking code to provide linked executable code for execution by the sequencer, a method for linking code for loading into and execution by the sequencer, said method including: linking code on a linking computer by performing at least the following steps: (a) providing, on the host computer, at least one link loop definition associated with plural sets of parameter values, and (b) generating, with the linking computer, linked executable code in response to said link loop definition and said plural sets of parameter values; (c) loading the linked code from the linking computer into said sequencer; (d) executing said provided linked code with said sequencer; and (e) controlling at least one of (1) a spatially varying magnetic field, and (2) a spatially varying RF field in accordance with said sequencer execution.
Claim 3
Dependent Claim 26 words
A method as in claim 1 wherein said generating step (b) includes substituting at least one of said plural parameter value sets into previously generated code.
Claim 4
Dependent Claim 52 words
A method as in claim 1 wherein program instructions specify N iterations of said link loop, N an arbitrary integer, and wherein said generating step (b) includes generating N copies of inline code to said sequencer, each of said N copies including substitute values obtained from said plural sets of parameter values.
Claim 5
Dependent Claim 20 words
A method as in claim 1 further including requiring explicit specification of the range and/or scope of said link loop.
Claim 6
Dependent Claim 23 words
A method as in claim 4 further including the step of automatically checking to determine whether said range and/or scope specification is present.
Claim 7
Dependent Claim 29 words
A method as in claim 1 further including specifying, as part of said link loop definition, that said link loop is nested with at least one other link loop.
Claim 8
Dependent Claim 31 words
A method as in claim 1 further including specifying, as part of said link loop definition, that said link loop is nested with K other link loops, K an arbitrary integer.
Claim 9
Dependent Claim 49 words
A method as in claim 1 wherein: said method further includes defining a further loop for execution by said sequencer; and said generating step includes generating code in response to said defined further loop; and said executing step comprising iteratively executing said further loop representing code with said sequencer.
Claim 10
Dependent Claim 18 words
A method as in claim 1 further including defining global symbolic function arguments within said link loop definition.
Claim 11
Dependent Claim 23 words
A method as in claim 1 further including displaying at least a part of said link loop definition in a multidimensional spreadsheet format.
Claim 12
Dependent Claim 15 words
A method as in claim 1 further including specifying a value specified by a formula.
Claim 13
Dependent Claim 27 words
A method as in claim 1 further including referencing a first set of parameter values with a second set of parameter values different from said first set.
Claim 14
Independent Claim 148 words
A system for generating executable code for a sequencer of a magnetic resonance imaging (MRI) system, said system including: a linking computer for linking code to provide linked code, the linking computer including: link associating means for associating at least one link loop definition with at least one set of parameter values and at least one scope and/or range parameter, linking means coupled to the linking associating means for generating linked executable code in response to said link loop definition, said parameter values set, and said scope and/or range parameter, and loading means coupled to the linking means for providing said generated linked executable code to said sequencer; and a sequencer coupled to the linking computer, the sequencer executing said provided linked executable code so as to provide a controlled sequence of states defining at least one of (i) a magnetic field, and (ii) a radio frequency field.
Claim 15
Independent Claim 148 words
A system for generating executable code for a sequencer of a magnetic resonance imaging (MRI) system, said system including: a linking computer for linking code to provide linked code, the linking computer including: link associating means for associating at least one link loop definition with at least one set of parameter values and at least one scope and/or range parameter, linking means coupled to the linking associating means for generating linked executable code in response to said link loop definition, said parameter values set, and said scope and/or range parameter, and loading means coupled to the linking means for providing said generated linked executable code to said sequencer; and a sequencer coupled to the linking computer, the sequencer executing said provided linked executable code so as to provide a controlled sequence of states defining at least one of (i) a magnetic field, and (ii) a radio frequency field.
Claim 16
Dependent Claim 58 words
A system as in claim 13 wherein said generating and providing means includes means for generating and providing a plurality of copies of inline code to said sequencer, the number of iterations being specified at least in part by said range and/or scope parameter, each of said iterations including substitute values obtained from said sets of parameter values.
Claim 17
Dependent Claim 19 words
A system as in claim 13 further including means for requiring explicit specification of the range and/or scope parameter.
Claim 18
Dependent Claim 23 words
A system as in claim 13 further including means for automatically checking to determine whether said range and/or scope parameter has been specified.
Claim 19
Dependent Claim 20 words
A system as in claim 13 wherein said link loop definition specifies nesting within at least one other link loop.
Claim 20
Dependent Claim 21 words
A system as in claim 13 wherein said link loop definition specifies nesting within K other link loops, K an integer.
Claim 21
Dependent Claim 48 words
A system as in claim 13 wherein: said system further includes means for defining a further loop for execution by said sequencer; said generating and providing means includes means for providing code representing said further loop; and said sequencer iteratively executes said provided code representing said further loop.
Claim 22
Dependent Claim 21 words
A system as in claim 13 further including means for defining global symbolic function arguments associated with said link loop definition.
Claim 23
Dependent Claim 25 words
A system as in claim 13 further including means for displaying at least a part of said link loop definition in a multidimensional spreadsheet format.
Claim 24
Dependent Claim 18 words
A system as in claim 13 further including means for specifying a formula associated with said link loop.
Claim 25
Dependent Claim 24 words
A system as in claim 13 further including means for referencing a further set of parameter values with said first-mentioned set of parameter values.
Claim 26
Dependent Claim 158 words
In a magnetic resonance imaging (MRI) system having a linking computer which links code to provide an executable linked code and provides the executable linked code to a sequencer which executes the linked code to control generation of at least one of a spatially varying magnetic field and a spatially yawing RF field, a method for linking code for execution by the sequencer, said method including: programming the linking computer to: (a) define at least one global variable; (b) provide at least one link loop definition; (c) generate linked executable code in response to said link loop definition and said defined global variable; and (d) provide said generated code to said sequencer and load said generated linked executable code into said sequencer; (e) executing said provided linked executable code with said sequencer; and (f) controlling, with the sequencer, at least one of a spatially varying magnetic field and a spatially varying RF field in accordance with said execution.
Claim 27
Dependent Claim 158 words
In a magnetic resonance imaging (MRI) system having a linking computer which links code to provide an executable linked code and provides the executable linked code to a sequencer which executes the linked code to control generation of at least one of a spatially varying magnetic field and a spatially yawing RF field, a method for linking code for execution by the sequencer, said method including: programming the linking computer to: (a) define at least one global variable; (b) provide at least one link loop definition; (c) generate linked executable code in response to said link loop definition and said defined global variable; and (d) provide said generated code to said sequencer and load said generated linked executable code into said sequencer; (e) executing said provided linked executable code with said sequencer; and (f) controlling, with the sequencer, at least one of a spatially varying magnetic field and a spatially varying RF field in accordance with said execution.
Claim 28
Dependent Claim 43 words
A system as in claim 24 wherein said defining step (a) comprises defining a global system RF pulse repetition time (TR), and said generating step (c) includes the step of generating code parameters in accordance with said specified global RF pulse repetition time.
Claim 29
Dependent Claim 22 words
A method as in claim 25 wherein said generating step (c) further includes the step of changing slice-specific parameters in said code.
Claim 30
Dependent Claim 36 words
A system as in claim 24 wherein said defining step (a) comprises defining a global system spin-echo time parameter (TE), and said generating step (c) includes generating code parameters in accordance with said global parameter TE.
Claim 31
Dependent Claim 244 words
In a magnetic resonance imaging (MRI) system having a linking computer that performs a linking operation to provide executable linked code for execution by a sequencer, the sequencer controlling generation of at least one of a spatially varying magnetic field and a spatially varying RF field in accordance with the linked executable code, a method including: linking code on the linking computer, including: (a) providing at least one link loop definition specifying plural sets of parameter values; (b) defining plural nested loops at the link level, including specifying a loop index symbol for said loop and specifying at least one range and/or scope parameter associated with said index symbol; (c) associating each of said plural defined nested loops with a different one of said plural sets of parameter values; and (d) generating linked, executable sequencer code in response to said defined nested loops, said plural parameter value sets and said range and/or scope parameter, including the step of determining whether a link loop associated with a particular MRI parameter is defined by a link loop definition and specifying at least one default value for said parameter if said determination reveals that no such definition exists; (e) loading the linked executable code from the linking computer into the sequencer; and (f) executing said loaded code with said sequencer to generate an ordered sequence of sequencer states, said ordered sequence controlling at least one of a spatially varying magnetic field and a spatially varying RF field.
Claim 32
Dependent Claim 244 words
In a magnetic resonance imaging (MRI) system having a linking computer that performs a linking operation to provide executable linked code for execution by a sequencer, the sequencer controlling generation of at least one of a spatially varying magnetic field and a spatially varying RF field in accordance with the linked executable code, a method including: linking code on the linking computer, including: (a) providing at least one link loop definition specifying plural sets of parameter values; (b) defining plural nested loops at the link level, including specifying a loop index symbol for said loop and specifying at least one range and/or scope parameter associated with said index symbol; (c) associating each of said plural defined nested loops with a different one of said plural sets of parameter values; and (d) generating linked, executable sequencer code in response to said defined nested loops, said plural parameter value sets and said range and/or scope parameter, including the step of determining whether a link loop associated with a particular MRI parameter is defined by a link loop definition and specifying at least one default value for said parameter if said determination reveals that no such definition exists; (e) loading the linked executable code from the linking computer into the sequencer; and (f) executing said loaded code with said sequencer to generate an ordered sequence of sequencer states, said ordered sequence controlling at least one of a spatially varying magnetic field and a spatially varying RF field.

References Cited (Backward Citations)

US4845613A Cited
US5068786A Cited
US4764894A Cited
US4689564A Cited
US4707661A Cited
US5144242A Cited
US5465361A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2000-02-25 2000-08-26 2001-02-25 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2004-02-25 2004-08-26 2005-02-25 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2008-02-25 2008-08-26 2009-02-25 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag