Fast multi-dimensional NMR acquisition and processing using the sparse FFT
Increasing the dimensionality of NMR experiments strongly enhances the spectral resolution and provides invaluable direct information about atomic interactions. However, the price tag is high: long measurement times and heavy requirements on the computation power and data storage. We introduce sparse fast Fourier transform as a new method of NMR signal collection and processing, which is capable of reconstructing high quality spectra of large size and dimensionality with short measurement times, faster computations than the fast Fourier transform, and minimal storage for processing and handling of sparse spectra. The new algorithm is described and demonstrated for a 4D BEST-HNCOCA spectrum.
KeywordsCompressed sensing Reduced dimensionality Non uniform sampling Fast NMR
The work was supported by the Swedish Research Council (Research Grant 2011-5994); Swedish National Infrastructure for Computing (Grant SNIC 001/12-271). The Swedish NMR Centre is acknowledged for spectrometer time.
- Ghazi B, Hassanieh H, Indyk P, Katabi D, Price E, Shi L (2013) Sample-optimal average-case sparse Fourier transform in two dimensions. In: 51st annual Allerton conference on communication, control, and computing, October 2013Google Scholar
- Hassanieh H, Indyk P, Katabi D, Price E (2012a) Nearly optimal sparse fourier transform. In: The 44th symposium on theory of computing, STOCGoogle Scholar
- Hassanieh H, Indyk P, Katabi D, Price E (2012b) Simple and practical algorithm for sparse fourier transform. In: Twenty-third annual ACM-SIAM symposium on discrete algorithms, SODAGoogle Scholar
- Motáčková V, Nováček J, Zawadzka-Kazimierczuk A, Kazimierczuk K, Žídek L, Šanderová H, Krásný L, Koźmiński W, Sklenář V (2010) Strategy for complete NMR assignment of disordered proteins with highly repetitive sequences based on resolution-enhanced 5D experiments. J Biomol NMR 48:169–177. doi: 10.1007/s10858-010-9447-3 CrossRefGoogle Scholar