|
For Full-Text PDF, please login, if you are a member of IEICE,
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
|
Rate-One Full-Diversity Quasi-Orthogonal STBCs with Low Decoding Complexity
Minh-Tuan LE Van-Su PHAM Linh MAI Giwan YOON
Publication
IEICE TRANSACTIONS on Communications
Vol.E89-B
No.12
pp.3376-3385 Publication Date: 2006/12/01 Online ISSN: 1745-1345
DOI: 10.1093/ietcom/e89-b.12.3376 Print ISSN: 0916-8516 Type of Manuscript: PAPER Category: Wireless Communication Technologies Keyword: space-time coding, multiple-input multiple-output, maximum likelihood detection, diversity, wireless communication,
Full Text: PDF(558.7KB)>>
Summary:
This paper presents a family of rate-one quasi-orthogonal space-time block codes (QO-STBCs) for any number of transmit antennas. Full diversity of the proposed QO-STBCs is achieved via the use of constellation rotation. When the number of transmit antennas is even, these codes are delay "optimal." This property along with the quasi-orthogonality one allows the codes to have low decoding complexity. Besides, by applying lookup tables into the detection methods presented in [1] and generalizing them, two low-complexity maximum-likelihood (ML) decoders for the proposed QO-STBCs and for other existing QO-STBCs, called PMLD and QMLD, are obtained. Simulation results are provided to verify the bit error rate (BER) performances and complexities of both the proposed QO-STBCs and the proposed decoders.
|
|
|