The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
중복 정보가 포함된 전송을 위한 새로운 자체 동기화 디코딩 알고리즘이 제안되었습니다. 채널의 비트가 지속적으로 삭제되기 때문에 비동기화가 발생한다고 가정합니다. 디코더는 한 번의 합산 디코딩 이후에 특정 코드워드와 이에 대응하는 업데이트된 코드워드 사이의 해밍 거리 및 신드롬을 포함하는 메트릭에 기초하여 결정을 내립니다. 이전 가정의 기초는 우리가 "CP-거리"라고 부르는 것에 의존합니다. 코드의 CP 거리가 클수록 동기화 특성이 좋아집니다. 또한, 우리의 제안은 이전 제안과 같이 CP(Cycically Permutable) 코드에만 국한되지 않습니다. 이론적 기초와 실험 결과는 우리 알고리즘의 좋은 성능을 보여줍니다.
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.
부
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
부
@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},}
부
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 -