Trellis aggregation for high code rate turbo-code



In high rate Turbo-code, the heavy punctionring makes long sequence of treillis without any bit of redondance. We show in [1] that for a m-states convolutional decoder, A redondance free section of length (m-1) * P, where P is an integer, can be exactly reduced to a section of treillis of length m-1. In [2], we show that for an M state Turbo decoder, among the L compressed trellis stages, only m = 3 or even m = 2 are necessary. The so-called m-min algorithm can either be used to increase the throughput for decoding a high rate turbo-code and/or to reduce its power consumption.

This work has been supported by the GIGADEC project (Brittany region funding), as well as the CPER project PALMYRE II (Brittany region and FEDER funding). The objective of the GIGADEC project was to define new architectures for very high speed Turbo Code (project in collaboration with Turbo-Concept and Telecom Bretagne.)


More information

The matlab file mentioned in [2] (reference [9]) can be download here: here)

In [2], table IV is extracted from this figures:


Figure 1: FER as a function of Eb/No. HSPA turbo-code of length K=5144 for several code rates. Sliding windows of size W is used combined with acquisition sequence of length W (combined with the Next Iteration Initialisation method).


Figure 2: FER as a function of Eb/No. HSPA turbo-code of length K=5144 and code rate r = 0.98. Several values of windows length are used.


Related papers

  1. E. Boutillon; J.-L. Sanchez-Rojas, C. Marchand, “Compression of redundancy free trellis stages in Turbo-Decoder”, Electronics Letters, vol. 49 (7), pp. 460 - 462. 2013
  2. Emmanuel Boutillon, José-Luis Sanchez-Rojas, Cédric Marchand, "Simplified Compression of Redundancy Free Trellis Sections in Turbo Decoder", Accepted in IEEE Communications Letters, Avril 2014.

Return to main page of Emmanuel Boutillon

Return to the main page of the lab

Return to the main page of the university