2000 character limit reached
Shaping Bits
Published 18 Jan 2010 in cs.IT and math.IT | (1001.3036v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.