Performance of error control over block fading channels

Malkamaki, E.

doi:10.1109/itcom.1999.781399

Cited by 5 publications

(11 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A dramatic increase in the error exponent is reported (as expected). Further optimizing the Gallager parameter [94], making it fading-vector-dependent, improves considerably the tightness, as has been already indicated in [175] for the binary case.…”

Section: ) Error Exponents and Cutoff Ratesmentioning

confidence: 71%

“…In the nice contribution [175], upper and lower exponential (reliability type) bounds are derived for the block-fading channel with diversity branches. The improved upper bound is found by letting the parameters ( in Gallager's notation [94]) to be channel-state-dependent.…”

Section: ) Error Exponents and Cutoff Ratesmentioning

confidence: 99%

“…However, this sample, small though it is, indicates the amount of effort invested into enhancing the understanding of performance of practical systems over this class of channels where more insight the mere reliable rate is sought. In fact, the results [148], [183], [15], [168], [175] for the error exponent reveal the need for considerable effective time diversity in any practical coding system, which dictates long delays for slow-varying fading models, as to achieve reliable communication in the classical Shannon's sense. The importance of CSI at the transmitter in terms of dramatic increase in the error exponent [31] similar to the capacity versus outage performance [43] also deserves special attention of practical-system designers, and that is opposed to the negligible increase in the ergodic capacity [112] in this setting.…”

Section: ) Error Exponents and Cutoff Ratesmentioning

confidence: 99%

“…Malkamäki and Leib [175] provide a fairly comprehensive analysis of coding for this class of channels, based on randomcoding error bounds. Among the observations of [175], it is interesting to note that for high-rate codes the diversity afforded by the use of blocks may not improve the average code performance: since the channel is constant during a block, it may be better to send the whole codeword in a single block rather than to divide it into several blocks.…”

Section: Designing Fading Codes: the Impact Of Hamming Distancementioning

confidence: 99%

See 3 more Smart Citations

Fading channels: information-theoretic and communications aspects

Biglieri

Proakis

Shamai³

1998

IEEE Trans. Inform. Theory

1,609

1,329

View full text Add to dashboard Buy / Rent full text

Abstract-In this paper we review the most peculiar and interesting information-theoretic and communications features of fading channels. We first describe the statistical models of fading channels which are frequently used in the analysis and design of communication systems. Next, we focus on the information theory of fading channels, by emphasizing capacity as the most important performance measure. Both single-user and multiuser transmission are examined. Further, we describe how the structure of fading channels impacts code design, and finally overview equalization of fading multipath channels.

show abstract

Section: ) Error Exponents and Cutoff Ratesmentioning

confidence: 71%

Section: ) Error Exponents and Cutoff Ratesmentioning

confidence: 99%

Section: ) Error Exponents and Cutoff Ratesmentioning

confidence: 99%

Section: Designing Fading Codes: the Impact Of Hamming Distancementioning

confidence: 99%

See 2 more Smart Citations

Fading channels: information-theoretic and communications aspects

Biglieri

Proakis

Shamai³

1998

IEEE Trans. Inform. Theory

1,609

1,329

View full text Add to dashboard Buy / Rent full text

show abstract

“…is the Singleton bound [5], [6], [7]. More recently, it has been shown [8] that the optimal SNR exponent d ⋆ (R) sup…”

mentioning

confidence: 99%

A Tight Lower Bound to the Outage Probability of Discrete-Input Block-Fading Channels

Nguyen¹,

Fabregas²,

Fabregas³

et al. 2007

IEEE Trans. Inform. Theory

View full text Add to dashboard Buy / Rent full text

In this correspondence, we propose a tight lower bound to the outage probability of discrete-input Nakagami-m block-fading channels. The approach permits an efficient method for numerical evaluation of the bound, providing an additional tool for system design. The optimal rate-diversity trade-off for the Nakagami-m block-fading channel is also derived and a tight upper bound is obtained for the optimal coding gain constant.

show abstract

Performance of error control over block fading channels

Cited by 5 publications

References 14 publications

Fading channels: information-theoretic and communications aspects

Fading channels: information-theoretic and communications aspects

A Tight Lower Bound to the Outage Probability of Discrete-Input Block-Fading Channels

Contact Info

Product

Resources

About