Asymptotic Comparison of ML and MAP Detectors for Multidimensional Constellations
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2016
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866916103555383296 |
|---|---|
| author | Alvarado, Alex Agrell, Erik Brännström, Fredrik |
| author_facet | Alvarado, Alex Agrell, Erik Brännström, Fredrik |
| contents | A classical problem in digital communications is to evaluate the symbol error probability (SEP) and bit error probability (BEP) of a multidimensional constellation over an additive white Gaussian noise channel. In this paper, we revisit this problem for nonequally likely symbols and study the asymptotic behavior of the optimal maximum a posteriori (MAP) detector. Exact closed-form asymptotic expressions for SEP and BEP for arbitrary constellations and input distributions are presented. The well-known union bound is proven to be asymptotically tight under general conditions. The performance of the practically relevant maximum likelihood (ML) detector is also analyzed. Although the decision regions with MAP detection converge to the ML regions at high signal-to-noise ratios, the ratio between the MAP and ML detector in terms of both SEP and BEP approach a constant, which depends on the constellation and a priori probabilities. Necessary and sufficient conditions for asymptotic equivalence between the MAP and ML detectors are also presented. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1607_01818 |
| institution | arXiv |
| publishDate | 2016 |
| record_format | arxiv |
| spellingShingle | Asymptotic Comparison of ML and MAP Detectors for Multidimensional Constellations Alvarado, Alex Agrell, Erik Brännström, Fredrik Information Theory A classical problem in digital communications is to evaluate the symbol error probability (SEP) and bit error probability (BEP) of a multidimensional constellation over an additive white Gaussian noise channel. In this paper, we revisit this problem for nonequally likely symbols and study the asymptotic behavior of the optimal maximum a posteriori (MAP) detector. Exact closed-form asymptotic expressions for SEP and BEP for arbitrary constellations and input distributions are presented. The well-known union bound is proven to be asymptotically tight under general conditions. The performance of the practically relevant maximum likelihood (ML) detector is also analyzed. Although the decision regions with MAP detection converge to the ML regions at high signal-to-noise ratios, the ratio between the MAP and ML detector in terms of both SEP and BEP approach a constant, which depends on the constellation and a priori probabilities. Necessary and sufficient conditions for asymptotic equivalence between the MAP and ML detectors are also presented. |
| title | Asymptotic Comparison of ML and MAP Detectors for Multidimensional Constellations |
| topic | Information Theory |
| url | https://arxiv.org/abs/1607.01818 |