On the Complexity of the Sphere Decoder for Frequency-Selective MIMO Channels

DOI10.1109/TSP.2008.2005745MaRDI QIDQ4568900zbMATH OpenOpenAlexFDO

Authors Luis G. Barbero, Colin F. N. Cowan, Tharmalingam Ratnarajah

Publication date 27 June 2018

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

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

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Source coding (94A29) Channel models (including quantum) in information and communication theory (94A40)

Cited in

(3)

• Maximum-likelihood sequence detection of multiple antenna systems over dispersive channels via sphere decoding
• New MIMO ARQ protocols and joint detection via sphere decoding
• On the sphere-decoding algorithm I. Expected complexity

This page was built for publication: On the Complexity of the Sphere Decoder for Frequency-Selective MIMO Channels

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