TY - GEN
T1 - Block Recursive MIMO Decoding
AU - Askri, Aymen
AU - Othman, Ghaya Rekaya Ben
AU - Khsiba, Mohamed Achraf
N1 - Publisher Copyright:
© 2018 IEEE.
PY - 2018/9/13
Y1 - 2018/9/13
N2 - In this work we propose a new recursive multi-block decoding method for MIMO systems. The idea is based on the construction of a list of candidates. For each block, a list composed of the ML solution and its neighbors is enumerated. Through the derivation of an upper bound of the error probability, we calculate the thresholds to fix the list sizes for each block to achieve the desired diversity order. We show by simulation results a complexity reduction for different block divisions compared to the Sphere Decoder, while offering almost ML performance (full diversity).
AB - In this work we propose a new recursive multi-block decoding method for MIMO systems. The idea is based on the construction of a list of candidates. For each block, a list composed of the ML solution and its neighbors is enumerated. Through the derivation of an upper bound of the error probability, we calculate the thresholds to fix the list sizes for each block to achieve the desired diversity order. We show by simulation results a complexity reduction for different block divisions compared to the Sphere Decoder, while offering almost ML performance (full diversity).
KW - Block decoding
KW - Diversity order
KW - MIMO systems
KW - Recursive decoding
KW - Reduced complexity
UR - https://www.scopus.com/pages/publications/85054484169
U2 - 10.1109/ICT.2018.8464886
DO - 10.1109/ICT.2018.8464886
M3 - Conference contribution
AN - SCOPUS:85054484169
SN - 9781538623213
T3 - 2018 25th International Conference on Telecommunications, ICT 2018
SP - 116
EP - 120
BT - 2018 25th International Conference on Telecommunications, ICT 2018
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 25th International Conference on Telecommunications, ICT 2018
Y2 - 26 June 2018 through 28 June 2018
ER -