重复累积码几种译码算法的研究

介绍了一种可以进行线性编码、线性译码的好码──重复累积码,分析和推导了基于Tanner图的三种译码算法,用MATLAB在高斯信道下对三种算法进行仿真,对RA码译码的结果进行了比较。     

List Decoding of Arıkan’s PAC Codes

Polar coding gives rise to the first explicit family of codes that provably achieve capacity with efficient encoding and decoding for a wide range of channels. However, its performance at short blocklengths under standard successive cancellation decoding is far from optimal. A well-known way to improve the performance of polar codes at short blocklengths is CRC precoding followed by successive-cancellation list decoding. This approach, along with various refinements thereof, has largely remained the state of the art in polar coding since it was introduced in 2011. Recently, Arıkan presented a new polar coding scheme, which he called polarization-adjusted convolutional (PAC) codes. At short blocklengths, such codes offer a dramatic improvement in performance as compared to CRC-aided list decoding of conventional polar codes. PAC codes are based primarily upon the following main ideas: replacing CRC codes with convolutional precoding (under appropriate rate profiling) and replacing list decoding by sequential decoding. One of our primary goals in this paper is to answer the following question: is sequential decoding essential for the superior performance of PAC codes? We show that similar performance can be achieved using list decoding when the list size L is moderately large (say, L⩾128). List decoding has distinct advantages over sequential decoding in certain scenarios, such as low-SNR regimes or situations where the worst-case complexity/latency is the primary constraint. Another objective is to provide some insights into the remarkable performance of PAC codes. We first observe that both sequential decoding and list decoding of PAC codes closely match ML decoding thereof. We then estimate the number of low weight codewords in PAC codes, and use these estimates to approximate the union bound on their performance. These results indicate that PAC codes are superior to both polar codes and Reed–Muller codes. We also consider random time-varying convolutional precoding for PAC codes, and observe that this scheme achieves the same superior performance with constraint length as low as ν=2.     

编码MIMO信道中削弱误差传播的软判决均衡

为降低信道均衡算法的复杂度,提出了一种适于LDPC(Low-Density Parity-Check)编码M IMO(Mu lti-InputMu lti-Output)信道的基于迭代式概率数据辅助(PDA:Probab ilistic Data Assoc iation)的次优软输出判决反馈均衡算法。滑动窗PDA检测器输出外信息作为软输入软输出LDPC信道解码器的先验信息,实现信道均衡与信道解码的联合信息更新,克服传统判决反馈均衡器误差传播的缺陷。仿真表明,该均衡算法性能要比V-BLAST迫零检测算法提高1~2 dB,当Eb/No为3 dB时,误比特率达到10-5,且算法复杂度仅为O(N3),可获得较为满意的码间干扰消除效果。     

Reed-Muller codes and permutation decoding

We show that the first- and second-order Reed-Muller codes, R(1,m) and R(2,m), can be used for permutation decoding by finding, within the translation group, (m−1)- and (m+1)-PD-sets for R(1,m) for m≥5,6, respectively, and (m−3)-PD-sets for R(2,m) for m≥8. We extend the results of Seneviratne [P. Seneviratne, Partial permutation decoding for the first-order Reed-Muller codes, Discrete Math., 309 (2009), 1967-1970].     

Antiblocking decoding

Based on the notion of an antiblocking system a new decoding algorithm is developed which is comparable with the permutation decoding algorithm, but more efficient.     

闭路电教系统双向控制通信链路的简单实现

提出了一种简单实用的闭路电教系统双向控制通信连路，详细分析了探讨了红外遥控系统指令的编解码特征，讲述了软指令解码与恢复方法，同时给出软硬件的具体实现，为电教设备的反向控制提供了一种新的手段。     

瑞利衰落信道中的调频调相信号格形编码的误码性能分析

本文研究了调频调相信号集的格形编码信号，在瑞利衰落信道上的误码性能．并在此条件下，导出误码率的实用表达式，且给出格形编码的例子．     

MPSK信号格形编码的误码性能分析

格形编码调制(TCM)同交错器结合在一起,在衰落信道中有很好的差错性能,本文利用解析法详尽地分析了MPSK的格形编码的误码性能,导出了严格的和易于计算的在衰落信道上传输格形编码调制的平均误码率上限的表达式,并得出重要结论。     

脉冲测距系统中编、译码的软件实现

提出了采用软件编程的方法实现对脉冲测距系统中脉冲数目、脉冲宽度和脉冲间隔的编、译码的方案，以三脉冲的编、译码为例，阐述了具体的实现过程，对程序进行了仿真验证，并对软件实现编、译码的特点进行了分析。     

串行通信编解码软件设计

接口设计中一般软件编解码方法抗干扰能力不强，针对这一问题，采用模拟80C51单片机异步串行口解码的方法来解决。实际应用结果表明，使用该方法设计的异步串行通讯解决了高速通讯情况下误码率高的问题，不仅提高了系统的抗干扰能力，而且使得多串口通讯易于实现。该设计方法可以应用到SPI、IIC等串行总线中。