A fast method for designing time-optimal gradient waveforms for arbitrary k-space trajectories.
A fast and simple algorithm for designing time-optimal waveforms is presented. The algorithm accepts a given arbitrary multidimensional k-space trajectory as the input and outputs the time-optimal gradient waveform that traverses k-space along that path in minimum time. The algorithm is noniterative, and its run time is independent of the complexity of the curve, i.e., the number of switches between slew-rate limited acceleration, slew-rate limited deceleration, and gradient amplitude limited regions. The key in the method is that the gradient amplitude is designed as a function of arc length along the k-space trajectory, rather than as a function of time. Several trajectory design examples are presented.
Lustig
Michael
M
Magnetic Resonance Systems Research Laboratory, Stanford University, 119 Quillen Ct., Stanford, CA 94305, USA. mlustig@mrsrl.stanford.edu
Kim
Seung-Jean
SJ
Pauly
John M
JM
D000465:Algorithms; D007089:Image Enhancement / Q000379:methods*; D007090:Image Interpretation, Computer-Assisted / Q000379:methods*; D021621:Imaging, Three-Dimensional / Q000379:methods*; D008279:Magnetic Resonance Imaging / Q000379:methods*; D015203:Reproducibility of Results; D012680:Sensitivity and Specificity