2006 IEEE International Symposium on Information Theory 2006
DOI: 10.1109/isit.2006.261844
|View full text |Cite
|
Sign up to set email alerts
|

Effective Coding Gain for Space-Time Codes

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2008
2008
2009
2009

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 11 publications
0
2
0
Order By: Relevance
“…Theorem 2.2: (Transmit-alphabet constrained, rate-diversity tradeoff for flat-fading channels) [35], [43] If a constellation of size is used for transmission and the diversity order of the system is , then the rate that can be achieved is bounded as (7) in bits per transmission.…”
Section: B Tradeoff Between Rate and Reliabilitymentioning
confidence: 99%
See 1 more Smart Citation
“…Theorem 2.2: (Transmit-alphabet constrained, rate-diversity tradeoff for flat-fading channels) [35], [43] If a constellation of size is used for transmission and the diversity order of the system is , then the rate that can be achieved is bounded as (7) in bits per transmission.…”
Section: B Tradeoff Between Rate and Reliabilitymentioning
confidence: 99%
“…Linear additive codeword designs are amenable to computationally-efficient lattice decoding strategies, such as the sphere decoder [9] and appear to be less susceptible to degradation in performance at low-to-moderate SNR caused by the number of nearest neighbors [7]. With this motivation, choosing the transmitted signal to be additive of the following form (21) allows the composite code to be linear in the complex field as well.…”
Section: A Linear Code Constructions: Flat-fading Channelsmentioning
confidence: 99%