Trellis coding with M-ary MSK constraints

Author

Bims, H.V. ; Cioffi, J.M.

Author_Institution

Inf. Syst. Lab., Stanford Univ., CA, USA

fYear

1989

fDate

27-30 Nov 1989

Firstpage

1546

Abstract

A method for concatenating well-known trellis codes with the continuous-phase minimum-shift-keying (MSK) modulator is presented. It is shown that, by using an appropriately designed predecoder, the decoder decisions can be made without memory for generally M-ary MSK. Well-known trellis codes such as the Ungerboeck codes can then be concatenated with the predecoded M-ary MSK modulator. The coding gain of these codes, therefore, can be directly applied to M-ary MSK. For binary MSK, the coding gain performance is at least as good as previous results. In addition, the precoding concept is extended to channels with M>2, and new results for trellis-coded 8-MSK and 16-MSK are reported

Keywords

encoding; minimum shift keying; 16-MSK; 8-MSK; M-ary MSK modulator; Ungerboeck codes; binary MSK; coding gain; continuous-phase minimum-shift-keying; decoder; precoding; trellis codes; Concatenated codes; Continuous phase modulation; Convolutional codes; Decoding; Frequency modulation; Information systems; Laboratories; Modulation coding; Partial response channels; Viterbi algorithm;

fLanguage

English

Publisher

ieee

Conference_Titel

Global Telecommunications Conference and Exhibition 'Communications Technology for the 1990s and Beyond' (GLOBECOM), 1989. IEEE

Conference_Location

Dallas, TX

Type

conf

DOI

10.1109/GLOCOM.1989.64206

Filename

64206