Rate-Constrained Shaping Codes for Structured Sources

01/08/2020
by   YI LIU, et al.
0

Shaping codes are used to encode information for use on channels with cost constraints. Applications include data transmission with a power constraint and, more recently, data storage on flash memories with a constraint on memory cell wear. In the latter application, system requirements often impose a rate constraint. In this paper, we study rate-constrained fixed-to-variable length shaping codes for noiseless, memoryless costly channels and general i.i.d. sources. The analysis relies on the theory of word-valued sources. We establish a relationship between the code expansion factor and minimum average symbol cost. We then determine the expansion factor that minimizes the average cost per source symbol (total cost), corresponding to a conventional optimal source code with cost. An equivalence is established between codes minimizing average symbol cost and codes minimizing total cost, and a separation theorem is proved, showing that optimal shaping can be achieved by a concatenation of optimal compression and optimal shaping for a uniform i.i.d. source. Shaping codes often incorporate, either explicitly or implicitly, some form of non-equiprobable signaling. We use our results to further explore the connections between shaping codes and codes that map a sequence of i.i.d. source symbols into an output sequence of symbols that are approximately independent and distributed according to a specified target distribution, such as distribution matching (DM) codes. Optimal DM codes are characterized in terms of a new performance measure - generalized expansion factor (GEF) - motivated by the costly channel perspective. The GEF is used to study DM codes that minimize informational divergence and normalized informational divergence.

READ FULL TEXT
research
05/07/2022

Rate-Constrained Shaping Codes for Finite-State Channels With Cost

Shaping codes are used to generate code sequences in which the symbols o...
research
07/01/2019

Mismatched Guesswork

We study the problem of mismatched guesswork, where we evaluate the numb...
research
09/08/2023

Two classes of reducible cyclic codes with large minimum symbol-pair distances

The high-density data storage technology aims to design high-capacity st...
research
12/07/2021

The b-symbol weight hierarchy of the Kasami codes

The symbol-pair read channel was first proposed by Cassuto and Blaum. La...
research
10/12/2018

Optimal Source Codes for Timely Updates

A transmitter observing a sequence of independent and identically distri...
research
07/10/2020

On the Performance of Direct Shaping Codes

In this work, we study a recently proposed direct shaping code for flash...
research
07/21/2021

On the Modulus in Matching Vector Codes

A k-query locally decodable code (LDC) C allows one to encode any n-symb...

Please sign up or login with your details

Forgot password? Click here to reset