基于卷积码和Turbo码的Slepian-Wolf码伴随式译码研究
On Syndrome Decoding for Slepian-Wolf Coding Based on Convolutional and Turbo Codes
摘要:
在信源编码中,无论在解码器处具有或不具有边信息,最终性能都可以通过随机合并来实现。在实际应用中已经成功地将结构化分仓成执行信道码的陪集。在这封信中,它是正式表明,各种卷积和涡轮综合征解码算法提出的文献中导致事实上相同的估计。一个等效的实现也描绘了直接处理的最大后验概率问题的综合征解码和解决它的迭代消息传递。该解决方案利用了与传统信道解码器用于形成校正子的代码的结构和算法完全相同的结构和算法。
英文摘要:
In source coding, either with or without side information at the decoder, the ultimate performance can be achieved by means of random binning. Structured binning into cosets of performing channel codes has been successfully employed in practical applications. In this letter it is formally shown that various convolutional- and turbo-syndrome decoding algorithms proposed in literature lead in fact to the same estimate. An equivalent implementation is also delineated by directly tackling syndrome decoding as a maximum a posteriori probability problem and solving it by means of iterative message-passing. This solution takes advantage of the exact same structures and algorithms used by the conventional channel decoder for the code according to which the syndrome is formed.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。