Abstract
In this paper we consider a matrix-algebraic approach to linear successive interference cancellation (SIC). It has been shown that both single- and multi-stage linear SIC schemes correspond to a one-shot linear matrix filtering. Eigenvalue conditions on the resulting linear filter for convergence of the multistage scheme are considered and the concept of e-convergence is introduced for determining the number of stages necessary for practical convergence. It is observed that the BER for the users does not generally reach its minimum when the scheme converges, hence, optimal performance is achieved after a limited number of cancellation stages, which does not have to be the same for different users.
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.
