2013
DOI: 10.1109/twc.2012.122212.111812
|View full text |Cite
|
Sign up to set email alerts
|

Achievable Rates over Doubly Selective Rician-Fading Channels under Peak-Power Constraint

Abstract: WOSInternational audienceWe derive a lower bound on the capacity of discrete-time Rician-fading channels that are selective both in time and frequency. The noncoherent setting is considered, where neither the transmitter nor the receiver knows a priori the actual channel realization. Single-input single-output communications subject to both average and peak power constraints are investigated. The lower bound assumes independent and identically distributed input data and is expressed as a difference between two… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
12
0

Year Published

2014
2014
2020
2020

Publication Types

Select...
4
3

Relationship

4
3

Authors

Journals

citations
Cited by 15 publications
(12 citation statements)
references
References 22 publications
0
12
0
Order By: Relevance
“…It must be stressed that u i should not be understood as an achievable rate for UA systems in the sense of [27], [28], but rather as an optimization criterion useful to automatically drive noncooperative UA systems toward a more efficient spectrum sharing strategy than the usual uniform power allocation strategy.…”
Section: Noncooperative Spectrum Sharing Gamementioning
confidence: 99%
See 1 more Smart Citation
“…It must be stressed that u i should not be understood as an achievable rate for UA systems in the sense of [27], [28], but rather as an optimization criterion useful to automatically drive noncooperative UA systems toward a more efficient spectrum sharing strategy than the usual uniform power allocation strategy.…”
Section: Noncooperative Spectrum Sharing Gamementioning
confidence: 99%
“…Using (28) and conditional expectations, we can write equation 30 The game could be defined with (9) as utility functions. However, the water-filling solution would not have a closed-form expression as in (15) and convergence and NE uniqueness conditions cannot be found easily.…”
Section: A Minimization Against the Worst Case Cross-channels Distrimentioning
confidence: 99%
“…Note that u i should not be understood as an achievable rate in the sense of [7] but rather as an optimization criterion allowing UA systems to find efficient power allocation strategies in a noncooperative way and with minimal knowledge about their environment. In the following, u i will thus be called "information rate" with a slight abuse of language.…”
Section: System Model and Problem Formulationmentioning
confidence: 99%
“…From a single measurement, it is thus possible to compare competing transmission schemes when faced to the same realistic environment [3]. Thanks to Monte-Carlo simulations, design and validation metrics such as bit error rate [1]- [3], capacity bounds [4]- [6] or fading statistics [2] can be computed with a good accuracy. Note however that the methodology behind stochastic replay does not apply to every UAC channel.…”
Section: Introductionmentioning
confidence: 99%