Shaping Bits
Albert Guillen i Fabregas, Alfonso Martinez
TL;DR
This paper investigates bit shaping in BICM over Gaussian channels, showing it achieves rates comparable to coded modulation and multilevel coding, with superior error exponents, across all SNRs.
Contribution
It demonstrates that bit shaping in BICM offers near-optimal rates and error exponents, aligning with those of more complex coded modulation schemes.
Findings
BICM with bit shaping achieves rates similar to coded modulation.
The error exponent of BICM exceeds multilevel coding and approaches coded modulation.
Performance is consistent across all SNR values.
Abstract
The performance of bit-interleaved coded modulation (BICM) with bit shaping (i.e., non-equiprobable bit probabilities in the underlying binary code) is studied. For the Gaussian channel, the rates achievable with BICM and bit shaping are practically identical to those of coded modulation or multilevel coding. This identity holds for the whole range of values of signal-to-noise ratio. Moreover, the random coding error exponent of BICM significantly exceeds that of multilevel coding and is very close to that of coded modulation.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Wireless Communication Techniques · Error Correcting Code Techniques · Wireless Communication Security Techniques