基于二次全等跳频码的跳频光码分多址系统

从跳频光码分多址(FH-OCDMA)系统的扩频特征出发,推导出具有良好相关性能的扩频码所能达到的最大码容量,再利用二次全等理论为跳频光码分多址系统构造出一种具有最大码容量的扩频码——二次全等跳频码(QCHC),并给出了构造实例。在此基础上,运用光纤布拉格光栅序列作为编解码器设计了一种跳频光码分多址系统的实现方案,并对该系统的性能进行了详细的分析。结果表明,采用二次全等跳频码的跳频光码分多址系统具有设计简单、用户容量大和误码率低等方面的优点。     

Belief-Propagation-Approximated Decoding of Low-Density Parity-Check Codes

In this paper, we propose a new reduced-complexity decoding algorithm of Low-Density Parity-Check (LDPC) codes, called Belief-Propagation-Approximated (BPA) algorithm, which utilizes the idea of normalization and translates approximately the intricate nonlinear operation in the check nodes of the original BP algorithm to only one operation of looking up the table. The normalization factors can be obtained by simulation, or theoretically. Simulation results demonstrate that BPA algorithm exhibits fairly satisfactory bit error performance on the Additive White Gaussian Noise (AWGN) channel.     

Skeleton chain coding for Chinese characters

The compression of Chinese characters is very important for Chinese office automation and desktop publishing. In this paper, various methods are used to compress 13,051 Chinese characters losslessly by coding their skeleton points. The skeleton points are composed of isolated points and curves. To trace every point in a curve once and consecutively is a NP problem. Therefore, we use contour path following and revisiting algorithms to trace skeleton curves with chain codes. The remaining isolated skeleton points are encoded by an Elias code. Our coding method has a better compression rate than that of conventional skeleton coding.     

直接序列扩展频谱中伪码优选研究

本文从最优化理论和工程实际出发，全面分析和完善了直接序列扩展频谱中伪码的数学模型，在此基础上，建立了一种较准确的伪码优选数学模型，并探讨了合适的搜索算法。     

一种P3/P4多相码雷达信号参数快速估计方法

针对Wigner-Ville变换、Radon-Wigner变换估计P3/P4多相编码雷达信号参数存在运算量大、估计精度低等问题,提出了基于Radon-Ambiguity变换和分数阶傅立叶变换（FRFT）联合分析的参数快速估计方法。该方法采用Radon-Ambiguity变换估计信号调制斜率,采用分数阶傅立叶变换估计载频、周期等,通过两次一维搜索峰值来估计信号的参数,与Wigner变换、Radon-Wigner变换的二维搜索峰值相比,运算量大大降低,且提高了参数估计精度。仿真结果证明了该方法的有效性。     

一种优化LDPC码环分布的改进算法

在下一代移动通信系统中,为了满足移动用户对高速、宽带数据传输业务不断增长和更高质量的要求,需要对现有物理层的关键技术作进一步的改进、完善和实用化,例如在信道编码方面,就采用了革命性的LDPC码。而PEG算法则是目前构造中短码长LDPC码最有效的算法之一。通过借鉴ACE算法,在对已有的结构优化设计算法深入理解的基础上,对PEG算法进行了改进,得到了一种可以进一步优化LDPC码环分布和最小距离的改进算法。仿真结果表明：由新算法构造出来的LDPC码的环分布和码重分布都明显优于PEG算法;其性能曲线在低信噪比时与原算法相差不大,而随着信噪比的增加可以有效地降低错误平层。     

一种具有较大围长的正则LDPC码构造方法

提出一种新的具有较大围长的正则LDPC码构造方法。首先介绍以矩阵分裂技术为基础的高围长正则LDPC码的构造方法,并在此基础上分析了设计围长时参数的选取方法。仿真表明,用这种方法构造的正则LDPC码围长可以达到12,并且在AWGN信道下的性能不差于相同参数、随机构造的LDPC码,在高信噪比时甚至优于相同参数的随机码。     

Improved Bounds for Quaternary Linear Codes of Dimension 6

In this paper, twenty new codes of dimension 6 are presented which give improved bounds on the maximum possible minimum distance of quaternary linear codes. These codes belong to the class of quasi-twisted (QT) codes, and have been constructed using a stochastic optimization algorithm, tabu search. A table of upper and lower bounds for d ⁴(n,6) is presented for n≤ 200. Received: 20 December 1996 / Accepted: 13 May 1997     

广义准正则格形码距离谱的计算

本文讨论了格形码距离谱的计算问题，定义了度量空间意义下的广义准正则格形码，对具有Ｉｍａｉ与Ｈｉｒａｋａｗａ［２］和Ｕｎｇｅｒｂｏｅｃｋ［３］定义的典型的时不变网格结构的广义准正则格形码，证明了其距离谱可用全零信息序列对应的码字进行计算。在理论上推广了Ｍ．Ｒｏｕａｎｃｅ与Ｄ．Ｊ．Ｃｏｓｔｅｌｏ的结果，解决了非平方欧几里德度量意义下一类ＴＣＭ信号序列的距离谱计算问题