RT-Polar: An HARQ Scheme with Universally Competitive Rates
| Autor: | Soumya Subhra Banerjee, Himanshu Tyagi |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
Scheme (programming language)
Computer science Polar code Hybrid automatic repeat request 020206 networking & telecommunications Data_CODINGANDINFORMATIONTHEORY 02 engineering and technology Binary symmetric channel Electrical Communication Engineering Redundancy (information theory) 0202 electrical engineering electronic engineering information engineering Polar Error detection and correction Algorithm computer Decoding methods Computer Science::Information Theory computer.programming_language |
| Zdroj: | ITW |
| DOI: | 10.1109/itw.2018.8613460 |
| Popis: | We present a construction for a universal channel code with feedback using Polar Codes. Our construction includes an error detection mechanism that is used to compute the ACK/NACK feedback directly from the received vector, without a higher layer CRC. Our scheme, termed the Repeat-Top Polar Code (RT-Polar), builds on a rate-compatible Polar Code and retransmits the t message bits sent over the most reliable polarized good channels over the least reliable good channels. At the decoder, these two t-bit strings are decoded and compared to detect an error. Through simulations, we illustrate the universal performance of our scheme for a binary symmetric channel with an unknown flipover probability. Our scheme performs comparably with a genie-aided scheme, where the detection mechanism is assumed to be error-free, for practically relevant message lengths of roughly 512 bits; this is the first instance of such a universal performance reported in literature. The proposed scheme is suitable for use as a HARQ in low-latency communication where including a higher-layer CRC will induce computational delays. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|