On the Complexity of Sphere Decoding for Differential Detection

DOI10.1109/TIT.2007.892775MaRDI QIDQ3548269zbMATH OpenFDO

Authors Volker Pauli, Lutz Lampe

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.2007.892775

Mathematics Subject Classification ID

Detection theory in information and communication theory (94A13) Decoding (94B35)

Recommendations

• Multiple symbol differential detection based on sphere decoding for unitary space-time modulation
• Multiple symbol differential detection with diversity reception
• "Turbo DPSK" using soft multiple-symbol differential sphere decoding
• Orthotope sphere decoding and parallelotope decoding-reduced complexity optimum detection algorithms for MIMO channels
• Reduced complexity \(K\) -best sphere decoder design for MIMO systems

Cited in

(7)

• Orthotope sphere decoding and parallelotope decoding-reduced complexity optimum detection algorithms for MIMO channels
• Implementation aspects of list sphere decoder algorithms for MIMO-OFDM systems
• Multiple symbol differential detection based on sphere decoding for unitary space-time modulation
• "Turbo DPSK" using soft multiple-symbol differential sphere decoding
• Fast multiple-antenna differential decoding
• 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 for Differential Detection

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