Summary
|
For Full-Text PDF, please login, if you are a member of IEICE, or go to Pay Per View on menu list, if you are a nonmember of IEICE. |
|
Noise Reduction for NMR FID Signals via Oversampled Real-Valued Discrete Gabor Transform Liang TAO Hon Keung KWAN Publication IEICE TRANSACTIONS on Information and Systems Vol.E88-D No.7 pp.1511-1518 Publication Date: 2005/07/01 Online ISSN: DOI: 10.1093/ietisy/e88-d.7.1511 Print ISSN: 0916-8532 Type of Manuscript: Special Section PAPER (Special Section on Recent Advances in Circuits and Systems--Part 1) Category: Adaptive Signal Processing Keyword: oversampled discrete Gabor transform, nuclear magnetic resonance free induction decay signals, signal enhancement, Gaussian synthesis window, Full Text: PDF(700.5KB)>>
Summary: An efficient algorithm to reduce the noise from the Nuclear Magnetic Resonance Free Induction Decay (NMR FID) signals is presented, in this paper, via the oversampled real-valued discrete Gabor transform using the Gaussian synthesis window. An NMR FID signal in the Gabor transform domain (i.e., a joint time-frequency domain) is concentrated in a few number of Gabor transform coefficients while the noise is fairly distributed among all the coefficients. Therefore, the NMR FID signal can be significantly enhanced by performing a thresholding technique on the coefficients in the transform domain. Theoretical and simulation experimental analyses in this paper show that the oversampled Gabor transform using the Gaussian synthesis window is more suitable for the NMR FID signal enhancement than the critically-sampled one using the exponential synthesis window, because both the Gaussian synthesis window and its corresponding analysis window in the oversampling case can have better localization in the frequency domain than the exponential synthesis window and its corresponding analysis window in the critically-sampling case. Moreover, to speed up the transform, instead of the commonly-used complex-valued discrete Gabor transform, the real-valued discrete Gabor transform presented in our previous work is adopted in the proposed algorithm. | ||||||||||
| ||||||||||
