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

Machine generation of machine-executable state-change instructions for magnetic resonance imaging

Assignee: University of California
•
Filing: 1986-07-29
•
Granted: 1987-11-17
•
Expires: 2006-07-29
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract An assembler/linker process utilizes predetermined control program segments ("templates" defining a sub-sequence of magnetic resonance imaging (MRI) states) together with predetermined program-change tables of MRI parameter values. At least some of the program segments are referenced by predetermined symbolic addresses and include pointer-references to corresponding ones of the table entries. The assembler/linker process machine replicates a predetermined set of such slice/specific program segments in a predetermined order while also simultaneously indexing corresponding symbolic addresses and referenced table entries in a predetermined sequence so as to maintain proper correspondence between slice-specific main programs and subroutines for each replicated program segment. In addition, certain of the replicated program segments may be defined having predetermined symbolic addresses which are not indexed thus further conserving the number of program instructions which need to be replicated and stored in the assembly/linkage process. A subset of slice-specific program segments can be further designated for replication as a unit before following program segments are utilized. A unique linker language level syntax is also provided for an ordered string of input digital data used to control the assembler/linker replication process.

Inventors

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

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-03 00:04
CPC Classifications
G; G01; G01R; G01R33/00; G01R33/20; G01R33/44; G01R33/48; G01R33/54

Claims Analysis

Total Claims: 7
Claim 1
Independent Claim 130 words
A process of machine generating machine executable state-change instructions for a sequence controller of a multi-slice magnetic resonance imaging (MRI) system, said process comprising the steps of: defining predetermined program-change tables T1, T2, . . . Tn of MRI parameter values in a machine accessible memory; defining predetermined slice-specific program segments P1, P2, . . . Pm of machine executable MRI sequencer instructions in a machine accessible memory, which segments are referenced by predetermined respective symbolic addresses and which segments include pointer-references to said tables; and machine replicating a predetermined set of said slice-specific program segments in a predetermined order while indexing the corresponding symbolic addresses and referenced table entries in a predetermined sequence so as to maintain proper correspondence between slice-specific main programs and subroutines in each replicated segment.
Claim 2
Dependent Claim 130 words
A process of machine generating machine executable state-change instructions for a sequence controller of a multi-slice magnetic resonance imaging (MRI) system, said process comprising the steps of: defining predetermined program-change tables T1, T2, . . . Tn of MRI parameter values in a machine accessible memory; defining predetermined slice-specific program segments P1, P2, . . . Pm of machine executable MRI sequencer instructions in a machine accessible memory, which segments are referenced by predetermined respective symbolic addresses and which segments include pointer-references to said tables; and machine replicating a predetermined set of said slice-specific program segments in a predetermined order while indexing the corresponding symbolic addresses and referenced table entries in a predetermined sequence so as to maintain proper correspondence between slice-specific main programs and subroutines in each replicated segment.
Claim 3
Dependent Claim 22 words
A process as in claim 1 wherein said machine replicating step includes: replicating included program segments without indexing predetermined symbolic address(es) thereof.
Claim 4
Dependent Claim 90 words
A process as in claim 2 wherein said machine replicating step is controlled by an ordered string of input digital data of the following format: P3(P4:6)S20P7/P10(P14)S1:20P15P16;C1:256 wherein Pn=symbols representing predetermined program segments; /=symbol representing a separation between subroutines and main programs; (x)Sy=slice-specific designation symbols identifying slice specific program segments x to be replicated for slices y; ;=a symbol representing a separation between the main program segments and cycle specification; and C1:256=symbols associated with an entire sequence of program segments to be replicated which specifies the range of successive phase-encoding cycles.
Claim 5
Dependent Claim 41 words
A process as in claim 3 wherein said ordered string of input digital data includes a further symbol (Rq) designating a subset of slice-specific program segments to be replicated as a unit q times before the following program segment is utilized.
Claim 6
Dependent Claim 91 words
A process as in claim 1 wherein said machine replicating step is controlled by an ordered string of input digital data of the following format: P3(P4:6)S20P7/P10(P14)S1:20P15P16;C1:256 wherein Pn=symbols representing predetermined program segments; /=symbol representing a separation between subroutines and main programs; (x)Sy=slice-specific designation symbols identifying slice specific program segments x to be replicated for slices y; ;=a symbol representing a separation between the designated main program segments and cycle specification; and C1:256=symbols associated with an entire sequence of program segments to be replicated which specifies the range of successive phase-encoding cycles.
Claim 7
Dependent Claim 41 words
A process as in claim 5 wherein said ordered string of input digital data includes a further symbol (Rq) designating a subset of slice-specific program segments to be replicated as a unit q times before the following program segment is utilized.

References Cited (Backward Citations)

US4297637A Cited
US4318043A Cited
US4471305A Cited
US4599565A Cited
GB2126731A Cited
EP0109633A2 Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1990-11-16 1991-05-18 1991-11-17 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1994-11-16 1995-05-18 1995-11-17 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1998-11-16 1999-05-18 1999-11-17 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag