DocumentCode
770037
Title
Convolutional coding of binary CPM schemes with no increase in receiver complexity
Author
Holubowicz, Witold ; Morales-Moreno, F.
Author_Institution
Franco-Polish Sch. of New Inf. & Commun. Technol., Poznan, Poland
Volume
43
Issue
38020
fYear
1995
Firstpage
1221
Lastpage
1224
Abstract
In this paper, we deal with convolutionally encoded MSK, DMSK and TFM signals. The matched convolutional encoding technique is used which was shown earlier to lead in some eases to the optimum Viterbi demodulation/decoder which is not more complex than the optimum receiver for the uncoded signal. Results of a systematic search for such cases are presented and discussed.<>
Keywords
Viterbi decoding; continuous phase modulation; convolutional codes; demodulation; frequency modulation; minimum shift keying; receivers; DMSK signals; TFM signals; binary CPM schemes; convolutional coding; convolutionally encoded MSK; decoder; optimum Viterbi demodulation; receiver complexity; uncoded signal; Convolution; Convolutional codes; Decoding; Demodulation; Encoding; Viterbi algorithm;
fLanguage
English
Journal_Title
Communications, IEEE Transactions on
Publisher
ieee
ISSN
0090-6778
Type
jour
DOI
10.1109/26.380156
Filename
380156
Link To Document