共查询到17条相似文献,搜索用时 218 毫秒
1.
极化码的简化串行抵消列表(Simplified Successive Cancellation List,SSCL)译码提出了R1(Rate-1)、R0(Rate-0)等多种特殊节点的快速译码算法,一定程度改善了SCL译码复杂度高和时延大的问题,但当节点信息比特数量较大时仍存在大量的冗余计算.针对R1等信息比特较多的节点,提出了一种基于路径度量(Path Metric,PM)的自适应路径选择策略,无需先验信息设置阈值,在不降低SSCL译码性能的条件下能有效降低排序复杂度,减少所需时间步数,提升Polar码译码效率.仿真和实验结果表明,在保证纠错性能的前提下,该算法针对R1节点译码所需的时间步数相对传统SCL译码降低了约83%,相对SSCL降低了约47%,相对快速SSCL降低了约18%.同时,相对基于搜索集和决策函数的SCL译码算法译码效率也有较大提高,其所需时间步数受码字结构及信道环境自适应改变,但不大于快速SSCL译码算法所需时间步数. 相似文献
2.
李岳张强颜鸽来周密王迪 《长江信息通信》2022,(12):45-47
针对自由空间光通信中极化码译码复杂度高的问题,提出了一种适用于大气湍流信道的具有较低译码复杂度的分段CRC辅助SCL剪枝译码算法。将剪枝算法引入大气湍流信道下的极化码译码中,采用分段循环冗余校验作为检错单元,剪枝算法减少SCL译码的译码路径,进而降低极化码译码复杂度。仿真结果表明,在不同湍流强度下,该译码算法可以获得优于SCL译码算法的误码性能,并可通过改变性能损失值,获得较低的译码复杂度。 相似文献
3.
针对极化码连续取消列表(SCL)译码算法为获取较好性能而采用较多的保留路径数,导致译码复杂度较高的缺点,自适应SCL译码算法虽然在高信噪比下降低了一定的计算量,却带来了较高的译码延时。根据极化码的顺序译码结构,该文提出了一种分段循环冗余校验(CRC)与自适应选择保留路径数量相结合的SCL译码算法。仿真结果表明,与传统CRC辅助SCL译码算法、自适应SCL译码算法相比,该算法在码率R=0.5时,低信噪比下(–1 dB)复杂度降低了约21.6%,在高信噪比下(3 dB)复杂度降低了约64%,同时获得较好的译码性能。 相似文献
4.
5.
6.
LDPC码的硬判决译码通常是利用比特翻转算法(BF)以及在其基础上改进的加权比特翻转算法(WBF)来实现的,但是前者算法性能较差,而后者的复杂度较高,为了让译码算法能够兼顾其性能和复杂度,针对之前的BF以及WBF算法,提出了一种改进的LDPC码硬判决译码算法,该算法能够在前两次迭代中完成多个比特位的翻转.仿真结果表明,这种改进的算法可以在性能损失较小的条件下,大大降低算法的复杂度,从而提高译码的效率,减轻硬件的负担. 相似文献
7.
本文针对衰落信道中DPSK(differential phase-shift keying)信号的特点,提出了一种基于判决反馈的Turbo DPSK解调/译码算法,它利用判决反馈进行衰落信道的估计并计算信息比特的似然比.与基于BCJR(Bahl-Cocke-Jelinek-Raviv)的Turbo DPSK解调/译码算法相比,它可以大大降低运算复杂度,减少迭代译码过程中所需的存储空间.仿真结果表明,采用这种新的迭代解调/译码算法可以获得和基于BCJR的迭代解调/译码算法几乎一样的性能. 相似文献
8.
9.
为了提升基于极化码的稀疏码多址接入(sparse code multiple access,SCMA)系统接收机性能,提出了基于简化软消除列表(simplify soft cancellation list,SSCANL)译码器的循环冗余校验(cyclic redundancy check,CRC)辅助联合迭代检测译码接收机方案。该方案中极化码译码器使用SSCANL译码算法,采用译码节点删除技术对软消除列表(soft cancellation list,SCANL)算法所需要的L次软消除译码(soft cancellation, SCAN)进行简化,通过近似删除冻结位节点,简化节点间软信息更新计算过程,从而降低译码算法的计算复杂度。仿真结果表明,SSCANL算法可获得与SCANL算法一致的性能,其计算复杂度与SCANL算法相比有所降低,码率越低,算法复杂度降低效果越好;且基于SSCANL译码器的CRC 辅助联合迭代检测译码接收机方案相较基于SCAN译码器的联合迭代检测译码(joint iterative detection and decoding based on SCAN decoder, JIDD-SCAN)方案、基于SCAN译码器的CRC辅助联合迭代检测译码(CRC aided joint iterative detection and decoding based on SCAN decoder,C-JIDD-SCAN)方案,在误码率为10-4时,性能分别提升了约0.65 dB、0.59 dB。 相似文献
10.
极化码作为一种线性分组码,具有较低的编码复杂度和确定的构造,但当其为中短码长时,性能会有所降低。提出一种基于分段循环冗余校验(cyclic redundancy check,CRC)码级联Hash极化码的设计方法,该方法在原有Hash极化码(Hash-Polar)的基础上,采用CRC分段校验进行双校验,分段CRC码在译码过程中能辅助路径度量,即对译码路径进行修饰,以此提高路径选择的可靠性,提高性能;另外,分段校验是将校验码分散地添加到输入的信息序列中,译码时对于CRC不通过的情况,可提前终止译码路径以省去不必要的译码计算量。最后,译码结束时,Hash校验码对修饰后的L条路径进行校验,选出最佳译码路径。仿真结果表明,所提出的设计方法比 CRC 辅助的 Hash 极化码(Hash-CRC-Polar)误码性能更优异。在高斯信道下,当码长为 128 bit、码率为 1/2、误码率为 10-3时,所提出的基于分段 CRC 校验码的 Hash 极化码比Hash-CRC-Polar获得了约0.25 dB的增益。 相似文献
11.
An efficient hybrid decoding algorithm for Reed-Solomon codes based on bit reliability 总被引:1,自引:0,他引:1
Ta-Hsiang Hu Shu Lin 《Communications, IEEE Transactions on》2003,51(7):1073-1081
The paper presents a computationally efficient hybrid reliability-based decoding algorithm for Reed-Solomon (RS) codes. This hybrid decoding algorithm consists of two major components, a re-encoding process and a successive erasure-and-error decoding process for both bit and symbol levels. The re-encoding process is to generate a sequence of candidate codewords based on the information provided by the codeword decoded by an algebraic decoder and a set of test error patterns. Two criteria are used for testing in the decoding process to reduce the decoding computational complexity. The first criterion is devised to reduce the number of re-encoding operations by eliminating the unlikely error patterns. The second criterion is to test the optimality of a generated candidate codeword. Numerical results show that the proposed decoding algorithm can achieve either a near-optimum error performance or an asymptotically optimum error performance. 相似文献
12.
13.
极化码作为一种纠错码,具有较好的编译码性能,已成为5G短码控制信道的标准编码方案。但在码长较短时,其性能不够优异。提出一种基于增强奇偶校验码级联极化码的新型编译码方法,在原有的奇偶校验位后设立增强校验位,对校验方程中信道可靠度较低的信息位进行双重校验,辅助奇偶校验码在译码过程中对路径进行修剪,以此提高路径选择的可靠性。仿真结果表明,在相同信道、相同码率码长下,本文提出的新型编译码方法比循环冗余校验(cyclic redundancy check,CRC)码级联极化码、奇偶校验(parity check,PC)码级联极化码误码性能更优异。在高斯信道下,当码长为128、码率为1/2、误码率为10-3时,本文提出的基于增强PC码级联的极化码比PC码级联的极化码获得了约0.3 dB增益,与CRC辅助的极化码相比获得了约0.4 dB增益。 相似文献
14.
针对极化码串行抵消列表比特翻转(Successive Cancellation List Bit-Flip, SCLF)译码算法复杂度较高的问题,提出一种基于分布式奇偶校验码的低复杂度极化码SCLF译码(SCLF Decoding Algorithm for Low-Complexity Polar Codes Based on Distributed Parity Check Codes, DPC-SCLF)算法。与仅采用循环冗余校验(Cyclic Redundancy Check, CRC)码校验的SCLF译码算法不同,该算法首先利用极化信道偏序关系构造关键集,然后采用分布式奇偶校验(Parity Check, PC)码与CRC码结合的方式对错误比特进行检验、识别和翻转,提高了翻转精度,减少了重译码次数。此外,在译码时利用路径剪枝操作,提高了正确路径的竞争力,改善了误码性能,且利用提前终止译码进程操作,减少了译码比特数。仿真结果表明,与D-Post-SCLF译码算法和RCS-SCLF译码算法相比,所提出算法具有更低的译码复杂度且在中高信噪比下具有更好的误码性能。 相似文献
15.
16.
Polar codes become the coding scheme for control channels of enhanced mobile broadband (eMBB) scenarios in the fifth generation (5G) communication system due to their excellent decoding performance. For the cell search procedure in 5G system, some common information bits ( CIBs) are transmitted in consecutive synchronization signal blocks ( SSBs). In this paper, a dual-cyclic redundancy check ( dual-CRC) aided encoding scheme is proposed, and the corresponding dual-successive cancellation flip ( dual-SCFlip) algorithm is given to further improve the performance of polar codes in the low signal-to-noise ratio ( SNR) environment. In dual-CRC aided encoding structure, the information bits of polar codes in different transmission blocks add cyclic redundancy check (CRC) sequences respectively according to CIBs and different information bits (DIBs). The structure enlarges the size of CIBs to improve the block error ratio ( BLER) performance of the system. The dual-SCFlip decoder can perform bit flip immediately once CIBs is decoded completely, and then decode DIBs or terminate decoding in advance according to the CRC result, which reduces the delay of decoding and mitigates the error propagation effect. Simulation results show that the dual-CRC aided encoding scheme and dual-SCFlip decoder have significant performance improvement compared to other existing schemes with low SNR. 相似文献
17.
Shufeng Li Mingyu Cai Robert Edwards Yao Sun Libiao Jin 《Digital Communications & Networks》2022,8(3):359-372
Binary Polar Codes (BPCs) have advantages of high-efficiency and capacity-achieving but suffer from large latency due to the Successive-Cancellation List (SCL) decoding. Non-Binary Polar Codes (NBPCs) have been investigated to obtain the performance gains and reduce latency under the implementation of parallel architectures for multi-bit decoding. However, most of the existing works only focus on the Reed-Solomon matrix-based NBPCs and the probability domain-based non-binary polar decoding, which lack flexible structure and have a large computation amount in the decoding process, while little attention has been paid to general non-binary kernel-based NBPCs and Log-Likelihood Ratio (LLR) based decoding methods. In this paper, we consider a scheme of NBPCs with a general structure over GF(2m). Specifically, we pursue a detailed Monte-Carlo simulation implementation to determine the construction for proposed NBPCs. For non-binary polar decoding, an SCL decoding based on LLRs is proposed for NBPCs, which can be implemented with non-binary kernels of arbitrary size. Moreover, we propose a Perfect Polarization-Based SCL (PPB-SCL) algorithm based on LLRs to reduce decoding complexity by deriving a new update function of path metric for NBPCs and eliminating the path splitting process at perfect polarized (i.e., highly reliable) positions. Simulation results show that the bit error rate of the proposed NBPCs significantly outperforms that of BPCs. In addition, the proposed PPB-SCL decoding obtains about a 40% complexity reduction of SCL decoding for NBPCs. 相似文献