A survey of VLSI implementations of tree search algorithms for MIMO detection

DOI10.1007/s00034-015-0218-yzbMath1346.94061OpenAlexW2214389708WikidataQ59245006 ScholiaQ59245006MaRDI QIDQ318217

Mohammed El-Hajjar, Ibrahim A. Bello, Mark Zwolinski, Basel Halak

Publication date: 4 October 2016

Published in: Circuits, Systems, and Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00034-015-0218-y

zbMATH Keywords

surveywireless communicationsMIMO detection algorithmssphere decodingvery large-scale integration (VLSI)

Mathematics Subject Classification ID

Detection theory in information and communication theory (94A13) Software, source code, etc. for problems pertaining to information and communication theory (94-04)

Cites Work

• On Lovász' lattice reduction and the nearest lattice point problem
• Lattice basis reduction: Improved practical algorithms and solving subset sum problems
• Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis
• A unified framework for tree search decoding: rediscovering the sequential decoder
• Communication on the Grassmann manifold: a geometric approach to the noncoherent multiple-antenna channel
• A universal lattice code decoder for fading channels
• Area-Efficient Configurable High-Throughput Signal Detector Supporting Multiple MIMO Modes
• Soft–Input Soft–Output Single Tree-Search Sphere Decoding

This page was built for publication: A survey of VLSI implementations of tree search algorithms for MIMO detection