Linear Interference Cancellation of Asynchronous CDMA Systems by Preconditioned CG Method
2004
It is well known that the iterative method is used for solving a set of linear equations corresponding to linear interference cancellation structures. An ideal computation of the decorrelating or the linear minimum mean-squared-error (LMMSE) detector requires order K3 flops, where K is the number of users. To alleviate the computational complexity, iterative decorrelating and the LMMSE detectors are proposed. In this paper, the symmetric successive over relaxation (SSOR) preconditioning scheme is applied to the conjugate gradient (CG) method. The performance of the detectors is investigated and it is found that the SSOR preconditioned CG (PCG) method can provide significantly faster convergence than CG method.
Keywords:
- Single antenna interference cancellation
- Multiuser detection
- Symmetric successive over-relaxation
- Successive over-relaxation
- Linear equation
- Iterative method
- Mathematical optimization
- Conjugate gradient method
- Derivation of the conjugate gradient method
- Mathematics
- Computational complexity theory
- Algorithm
- Convergence (routing)
- Real-time computing
- Computer science
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
9
References
3
Citations
NaN
KQI