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 in:IEEE transactions on information theory 1993-09, Vol.39 (5), p.1687-1694
Main Authors: Balachandran, K., Anderson, J.B., Finamore, W.A., Pimentel, C.J.-L.
Format: Article
Language:English
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
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
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.< >
ISSN:0018-9448
1557-9654
DOI:10.1109/18.259658