A fast and practical computation method for magnetic resonance simulators

Abstract

PurposeThis work aims to develop a fast and practical computation method for MR simulations. The computational cost of MR simulations is often high because magnetizations of many isochromats are updated using a small step size on the order of microseconds. There are two types of subsequences to be processed for the simulations: subsequences with and without RF pulses. While straightforward implementations spend most of their time calculating subsequences with RF pulses, there is a method which efficiently reuses the computation for repetitive RF pulses.Theory and MethodsA new method for efficiently processing subsequences with RF pulses is proposed. Rather than using an iterative update approach, the proposed method computes the combined transition which combines all transitions applied iteratively for each subsequence with RF pulses. The combined transition is used again when the same subsequence is used later. The combined transitions are cached and managed using a least recently used algorithm.ResultsThe proposed method was found to accelerate the simulation by ˜20 times when 3.9 million isochromats were simulated using spin‐echo sequences. Even on a laptop computer, the proposed method was able to simulate these sequences in ˜3.5 min.ConclusionAn efficient method for simulating pulse sequences is proposed. The proposed method computes and manages combined transitions, making MR simulation practical on a wide range of computers, including laptops.