Recursive GF(2N) encoders using left-circulate function for optimum PSK-TCM schemes

  • Authors:
  • Calin Vladeanu;Safwan El Assad;Jean-Claude Carlach;Raymond Quéré;Ion Marghescu

  • Affiliations:
  • Telecommunications Department, University Politehnica of Bucharest, 1-3 Iuliu Maniu Bvd., Zip 061071 Bucharest, Romania;IREENA, ícole Polytechnique de l'Université de Nantes, Rue Christian Pauc, B.P. 50609, 44306 Nantes, Cedex 3, France;France-Télécom R&D, RESA/WIN/CREM, site du CCETT-Rennes, France;XLIM-CNRS, Université de Limoges, France;Telecommunications Department, University Politehnica of Bucharest, 1-3 Iuliu Maniu Bvd., Zip 061071 Bucharest, Romania

  • Venue:
  • Signal Processing
  • Year:
  • 2010

Quantified Score

Hi-index 0.08

Visualization

Abstract

In this paper, phase shift keying-trellis coded modulation (PSK-TCM) schemes are designed using recursive convolutional encoders over Galois field GF(2^N). These encoders are designed using the nonlinear left-circulate (LCIRC) function. The LCIRC function performs a bit left circulation over the representation word. Different encoding rates are obtained for these encoders when using different representation wordlengths at the input and the output, denoted as N"i"n and N, respectively. A generalized 1-delay GF(2^N) encoder scheme using LCIRC is proposed for performance analysis and optimization, for any possible encoding rate, N"i"n/N. The minimum Euclidian distance is estimated for these PSK-TCM schemes and a general expression is found as a function of the wordlengths N"i"n and N. The symbol error rate (SER) is estimated by simulation for PSK-TCM transmissions over an additive white Gaussian noise (AWGN) channel.