Shaping codes constructed from cost-constrained graphs

Author

McLaughlin, Steven W. ; Khayrallah, Ali S.

Author_Institution

Dept. of Electr. Eng., Rochester Inst. of Technol., NY, USA

Volume

43

Issue

2

fYear

1997

fDate

3/1/1997 12:00:00 AM

Firstpage

692

Lastpage

699

Abstract

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

Keywords

block codes; channel capacity; channel coding; constraint theory; graph theory; telecommunication signalling; variable length codes; asynchronous shaping codes; capacity-cost function; constellation expansion ratio; cost-constrained channel; cost-constrained graphs; finite-state encoders; nonequiprobable signaling; peak-to-average power; shaping codes construction; signal constellation; sliding-block decoders; subconstellations; variable-length to fixed-length codes; AWGN; Additive white noise; Constellation diagram; Convolutional codes; Costs; Data communication; Decoding; Materials science and technology; Peak to average power ratio; Quantization;

fLanguage

English

Journal_Title

Information Theory, IEEE Transactions on

Publisher

ieee

ISSN

0018-9448

Type

jour

DOI

10.1109/18.556124

Filename

556124