Minimum Euclidean distance for combinations of short rate 1/2 convolutional codes and CPFSK modulation
- 1 May 1984
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 30 (3), 509-519
- https://doi.org/10.1109/tit.1984.1056912
Abstract
Continuous phase frequency shift keying (CPFSK) is a constant amplitude modulation method with good spectral sidelobe properties. Good error probability properties can be obtained with coherent maximum-likelihood detection. In this paper we study the Euclidean distance properties of signals formed by a conventional rate1/2convolutional encoder followed by a binary or4-level CPFSK modulator. The minimum Euclidean distance is calculated for these signal sets as a function of the modulation index and the observation interval length. The optimum detector is discussed for rational modulation index values. The best obtainable codes are found for the case of short rate1/2codes with binary or4-level CPFSK modulation. Lists of the best codes are given. Among the results are that the noncatastrophic rate1/2convolutional codes with optimum free Hamming distance do not in general give the best Euclidean distance with CPFSK.Keywords
This publication has 9 references indexed in Scilit:
- Minimum Euclidean distance and power spectrum for a class of smoothed phase modulation codes with constant envelopeIEEE Transactions on Communications, 1982
- Channel coding with multilevel/phase signalsIEEE Transactions on Information Theory, 1982
- On the minimum Euclidean distance for a class of signal space codesIEEE Transactions on Information Theory, 1982
- Symbol Error Probability Bounds for Coherently Viterbi Detected Continuous Phase Modulated SignalsIEEE Transactions on Communications, 1981
- Continuous Phase Modulation--Part I: Full Response SignalingIEEE Transactions on Communications, 1981
- Power-Bandwidth Performance of Smoothed Phase Modulation CodesIEEE Transactions on Communications, 1981
- Error-Correction Coding for Digital CommunicationsPublished by Springer Nature ,1981
- A bandwidth-efficient class of signal-space codesIEEE Transactions on Information Theory, 1978
- Inverses of Linear Sequential CircuitsIEEE Transactions on Computers, 1968