检索结果-南通市图书馆

Parity-check and G-matrix based intelligent early stopping criterion for belief propagation decoder for polar codes

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Digital Communications and Networks 2023年第5期9卷 1148-1156页

作者： Qasim Jan Shahid Hussain Zhiwen Pan Nan Liu Zakir Ali Zechen Liu Xiaohu You National Mobile Communications Research Laboratory Southeast UniversityNanjingJiangsu210096China Purple Mountain Laboratories NanjingJiangsu211100China Department of Computer Science COMSATS University IslamabadAttock CampusAttock43600Pakistan School of Medicine Computer Science and EngineeringUniversity of GalwayH91 TK33GalwayIreland Department of Computer Sciences Bahria University Lahore Campus54600Pakistan

The error correction performance of Belief Propagation(BP)decoding for polar codes is satisfactory compared with the Successive Cancellation(SC)***,it has to complete a fixed number of iterations,which results in high computational *** necessitates an intelligent identification of successful BP decoding for early termination of the decoding process to avoid unnecessary iterations and minimize the computational complexity of BP *** paper proposes a hybrid technique that combines the“paritycheck”with the“G-matrix”to reduce the computational complexity of BP decoder for polar *** proposed hybrid technique takes advantage of the parity-check to intelligently identify the valid codeword at an early stage and terminate the BP decoding process,which minimizes the overhead of the G-matrix and reduces the computational complexity of BP *** explore a detailed mechanism incorporating the parity bits as outer code and prove that the proposed hybrid technique minimizes the computational complexity while preserving the BP error correction ***,mathematical formulation for the proposed hybrid technique that minimizes the computation cost of the G-matrix is *** performance of the proposed hybrid technique is validated by comparing it with the state-of-the-art early stopping criteria for BP *** results show that the proposed hybrid technique reduces the iterations by about 90%of BP decoding in a high Signal-to-Noise Ratio(SNR)(i.e.,3.5~4 dB),and approaches the error correction performance of G-matrix and conventional BP decoder for polar codes.

关键词： Belief propagation Early termination G-matrix Parity-check polar codes

维普期刊数据库

Belief propagation list bit-flip decoder for polar codes

在线全文

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2021年第9期64卷 224-231页

作者： Yuyu YANG Yaoyue HU Zhiwen PAN Nan LIU Shenjie XIA National Mobile Communications Research Laboratory Southeast University Huawei Technologies Co.Ltd.

Belief propagation(BP) decoder is a low decoding latency algorithm for polar codes. However,the block error rate(BLER) performance of the BP decoder is inferior to the cyclic redundancy check(CRC)aided successive cancellation list(CA-SCL) decoder with medium list size for polar codes. Thus, in this paper, we introduce a bit-flip method into the belief propagation list(BPL) decoder and propose a BPL bitflip(BPLF) decoder to improve the BLER performance of BP-based decoder for polar codes. The proposed decoder is based on a CRC-aided belief propagation list(CA-BPL) decoder, and the error-prone bits are obtained from the decoded result to construct flip bits set(FBS). The bits in FBS are flipped to obtain the correct decoding result. Moreover, the simulation results show that the BLER of the proposed BPLF decoder is significantly superior to that of the CA-BPL despite having the same list size, e.g., there is 0.75 dB gain at BLER = 10.4 with list size 64. Furthermore, the decoding complexity and latency of the proposed BPLF decoder are only slightly higher than those of CA-BPL decoder with the same list size in medium to high signal-to-noise ratio(SNR) region.

关键词： polar codes belief propagation bit-flip list decoder

An Improved polar codes-Based Key Reconciliation for Practical Quantum Key Distribution

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2018年第2期27卷 250-255页

作者： YAN Shiling WANG Jindong FANG Junbin JIANG Lin WANG Xuan Laboratory of Quantum Engineering and Quantum Materials South China Normal University Department of Optoelectronic Engineering Jinan University The Edward S.Rogers Sr.Department of Electrical & Computer Engineering University of Toronto Harbin Institute of Technology Shenzhen Graduate School

Key reconciliation is important for practical Quantum key distribution（QKD） systems since it corrects the error bits in a key string by sacrificing some key bits. Therefore, its performance directly affects the secret key rate of a practical QKD system. Although key reconciliation scheme based on polar codes can achieve a high coding efficiency, the high frame error rate causes discarding key strings and decreases the secret key rate. In this paper, we fist analyze the limitation of successive cancellation decoding of polar codes, and then we propose an improved key reconciliation scheme using polar codes with successive cancellation list decoding and optimized coding structures, which can decrease the frame error probability, resulting in a higher secret key rate. Numerical results show that the proposed scheme can achieve a 12.8% higher secret key rate than the previous polar codes-based scheme with a code length of 216 bits and a quantum bit error rate of 2%. Besides, the proposed scheme is robust and it can extract secret key bits even when the quantum bit error rate reaches 10.2% with a code length of 2;bits and a coding efficiency of 90.6%.

