共查询到17条相似文献,搜索用时 94 毫秒
1.
2.
为提高低密度奇偶校验(LDPC)码的低复杂度硬判决译码算法的性能,提出了一种改进的比特翻转(BF)译码算法,在迭代时利用一个交替的门限模式对多个比特进行翻转,降低了每次迭代时比特被错误翻转的概率,从而有效提高了译码性能.仿真结果表明,与BF算法相比,该算法在保持低复杂度的基础上获得了更好的译码性能和更快的收敛速度. 相似文献
3.
4.
相比于最小和译码算法,LDPC码的另外一种译码算法——比特翻转译码算法实现更简单,但其性能有较大恶化。最近提出的有噪梯度下降比特翻转译码(NGDBF)算法性能相比简单的比特翻转算法性能有明显提高,但该算法一次翻转一个比特限制了其应用。结合并行加权比特翻转译码(PWBF)中翻转标记的思想,本文提出了一种NGDBF译码的改进算法——并行NGDBF译码及其自适应形式,克服了PWBF译码对行重/列重较小的LDPC码性能不佳的缺陷。仿真表明:并行NGDBF译码的性能优于相应的NGDBF译码,其自适应形式不仅性能逼近最小和译码,而且实现简单。 相似文献
5.
6.
LDPC码的硬判决译码通常是利用比特翻转算法(BF)以及在其基础上改进的加权比特翻转算法(WBF)来实现的,但是前者算法性能较差,而后者的复杂度较高,为了让译码算法能够兼顾其性能和复杂度,针对之前的BF以及WBF算法,提出了一种改进的LDPC码硬判决译码算法,该算法能够在前两次迭代中完成多个比特位的翻转.仿真结果表明,这种改进的算法可以在性能损失较小的条件下,大大降低算法的复杂度,从而提高译码的效率,减轻硬件的负担. 相似文献
7.
针对低密度奇偶校验(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的增益. 相似文献
8.
针对无线光通信中低密度奇偶校验码(LDPC)置信传播(BP)译码算法复杂度高及置信度振荡造成译码错误等缺点,基于对数BP算法提出了一种改进的译码算法。改进的译码算法在校验节点运算时,判断输入到校验节点消息的最小值与某个门限的大小,根据比较结果,分别用消息最小值或若干个最小值进行运算,在损失很少性能的情况下降低了运算复杂度;同时在比特节点采用振荡抵消处理运算,提高了算法的性能增益。最后在对数正态分布湍流信道模型下,分别对比特充分交织和交织深度为16的情况进行了仿真实验。仿真结果表明,改进的译码算法与BP算法相比,大幅度降低了计算复杂度,而且译码性能有一定的优势,收敛速度损失很少;而相对于最小和算法,改进的算法虽然译码复杂度有所增加,但误码率性能有明显的优势,并且收敛速度也优于最小和算法。因此,改进的译码算法是无线光通信中LDPC码译码算法复杂度和性能之间一个较好的折中处理方案。 相似文献
9.
针对串行抵消翻转译码算法(Successive Cancellation Flip,SCF)受限于单比特翻转而性能提升有限问题,提出了一种双比特翻转译码算法(Successive Cancellation Flip with 2 Bits,SCF2)。针对SCP算法扰动方差初始值固定的问题,设计了一种扰动方差可随码长和码率变化的改进SCP算法。在此基础上,结合翻转和扰动机制,提出了一种动态扰动辅助的串行抵消双比特翻转(Dynamic Perturbation-Aided SCF2,DPA-SCF2)译码算法,并对其译码复杂度和性能进行了分析。仿真结果显示,相比于列表长度为4的循环冗余校验辅助串行抵消列表(Cyclic Redundancy Check Aided Successive Cancellation List,CA-SCL)译码算法,所提算法最大可获得约0.5 dB的性能增益。 相似文献
10.
《无线电通信技术》2021,(1):73-79
级联的LDPC-极化码被用于提升有限长度下极化码的译码性能,尽管在置信传播译码器下获得很大的性能提升,仍与最先进的CA-SCL译码器有着明显的性能差距。针对该问题,提出一个改进的LDPC-极化码级联码比特翻转译码算法,在传统的联合因子图置信传播译码算法译码失败后,通过每次对一个易错的信息比特进行比特翻转,在给定的翻转次数下,其BLER性能比BP译码算法有0.3 dB的增益;在原有的LDPC-极化码基础上串联CRC后,性能得到了进一步提升。仿真结果表明,该级联码在中高信噪比区间获得了极为优异的译码性能,接近中等列表长度的CA-SCL译码器。同时,相对于CA-SCL译码器和极化码的置信传播比特翻转译码器,具有更低的译码时延。 相似文献
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.
In short-range wireless communication system(SWCS),the complex scenarios make its transmission face the diverse interference,and lower hardware resource leads to its limited anti-interference capability.To achieve the reliable transmission,a frequency-hopping-based SWCS (FH-SWCS)with improved LDPC (I-LDPC) code was constructed.In FH-SWCS,a low-complexity check-sum updating(LCU)algorithm was proposed to reduce the amount of computation.LCU-based multi-threshold bit flipping (LCU-MTBF) algorithm was given to increase the reliability of bit-flipping, improving decoding performance and reduce the complexity of decoding.The simulation results demonstrate that LCU is suitable for multiple hard decisions decoding algorithm,and it can reduce the computational complexity of original decoding algorithm without affecting its performance.When BER is 10?5,and iterations number is 5,0.15dB performance gain can be achieved,and the number of additions algorithm can be reduced about 40% in LCU-MTBF.In FH-SWCS with I-LDPC,when BER is 10?4,and SNR is 15dB,the performance gain about 7dB can be achieved to improve the anti-interference of the system effectively. 相似文献
13.
An improved decoding algorithm for finite-geometry LDPC codes 总被引:1,自引:0,他引:1
In this letter, an improved bit-flipping decoding algorithm for high-rate finite-geometry low-density parity-check (FG-LDPC) codes is proposed. Both improvement in performance and reduction in decoding delay are observed by flipping multiple bits in each iteration. Our studies show that the proposed algorithm achieves an appealing tradeoff between performance and complexity for FG-LDPC codes. 相似文献
14.
Parallel Weighted Bit-Flipping Decoding 总被引:1,自引:0,他引:1
Xiaofu Wu Chunming Zhao Xiaohu You 《Communications Letters, IEEE》2007,11(8):671-673
A parallel weighted bit-flipping (PWBF) decoding algorithm for low-density parity-check (LDPC) codes is proposed. Compared to the best known serial weighted bit-flipping decoding, the PWBF decoding converges significantly faster but with little performance penalty. For decoding of finite-geometry LDPC codes, we demonstrate through examples that the proposed PWBF decoding converges in about 5 iterations with performance very close to that of the standard belief-propagation decoding. 相似文献
15.
16.