Self-Synchronizable Decoding Algorithms for Transmission with Redundant Information at Decoder


IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E93-A   No.11   pp.1958-1965
Publication Date: 2010/11/01
Online ISSN: 1745-1337
DOI: 10.1587/transfun.E93.A.1958
Print ISSN: 0916-8508
Type of Manuscript: Special Section PAPER (Special Section on Information Theory and Its Applications)
Category: Coding Theory
synchronization,  CP codes,  LDPC codes,  Hamming distance,  

Full Text: PDF>>
Buy this Article

A novel self-synchronizable decoding algorithm for transmissions with redundant information is proposed. We assume that desynchronization occurs because a continuous deletion of bits in the channel. The decoder bases its decision on a metric which involves the syndrome and the Hamming distance between certain codeword and its corresponding updated codeword after one iteration of sum-product decoding. The foundation of the previous assumption relies on what we called "CP-distance." The larger the CP-distance of a code the better the synchronization characteristics. Moreover, our proposal is not restricted to cyclically permutable (CP) codes as previous proposals. Theoretical foundation and experimental results show good performance of our algorithm.