Polar codes for compress-and-forward in binary relay channels
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...
Main Authors: | , , , |
---|---|
Format: | Others |
Language: | English |
Published: |
KTH, Kommunikationsteori
2010
|
Subjects: | |
Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-43727 http://nbn-resolving.de/urn:isbn:978-1-4244-9722-5 |