Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
