Suppression of Diagonal Peaks with Singular Value Decomposition
β Scribed by Guang Zhu; Wing Y. Choy; Guoqiang Song; B.C. Sanctuary
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 99 KB
- Volume
- 132
- Category
- Article
- ISSN
- 1090-7807
No coin nor oath required. For personal study only.
β¦ Synopsis
A number of modified two-dimensional NMR pulse sequences FIDs in the indirectly detected (t 1 ) domain after the Fourier have been developed to suppress the diagonal peaks which may transformation of the directly detected (t 2 ) domain. These introduce severe spectral distortions, such as t 1 -ridges and large FIDs are reconstructed following the removal of the largest dispersive signals on the diagonal. However, these modifications singular values. The final spectrum which is free of the increase the minimum number of scans, require more complicated dispersive resonances can be obtained by Fourier transforexperimental designs, and often decrease the sensitivity of the mation of the t 1 domain. We demonstrate here that pureexperiment. Here we present a post-acquisition method to remove phase COSY spectra with the suppression of diagonal peaks the undesirable diagonal peaks by using singular value decomposican readily be obtained by the use of this proposed method,
π SIMILAR VOLUMES
One of the most frequently used operations in singular value decomposition (SVD) is the two-sided rotation transformation on \(2 \times 2\) matrices. In order to achieve high performances for CORDIC SVD processors, a new method of carrying out the two-sided rotation transformation on \(2 \times 2\)
A novel method for suppression of 13 C-13 C diagonal peaks without sensitivity loss in three-dimensional HCCH TROSY-type NMR correlation experiments involving aromatic side chains in proteins (Pervushin et al., J. Am. Chem. Soc. 120, 6394 -6400 (1998)) is presented. The key element is a spin-state-s
Singular value decomposition (SVD) is used in many applications such as real-time signal processing where fast computation of these problems is needed. In this paper, parallel algorithms for solving the singular value decomposition problem are discussed. The algorithms are designed for optically int