MAP-Based Code-Aided Hypothesis Testing
This contribution deals with code-aided hypothesis testing for wireless digital receivers. We provide a theoretical justification for a hypothesis testing algorithm that was previously introduced in (Wymeersch et al., 2006) based on ad-hoc arguments. Contrary to conventional hypothesis testing metho...
Saved in:
Published in | IEEE transactions on wireless communications Vol. 7; no. 8; pp. 2856 - 2860 |
---|---|
Main Authors | , , , , |
Format | Journal Article |
Language | English |
Published |
Piscataway, NJ
IEEE
01.08.2008
Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | This contribution deals with code-aided hypothesis testing for wireless digital receivers. We provide a theoretical justification for a hypothesis testing algorithm that was previously introduced in (Wymeersch et al., 2006) based on ad-hoc arguments. Contrary to conventional hypothesis testing methods, the algorithm from Wymeersch et al. exploits the code structure within the received signal and does not require any pilot symbols. By doing so, it allows to improve the bandwidth-efficiency of the transmission. The present contribution shows that, under mild conditions, the performance of the algorithm from Wymeersch et al. coincides with the performance of the optimal Maximum A Posteriori (MAP) hypothesis test. Computer simulations support this result. |
---|---|
Bibliography: | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
ISSN: | 1536-1276 1558-2248 |
DOI: | 10.1109/TWC.2008.060995 |