Name
Abstract | ||
|---|---|---|
A recently published lower bound on the probability of a finite union of events, which is referred to in this paper as the new FLS lower bound, is applied to find a lower bound of the average symbol detection error rate of nonuniform M-ary modulated signals transmitted over the additive white Gaussian noise channels. An optimum detector based on the maximum a posteriori principle is assumed. Numerical results are presented to show that, when compared with the best known de Caen lower bound and the KAT lower bound in the literature, the new FLS lower bound always provides the tightest estimation of the average symbol detection error rate for both uniform and nonuniform signallings. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1109/WCNC.2013.6555040 | WCNC |
Keywords | Field | DocType |
noise | Chapman–Robbins bound,Combinatorics,Upper and lower bounds,Word error rate,Algorithm,Communication channel,Real-time computing,Maximum a posteriori estimation,Probability of error,Detector,Additive white Gaussian noise,Mathematics | Conference |
ISSN | ISBN | Citations |
1525-3511 E-ISBN : 978-1-4673-5937-5 | 978-1-4673-5937-5 | 2 |
PageRank | References | Authors |
0.53 | 5 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhiwei Mao | 1 | 59 | 11.06 |
| Julian Cheng | 2 | 1409 | 145.12 |
| Jian Shen | 3 | 92 | 14.67 |