关键词： Quantum key distribution polar codes Successive cancellation list decoding Secret key rate

Sphere decoder for polar codes concatenated with cyclic redundancy check

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2019年第8期62卷 159-171页

作者： Yongrun YU Zhiwen PAN Nan LIU Xiaosi TAN National Mobile Communications Research Laboratory Southeast University

The existing cyclic redundancy check(CRC)-aided successive cancellation list(CA-SCL) decoder partitions the decoding process into two steps, where an SCL is followed by a CRC check. An SCL decoder can approach the maximum-likelihood(ML) decoding performance of the inner polar codes using a sufficiently large list; however, in this case, CRC is only used for performing error detection. Therefore, the decoding performance of the outer CRC is different from that of ML because the errors are not rectified, which degrades the performance of the entire concatenated codes. In this study, we propose a sphere decoder(SD) that can achieve the ML performance of polar codes concatenated with CRC to address the suboptimality of CASCL decoding. The proposed SD performs joint decoding of the CRC-polar codes in a single step, thereby avoiding the polar decoding and CRC detection decoding scheme. Because the proposed SD guarantees the ML decoding performance of the CRC-polar concatenated codes, the simulation results demonstrate that the block error rate(BLER) of the proposed SD acts as the lower bound of the CA-SCL decoding performance. Further, a new initial radius selection method is proposed for the SD to reduce the average decoding complexity. The simulations demonstrate that the proposed initial radius selection method reduces more amount of decoding complexity when compared with that reduced using sequential step size methods.

关键词： polar codes sphere decoder maximum-likelihood decoding optimal decoding radius search

Improved Segmented Belief Propagation List Decoding for polar codes with Bit-Flipping

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

China Communications 2024年第3期21卷 19-36页

作者： Mao Yinyou Yang Dong Liu Xingcheng Zou En School of Electronics and Information Technology(SEIT) Sun Yat-sen University(SYSU)Guangzhou 510006China School of Information Science Guangzhou Xinhua UniversityGuangzhou 510520China Southern Marine Science and Engineering Guangdong Laboratory(Zhuhai) Zhuhai 519080China

Belief propagation list(BPL) decoding for polar codes has attracted more attention due to its inherent parallel nature. However, a large gap still exists with CRC-aided SCL(CA-SCL) *** this work, an improved segmented belief propagation list decoding based on bit flipping(SBPL-BF) is proposed. On the one hand, the proposed algorithm makes use of the cooperative characteristic in BPL decoding such that the codeword is decoded in different BP decoders. Based on this characteristic, the unreliable bits for flipping could be split into multiple subblocks and could be flipped in different decoders simultaneously. On the other hand, a more flexible and effective processing strategy for the priori information of the unfrozen bits that do not need to be flipped is designed to improve the decoding convergence. In addition, this is the first proposal in BPL decoding which jointly optimizes the bit flipping of the information bits and the code bits. In particular, for bit flipping of the code bits, a H-matrix aided bit-flipping algorithm is designed to enhance the accuracy in identifying erroneous code bits. The simulation results show that the proposed algorithm significantly improves the errorcorrection performance of BPL decoding for medium and long codes. It is more than 0.25 d B better than the state-of-the-art BPL decoding at a block error rate(BLER) of 10^(-5), and outperforms CA-SCL decoding in the low signal-to-noise(SNR) region for(1024, 0.5)polar codes.

关键词： belief propagation list(BPL)decoding bit-flipping polar codes segmented CRC

维普期刊数据库

A low-latency list decoder for polar codes

在线全文

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2018年第10期61卷 163-172页

作者： Qingyun XU Zhiwen PAN Nan LIU Xiaohu YOU National Mobile Communications Research Laboratory Southeast University

Successive cancellation(SC) is a low complexity serial decoding algorithm for polar codes, and successive cancellation list(SCL) can achieve excellent error-correcting performance. However, SCL decoder suffers from long decoding latency compared with belief propagation(BP) decoder. In this paper, a lowlatency list decoder whose latency performance can approach that of BP deocder is proposed. A prunable subtree recognizing scheme based on H-Matrix check is proposed by taking the reliability of frozen bits into account. Then, a latency-reduced list decoder based on the prunable constituent codes is *** results show that the decoding latency of proposed list scheme can be reduced significantly,especially for high signal noise ratio(SNR) region.

