基于Hoey序列的QC-LDPC码构造方法

基于Hoey序列提出了一种列重为3,并环长至少为8的准循环低密度奇偶校验(quasi-cyclic low-density parity-check,QC-LDPC)码的新颖构造方法,该构造方法能避免短环的产生,有较好的纠错性能,可通过改变参数值进而改变码长和码率.对提出的构造方法进行了环长至少为8的证明,用Matlab搭建了通信系统的仿真模型,并在此模型基础上对基于该构造方法构造的QC-LDPC(900,452)码进行了仿真分析,仿真平台是在高斯白噪声(additive white Gaussian noise,AWGN)信道下,调制方式为二进制相移键控(binary phase shift keying,BPSK)调制,译码算法为和积算法(sum product algorithm,SPA).仿真结果表明,当误码率(bit error rate,BER)相同时,利用该构造方法所构造的QC-LDPC(900,452)码的净编码增益(net coding gain,NCG)比基于等差数列(arithmetic progression sequence,APS)构造的QC-LDPC(896,452)码以及基于最大公约数(greatest common divisor,GCD)构造的QC-LDPC(900,453)码的NCG都提高了,且所有码的码率均为0.5.     

线性调制下LMS和RLS算法研究及仿真

利用MATLAB仿真软件对线性调制下LMS和RLS两种算法进行仿真,通过仿真比较了两种算法的收敛速度,对两种算法收敛后的误码率进行分析,研究了步长对LMS算法均方误差性能曲线的影响和遗忘因子对RLS算法性能曲线的影响．     

多用户OFDM系统中分组跳频算法及性能分析

针对多用户OFDM系统,提出一种新的分组跳频算法,将多个处于深衰落子载波上的频域序列组合构成一个短OFDM帧,动态地分配到系统空闲子载波上进行传输,以解决深衰落所带来的系统性能恶化问题,同时优化系统的资源分配.仿真结果表明,这种分组跳频算法与传统算法相比,能明显改善系统的误码率性能.     

基于蒙特卡罗方法的数字通信系统性能分析

结合数字通信系统的调制解调理论,按照蒙特卡罗的思想原则对数字通信系统进行建模仿真,可以短时、高效地分析影响数字通信系统性能的因素．文章分析了蒙特卡罗建模的思想,建立了基于蒙特卡罗思想的8PSK数字通信系统,应用MATLAB语言编程,分析了8PSK数字通信系统的误码率．通过仿真结果与理论值对比,验证数字通信系统的信噪比对误码率的影响．     

On the Performance of Punctured Turbo Codes

IntroductionTurbo codes, first introduced by Berrou et al.[1],have attracted the attention of many researchers for theirremarkable coding gains close to theoretical limits, yetadmitting a relatively simple iterative decodingtechnique[2]. Since then, abundant of fruitful results on theperformance of turbo codes have been published, in whicha distance spectrum interpretation was presented by [3]and a super trellis structure of turbo codes was derived by[4]. An analytical…     

应用ASN.1对SNMP中SMI进行描述的方法

简单网络管理协议是目前最广泛的网络管理协议,抽象语法记法是国际标准化组织用来描述协议的标准语法。本文详细说明了抽象语法记法1在简单网络管理协议的核心部分管理信息结构中的应用,全面阐述了简单网络管理协议管理网络实体的机制。     

高精度OFDM信道估计算法

为了降低OFDM系统经典最小均方误差(MMSE)信道估计算法的误码率(BER),提出了经带阻滤波的MMSE信道估计算法.该算法首先采用MMSE得到初始的信道估计值,再利用离散傅里叶变换的特性,将噪声和信道频率响应信息分离开来,最后通过带阻滤波器对估计算法进行滤波,进而提高系统的BER性能.仿真结果表明,在增加少量计算复...     

可快速编码的准循环LDPC码设计

由于LDPC码的生成矩阵是非稀疏的,当LDPC码较长时,存储一个庞大的生成矩阵很困难,通过生成矩阵来编码也有较高的时间复杂度. 为了解决LDPC码的编码复杂度问题,该文提出一种可快速编码的准循环LDPC码设计. 不同于其他准循环码,所设计的准循环码校验矩阵除具有准循环特性外,还引入了具有准双对角线结构的子矩阵,使校验矩阵具有近似下三角结构. 该结构的校验矩阵可采用Richardson提出的快速编码算法直接通过校验矩阵进行编码,避免了采用生成矩阵编码带来的存储难度与时间复杂性. 在AWGN信道下的仿真结果表明,该文设计的LDPC码在不同码长、码率情况下均有很好的BER性能.     

Construction of protograph LDPC codes with circular generator matrices

The application of protograph low density parity check(LDPC) codes involves the encoding complexity problem.Since the generator matrices are dense,and if the positions of 1 s are irregularity,the encoder needs to store every 1 of the generator matrices by using huge chip area.In order to solve this problem,we need to design the protograph LDPC codes with circular generator matrices.A theorem concerning the circulating property of generator matrices of nonsingular protograph LDPC codes is proposed.The circulating property of generator matrix of nonsingular protograph LDPC codes can be obtained from the corresponding quasi-cyclic parity check matrix.This paper gives a scheme of constructing protograph LDPC codes with circulating generator matrices,and it reveals that the fast encoding algorithm of protograph LDPC codes has lower encoding complexity under the condition of the proposed theorem.Simulation results in additive white Gaussian noise(AWGN) channels show that the bit error rate(BER) performance of the designed codes based on the proposed theorem is much better than that of GB20600 LDPC codes and Tanner LDPC codes.     

Resource allocation for cooperative diversity systems based on quadrature modulation

To improve the error performance and the resource utilization of cooperative systems, the optimum resource allocation, i.e., power allocation and partner choice, for an adaptive decode-and-forward (DF) cooperative diversity system based on quadrature modulation is investigated. The closed-form expression of the bit error rate (BER) system performance is derived and an optimal power allocation (OPA) algorithm is proposed to optimize the power allocation between the local and relayed signals under the minimum BER criterion. Based on the OPA algorithm, a partner choice strategy is proposed to determine the partner locations specified by various cooperation gains. Simulation results show that the proposed resource optimization algorithms are superior to the unoptimized algorithms by significantly reducing the BER and improving the cooperative gain, which is useful to simplify the practical partner choice process.