2000 character limit reached
Optimal Non-Uniform Mapping for Probabilistic Shaping
Published 6 Aug 2012 in cs.IT and math.IT | (1208.1116v3)
Abstract: The construction of optimal non-uniform mappings for discrete input memoryless channels (DIMCs) is investigated. An efficient algorithm to find optimal mappings is proposed and the rate by which a target distribution is approached is investigated. The results are applied to non-uniform mappings for additive white Gaussian noise (AWGN) channels with finite signal constellations. The mappings found by the proposed methods outperform those obtained via a central limit theorem approach as suggested in the literature.
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.