By Topic

Shaping codes constructed from cost-constrained graphs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
S. W. McLaughlin ; Dept. of Electr. Eng., Rochester Inst. of Technol., NY, USA ; A. S. Khayrallah

We give a general procedure for constructing shaping codes from costly constrained graphs. The codes have finite-state encoders and sliding-block decoders. The shaping codes are in the spirit of Calderbank and Ozarow (1990), where shaping is achieved by nonequiprobable signaling on T subconstellations of a signal constellation Ω. We show how nonequiprobable signaling relates to a costly constrained channel. Khayrallah and Neuhoff developed a procedure for constructing codes with rates close to the capacity-cost function of the general cost-constrained channel, and we use their procedure to construct asynchronous (variable-length to fixed-length) shaping codes. Comparisons are made with shaping codes having comparable gain. The codes presented here are less complex and have lower peak-to-average power and lower constellation expansion ratio

Published in:

IEEE Transactions on Information Theory  (Volume:43 ,  Issue: 2 )