Tree search based configurable joint detection and decoding algorithms for MIMO systems

It has been shown that the Configurable Joint Detection-Decoding (CJDD) algorithms in MIMO systems can effectively reduce the complexity and improve the signal quality. Since the CJDD approach is based on the tree search algorithms and there exists various kinds of such methods with different characteristics, it is of great importance to explore the trade-offs between each algorithm and their impacts on different aspects of system performances. In this paper, we study the CJDD algorithm based on three types of tree search approaches: breadth-first search, depth-first search, and the Fano algorithm. We explicitly elucidate the advantages and disadvantages of each algorithm on the basis of timing complexity, area complexity, and run-time variability. Our goal is to shed more lights on the design and application of tree search type approaches on the MIMO wireless communication systems for different system design considerations.