A unified framework for tree search decoding: rediscovering the sequential decoder

DOI10.1109/TIT.2005.864418zbMath1317.94159OpenAlexW1683834415MaRDI QIDQ3547417

Mohamed Oussama Damen, Hesham El Gamal, Arul D. Murugan, 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

Mathematics Subject Classification ID

Decoding (94B35)

Related Items (7)

A survey of VLSI implementations of tree search algorithms for MIMO detection ⋮ An entropy-regularized ADMM for binary quadratic programming ⋮ Maximum-likelihood detection based on branch and bound algorithm for MIMO systems ⋮ Implementation aspects of list sphere decoder algorithms for MIMO-OFDM systems ⋮ Tightness of a New and Enhanced Semidefinite Relaxation for MIMO Detection ⋮ A low complexity branch-and-bound-based decoder for V-BLAST systems with PSK signals ⋮ Codes in the Sum-Rank Metric: Fundamentals and Applications

This page was built for publication: A unified framework for tree search decoding: rediscovering the sequential decoder