Signal mapping and nonlinear encoder for uniform trellis codes

Author

Buz, Richard

Author_Institution

Dept. of Electr. Eng., Queens Univ., Kingston, Ont., Canada

fYear

1990

fDate

2-5 Dec 1990

Firstpage

1989

Abstract

Sufficient conditions presented by E. Zehavi and J.K. Wolf (1987) ensure that certain N-state trellis codes can be analyzed for distance and error rate using N error states. It is noted here that these conditions neglect the importance of the mapping rule and are limited to trellis codes based on an underlying linear convolutional code. New sufficient conditions which ensure that, after partitioning the signal constellation once, the resultant subsets have equal error weight profiles, are presented. Also, the new conditions allow certain trellis codes based on nonlinear convolutional codes to be analyzed. A rotationally invariant eight-state code using a 32-CR signal set is presented as an example

Keywords

encoding; error correction codes; 32-CR signal set; N-state trellis codes; nonlinear convolutional codes; nonlinear encoder; rotationally invariant eight-state code; signal mapping; uniform trellis codes; Bit error rate; Constellation diagram; Convolutional codes; Error analysis; Error correction codes; Error probability; Euclidean distance; Signal mapping; Sufficient conditions; Upper bound;

fLanguage

English

Publisher

ieee

Conference_Titel

Global Telecommunications Conference, 1990, and Exhibition. 'Communications: Connecting the Future', GLOBECOM '90., IEEE

Conference_Location

San Diego, CA

Print_ISBN

0-87942-632-2

Type

conf

DOI

10.1109/GLOCOM.1990.116827

Filename

116827