Reduced-complexity orthotope sphere decoding for multiple-input multiple-output antenna system

Author

Jang, Hwanchol ; Lee, Heung-No ; Nooshabadi, Saeid

Author_Institution

Dept. of Inf. & Commun., Gwangju Inst. of Sci. & Technol., Gwangju, South Korea

fYear

2010

Firstpage

660

Lastpage

663

Abstract

In this paper, we propose a maximum likelihood (ML)-like performance reduced computational complexity sorted orthotope sphere decoding (OSD), and zero forced (ZF) sorted OSD algorithms for the spatial multiplexing (SM) in a multiple-input multiple-output (MIMO) system. In comparison with the original OSD our technique reduces the number of partial Euclidean distance (PED) computations by up to 28%, and 25% for QPSK and 16-QAM 4×4 MIMO systems, respectively.

Keywords

MIMO communication; antennas; decoding; phase shift keying; quadrature amplitude modulation; MIMO system; QAM; QPSK; computational complexity; maximum likelihood; multiple-input multiple-output antenna system; partial Euclidean distance; reduced-complexity orthotope sphere decoding; spatial multiplexing; zero forced sorted OSD algorithms; AWGN; Additive white noise; Computational complexity; Detectors; Euclidean distance; MIMO; Maximum likelihood decoding; Maximum likelihood detection; Receiving antennas; Samarium;

fLanguage

English

Publisher

ieee

Conference_Titel

Circuits and Systems (MWSCAS), 2010 53rd IEEE International Midwest Symposium on

Conference_Location

Seattle, WA

ISSN

1548-3746

Print_ISBN

978-1-4244-7771-5

Type

conf

DOI

10.1109/MWSCAS.2010.5548914

Filename

5548914