Polar Codes for Cooperative Relaying
2012 (English)In: IEEE Transactions on Communications, ISSN 0090-6778, E-ISSN 1558-0857, Vol. 60, no 11, 3263-3273 p.Article in journal (Refereed) Published
We consider the symmetric discrete memoryless relay channel with orthogonal receiver components and show that polar codes are suitable for decode-and-forward and compress-and-forward relaying. In the first case we prove that polar codes are capacity achieving for the physically degraded relay channel; for stochastically degraded relay channels our construction provides an achievable rate. In the second case we construct sequences of polar codes that achieve the compress-and-forward rate by nesting polar codes for source compression into polar codes for channel coding. In both cases our constructions inherit most of the properties of polar codes. In particular, the encoding and decoding algorithms and the bound on the block error probability O(2 (N beta)) which holds for any 0 < beta < 1/2.
Place, publisher, year, edition, pages
IEEE Press, 2012. Vol. 60, no 11, 3263-3273 p.
Polar codes, compress-and-forward, cooperative communication, decode-and-forward, relay channel
IdentifiersURN: urn:nbn:se:kth:diva-104536DOI: 10.1109/TCOMM.2012.081412.110266ISI: 000311856300015ScopusID: 2-s2.0-84870523692OAI: oai:DiVA.org:kth-104536DiVA: diva2:574594
FunderEU, FP7, Seventh Framework Programme, 216076VinnovaSwedish Research CouncilICT - The Next Generation
QC 201212072012-12-072012-11-052013-04-11Bibliographically approved