Please use this identifier to cite or link to this item: https://doi.org/10.1016/S1090-7807(02)00069-1
Title: An efficient algorithm for automatic phase correction of NMR spectra based on entropy minimization
Authors: Chen, L. 
Weng, Z. 
Goh, L. 
Garland, M. 
Keywords: Derivative
Entropy minimization
NMR spectra
Phase correction
Issue Date: 2002
Citation: Chen, L., Weng, Z., Goh, L., Garland, M. (2002). An efficient algorithm for automatic phase correction of NMR spectra based on entropy minimization. Journal of Magnetic Resonance 158 (1-2) : 164-168. ScholarBank@NUS Repository. https://doi.org/10.1016/S1090-7807(02)00069-1
Abstract: A new algorithm for automatic phase correction of NMR spectra based on entropy minimization is proposed. The optimal zero-order and first-order phase corrections for a NMR spectrum are determined by minimizing entropy. The objective function is constructed using a Shannon-type information entropy measure. Entropy is defined as the normalized derivative of the NMR spectral data. The algorithm has been successfully applied to experimental 1H NMR spectra. The results of automatic phase correction are found to be comparable to, or perhaps better than, manual phase correction. The advantages of this automatic phase correction algorithm include its simple mathematical basis and the straightforward, reproducible, and efficient optimization procedure. The algorithm is implemented in the Matlab program ACME - Automated phase Correction based on Minimization of Entropy. © 2002 Elsevier Science (USA). All rights reserved.
Source Title: Journal of Magnetic Resonance
URI: http://scholarbank.nus.edu.sg/handle/10635/91867
ISSN: 10907807
DOI: 10.1016/S1090-7807(02)00069-1
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

68
checked on Nov 17, 2018

WEB OF SCIENCETM
Citations

69
checked on Oct 31, 2018

Page view(s)

132
checked on Nov 2, 2018

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.