Self-Synchronizable Decoding Algorithms for Transmission with Redundant Information at Decoder
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E93-A No.11 pp.1958-1965
- Publication Date
- 2010/11/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E93.A.1958
- Type of Manuscript
- Special Section PAPER (Special Section on Information Theory and Its Applications)
- Category
- Coding Theory
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Raul MARTINEZ-NORIEGA, Isao ABE, Kazuhiko YAMAGUCHI, "Self-Synchronizable Decoding Algorithms for Transmission with Redundant Information at Decoder" in IEICE TRANSACTIONS on Fundamentals,
vol. E93-A, no. 11, pp. 1958-1965, November 2010, doi: 10.1587/transfun.E93.A.1958.
Abstract: 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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E93.A.1958/_p
Copy
@ARTICLE{e93-a_11_1958,
author={Raul MARTINEZ-NORIEGA, Isao ABE, Kazuhiko YAMAGUCHI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Self-Synchronizable Decoding Algorithms for Transmission with Redundant Information at Decoder},
year={2010},
volume={E93-A},
number={11},
pages={1958-1965},
abstract={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.},
keywords={},
doi={10.1587/transfun.E93.A.1958},
ISSN={1745-1337},
month={November},}
Copy
TY - JOUR
TI - Self-Synchronizable Decoding Algorithms for Transmission with Redundant Information at Decoder
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1958
EP - 1965
AU - Raul MARTINEZ-NORIEGA
AU - Isao ABE
AU - Kazuhiko YAMAGUCHI
PY - 2010
DO - 10.1587/transfun.E93.A.1958
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E93-A
IS - 11
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - November 2010
AB - 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.
ER -
English
