Low complexity essentially maximum likelihood decoding of perfect space-time block codes
Citations
61 citations
56 citations
24 citations
10 citations
7 citations
Cites background from "Low complexity essentially maximum ..."
...However, this sub-code still provides rate 2 and can be decoded with essentially maximum likelihood performance using an algorithm introduced in [8] with complexity N(3), where N is the size of an underlying signal constellation....
[...]
References
13,706 citations
7,348 citations
"Low complexity essentially maximum ..." refers methods in this paper
...Orthogonal STBCs (OSTBC) [2] were designed to use more than two transmit antennas....
[...]
825 citations
483 citations
"Low complexity essentially maximum ..." refers background in this paper
...The perfect STBC can be decoded with sphere decoder [3], but these suffer from the draw back that when the channel matrix is close to singular, the preprocessing stage of the sphere decoding algorithm yields a plane of possibilities rather than a single initial estimate....
[...]
...[3] introduced perfect space-time block codes which satisfy all of the following criteria: fullrate, full-diversity, non-vanishing determinant, good shaping and uniform average transmitted energy per antenna....
[...]
219 citations
"Low complexity essentially maximum ..." refers background in this paper
...The perfect STBC can be decoded with sphere decoder [3], but these suffer from the draw back that when the channel matrix is close to singular, the preprocessing stage of the sphere decoding algorithm yields a plane of possibilities rather than a single initial estimate....
[...]
...Oggier et al.[3] introduced perfect space-time block codes which satisfy all of the following criteria: fullrate, full-diversity, non-vanishing determinant, good shaping and uniform average transmitted energy per antenna....
[...]