Better rate 1/2 coded continuous phase modulation schemes and the M-algorithm

Author

Balachandran, Kumar ; Anderson, John B. ; Finamore, Weiler A. ; Pimentel, Cecilio J L

Author_Institution

Pacific Commun. Sci. Inc., San Diego, CA, USA

Volume

39

Issue

5

fYear

1993

fDate

9/1/1993 12:00:00 AM

Firstpage

1687

Lastpage

1694

Abstract

Continuous phase modulation (CPM) signals may be precoded by a convolutional code followed by a mapping rule. Better codes may, however, be obtained by a more general code formed by a finite state machine. We provide improved codes for one such finite state machine. A new description of codes and design rules are presented. Better results are demonstrated for the partial response CPM schemes and previous optimum results are matched for the full response case. Tests of an M-algorithm decoder achieve near maximum-likelihood performance with only a fraction of the complexity of the Viterbi algorithm

Keywords

convolutional codes; decoding; finite state machines; phase modulation; trellis codes; CPM; M-algorithm decoder; convolutional code; finite state machine; full response scheme; mapping rule; near maximum-likelihood performance; partial response schemes; rate 1/2 coded continuous phase modulation; trellis code; Automata; Binary sequences; Continuous phase modulation; Convolution; Convolutional codes; Maximum likelihood decoding; Modulation coding; Registers; Sampling methods; Testing;

fLanguage

English

Journal_Title

Information Theory, IEEE Transactions on

Publisher

ieee

ISSN

0018-9448

Type

jour

DOI

10.1109/18.259658

Filename

259658