Open AccessLow‐complexity iterative channel estimation with lattice reduction‐based detection for multiple‐input multiple‐output systems
Author(s) -
Bai Lin,
Dou Shengyue,
Li Qiaoyu,
Xing Weixi,
Choi Jinho
Publication year - 2014
Publication title -
iet communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.355
H-Index - 62
eISSN - 1751-8636
pISSN - 1751-8628
DOI - 10.1049/iet-com.2013.0476
Subject(s) - lattice reduction , algorithm , detector , fading , reduction (mathematics) , computer science , channel (broadcasting) , basis (linear algebra) , lattice (music) , computational complexity theory , iterative method , mathematics , mathematical optimization , decoding methods , telecommunications , mimo , geometry , physics , acoustics
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.