Low-complexity maximum-likelihood decoder for four-transmit-antenna quasi-orthogonal space-time block code
This letter proposes a very low-complexity maximum-likelihood (ML) detection algorithm based on QR decomposition for the quasi-orthogonal space-time block code (QSTBC) with four transmit antennas, called the LC-ML decoder. The proposed algorithm enables the QSTBC to achieve ML performance with signi...
Uloženo v:
| Vydáno v: | IEEE transactions on communications Ročník 53; číslo 11; s. 1817 - 1821 |
|---|---|
| Hlavní autoři: | , , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
New York, NY
IEEE
01.11.2005
Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Témata: | |
| ISSN: | 0090-6778, 1558-0857 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | This letter proposes a very low-complexity maximum-likelihood (ML) detection algorithm based on QR decomposition for the quasi-orthogonal space-time block code (QSTBC) with four transmit antennas, called the LC-ML decoder. The proposed algorithm enables the QSTBC to achieve ML performance with significant reduction in computational load for any high-level modulation scheme. |
|---|---|
| Bibliografie: | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 content type line 23 |
| ISSN: | 0090-6778 1558-0857 |
| DOI: | 10.1109/TCOMM.2005.858688 |