High speed decoding of the binary (47, 24, 11) quadratic residue code

An efficient table lookup decoding algorithm (TLDA) is presented to decode up to five possible errors in a binary systematic (47, 24, 11) quadratic residue (QR) code. The main idea of the TLDA is based on the weight of syndrome, the syndrome decoder together with a reduced-size lookup table (RSLT), and the shift-search method given by Reed et al. Thus, the size of the lookup table and computational complexity in a finite field can be significantly reduced. The memory size of the proposed condensed lookup table (CLT) consists of only 36.6 Kbytes and is only about 0.24% of the full lookup table (FLT) and 3.2% of the lookup up table given by Chen et al., respectively. These facts lead to significant reduction of computational time and the decoding complexity. A simulation result shows that the decoding speed of the proposed TLDA is much faster than all existing decoding algorithms. Moreover, it can be extended to decode all QR codes, including the class of the cyclic codes when the code length is moderate. The CLT makes this new decoding algorithm suitable for hardware or firmware implementations.     

Oil spill detection from SAR intensity imagery using a marked point process

This paper presents a new algorithm for the detection of oil spill from SAR intensity images. The proposed algorithm combines the marked point process, Bayesian inference and Markov Chain Monte Carlo (MCMC) technique. In this paper, the candidates of oil spills or dark spots in a SAR intensity image are characterized by a Poisson marked point process. The marked point process is formed by a group of random points (as a point process modelling the locations of oil spills) and a set of parameters including geometric parameters of windows centred at the random points and gamma distribution parameters (as the marks attaching to each point). As a result, the candidates of oil spills are represented by a group of windows, in which the intensities of pixels follow independent and identical gamma distribution with lower mean than that for the identical gamma distribution of the pixels out of windows. Following the Bayesian paradigm, the posterior distribution, which characterizes the locations and statistical distributions of oil spills, can be obtained up to a normalizing constant. In order to simulate from the posterior distribution and to estimate the parameters of the posterior distribution, the Revisable Jump MCMC (RJMCMC) algorithm is used. The optimal locations and sizes of dark spots are obtained by a maximum a posteriori (MAP) algorithm. The proposed approach is tested using Radarsat-1 SAR images with oil spills indicated by human analysts. The results show that the proposed approach works well and is very promising.     

联合估计混叠度，运动参数和高分辨率图像的JEMAP算法

本文提出一种空域联合估计混叠度，运动参数和高分辨率图像的JEMAP算法，以提高超分辨率处理的适应性，在地面上稳定地获得高于实测卫星图像中所用CCD设备成像精度的高清晰图像。算法根据星戡CCD设备的成像机理，定义卫星图像的混叠度，确定超分辨率处理模型，通过空域迭代联合估计混叠度，运动参数和高分辨率图像。实际卫星图像处理表明JEMAP算法具有很好的适应性和稳定性，包含先验约束能力较强，可以解开欠采样低分辨率输入图像的混叠，重构清晰卫星图像。     

一种咬尾卷积译码的修正算法

在LTE系统中,物理广播信道和物理下行控制信道均采用了咬尾卷积编码,咬尾卷积编码拥有很多优良的性能.针对咬尾卷积译码,提出了一种基于Viterbi译码的修正算法——正逆序结合译码算法,根据分支度量确定误码在数据帧的分布,最后确定采用正序还是逆序译码结果.仿真结果表明,Viterbi的修正方法有效地降低了系统误码率,而且具有普适性,适合应用于LTE系统.     

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

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

基于HMRF先验模型的超分辨率重建

针对基于最大后验概率(MAP)的超分辨率重建算法在重建图像过程中存在的问题,提出一种基于Huber-马尔可夫随机场(HMRF)先验模型的超分辨率重建方法,采用HMRF作为图像先验模型,对图像进行分段超分辨率重建。仿真实验结果表明,与传统的MAP算法相比,该方法能更好地保存重建图像的边缘细节,有效提高重建图像的质量。     

无源毫米波图像超分辨率处理方法

超分辨率处理是一个病态问题,有效地利用已知信息和约束条件是实现最佳处理的重要因素.论文以无源毫米波成像退化模型为基础,给出点扩展函数估计;通过引入典型目标和场景毫米波辐射特性,把POCS(凸集投影)和MAP(最大后验概率)结合起来,提出一种无源毫米波图像超分辨率处理方法.实验结果表明,该方法能够加快收敛速度,在平滑噪声的同时保护图像边缘和细节.     

GEP算法解码结构复用研究

适应度评价大体可以分成解码和计算适应度值两个部分, 是进化计算中运算量最大、重复率最高的过程之一。为了有效利用已有计算结果的角度避免大量重复建树和遍历运算, 改进了GEP解码算法基本流程以降低GEP的运算量, 达到了提升运算效率的目的。采用仿真的方式对引入复用机制的GEP和传统GEP算法进行了对比实验, 从解码次数、解码所用时间等两个方面进行对照, 发现引入复用机制的GEP算法在解码次数上比传统GEP有多个数量级的优势, 在解码所需时间上也有较大的改进。     

喷泉码中LT码的二次译码算法

LT码是喷泉码的一种,采用LT码的BP译码算法时,当处理完度数为1的数据后,译码将无法继续,造成停止集为空集,影响译码效率。为此,提出一种新的二次译码算法,在译码停止后,针对剩下的编码分组仍然具有可译性的特点,进行进一步译码。仿真结果表明,该算法在译码开销为0.2~0.5的情况下,译码效率普遍提高20%左右。     

国数字地面电视标准中LDPC码的半并行译码结构设计*

中国数字地面电视广播标准采用准循环低密度校验码（QC-LDPC）作为其信道编码的内码。根据该类LDPC码的准循环特性,提出了一种基于后验概率的简化最小和算法及其对应的半并行译码结构。其可实现在同一接收机中尽量复用硬件资源并减少消耗情况下LDPC码的多码率译码。最后,使用可编程门阵列实现了此结构并验证了其性能,实验表明,该方法比传统的最小和算法性能略有降低,但可节约大量存储器资源。