The Fastest Arbitrary K-Space Trajectories

Sana Vaziri¹, Michael Lustig¹

We present a method to compute the fastest possible gradient waveforms for a given k-space trajectory. In our design, we exploit the fact that each gradient set has its own constraints. The resulting trajectory is therefore not rotationally invariant and a redesign is needed when rotated. However, our algorithm is fast and non-iterative and can compute waveforms on-the-fly. Results of 5-10% waveform time reduction are presented for spiral and circular trajectories.