Block Recursive MIMO Decoding

摘要

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).