DocumentCode
1542438
Title
Optimization of trellis coded TFM via matched codes
Author
Morales-Moreno, Fidel ; Holubowicz, Witold ; Pasupathy, Subbarayan
Author_Institution
Telesat Canada, Gloucester, Ont., Canada
Volume
42
Issue
234
fYear
1994
Firstpage
1586
Lastpage
1594
Abstract
A matched code is a convolutional code chosen in such a way that when combined with modulation with memory the resulting receiver for the coded modulation has the smallest possible number of states. In the paper, the matched coding technique is applied to coded tamed frequency modulation (TFM) schemes and a formal procedure is developed to find the best combination of a code and a modulation. The optimization criterion is the maximum free Euclidean distance for a given code rate and a given number of states in the Viterbi receiver used for the coded modulation. A search for the best codes was carried out for code rates 1/2 and 2/3, and for receivers with up to 256 and 64 states, respectively. Good coding gains (more than 7 dB for rate 1/2) were achieved. Some of the best codes were catastrophic, yet the coded modulation was not. The codes obtained using the matched coding approach were in many cases better than those obtained using traditional optimization techniques
Keywords
convolutional codes; finite state machines; frequency modulation; optimisation; receivers; trellis codes; Viterbi receiver; code rates; coded modulation; coded tamed frequency modulation schemes; coding gains; convolutional code; matched codes; maximum free Euclidean distance; optimization criterion; trellis coded TFM; Convolution; Convolutional codes; Digital modulation; Euclidean distance; Frequency modulation; Modulation coding; Narrowband; Pulse shaping methods; Satellite communication; Viterbi algorithm;
fLanguage
English
Journal_Title
Communications, IEEE Transactions on
Publisher
ieee
ISSN
0090-6778
Type
jour
DOI
10.1109/TCOMM.1994.582851
Filename
582851
Link To Document