On Maximum-Likelihood Decoding of Time-Varying Trellis Codes

Wenhui Li, Vladimir Sidorenko, Thomas Jerkovits, Gerhard Kramer

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    2 Citations (Scopus)

    Abstract

    Decoding complexity of convolutional and trellis codes by Viterbi decoder can be reduced by applying suggested merging algorithm to the Forney code trellis. The algorithm can be applied for every trellis section separately, which is convenient for time-varying codes, and it outputs the minimal trellis of the section. In case of convolutional codes, the same minimal trellis of every section can be obtained from the syndrome trellis of proposed split code.

    Original languageEnglish
    Title of host publication2019 16th International Symposium "Problems of Redundancy in Information and Control Systems", REDUNDANCY 2019
    PublisherInstitute of Electrical and Electronics Engineers Inc.
    Pages104-109
    Number of pages6
    ISBN (Electronic)9781728119441
    DOIs
    Publication statusPublished - Oct 2019
    Event16th International Symposium "Problems of Redundancy in Information and Control Systems", REDUNDANCY 2019 - Moscow, Russian Federation
    Duration: 21 Oct 201925 Oct 2019

    Publication series

    Name2019 16th International Symposium "Problems of Redundancy in Information and Control Systems", REDUNDANCY 2019

    Conference

    Conference16th International Symposium "Problems of Redundancy in Information and Control Systems", REDUNDANCY 2019
    Country/TerritoryRussian Federation
    CityMoscow
    Period21/10/1925/10/19

    Fingerprint

    Dive into the research topics of 'On Maximum-Likelihood Decoding of Time-Varying Trellis Codes'. Together they form a unique fingerprint.

    Cite this