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

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 de...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on information theory Vol. 39; no. 5; pp. 1687 - 1694
Main Authors Balachandran, K., Anderson, J.B., Finamore, W.A., Pimentel, C.J.-L.
Format Journal Article
LanguageEnglish
Published New York, NY IEEE 01.09.1993
Institute of Electrical and Electronics Engineers
Subjects
Applied sciences
Automata
Binary sequences
Coding, codes
Continuous phase modulation
Convolution
Convolutional codes
Exact sciences and technology
Information, signal and communications theory
Maximum likelihood decoding
Modulation coding
Registers
Sampling methods
Signal and communications theory
Telecommunications and information theory
Testing
Phase modulation
Convolutional code
Coding
Trellis code
Maximum likelihood
Continuous phase
Sequential decoding
Online AccessGet full text
ISSN0018-9448
DOI10.1109/18.259658

Cover

More Information
Summary: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.< >
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0018-9448
DOI:10.1109/18.259658