A Framework for Fixed Complexity Breadth-First MIMO Detection

D.L. Milliner, E. Zimmermann, J.R. Barry, G.P. Fettweis
2008 2008 IEEE 10th International Symposium on Spread Spectrum Techniques and Applications  
In this work we present a unifying framework to characterize different types of breadth-first tree search detectors for multiple antenna systems. All considered algorithms operate at fixed complexity and require only a single pass through the detection tree, making them very attractive for practical implementation. Existing approaches are placed into this framework and a performance-complexity analysis is performed for both hard-output and soft-output detection. The B-Chase and the parallel
more » ... t candidate adding algorithm emerge as the most attractive schemes for hard-output and soft-output detection, respectively.
doi:10.1109/isssta.2008.31 fatcat:ldwonmkcrzej5ed5x46lopva4u