Sequential Decoding of Convolutional Codes for Rayleigh Fading Channels

  • Authors:

  • Pål Orten;Arne Svensson

  • Affiliations:

  • Nera Research, Bergerveien 12, 1375 Billingstad, Norway E-mail: Pal.Orten@research.nera.no;Communication Systems Group, Department of Signals and Systems, Chalmers University of Technology, SE-412 96 Göteborg, Sweden E-mail: Arne.Svensson@s2.chalmers.se

  • Venue:
  • Wireless Personal Communications: An International Journal
  • Year:
  • 2002

Quantified Score

Hi-index 0.01

Visualization

Abstract

The performance of sequential decoding of long constraint length convolutional codes is evaluated for Rayleigh fading channels. Sequential decoding is not practical below a certain theoretical signal-to-noise ratio, and these theoretical limits are calculated for a number of modulation methods and code rates. As an example, with BPSK modulation, soft decisions and code rate 1/2, the theoretical signal-to-noise ratio per information bit is 5.7 dB. Above this limit the bit error rate can be made arbitrarily small by increasing the constraint length at no significant complexity cost. Furthermore, it is shown that with carefully chosen quantization steps, 8 level uniform quantization gives a negligible loss also for sequential decoding on a Rayleigh fading channel. Simulation results using 8 level quantization correspond well with the theoretical performance bounds. Also, the performance on a correlated channel with finite interleaving has been obtained. With an interleaver depth of 50×50 and a normalized doppler frequency equal to 0.01 we are only 0.5 dB away from the performance with perfect interleaving. Finally, bit error rate results show this scheme to compete well with Turbo codes.