共查询到16条相似文献,搜索用时 140 毫秒
1.
2.
《信息通信》2019,(3)
文章为了降低极化码的串行抵消列表(Successive Cancellation List,SCL)算法的译码时延,利用简化串行抵消(Simplified SC,SSC)算法思想,设计实现了系统极化码(system polar code,SPC)低复杂度(low complexity)的循环冗余校验辅助串行抵消列表(CRC-Aided SCL,CA-SCL)译码,简称为SPC-LC-CA-SCL算法。仿真结果表明:极化码(1024,512)中"Rate-1"节点并行处理的门限值(Threshold Value)设为64时,SPC-LC-CA-SCL和SPC-CA-SCL算法性能一致,时延减少了6.35%。"Rate-1"节点并行处理的门限值设为32,16时,时延分别减少了17.78%和24.13%,性能则降低了0.4dB和0.5dB。 相似文献
3.
针对极化码连续取消列表(SCL)译码算法为获取较好性能而采用较多的保留路径数,导致译码复杂度较高的缺点,自适应SCL译码算法虽然在高信噪比下降低了一定的计算量,却带来了较高的译码延时。根据极化码的顺序译码结构,该文提出了一种分段循环冗余校验(CRC)与自适应选择保留路径数量相结合的SCL译码算法。仿真结果表明,与传统CRC辅助SCL译码算法、自适应SCL译码算法相比,该算法在码率R=0.5时,低信噪比下(–1 dB)复杂度降低了约21.6%,在高信噪比下(3 dB)复杂度降低了约64%,同时获得较好的译码性能。 相似文献
4.
5.
针对串行抵消翻转译码算法(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的性能增益。 相似文献
6.
首先提出基于初始对数似然比(Log-Likelihood Ratio, LR)与路径度量值(Path Metric, PM)的PM-LLR-SCL译码算法,在接收端初始LLR和PM值之间建立映射关系,并通过重排PM值完成翻转功能。其次,提出基于极化码生成矩阵的行重特性和PM值的PM-RW-SCL译码算法,不仅考虑了Polar码的最小码距和极化子信道可靠度,同时将路径分裂每一层的PM值引入到译码策略中,从而提高了译码性能。仿真结果显示,与串行抵消列表比特翻转(Successive Cancellation List Bit-flip, SCLF)相比,提出的PM-LLR-SCL算法最大可获得约0.23 dB的性能增益,而基于路径数量的复杂度降低了约62%;与基于行权重的串行抵消列表翻转译码算法相比,PM-RW-SCL算法最大可获得约1.5 dB的性能增益,而复杂度降低了约39%。 相似文献
7.
为了解决串行抵消(Successive Cancellation,SC)译码算法在中短码长情况下译码性能不佳的问题,在SC译码算法的基础上增加路径列表和比特翻转方法得到一种改进的串行抵消列表翻转(Successive Cancellation List Flip,SCLF)译码算法.该算法利用比特翻转构建最不可靠的信息位集合,称为翻转集合(Flipping Set,FS),同时提出一种新的度量法则来缩小FS的范围、提高FS的准确率.仿真结果表明,随着信噪比的增大,所提出的SCLF译码算法误块率(Block Error Rate,BLER)有较大提升,当BLER为10-3时,SCLF(码长N=256,列表大小L=8)译码算法的增益比SC(N=256)译码算法提升了 0.55 dB;当BLER为10-4时,SCLF(N=256,L=8)译码算法的增益比CA-SCL(N=256,L=8)译码算法提升了 0.22 dB;当BLER为10-5时,SCLF(N=256,L=16)译码算法的增益比CA-SCL(N=256,L=16)译码算法提升了 0.17 dB. 相似文献
8.
针对极化码在中短码长时纠错性能的不足,提出了一种基于错误集的极化码改进串行抵消列表(Successive Cancellation List of Polar Codes Based on Error Set,ES-SCL)译码算法。该算法首先根据极化码的信道特性构造错误集,在极化码编码时根据错误集中的元素设置奇偶校验(Parity Check,PC)位,其余位置则放置信息比特和冻结比特,译码器在译码PC位时,每条路径通过校验函数得到PC位的比特估计,不执行路径分裂和剪枝,其余位置则执行SCL译码。仿真结果表明,在加性高斯白噪声信道下,当码长为512,码率为0.5,误块率为10-5,最大译码列表数为8时,相较于PC-PSCL译码算法以及CA-SCL译码算法,所提出的ES-SCL译码算法获得了约0.18和0.15dB的增益;当码长为256,码率为0.5,误码率为10-5,最大译码列表数为8时,相较于CA-SCL,PC-PSCL译码算法,获得了约0.3和0.35dB的增益;此外,采用部分比特分裂译码的ES-SCL译码算法可以在误块率与PC-PSCL译码算法几乎相同的情况下,减少约50%的排序次数,具有更低的译码复杂度。 相似文献
9.
10.
11.
极化码作为一种纠错码,具有较好的编译码性能,已成为5G短码控制信道的标准编码方案.但在码长较短时,其性能不够优异.作为一种新型级联极化码,奇偶校验码与极化码的级联方案提高了有限码长的性能,但是其译码算法有着较高的复杂度.该文针对这一问题,提出一种基于奇偶校验码级联极化码的串行抵消局部列表译码(PC-PSCL)算法,该算... 相似文献
12.
13.
An improved successive cancellation list bit-flip based on assigned set (AS-SCLF) decoding algorithm is proposed to solve the problems that the successive decoding of the successive cancellation (SC) decoder has error propagation and the path extension of the successive cancellation list (SCL) decoder has the decision errors in the traditional cyclic redundancy check aided successive cancellation list (CA-SCL) decoding algorithm. The proposed algorithm constructs the AS firstly. The construction criterion is to use the Gaussian approximation principle to estimate the reliabilities of the polar subchannel and the error probabilities of the bits under SC decoding, and the normalized beliefs of the bits in actual decoding are obtained through the path metric under CA-SCL decoding, thus the error bits containing the SC state are identified and sorted in ascending order of the reliability. Then the SCLF decoding is performed. When the CA-SCL decoding fails for the first time, the decision results on the path of the SC state in the AS are exchanged. The simulation results show that compared with the CA-SCL decoding algorithm, the SCLF decoding algorithm based on the critical set and the decision post-processing decoding algorithm, the improved AS-SCLF decoding algorithm can improve the gain of about 0.29 dB, 0.22 dB and 0.1 dB respectively at the block error rate (BLER) of 10-4 and reduce the number of decoding at the low signal-to-noise ratio (SNR), thus the computational complexity is also reduced. 相似文献
14.
A low-complexity design architecture for implementing the Successive Cancellation (SC) decoding algorithm for polar codes is presented. Hardware design of polar decoders is accomplished using SC decoding due to the reduced intricacy of the algorithm. Merged processing element (MPE) block is the primary area occupying factor of the SC decoder as it incorporates numerous sign and magnitude conversions. Two’s complement method is typically used in the MPE block of SC decoder. In this paper, a low-complex MPE architecture with minimal two’s complement conversion is proposed. A reformulation is also applied to the merged processing elements at the final stage of SC decoder to generate two output bits at a time. The proposed merged processing element thereby reduces the hardware complexity of the SC decoder and also reduces latency by an average of 64%. An SC decoder with code length 1024 and code rate 1/2 was designed and synthesized using 45-nm CMOS technology. The implementation results of the proposed decoder display significant improvement in the Technology Scaled Normalized Throughput (TSNT) value and an average 48% reduction in hardware complexity compared to the prevalent SC decoder architectures. Compared to the conventional SC decoder, the presented method displayed a 23% reduction in area. 相似文献
15.
16.
In order to reduce the high complexity of the successive cancellation list (SCL) algorithm for polar codes, a simplified SCL decoding algorithm based on critical sets (CS-SCL decoding algorithm) is proposed. The algorithm firstly constructs the critical sets according to the channel characteristics of the polar codes as well as comprehensively considering both the minimum Hamming weight (MHW) of the information bits and the channel reliability. The information bits within the critical sets and the path splitting are still performed by the SCL decoding algorithm while the information bits outside the critical sets are directly performed by the hard decision. Thus, the number of path ordering, copying, and deleting can be reduced during decoding. Furthermore, the computational complexity of the SCL decoding can also be reduced. Simulation results demonstrate that the decoding complexity of the proposed CS-SCL decoding algorithm, compared with the conventional SCL decoding algorithm, is reduced by at least 70%, while compared with the simplified SCL (PS-SS-SCL) algorithm which constructs the critical set with the first and second information bits of the Rate-1 nodes, its decoding complexity can also be reduced. Moreover, the loss of the error correction performance for the proposed CS-SCL decoding algorithm is minor. Therefore, the proposed CS-SCL algorithm is effective and can provide a reasonable tradeoff between the decoding performance and complexity for the decoding algorithm of polar codes. 相似文献