Further results on convolutional code search for block-fading channels

  • Authors:
  • M. Chiani;A. Conti;V. Tralli

  • Affiliations:
  • IEIIT-BO/CNR, Univ. of Bologna, Italy;-;-

  • Venue:
  • IEEE Transactions on Information Theory
  • Year:
  • 2004

Quantified Score

Hi-index 754.84

Visualization

Abstract

This correspondence presents results of code search for convolutional codes over block-fading channels (BFCs). Search criteria are based on a union bound approach which exploits the concept of generalized transfer function (GTF) of the error trellis diagram. A new asymptotic bound is derived, and the performance of the codes found using our search criterion is compared analytically and by numerical simulation with already existing codes.