A unified framework for tree search decoding: rediscovering the sequential decoder
From MaRDI portal
Publication:3547417
DOI10.1109/TIT.2005.864418zbMATH Open1317.94159OpenAlexW1683834415MaRDI QIDQ3547417FDOQ3547417
Authors: Arul D. Murugan, Hesham El Gamal, Mohamed Oussama Damen, Giuseppe Caire 
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2005.864418
Recommendations
- A universal lattice code decoder for fading channels
- A low complexity branch-and-bound-based decoder for V-BLAST systems with PSK signals
- Sequential decoding based on an error criterion
- Maximum-likelihood sequence detection of multiple antenna systems over dispersive channels via sphere decoding
- An improved space-time lattice decoding algorithm
Cited In (7)
- Tightness of a New and Enhanced Semidefinite Relaxation for MIMO Detection
- A survey of VLSI implementations of tree search algorithms for MIMO detection
- A low complexity branch-and-bound-based decoder for V-BLAST systems with PSK signals
- An entropy-regularized ADMM for binary quadratic programming
- Codes in the sum-rank metric: fundamentals and applications
- Maximum-likelihood detection based on branch and bound algorithm for MIMO systems
- Implementation aspects of list sphere decoder algorithms for MIMO-OFDM systems
This page was built for publication: A unified framework for tree search decoding: rediscovering the sequential decoder
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3547417)
