共查询到16条相似文献,搜索用时 140 毫秒
1.
2.
3.
针对低密度奇偶校验(LDPC)码中加权比特翻转(WBF)译码算法在迭代过程中绝大多数情况都是进行单比特翻转,导致译码效率低并且可能会发生比特翻转"死循环"的现象,提出一种更为高效的加权比特翻转(EWBF)算法.该算法对翻转阈值进行了改进,使得每次迭代能够翻转多个比特,提高译码效率,并且能够避免译码过程出现的翻转"死循环"现象.仿真结果表明,所提译码算法与WBF算法、改进的WBF(MWBF)算法和IMWBF(Improved MWBF)算法相比,平均迭代次数分别降低51.6%~56.2%、49.6%~54.2%和48.1%~51.3%;而在译码性能方面,算法性能接近甚至优于IMWBF算法,当最大迭代次数设定为30次时,相比于IMWBF算法,在误码率为10-4时可获得0.92 dB的增益. 相似文献
4.
5.
LDPC码的硬判决译码通常是利用比特翻转算法(BF)以及在其基础上改进的加权比特翻转算法(WBF)来实现的,但是前者算法性能较差,而后者的复杂度较高,为了让译码算法能够兼顾其性能和复杂度,针对之前的BF以及WBF算法,提出了一种改进的LDPC码硬判决译码算法,该算法能够在前两次迭代中完成多个比特位的翻转.仿真结果表明,这种改进的算法可以在性能损失较小的条件下,大大降低算法的复杂度,从而提高译码的效率,减轻硬件的负担. 相似文献
6.
7.
Turbo码的一种高效改进型MAP译码算法 总被引:1,自引:0,他引:1
该文给出了一种改进型最大后验概率(MAP)译码算法用于实现并行级联卷积码(Turbo码)的最优译码。与基于对数域的Log-MAP算法相比较,该文给出的算法不引入对数域,但能够完全消除标准MAP算法在迭代过程中必须进行的大量指数和对数运算。计算机仿真结果表明,这种具有最优纠错性能的改进型MAP算法能够显著减少运行时间,其译码效率甚至优于牺牲了较多纠错性能的最快速的对数域MAP译码算法(Max-Log-MAP)。 相似文献
8.
文章研究了两种海面目标检测算法。由于海杂波的非高斯、非平稳和非均匀特性,传统的分布模型不能对海杂波进行有效的拟合,海杂波的概率密度函数会产生严重的拖尾现象。海杂波的非平稳性主要体现在纹理上,通过对纹理进行逆高斯建模,并估计纹理的最大后验值和最小均方误差值,对非平稳纹理进行归一化处理,实现海杂波协方差矩阵的平稳化。在广义似然比检测模型的基础上,提出了最大后验逆高斯广义似然比检测器(MAP-IGD-GLRT)和最小均方误差逆高斯广义似然比检测器(MMSE-IGD-GLRT)。经过仿真和实测数据实验验证,该文所提两种检测器均优于对比算法。 相似文献
9.
一种基于MAP的图像超分辨率重建算法 总被引:1,自引:0,他引:1
引入一种基于关键点滤波(Critical-Point Filters,CPF)的图像配准方法,并在最大后验概率(Maximum a Posteriori,MAP)框架下提出一种改进的集投影法(Projections onto ConvexSets,MAP/POCS)混合算法。算法把POCS的残差约束集合加入到基于CPF图像配准的MAP正则算法中,在每次迭代重建中对重建图像的像素点进行约束,充分利用这三种算法的优点。实验结果表明,相比于传统的重建方法,该算法能够更有效地表达视频中的非平移运动,超分辨图像主观质量有明显改善。 相似文献
10.
研究了基于LDPC编码无线MIMO通信系统中的软输出最小均方误差干扰抵消迭代(MMSE PIC)检测算法.针对初次迭代检测时PIC输出的后验比特对数似然比(LLR)不可靠的问题,利用MMSE滤波器输出的高斯近似表示,给出了基于后验概率估计的迭代干扰抵消检测算法,以提高检测器输出的编码比特对数似然比的可靠性.仿真结果表明:改进的检测算法优于现有算法. 相似文献
11.
New insights into weighted bit-flipping decoding 总被引:1,自引:0,他引:1
Wu X. Ling C. Jiang M. Xu E. Zhao C. You X. 《Communications, IEEE Transactions on》2009,57(8):2177-2180
A natural relationship between weighted bit-flipping (WBF) decoding and belief-propagation-like (BP-like) decoding is explored. This understanding can help us develop WBF algorithms from BP-like algorithms. For min-sum decoding, one can find that its WBF algorithm is the algorithm proposed by Jiang et al. For BP decoding, we propose a new WBF algorithm and show its performance advantage. The proposed WBF algorithms are parallelized to achieve rapid convergence. Two efficient simulation-based procedures are proposed for the optimization of the associated thresholds. 相似文献
12.
Hybrid Iterative Decoding for Low-Density Parity-Check Codes Based on Finite Geometries 总被引:1,自引:0,他引:1
Jian Li Xian-Da Zhang 《Communications Letters, IEEE》2008,12(1):29-31
In this letter, a two-stage hybrid iterative decoding algorithm which combines two iterative decoding algorithms is proposed to reduce the computational complexity of finite geometry low-density parity-check (FG-LDPC) codes. We introduce a fast weighted bit-flipping (WBF) decoding algorithm for the first stage decoding. If the first stage decoding fails, the decoding is continued by the powerful belief propagation (BP) algorithm. The proposed hybrid decoding algorithm greatly reduces the computational complexity while maintains the same performance compared to that of using the BP algorithm only. 相似文献
13.
两种NLOS误差消除及TOA定位算法 总被引:2,自引:0,他引:2
在蜂窝网络定位中,由于NLOS环境造成的附加时延(NLOS误差)是导致定位精度下降的主要原因,本文将NLOS误差与系统测量误差合成的噪声分为均值部分和随机部分,利用卡尔曼滤波算法输出与噪声方差无关的特性,无需得到全部噪声方差的准确值,只利用系统测量噪声的方差,用卡尔曼滤波算法除随机部分,再根据噪声均值部分与移动台到基站距离的关系,提出了一种简单的最小二乘(LS)定位算法,或利用最优化方法进行定位;利用仿真实验得到滤波距离--误差先验信息,基于先验信息提出了第二种NLOS误差消除算法,再利用所提的最小二乘定位算法进行定位.仿真结果表明,本文提出的算法能够有效消除NLOS误差带来的影响,具有更高的定位精度与稳健性. 相似文献
14.
论文通过对准逆序置乱算法的研究,提出了一种新颖的置乱处理算法—对折置乱算法。针对一维序列置乱算法分别按行列对图像置乱所固有的弊端进行了改进,获得了良好的置乱效果,并具有保密功能。同时提出了一个置乱度评估指标,该指标实现了严格意义上的归一化,计算简单而有效。 相似文献
15.
16.
Du Jiang Song Ting Zheng Yuzheng Taekon Kim 《电子科学学刊(英文版)》2008,25(1):134-139
In wireless communication environment, the time-varying channel and angular spreads caused by multipath fading and the mobility of Mobile Stations (MS) degrade the performance of the conventional Direction-Of-Arrival (DOA) tracking algorithms. On the other hand, although the DOA estimation methods based on the Maximum Likelihood (ML) principle have higher resolution than the beamforming and the subspace based methods, prohibitively heavy computation limits their practical applications. This letter first proposes a new suboptimal DOA estimation algorithm that combines the advantages of the lower complexity of subspace algorithm and the high accuracy of ML based algorithms, and then proposes a Kalman filtering based tracking algorithm to model the dynamic property of directional changes for mobile terminals in such a way that the association between the estimates made at different time points is maintained. At each stage during tracking process, the current suboptimal estimates of DOA are treated as meas urements, predicted and updated via a Kalman state equation, hence adaptive tracking of moving MS can be carried out without the need to perform unduly heavy computations. Computer simulation results show that this proposed algorithm has better performance of DOA estimation and tracking of MS than the conventional ML or subspace based algorithms in terms of accuracy and robustness. 相似文献