Anzeige
Erschienen in:
2019 | OriginalPaper | Buchkapitel
Decoding on the Modified Pruning Trellis for Correcting Insertions/Deletions
verfasst von : Yuan Liu, Ruiqing Xing, Xiaonan Zhao
Erschienen in: Communications, Signal Processing, and Systems
Verlag: Springer Singapore
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Abstract
Both forward and backward passes cost a large number of computations in the traditional decoding algorithm of the concatenated code for correcting insertions/deletions. In this paper, states in the forward pass are pruned according to not only the pruning threshold but also backward quantities. Similarly, the number of states in the backward pass is also reduced according to the forward quantities. Using this modified pruning scheme, the smaller trellis and low-complexity decoding algorithm are achieved, compared with the traditional decoding on the adaptively pruned trellis. Simulation results show that, the computation reduction in the forward-backward algorithm is achieved with no performance loss.