Abstract | ||
---|---|---|
This paper introduces a new class of space-time codes that achieve coding gain without a trellis or any form of inter-block dependency. The construction of the new codes starts from an existing (parent) space-time block code (STBC). Then by increasing the constellation size followed by expurgation of the expanded codebook, a better code is obtained at the original transmission rate. This method can be applied to a wide variety of space-time block codes, including orthogonal codes and quasi-orthogonal codes. A multi-stage design algorithm is presented, and for orthogonal parent codes, an efficient decoding algorithm is developed, and its decoding complexity is analyzed. Despite altering the regular structure of the orthogonal code, the decoding complexity is only affected by a constant factor. |
Year | DOI | Venue |
---|---|---|
2009 | 10.1109/TCOMM.2009.02.070032 | IEEE Transactions on Communications |
Keywords | Field | DocType |
mimo system,new code,decoding complexity,space-time block code,orthogonal code,multi-stage design algorithm,quasi-orthogonal code,efficient decoding algorithm,better code,space-time code,orthogonal parent code,gain,modulation,space time code,decoding,coding gain,mimo,convolutional codes,algorithm design and analysis,block codes,space time block code | BCJR algorithm,Concatenated error correction code,Sequential decoding,Computer science,Serial concatenated convolutional codes,Block code,Electronic engineering,Linear code,Reed–Muller code,List decoding | Journal |
Volume | Issue | ISSN |
57 | 2 | 0090-6778 |
Citations | PageRank | References |
1 | 0.36 | 9 |
Authors | ||
2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Mohammad Janani | 1 | 13 | 2.41 |
Aria Nosratinia | 2 | 867 | 93.76 |