Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Fast multi-dimensional NMR acquisition and processing using the sparse FFT

Fast multi-dimensional NMR acquisition and processing using the sparse FFT

Thumbnail Image
Download
Name

SFFT_NMR_Paper_Rev_v6.pdf

Size

932.74 KB

Format

Adobe PDF

Checksum (MD5)

b42b84f57d3a10aaff2c473ba9ce7f51

Author(s)
Hassanieh, Haitham
•
Mayzel, Maxim
•
Shi, Lixin
•
Katabi, Dina
•
Orekhov, Vadislav Yu
Date Issued
June 2015
Journal
Journal of Biomolecular NMR
Publisher
Springer-Verlag
Citation
Hassanieh, Haitham, Maxim Mayzel, Lixin Shi, Dina Katabi, and Vladislav Yu Orekhov. “Fast Multi-Dimensional NMR Acquisition and Processing Using the Sparse FFT.” Journal of Biomolecular NMR 63, no. 1 (September 2015): 9–19.
Version
Author's final manuscript
Abstract
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.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
http://creativecommons.org/licenses/by-nc-sa/4.0/
Persistent DSpace Link
http://hdl.handle.net/1721.1/102476
DOI of Published Version
https://doi.org/10.1007/s10858-015-9952-5
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.