Abstract
In this paper, we propose a low-complexity group alternate iterative list (GAIL) detection algorithm for MIMO systems. By utilizing the recursive interference suppression and successive interference cancellation techniques, the symbol vector can be partitioned into many subgroups. Subsequently, symbols in each subgroup are detected in terms of the K-best detector. The inter-group interference is effectively mitigated in the GAIL algorithm by creating a candidate list and iteratively correcting the unreliable symbols for the detection result. We provide the performance-complexity tradeoff based on different feasible parameter settings. The numerical results demonstrate that the GAIL algorithm can achieve close-to-optimal performance while maintaining low computational complexity. In addition, the running speed of the GAIL algorithm can be dramatically increased using parallel processing in real-time communication systems.
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.
