Viterbi算法中的尾比特处理方法

讨论了Viterbi译码算法中一种新型的结束技术——尾比特技术。首先,由原理分析说明了尾比特回溯的编码方式与传统的卷识码编码方式的区别,进一步根据这一编码原理对Viterbi译码算法进行了相应改进。仿真结果证明,改进后的算法能够得到正确的译码结果。     

RS码译码算法对比研究

RS码所具有的高效译码性能使其被广泛应用于数据通信和存储系统的差错控制中。本文主要对目前常用的RS码的硬判决译码算法和K—V代数软判决译码算法进行对比研究。通过对两种算法原理的理论分析,给出了RS码在硬判决与软判决的算法下的计算机仿真。结果表明两种算法均能得到良好的译码效果,而软判决译码算法较硬判决方式能更有效地带来系统增益。而软判决译码算法可以通过适当提高复杂度来改善系统的性能。     

两种级联空时格码方案的EXIT分析

级联空时格码方案可以有效地提高空时格码系统的性能。研究了两种级联空时格码方案:PC-STTC和ST-Turbo-TC。由于两种级联方案都使用了迭代译码方法,而外信息转移(EXIT)图是分析迭代译码性能的有利工具,主要分析比较了PC-STTC和ST-Turbo-TC的EXIT性能,比较了不同信噪比和编码多项式对于译码外信息转移特性的影响。研究结果显示,PC-STTC方案比ST-Turbo-TC方案有着更好的迭代收敛性能,同时给出了BER仿真图证明了EXIT图的分析结论。     

迭代结构的信源信道联合解码及其简化算法

信源信道联合解码算法中的迭代信道解码需要进行比特似然值和概率值转换,以及联乘、累加运算,增加了信道解码的计算复杂度,该文针对这一问题,直接利用信道解码的比特硬判决值和参数的先验概率,估计比特的外信息,用于迭代信道解码。基于高斯-马尔可夫信源参数的仿真实验表明,该简化算法大大降低了迭代信道解码算法的计算复杂度。与独立解码算法相比,简化的联合解码算法明显改善了接收参数的信噪比,同时不会明显降低原迭代结构解码算法的性能。     

Multisecret-sharing schemes and bounded distance decoding of linear codes

Error-correcting codes are used to correct errors when messages are transmitted through a noisy communication channel. Bounded distance decoding (i.e. decoding up to the error-correcting capacity) is a method of correcting errors that guarantees unique decoding. Secret sharing is a cryptographic protocol that allows a secret known from a person called the dealer to be distributed to n participants. No single participant knows the secret but some special subsets of participants called coalitions can. In this paper, we present a multisecret-sharing scheme based on an error-correcting code where secret reconstruction is made by using bounded distance decoding of the code. This scheme is ideal in the sense that the size of each secret equals the size of any share. Its security improves on that of multisecret-sharing schemes.     

一种符合EPCCIG2协议的RFID反向链路数据解码技术的实现

针对物联网协议EPcc1G2中反向链路数据的解码技术，以精简硬件资源和提高解码效率为目标，给出了基于MCU硬件平台，并利用其中TIMER模块和ADC模块实现反向链路数据解码技术的设计分析和实现思路，同时以实际运用中对FM0解码实现为实例，对解码效果、关键技术点进行了分析；还在结论中将此解码技术与常用技术方案进行了扼要比较，阐明了相关技术特点，得出了本技术的比较优势。     

Stochastic resonance in parallel concatenated turbo code decoding

In an array of threshold devices, we examine the effect of noise in improving performance of turbo code decoding. Such a phenomenon of noise-enhanced effect is termed stochastic resonance (SR). When signal is subthreshold, SR is observed by using Gaussian noise during iterative decoding. That is, the minimal bit error ratio (BER) is achieved at some non-zero noise intensity level. Besides, the larger the number of threshold devices is, the more remarkable the SR effect becomes. Especially when noise intensity is nearly optimal, BER approximates to zero after a few decoding iterations. Moreover, when Gaussian mixture noise is utilized, suprathreshold stochastic resonance (SSR) occurs in turbo decoding. These results show the beneficial effect of noise in channel coding and decoding.     

A modified Min Sum decoding algorithm based on LMMSE for LDPC codes

A new modified Min Sum decoding algorithm based on parameter estimation theory for Low Density Parity Check (LDPC) codes is presented in this paper. First, Linear Minimum Mean Square Error (LMMSE) estimate criterion is used to model the magnitude of check-to-variable message and calculate estimated parameters, furthermore the golden section search algorithm is used to speed up getting the boundary, with which the parameters can be determined. Then, the parameters are modified further on the basis of the relationship between the iteration number and the estimated parameters. Finally, the same estimated parameters are used for different signal to noise ratio (SNR) to ensure the decoding performance and reduce the hardware complexity. The simulation results show that a gain of 0.3–0.5 dB can be achieved in comparison with other kinds of modified Min Sum algorithms, which is very close to that of BP algorithm. What's more, the algorithm has the following characteristics: low computation complexity, small decoding delay, easiness of calculation for estimated parameters, and simplicity in hardware implementation.     

基于FPGA的GOOSE报文解析模块设计与实现

为了提高通用面向对象变电站事件(GOOSE)报文的传输实时性和可靠性性能,给出一种基于现场可编程逻辑门阵列(FPGA)的GOOSE报文快速有效解析的方法。利用FPGA的并行执行机制,设计并实现了GOOSE报文解析有限状态机与订阅检验判断流程。通过对实例的行为仿真及波形捕获,验证了设计在较大网络流量下能够实现过滤并快速解析GOOSE与链路自检的功能。相对于传统CPU的顺序执行处理方式,基于FPGA的变电站实时报文解析设计具有更高的实时性及可靠性,为过程层设备的设计与开发提供了新思路。     

高速相干光通信系统中水印辅助的低密度奇偶校验方案

为了研究水印辅助的低密度奇偶校验(LDPC)方 案在高速相干接收光通信系统 中的译码性能,提出了一种适用于相干光通信系统的水印符号辅助的LDPC前向纠错方案 ,与传统LDPC相比,可以大大提高相干接 收机的抗噪声能力。在100Gbit/s 16进制正 交幅度高制(16QAM)相干接收光通信系统上的仿真实验结果表明, 在误码率(BER)为10－9时, 所提出的前向纠错方案与传统LDPC相比 较,信噪比(SNR)增益提高了0.45dB ;同时,在相同BER下,水印符号辅助的LDPC方 案的译码迭代次数有很明显的降低。