.png){kind=icon}
.png){kind=icon}
Return
MAP-based code-aided hypothesis testing
.png){kind=icon}
PRE
AI
DOI：10.1109/TWC.2008.060995.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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 [1] based on ad-hoc arguments. Contrary to conventional hypothesis testing methods, the algorithm from [1] 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 [1] coincides with the performance of the optimal Maximum A Posteriori (MAP) hypotesis test. Computer simulations support this result.
Keywords:
MAP estimation
synchronization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
10.7
Papers:
1.3W
Citations:
5.3W
Organization
View more organizations