A new family of Linear Dispersion Code for fast Sphere Decoding

Author

Dai, X.G. ; Cheung, S.W. ; Yuk, T.I.

Author_Institution

Dept. of Electr. & Electron. Eng., Univ. of Hong Kong, Hong Kong

fYear

2009

fDate

3-6 May 2009

Firstpage

314

Lastpage

317

Abstract

In this paper, a new family of linear dispersion codes (LDCs) that can be decoded using a fast sphere decoding (SD) algorithm in MIMO systems is proposed. The basic principle of this structure is to make the LDC to have as many as possible the rows orthogonal in the dispersion matrices. Monte Carlo simulation results show that the optimum LDCs with this orthogonal structure have nearly identical bit-error-rate (BER) performances as other optimal LDCs. We develop a simplified sphere decoding (SD) algorithm that can significantly reduce the decoding complexity in decoding the new LDCs with proposed orthogonal structure. Simulation results show that the complexity reduction is more significant for MIMO system transmitting higher level modulation. For 2times4 MIMO systems transmitting 4 64QAM and 256QAM symbols in a block length of 4, the reductions are about 71-83% and 76-88%, respectively.

Keywords

MIMO communication; Monte Carlo methods; decoding; error statistics; quadrature amplitude modulation; MIMO systems; Monte Carlo simulation; QAM symbols; bit-error-rate; dispersion matrices; fast sphere decoding; linear dispersion code; AWGN; Bit error rate; Block codes; Diversity reception; MIMO; Maximum likelihood decoding; Maximum likelihood detection; Receiving antennas; Signal to noise ratio; Transmitting antennas; MIMO; Sphere decoding; complexity; orthogonal;

fLanguage

English

Publisher

ieee

Conference_Titel

Electrical and Computer Engineering, 2009. CCECE '09. Canadian Conference on

Conference_Location

St. John´s, NL

ISSN

0840-7789

Print_ISBN

978-1-4244-3509-8

Electronic_ISBN

0840-7789

Type

conf

DOI

10.1109/CCECE.2009.5090144

Filename

5090144