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. / <p>© 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 20111207</p>
| Identifer | oai:union.ndltd.org:UPSALLA1/oai:DiVA.org:kth-43727 |
| Date | January 2010 |
| Creators | Blasco-Serrano, Ricardo, Thobaben, Ragnar, Rathi, Vishwambhar, Skoglund, Mikael |
| Publisher | KTH, Kommunikationsteori, KTH, ACCESS Linnaeus Centre, KTH, ACCESS Linnaeus Centre, KTH, Kommunikationsteori, KTH, ACCESS Linnaeus Centre, KTH, Kommunikationsteori, KTH, Kommunikationsteori, KTH, ACCESS Linnaeus Centre |
| Source Sets | DiVA Archive at Upsalla University |
| Language | English |
| Detected Language | English |
| Type | Conference paper, info:eu-repo/semantics/conferenceObject, text |
| Format | application/pdf |
| Rights | info:eu-repo/semantics/openAccess |
| Relation | 44th Asilomar Conference on Signals, Systems and Computers, Asilomar 2010, p. 1743-1747, info:eu-repo/grantAgreement/EC/FP7/216076 |
Page generated in 0.0022 seconds