On the complexity of sphere decoding in digital communications

DOI10.1109/TSP.2005.843746MaRDI QIDQ5355699zbMATH OpenOpenAlexFDO

Authors Joakim Jaldén, Björn E. Ottersten

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)

Cited in

(11)

• On the complexity of decomposing matrices arising in satellite communication
• 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
• Effect of one redundant parity-check equation on the stopping distance
• Maximum-likelihood detection based on branch and bound algorithm for MIMO systems
• The diagonal reduction algorithm using fast Givens
• Decoding spherical codes for the Gaussian channel
• An efficient quadratic programming relaxation based algorithm for large-scale MIMO detection
• Lossless Dimension Reduction for Integer Least Squares With Application to Sphere Decoding
• On the sphere-decoding algorithm I. Expected complexity

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5355699)