关键词： list decoder low latency polar codes successive cancellation

A complexity-reduced fast successive cancellation list decoder for polar codes

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2018年第2期61卷 138-148页

作者： Qingyun XU Zhiwen PAN Nan LIU Xiaohu YOU National Mobile Communications Research Laboratory Southeast University

A multi-bit decision for polar codes based on a simplified successive cancellation(SSC) decoding algorithm can improve the throughput of polar decoding. A list algorithm is used to improve the errorcorrecting performance. However, list decoders are highly complex compared with decoders without a list algorithm. In this paper, a low-complexity list decoder is proposed, where path-splitting operations for a multi-bit decision can be avoided, if the decoding reliability exceeds a threshold. The threshold is determined based on the reliability of subchannels and positions of decoding nodes. Path splitting rules are designed for multi-bit decision processes, and a complexity-reduced list decoder is proposed based on this. Results show that the number of survival paths can be greatly reduced at the cost of negligible deterioration in block error performance. Thus, the computational complexity can be significantly reduced, especially for a high signal-to-noise ratio(SNR) region.

关键词： polar codes low-complexity decoder splitting-reduced multi-bit decision list decoder

Dual-CRC polar codes and dual-SCFlip decoding algorithm for cell search in 5G system

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

The Journal of China Universities of Posts and Telecommunications 2021年第6期28卷 82-90页

作者： Li Xiaohui Liu Shuaishuai Fan Tao Fang Kun State Key Laboratory of Integrated Service Networks Xidian UniversityXi'an 710071China School of Communication Engineering Xidian UniversityXi'an 710071China

polar codes become the coding scheme for control channels of enhanced mobile broadband(eMBB)scenarios in the fifth generation(5 G)communication system due to their excellent decoding *** the cell search procedure in 5 G 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)*** 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 *** 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 *** 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.

关键词： polar codes cell search dual-CRC dual-SCFlip

维普期刊数据库

Deployment of polar codes for Mission-Critical Machine-Type Communication Over Wireless Networks

在线全文

学校读者我要写书评

暂无评论

Computers, Materials & Continua 2022年第4期71卷 573-592页

作者： Najib Ahmed Mohammed Ali Mohammed Mansoor Rodina Binti Ahmad Saaidal Razalli Bin Azzuhri Department of Software Engineering Faculty of Computer Science and Information TechnologyUniversity of Malaya50603Kuala Lumpur Malaysia 2Department of Computer System&TechnologyFaculty of Computer Science and Information TechnologyUniversity of Malaya50603Kuala LumpurMalaysia

Mission critical Machine-type Communication(mcMTC),also referred to as Ultra-reliable Low Latency Communication(URLLC),has become a research *** is primarily characterized by communication that provides ultra-high reliability and very low latency to concurrently transmit short commands to a massive number of connected *** the reduction in physical(PHY)layer overhead and improvement in channel coding techniques are pivotal in reducing latency and improving reliability,the current wireless standards dedicated to support mcMTC rely heavily on adopting the bottom layers of general-purpose wireless standards and customizing only the upper *** mcMTC has a significant technical impact on the design of all layers of the communication protocol *** this paper,an innovative bottom-up approach has been proposed for mcMTC applications through PHY layer targeted at improving the transmission reliability by implementing ultra-reliable channel coding scheme in the PHY layer of IEEE 802.11a standard bearing in mind short packet transmission *** achieve this aim,we analyzed and compared the channel coding performance of convolutional codes(CCs),low-density parity-check(LDPC)codes,and polar codes in wireless network on the condition of short data packet *** Viterbi decoding algorithm(VA),logarithmic belief propagation(Log-BP)algorithm,and cyclic redundancy check(CRC)successive cancellation list(SCL)(CRC-SCL)decoding algorithm were adopted to CC,LDPC codes,and polar codes,***,a new PHY layer for mcMTC has been *** reliability of the proposed approach has been validated by simulation in terms of Bit error rate(BER)and packet error rate(PER)***-to-noise ratio(SNR).The simulation results demonstrate that the reliability of IEEE 802.11a standard has been significantly improved to be at PER=10−5 or even better with the implementation of polar *** results also show that the general-purpose wireless net

关键词： Machine-type communication mission-critical applications MTC URLLC M2M wireless networks polar codes