Bounding of MAP Decode and Forward Relaying
2010 (English)In: 2010 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2010, 938-942 p.Conference paper (Refereed)
We formulate the maximum a posteriori (MAP) rule for the decode-and-forward transmission strategy operating with a noisy relay. From the MAP rule we derive an analytical bound on the error probability, taking into account decoding errors at the relay. We further determine a practical close-to-MAP decoding scheme based on a convenient error model for the decoding operation at the relay. This error model allows for a trellis representation of the code described jointly by the encoding process at the source and the re-encoding process at the relay. Numerical results demonstrate a close agreement between our analytical results and monte carlo simulations.
Place, publisher, year, edition, pages
2010. 938-942 p.
, IEEE International Symposium on Information Theory - Proceedings
Parity-Check Codes, Capacity Theorems, Channels, Diversity, Networks
IdentifiersURN: urn:nbn:se:kth:diva-62609DOI: 10.1109/ISIT.2010.5513469ISI: 000287512700188ScopusID: 2-s2.0-77955678926ISBN: 978-1-4244-6960-4OAI: oai:DiVA.org:kth-62609DiVA: diva2:480801
2010 IEEE International Symposium on Information Theory Location: Austin, TX Date: JUL 13-13, 2010
QC 201201272012-01-192012-01-192012-01-27Bibliographically approved