2007
DOI: 10.1109/tit.2007.907520
|View full text |Cite
|
Sign up to set email alerts
|

Abstract: 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.

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
23
0

Year Published

2008
2008
2020
2020

Publication Types

Select...
4
3

Relationship

2
5

Authors

Journals

citations
Cited by 23 publications
(23 citation statements)
references
References 19 publications
0
23
0
Order By: Relevance
“…Let I ga be the realized input-output mutual information of the genie-aided channel, then I ga ≥ I. Furthermore, from the analysis in [23,25,26], we have that…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…Let I ga be the realized input-output mutual information of the genie-aided channel, then I ga ≥ I. Furthermore, from the analysis in [23,25,26], we have that…”
Section: Discussionmentioning
confidence: 99%
“…For single-input multipleoutput (SIMO) channels, the probabilities q(k ℓ−1 ) andp(ℓ|k ℓ−1 ) in (24) can be approximated numerically by shifting the outage probability bounds in [25] according to the gap between the bound and the corresponding simulation curve at high SNR. For MIMO channels, solving (24) requires tabulating the probabilities q(k ℓ−1 ) andp(ℓ|k ℓ−1 ), which can be obtained from…”
Section: B Power Adaptationmentioning
confidence: 99%
“…Reliable communication over block-fading channels has traditionally been studied under the assumption of perfect channel state information at the receiver (CSIR) [2]- [7]. Since only a finite number of fading realizations are spanned in a single codeword, block-fading channel is not information stable [8].…”
mentioning
confidence: 99%
“…Families of blockwise MDS codes based on convolutional codes [5], [6], turbo codes [9], low-density parity check (LDPC) codes [10] and ReedSolomon codes [4] have also been proposed in the literature. Following the footsteps of [11], references [6], [7] proved that the outage probability as a function of the signal-to-noise ratio (SNR) decays linearly in a log-log scale with a slope given by the so-called outage diversity or SNR exponent. This SNR exponent is precisely given by the Singleton bound and shown to be achieved by random codes constructed over discrete signal constellations, providing the optimal tradeoff between the SNR exponent (diversity) and the target data rate [6].…”
mentioning
confidence: 99%
“…Noting that P out≥ 1 γ P out|V ′ =V l and following the same lines as in [16] (see also [5], [11]) to obtain the SNR-exponent from 5 The definition of corrupt precoders involves only that |s (1) k | ≤ γ −0.5 for one particular combination of x (1) = (x 1,c , x 2,c ), x ′(1) = (x ′ 1 , x ′ 2 ) = x and k ∈ {1, 2}. Without loss of generality, assume k = 1.…”
Section: A Proof Of Lemmamentioning
confidence: 96%