Non-unitary-weight Space-Time Block Codes with Minimum Decoding Complexity


Autoria(s): Karmakar, Sanjay; Rajan, Sundar B
Data(s)

2006

Resumo

Space-Time Block Codes (STBCs) from Complex Orthogonal Designs (CODs) are single-symbol decodable/symbol-by-symbol decodable (SSD); however, SSD codes are obtainable from designs that are not CODs. Recently, two such classes of SSD codes have been studied: (i) Coordinate Interleaved Orthogonal Designs (CIODs) and (ii) Minimum-Decoding-Complexity (MDC) STBCs from Quasi-ODs (QODs). The class of CIODs have non-unitary weight matrices when written as a Linear Dispersion Code (LDC) proposed by Hassibi and Hochwald, whereas the other class of SSD codes including CODs have unitary weight matrices. In this paper, we construct a large class of SSD codes with nonunitary weight matrices. Also, we show that the class of CIODs is a special class of our construction.

Formato

application/pdf

Identificador

http://eprints.iisc.ernet.in/30491/1/04036072.pdf

Karmakar, Sanjay and Rajan, Sundar B (2006) Non-unitary-weight Space-Time Block Codes with Minimum Decoding Complexity. In: IEEE International Symposium on Information Theory,, Jul 09-14, 2006, Seattle, WA, pp. 793-797.

Publicador

IEEE

Relação

http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4036072

http://eprints.iisc.ernet.in/30491/

Palavras-Chave #Electrical Communication Engineering
Tipo

Conference Paper

PeerReviewed