Interleaver Design for Turbo Coding

Jakob Dahl Andersen, Viktor Zyablov

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

    Abstract

    By a combination of construction and random search based on a careful analysis of the low weight words and the distance properties of the component codes, it is possible to find interleavers for turbo coding with a high minimum distance. We have designed a block interleaver with permutations of each row, and found a combination of permutations where a tight upper bound to the minimum distance of the complete turbo scheme is 108.
    Original languageEnglish
    Title of host publicationProceedings of the International Symposium on Turbo Codes & Related Topics
    Place of PublicationBrest
    PublisherENST de Bretagne
    Publication date1997
    Pages154-156
    Publication statusPublished - 1997
    EventInternational Symposium on Turbo Codes and Related Topics - Brest, France
    Duration: 1 Jan 1997 → …

    Conference

    ConferenceInternational Symposium on Turbo Codes and Related Topics
    CityBrest, France
    Period01/01/1997 → …

    Cite this