A fast sphere decoding algorithm for space-frequency block codes

Authors:
Zoltan Safar;Weifeng Su;K. J. R. Liu
Affiliations:
Department of Electrical and Computer Engineering, A. James Clark Sch. of Eng., and Inst. for Sys. Res., Univ. of Maryland, College Park, MD and Modem System Design, Technology Platforms, Nokia, C ...;Dept. of Elec. and Comp. Eng., A. James Clark Sch. of Eng., and Inst. for Sys. Res., Univ. of Maryland, College Park, MD and Dept. of Elec. Eng., Sch. of Eng. and Appl. Sci., Ste. Univ. of New Yor ...;Department of Electrical and Computer Engineering, A. James Clark School of Engineering, and Institute for Systems Research, University of Maryland, College Park, MD
Venue:
EURASIP Journal on Applied Signal Processing
Year:
2006

Citing 10
Cited 2

Principles of mobile communication (2nd ed.)

Principles of mobile communication (2nd ed.)
Maximum-likelihood sequence detection of multiple antenna systems over dispersive channels via sphere decoding

EURASIP Journal on Applied Signal Processing
Space-time-frequency coded OFDM over frequency-selective fading channels

IEEE Transactions on Signal Processing
Obtaining full-diversity space-frequency codes from space-time codes via mapping

IEEE Transactions on Signal Processing
Space-time block codes from orthogonal designs

IEEE Transactions on Information Theory
A universal lattice code decoder for fading channels

IEEE Transactions on Information Theory
Closest point search in lattices

IEEE Transactions on Information Theory
On maximum-likelihood detection and the search for the closest lattice point

IEEE Transactions on Information Theory
Signal constellations for quasi-orthogonal space-time block codes with full diversity

IEEE Transactions on Information Theory
A simple transmit diversity technique for wireless communications

IEEE Journal on Selected Areas in Communications

Orthogonal space-time block codes with sphere packing

IEEE Transactions on Information Theory
Achievable diversity limits in a quantized MIMO-OFDM linear pre-coded system

ISWPC'10 Proceedings of the 5th IEEE international conference on Wireless pervasive computing

Quantified Score

Hi-index	0.06

Visualization

Abstract

The recently proposed space-frequency-coded MIMO-OFDM systems have promised considerable performance improvement over single-antenna systems. However, in order to make multiantenna OFDM systems an attractive choice for practical applications, implementation issues such as decoding complexity must be addressed successfully. In this paper, we propose a computationally efficient decoding algorithm for space-frequency block codes. The central part of the algorithm is a modulation-independent sphere decoding framework formulated in the complex domain. We develop three decoding approaches: a modulation-independent approach applicable to any memoryless modulation method, a QAM-specific and a PSK-specific fast decoding algorithm performing nearest-neighbor signal point search. The computational complexity of the algorithms is investigated via both analysis and simulation. The simulation results demonstrate that the proposed algorithm can significantly reduce the decoding complexity. We observe up to 75% reduction in the required FLOP count per code block compared to previously existing methods without noticeable performance degradation.