EXIT

EXIT
  • 文章类型: Journal Article
    在本文中,提出了一种基于双低密度奇偶校验(D-LDPC)码的联合源信道编码(JSCC)方案的联合组混洗调度解码(JGSSD)算法。所提出的算法将D-LDPC编码结构视为一个整体,并将混洗调度应用于每个组;分组依赖于变量节点(VN)的类型或长度。相比之下,传统的混合调度解码算法可以看作是该算法的一个特例。提出了一种基于JGSSD算法的D-LDPC码系统联合外部信息传输(JEXIT)算法,通过计算不同分组策略的信源解码和信道解码,分析分组策略的效果。仿真结果和比较验证了JGSSD算法的优越性,它可以自适应地权衡解码性能,复杂性和延迟。
    In this paper, a joint group shuffled scheduling decoding (JGSSD) algorithm for a joint source-channel coding (JSCC) scheme based on double low-density parity-check (D-LDPC) codes is presented. The proposed algorithm considers the D-LDPC coding structure as a whole and applies shuffled scheduling to each group; the grouping relies on the types or the length of the variable nodes (VNs). By comparison, the conventional shuffled scheduling decoding algorithm can be regarded as a special case of this proposed algorithm. A novel joint extrinsic information transfer (JEXIT) algorithm for the D-LDPC codes system with the JGSSD algorithm is proposed, by which the source and channel decoding are calculated with different grouping strategies to analyze the effects of the grouping strategy. Simulation results and comparisons verify the superiority of the JGSSD algorithm, which can adaptively trade off the decoding performance, complexity and latency.
    导出

    更多引用

    收藏

    翻译标题摘要

    我要上传

    求助全文

公众号