Recursive error correction for general Reed-Muller codes

Reed-Muller (RM) codes of growing length n and distance d are considered over a binary symmetric channel. A recursive decoding algorithm is designed that has complexity of order nlogn and corrects most error patterns of weight (dlnd)/2. The presented algorithm outperforms other algorithms with nonexponential decoding complexity, which are known for RM codes. We evaluate code performance using a new probabilistic technique that disintegrates decoding into a sequence of recursive steps. This allows us to define the most error-prone information symbols and find the highest transition error probability p, which yields a vanishing output error probability on long codes.     

Regular LDPC Codes from Semipartial Geometries

By considering a class of combinatorial structures, known as semipartial geometries, we define a class of low-density parity-check (LDPC) codes. We derive bounds on minimum distance, rank and girth for the codes from semipartial geometries, and present constructions and performance results for the classes of semipartial geometries which have not previously been proposed for use with iterative decoding.     

河川径流信息遗传基因研究

借鉴分子生物学和遗传工程的理论和方法,研究河川径流信息载体、信息转录、自我复制及信息传递顺序,并从数学上推导出径流变化规律图谱,即径流变化上涨密码图谱和回落密码图谱.通过径流信息密码解读、破译,发现径流中隐藏的变化规律和变化趋势,进而实现对径流的预测.     

OFDM symbol detection integrated with channel multipath gains estimation for doubly-selective fading channels

Orthogonal Frequency Division Multiplexing (OFDM) is a technique for wideband transmission that is commonly used in modern wireless communication systems because of its good performance over frequency selective channels. However OFDM systems are sensitive to channel time variations resulting in Inter-Carrier Interference (ICI), that without suitable detection methods can degrade performance significantly. Channel State Information (CSI) is essential to various OFDM detection schemes, and its acquisition is a critical factor over time varying channels. This work considers a Kalman filter channel multipath gains estimation technique for time varying environments, integrated with a novel detection scheme for OFDM based on a Sphere Decoding (SD) algorithm derived to exploit the banded structure of the channel matrix. This combined scheme employs decision–feedback from the SD requiring only a low pilot symbol density, and hence improves bandwidth efficiency. Three techniques for integrating the Kalman filter operating in decision–feedback mode, with SD data detection that produces these decisions, are considered in this paper. When compared with other competing schemes, this integrated symbol detection and channel multipath gains estimation approach for OFDM provides performance advantages over time varying channels. Furthermore, it is shown that for moderate Doppler shifts the degradation that carrier phase noise induces in this scheme is small.     

量子卷积码的编译码方法

对于量子卷积码理论的研究旨在保护长距离通信中的量子信息序列. 定义了量子态的多项式表示形式,根据Calderbank-Shor-Steane(CSS)型量子码的构造方法,给出了CSS型量子卷积码的一种新的编译码方法,描述了编译码网络. 该方法将码字基态变换为信息多项式与生成多项式的乘积,然后用量子态上的多项式乘法操作实现编译码网络. 最后借鉴经典卷积码的译码思想,给出了具有线性复杂度的量子Viterbi算法. 关键词： 量子信息 量子卷积码 编译码 纠错算法     

基于超结构光纤光栅的正交四相光码分多址编/解码器

正交四相序列编码相比于二相序列具有更大的码字容量和更好的互相关特性,因此更适用于光码分多址(OCDMA)无源光接入网.提出并实现了一种基于超结构光纤光栅的正交四相光码分多址编/解码器.该编/解码器采用A族四相序列作为地址码,在制作的过程中仅需一个均匀相位掩模板即可实现编码功能,并且在性能上与传统工艺制作的编码器相当.为了与不同波长信道相匹配,提出了变信道编码技术,仿真结果表明采用该技术的编码器具有更高频谱效率,因此得到更好的编/解码性能.对一个码长63,长度4.1 cm的正交四相编/解码器进行了信息速率为2.5 Gb/s.码片速率为156 Gchip/s的编/解码实验,取得了较好的编/解码效果.     

基于超结构光纤光栅的全光编解码性能分析

分析了光码分多址(OCDMA)系统中超结构光纤光栅(SSFBG)编解码器的相关特性, 考虑了输入脉冲宽度、SSFBG编解码光栅之间的波长偏移以及光栅的折射率调制振幅对全光编解码性能的影响。结果表明, 随着输入脉冲宽度和编解码光栅之间的波长偏移量的增加, 自相关峰值旁瓣比和自互相关峰值比下降, 即编解码性能出现下降; 编解码器的插入损耗和相关性能间存在矛盾, 需要折中考虑SSFBG折射率调制振幅的选取。建立了基于SSFBG编解码器的时域相位编码OCDMA系统的数学模型, 考虑了差拍噪声、多址干扰、接收机噪声以及接收机的带宽限制对系统性能的影响, 采用全光阈值技术和turbo编码来提高相干扩时OCDMA的系统性能。     

用三色光栅和黑白感光胶片作彩色摄影术的研究与进展

报道南开大学现代光学研究所白光信息处理课题组近十几年在将白光光学信息处理用于黑白胶片作彩色摄影的研究中，各阶段所取得的技术进展，以期社会予以评论和指导。     

Spectral Properties of Ameliorated Peat Soils in Poles'e

Based on the investigation of the optical properties of ameliorated peat soils, we have developed tone aerophotostandards containing information on three stages of their degradation and a classifier of phototone images. We were the first to propose an automated method of decoding aerophotoimages of ameliorated peat soils in Poles'e, which makes it possible to solve problems of their large-scale cartography at a qualitatively new level.     

Fast Decoding Algorithms for First Order Reed-Muller and Related Codes

Fast decoding algorithms for short codes based on modifications of maximum likelihood decoding algorithms of first order Reed-Muller codes are described. Only additions-subtractions, comparisons and absolute value calculations are used in the algorithms. Soft and hard decisions maximum likelihood decoding algorithms for first order Reed-Muller and the Nordstrom-Robinson codes with low complexity are proposed.