Low ML Decoding Complexity STBCs via Codes Over the Klein Group
Data(s) |
01/12/2011
|
---|---|
Resumo |
In this paper, we give a new framework for constructing low ML decoding complexity space-time block codes (STBCs) using codes over the Klein group K. Almost all known low ML decoding complexity STBCs can be obtained via this approach. New full- diversity STBCs with low ML decoding complexity and cubic shaping property are constructed, via codes over K, for number of transmit antennas N = 2(m), m >= 1, and rates R > 1 complex symbols per channel use. When R = N, the new STBCs are information- lossless as well. The new class of STBCs have the least knownML decoding complexity among all the codes available in the literature for a large set of (N, R) pairs. |
Formato |
application/pdf |
Identificador |
http://eprints.iisc.ernet.in/42966/1/Low_ML.pdf Natarajan, Lakshmi Prasad and Rajan, Sundar B (2011) Low ML Decoding Complexity STBCs via Codes Over the Klein Group. In: IEEE Transactions on Information Theory, 57 (12). pp. 7950-7971. |
Publicador |
IEEE |
Relação |
http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=6094265&tag=1 http://eprints.iisc.ernet.in/42966/ |
Palavras-Chave | #Electrical Communication Engineering |
Tipo |
Journal Article PeerReviewed |