Channel capacity of polar coding with a given polar mismatched successive cancellation decoder
arXiv:1610.07297
Abstract
Arıkan's polar coding, is by now a well studied technique that allows achieving the symmetric capacity of binary input memoryless channels with low complexity encoding and decoding, provided that the polar decoding architecture is used and the decoding metric is matched to the true channel. In this paper, we analyze communication rates that are achievable when the polar coding/decoding architecture is used with the decoder using an incorrect model of the channel. We define the `polar mismatched capacity' as an analogue of the classical mismatched capacity, give an expression for it, and derive bounds on it.
Submitted to IEEE Transactions on Information Theory
References in corpus (10)
- Nested Polar Codes for Wiretap and Relay Channels
- A Split-Reduced Successive Cancellation List Decoder for Polar Codes
- Polarization for arbitrary discrete memoryless channels
- Symbol-Decision Successive Cancellation List Decoder for Polar Codes
- A Low-Latency List Successive-Cancellation Decoding Implementation for Polar Codes
- A High Throughput List Decoder Architecture for Polar Codes
- Performance and Construction of Polar Codes on Symmetric Binary-Input Memoryless Channels
- Polar Coding for Processes with Memory
- Re-proving Channel Polarization Theorems: An Extremality and Robustness Analysis
- Erasure Schemes Using Generalized Polar Codes: Zero-Undetected-Error Capacity and Performance Trade-offs