Computational Complexity Bounds for List Mimo Detection

  title={Computational Complexity Bounds for List Mimo Detection},
  author={David L. Milliner and Ernesto Zimmermann and John R. Barry and Gerhard P. Fettweis},
This work establishes bounds on the computational complexity of list MIMO detectors. Specifically, upper and lower bounds are introduced, where computational complexity is measured in terms of the number of branch metric computations performed during detection. The lower complexity bound corresponds to a “genie tree search detector” while the upper bound is determined using the list sequential detector. For illustration, results are provided for several MIMO setups. 

From This Paper

Figures, tables, and topics from this paper.


Publications citing this paper.


Publications referenced by this paper.
Showing 1-10 of 12 references

Complexity Aspects in Near-Capacity MIMO Detection-Decoding

E. Zimmermann
Ph.D. dissertation, Technische Universität Dresden, Aug. 2007. • 2007
View 8 Excerpts
Highly Influenced

Iterative tree search detection for MIMO wireless systems

IEEE Transactions on Communications • 2005
View 4 Excerpts
Highly Influenced

A Framework for Fixed Complexity Breadth-First MIMO Detection

2008 IEEE 10th International Symposium on Spread Spectrum Techniques and Applications • 2008
View 6 Excerpts

The List-Sequential (LISS) Algorithm and Its Application

IEEE Transactions on Communications • 2007
View 1 Excerpt

A computationally efficient exact ML sphere decoder

IEEE Global Telecommunications Conference, 2004. GLOBECOM '04. • 2004
View 1 Excerpt

Similar Papers

Loading similar papers…