Abstract
Iterative channel estimation and detection (ICED) can provide a better performance as the channel estimation can be improved through iterations. For a multiple-input multiple-output channel, owing to a large size of the signal alphabet, ICED becomes less practical unless a low-complexity detector such as a lattice reduction-based detector is employed. However, since the lattice basis reduction has to be carried out for each iteration, the resulting complexity can be still high. In this study, a computationally efficient technique was proposed to perform the lattice basis reduction within ICED over both static and slowly time-varying block-fading channels, where orthogonal defect of basis, as well as error probability are 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
Disclaimer: 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.