Optimal convolutional codes for tamed frequency modulation

Document Type

Conference Proceeding

Publication Date

12-1-1988

Abstract

Summary form only given. The authors have considered how to combine convolutional codes and tamed frequency modulation (TFM) optimally. The criterion of goodness is the maximum free Euclidean distance for a given code rate and a given number of states in the trellis of the combined coding and modulation (hereafter called complexity of the combination). They report the results of a computer search for the best combinations of coding and TFM for convolutional codes of rate 1/2, 2/3, 3/4, and 4/5, and receiver complexities of up to 256 states (for rate 1/2). Good coding gains have been achieved with little increase in complexity and bandwidth (for rate 1/2 and a complexity of 256 states, a coding gain of about 7.6 dB has been achieved). It is concluded that the best codes found so far belong to a class of codes called matched codes, which have the property of minimizing the complexity of the combinations. Also, for same complexity comparisons, the best codes found using this optimization approach outperform those obtained by applying the traditional method.

Identifier

0024123969 (Scopus)

First Page

48

Last Page

49

Volume

25 n 13

This document is currently not available here.

Share

COinS