A Low Complexity Algorithm for Generating Turbo Code s-Random Interleavers

Authors:
Kostas V. Koutsouvelis;Christos E. Dimakis
Affiliations:
Aristotle University of Thessaloniki, Thessaloniki, Greece;Aristotle University of Thessaloniki, Thessaloniki, Greece
Venue:
Wireless Personal Communications: An International Journal
Year:
2008

Citing 2
Cited 0

Bandwidth-efficient turbo trellis-coded modulation using punctured component codes

IEEE Journal on Selected Areas in Communications
Computing the free distance of turbo codes and serially concatenated codes with interleavers: algorithms and applications

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present a low complexity algorithm based on the bubble search sorting method that can be used to generate Turbo code interleavers that fulfill several criteria like spreading (s-randomness), code matched criteria and even the odd---even property for Turbo Trellis Coded Modulation. Simulation results show that for $$s the algorithm is extremely efficient for short to medium interleaver lengths.