Name
Abstract | ||
|---|---|---|
We propose a new class of block codes that outperforms known space-time block codes at low rates. The new codes are designed by starting with a quasi-orthogonal structure, and then making certain modifications to increase the coding gain distance. By using appropriate rotations and set partitions for two quasi-orthogonal codes, and combining subsets of their codewords, we are able to obtain higher coding gain distance at a given rate, and thus improve performance. Simulations confirm the advantages of this code compared to other codes operating at the same rate and SNR. We also provide an efficient ML decoding algorithm for the new code. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1109/ICC.2006.255406 | 2006 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-12 |
Keywords | Field | DocType |
space time code,decoding,awgn,coding gain,space time block code,fading,block codes | Hamming code,Concatenated error correction code,Computer science,Turbo code,Block code,Expander code,Real-time computing,Raptor code,Linear code,Tornado code | Conference |
ISSN | Citations | PageRank |
1550-3607 | 2 | 0.40 |
References | Authors | |
6 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mohammad Janani | 1 | 13 | 2.41 |
| Aria Nosratinia | 2 | 867 | 93.76 |