Polar codes for compress-and-forward in binary relay channels
2010 (English)In: 44th Asilomar Conference on Signals, Systems and Computers, Asilomar 2010, IEEE conference proceedings, 2010, 1743-1747 p.Conference paper (Refereed)
We construct polar codes for binary relay channels with orthogonal receiver components. We show that polar codes achieve the cut-set bound when the channels are symmetric and the relay-destination link supports compress-and-forward relaying based on Slepian-Wolf coding. More generally, we show that a particular version of the compress-and-forward rate is achievable using polar codes for Wyner-Ziv coding. In both cases the block error probability can be bounded as O(2-Nβ) for 0 < β < 1/2 and sufficiently large block length N.
Place, publisher, year, edition, pages
IEEE conference proceedings, 2010. 1743-1747 p.
, Conference Record of the Asilomar Conference on Signals Systems and Computers, ISSN 1058-6393
Bit error rate, Channel coding, Decoding, Error probability, Relays, Source coding
IdentifiersURN: urn:nbn:se:kth:diva-43727DOI: 10.1109/ACSSC.2010.5757839ISI: 000305886000323ScopusID: 2-s2.0-79957996162ISBN: 978-1-4244-9722-5OAI: oai:DiVA.org:kth-43727DiVA: diva2:460950
44th Asilomar Conference on Signals, Systems and Computers, Asilomar 2010. Pacific Grove, CA. 7 November 2010 - 10 November 2010
FunderEU, FP7, Seventh Framework Programme, 216076
© 2010 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. QC 201112072012-01-172011-10-182014-11-24Bibliographically approved