Self-Synchronizable Decoding Algorithms for Transmission with Redundant Information at Decoder
スポンサーリンク
概要
- 論文の詳細を見る
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.
論文 | ランダム
- 25 Nitrogen Dynamics in Vegetables Growing Soils Applied with Tea Leaf, Coffee and Kitchen Composts by ^N Dilution Method
- Reactive Ion Beam Etching Using a Selective Gallium Doping Method
- The Subway Circuit: Charles Gilpin at the Crossroads
- 改訂版UCLA孤独感尺度邦訳版に関する検討
- 思春期における性的関心の発達 : 性の発達をめぐる生物的要因と社会的要因に関する再考察