Cart (Loading....) | Create Account
Close category search window

A Fast Method for Designing Time-Optimal Gradient Waveforms for Arbitrary k -Space Trajectories

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Lustig, M. ; Magn. Resonance Syst. Res. Lab., Stanford Univ., Stanford, CA ; Seung-Jean Kim ; Pauly, J.M.

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.

Published in:

Medical Imaging, IEEE Transactions on  (Volume:27 ,  Issue: 6 )

Date of Publication:

June 2008

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.