论文部分内容阅读
为了应用抗差错算术码进行系统设计和确定信源信道联合编码方案,需要较准确估计抗差错算术码的纠错性能,但目前,抗差错算术码的纠错性能只有仿真结果可以参考。该文以堆栈算法为例,通过理论分析得到了抗差错算术码序列差错概率上界,该上界与(1-R)成反比(R是抗差错算术码的编码效率)。同时,分析过程还为解码过程参数设置提供了理论依据。仿真结果证明了该上界是对算术码纠错能力的良好近似,可以用于编码方案的优化设计。
In order to apply the anti-error arithmetic code to design the system and to determine the joint coding scheme of the source channel, the error correction performance of the anti-error arithmetic code needs to be more accurately estimated. At present, only the simulation results can be referenced for the error correction performance of the anti-error arithmetic code. Taking stack algorithm as an example, the upper bound of the error probability of error-proof arithmetic code sequence is obtained theoretically. The upper bound is inversely proportional to (1-R) (R is the encoding efficiency of error-proof arithmetic code). At the same time, the analysis process also provides a theoretical basis for setting parameters of the decoding process. The simulation results show that the upper bound is a good approximation to the error correction capability of arithmetic codes and can be used to optimize the coding scheme.