In this paper, we propose using a single protograph to design joint source-channel codes (JSCCs). We present a generalized algorithm, called protograph extrinsic information transfer for JSCC algorithm (PEXIT-JSCC algorithm), for analyzing the channel threshold of the proposed JSCC. We also propose a source single protograph EXIT (SSP-EXIT) algorithm, which is more generic than the generalized source protograph extrinsic information transfer (GSP-EXIT) algorithm, for evaluating the source threshold of a single protograph. Moreover, a collaborative optimization method based on the SSP-EXIT and PEXIT-JSCC algorithms is proposed to construct single-protograph JSCCs with good source and channel thresholds. Finally, we construct single-protograph JSCCs, analyze their decoding thresholds, and compare their theoretical and error performance with JSCC systems based on optimized double-protographs. Results show that our proposed codes can attain channel thresholds within 1 dB from the Shannon limit and outperform double-protograph-based JSCCs.
翻译:在本文中,我们提议使用单一的原始数据来设计联合源-渠道代码(JSCCs ) 。 此外,我们提出一种通用算法,称为JSCs算法(PEXIT-JSCC 算法),用于分析拟议的JSCs的频道阈值。我们还提议使用单一的原始数据目录EXIT(SSP-EXIT)算法(SSP-EXIT)算法,该算法比通用的源源-外部信息传输算法(GSP-EXIT)算法(GSP-EXIT)算法更为通用,用于评价单一的预测程序源阈值。此外,我们提议了一种基于SSP-EXIT和PEXIT-JSC算法的合作优化方法,以建立有良好源和频道阈值的单一方案 JSCs;最后,我们提出了单一的原始数据目录,分析其分解阈值,并将其理论和错误性能与基于优化的双方案绘图的JSCs系统进行比较。结果显示,我们提议的代码可以从香农用1 dB 和超式双式双式的JSCs。