Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Bit-permuted coded modulation for polar codes (1609.09786v1)

Published 30 Sep 2016 in cs.IT and math.IT

Abstract: We consider the problem of using polar codes with higher order modulation over AWGN channels. Unlike prior work, we focus on using modulation independent polar codes. That is, the polar codes are not re-designed based on the modulation used. Instead, we propose bit-permuted coded modulation (BPCM): a technique for using the multilevel coding (MLC) approach for an arbitrary polar code. The BPCM technique exploits a natural connection between MLC and polar codes. It involves applying bit permutations prior to mapping the polar code to a higher order modulation. The bit permutations are designed, via density evolution, to match the rates provided by various bit levels of the higher order modulation to that of the polar code. We demonstrate performance of the BPCM technique using link simulations and density evolution for the AWGN channel. We compare the BPCM technique with the bit-interleaved coded modulation (BICM) technique. When using polar codes designed for BPSK modulation, we show gains for BPCM over BICM with random interleaver of up to 0.2 dB, 0.7 dB and 1.4 dB for 4-ASK, 8-ASK, and 16-ASK respectively.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (1)
  1. Saurabha R Tavildar (3 papers)
Citations (8)

Summary

We haven't generated a summary for this paper yet.