1994
DOI: 10.1007/bf02106515
|View full text |Cite
|
Sign up to set email alerts
|

On the bit error probability of QAM modulation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
15
0

Year Published

1994
1994
2016
2016

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 57 publications
(15 citation statements)
references
References 9 publications
0
15
0
Order By: Relevance
“…where erfc(x)= 2 √ π ∞ x e −t 2 dt is the complementary error function and rank(S k ) ≤ 1 [73,189]. This error measure should be minimized, thus it is equivalent to maximizing g k (SINR k )=0.5 − P k,16-QAM .…”
Section: User Performancementioning
confidence: 99%
“…where erfc(x)= 2 √ π ∞ x e −t 2 dt is the complementary error function and rank(S k ) ≤ 1 [73,189]. This error measure should be minimized, thus it is equivalent to maximizing g k (SINR k )=0.5 − P k,16-QAM .…”
Section: User Performancementioning
confidence: 99%
“…In order to meet the constraint, the BER for a QAM in AWGN channels can be used. Although the exact BER expressions for M-QAM are shown in [14], they are not easily inverted with respect to the SNR, so that a numerical method is necessary. Instead, in the adaptive modulation literature [5][6][7][8], an exponential function form is used, which is given by…”
Section: Snr Thresholds For Instantaneous Ber Constraintmentioning
confidence: 99%
“…The BER performance of M-ary QAM has been investigated by several authors. The exact BER expressions for QAM is presented in [3]. An extension of BER expressions considering of an arbitrary constellation size is discussed in [4].…”
Section: Introductionmentioning
confidence: 99%