On the complexity of sphere decoding in digital communications

DOI10.1109/TSP.2005.843746zbMath1370.94330OpenAlexW2148907454MaRDI QIDQ5355699

Björn Ottersten, Joakim Jaldén

Publication date: 20 September 2017

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tsp.2005.843746

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Detection theory in information and communication theory (94A13) Decoding (94B35)

Related Items (7)

Maximum-likelihood detection based on branch and bound algorithm for MIMO systems ⋮ A low complexity semidefinite relaxation for large-scale MIMO detection ⋮ A semidefinite programming method for integer convex quadratic minimization ⋮ A new effective branch-and-bound algorithm to the high order MIMO detection problem ⋮ The Diagonal Reduction Algorithm Using Fast Givens ⋮ Effect of one redundant parity-check equation on the stopping distance ⋮ An Efficient Quadratic Programming Relaxation Based Algorithm for Large-Scale MIMO Detection

This page was built for publication: On the complexity of sphere decoding in digital communications