Title :
Linear dispersion code with an orthogonal row structure for simplifying 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, China
Abstract :
In this paper, we propose a family of full diversity fast decodable Linear Dispersion Codes (LDCs) for use in MIMO systems. These codes have as many as possible the orthogonal rows in the dispersion matrices of the LDC. One of the main advantages of this family of LDCs is that it can be used in MIMO systems with arbitrary numbers of transmitted and received antennas and arbitrary transmission rates. We also develop a simplified Sphere Decoding (SD) algorithm to significantly reduce the decoding complexity for this family of LDCs. Monte Carlo simulation shows that the optimum LDCs with or without this orthogonal structure have nearly identical bit-error rate (BER) performances, but the complexity can be significantly reduced. For a 2Ã4 MIMO system transmitting 8 QPSK symbols in a block length of 4, the reduction is about 28-52%, and for a 3Ã3 MIMO system transmitting 10 QPSK symbols in a block length of 6, the reduction is about 28-49%.
Keywords :
MIMO communication; Monte Carlo methods; antenna arrays; error statistics; linear codes; orthogonal codes; quadrature phase shift keying; BER performance; MIMO systems; Monte Carlo simulation; QPSK symbols; Sphere Decoding; arbitrary transmission rates; bit-error rate; linear dispersion code; orthogonal row structure; Bit error rate; Block codes; Capacity planning; Diversity reception; Error probability; MIMO; Maximum likelihood decoding; Quadrature phase shift keying; Receiving antennas; Transmitting antennas; MIMO; Sphere decoding; complexity; orthogonal;
Conference_Titel :
Personal, Indoor and Mobile Radio Communications, 2009 IEEE 20th International Symposium on
Conference_Location :
Tokyo
Print_ISBN :
978-1-4244-5122-7
Electronic_ISBN :
978-1-4244-5123-4
DOI :
10.1109/PIMRC.2009.5449896