Abstract
In multiple-input multiple-output (MIMO) systems, performance can be enhanced by iterative channel estimation and detection (ICED). Note that due to a large size of the signal alphabet, ICED becomes less practical unless a low complexity detector such as a lattice reduction (LR)-based detector is employed. However, as LR has to be performed for each iteration, the resulting complexity can be still high. In this paper, we propose a computational efficient technique to perform the lattice basis reduction within ICED over both static and slowly time-varying block-fading channels, where orthogonal defect of basis is considered to decide whether or not basis reduction is needed for each iteration.
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.
