In this paper,an efficient unequal error protection(UEP)scheme for online fountain codes is proposed.In the buildup phase,the traversing-selection strategy is proposed to select the most important symbols(MIS).Then,in...In this paper,an efficient unequal error protection(UEP)scheme for online fountain codes is proposed.In the buildup phase,the traversing-selection strategy is proposed to select the most important symbols(MIS).Then,in the completion phase,the weighted-selection strategy is applied to provide low overhead.The performance of the proposed scheme is analyzed and compared with the existing UEP online fountain scheme.Simulation results show that in terms of MIS and the least important symbols(LIS),when the bit error ratio is 10-4,the proposed scheme can achieve 85%and 31.58%overhead reduction,respectively.展开更多
Digital fountain is applied into deep space communication for its rateless and non-feedback forward error correction.However,the long code length and encoding overhead are confined factors to guarantee a considerable ...Digital fountain is applied into deep space communication for its rateless and non-feedback forward error correction.However,the long code length and encoding overhead are confined factors to guarantee a considerable recovery probability as power and buffer-limited equipment in deep space environment.At the same time,the typical fountain decoding is sub-optimum decoding algorithm.We propose a new approach,Dependent Sequences Compensation Algorithm(DSCA),to improve the encoding efficiency by restricting the randomness in fountain encoding.While decoding algorithm is also optimized by redundant information in stopping set.The results show that the optimized method can obtain a 10-4 decoding failure rate with overhead under 0.20 for code length 500,which indicates the usefulness of the proposed approach in deep space communication.展开更多
In relay-assisted multi-user system, relay coding is important to enhance the robustness and reliability of cooperative transmission. For better adaptability and efficiency, two joint network and fountain coding(JNFC)...In relay-assisted multi-user system, relay coding is important to enhance the robustness and reliability of cooperative transmission. For better adaptability and efficiency, two joint network and fountain coding(JNFC) schemes are proposed. When the condition of all direct channels is worse, JNFC scheme based on distributed LT(DLT) codes is used. Otherwise, JNFC scheme based on multi-dimensional LT(MD-LT) codes is suited. For both two above-mentioned schemes, the united degree distribution design method for short-length fountain codes is proposed. For the latter scheme, MD-LT codes are proposed for equal error protection(EEP) of each user. Simulation results and analysis show that the united degree distribution need less decoding overhead compared with other degree distribution for short-length fountain codes. And then, all users are protected equally in despite of asymmetric uplinks.展开更多
This paper proposed a practicalfeedback scheme for fountain codes based transportprotocol in space communications. In the proposed scheme,the sender is signaled by two types of acknowledgment(ACK) packets.Before decod...This paper proposed a practicalfeedback scheme for fountain codes based transportprotocol in space communications. In the proposed scheme,the sender is signaled by two types of acknowledgment(ACK) packets.Before decoding, packet loss probability isestimated on the receiver side and encapsulated intoa soft ACKand sent to the sender.After decoding,decoding results are encapsulated into hard ACKsandsent to the sender.There are two contributions in the proposed scheme: 1. Employing physical layer calculation instead of application layer statistics to estimate the packet loss probability of space channel, which can improvethe accuracy and practicality. 2. A cascade overhead-failure probabilityrelationship between the sender and the receiver has been analyzed to help determine the exact numberof packetsneeded byfountain decoding.Simulations show that for space communications,compared with the existing space transport protocols, fountain codes based transport protocolwith the proposed schemecan not only ensure transmission reliability, but also greatly improvelink utilization.展开更多
Fountain codes are considered to be a promising coding technique in underwater acoustic communication(UAC) which is challenged with the unique propagation features of the underwater acoustic channel and the harsh mari...Fountain codes are considered to be a promising coding technique in underwater acoustic communication(UAC) which is challenged with the unique propagation features of the underwater acoustic channel and the harsh marine environment. And Luby transform(LT) codes are the first codes fully realizing the digital fountain concept. However, in conventional LT encoding/decoding algorithms, due to the imperfect coverage(IC) of input symbols and short cycles in the generator matrix, stopping sets would occur and terminate the decoding. Thus, the recovery probability is reduced,high coding overhead is required and decoding delay is increased.These issues would be disadvantages while applying LT codes in underwater acoustic communication. Aimed at solving those issues, novel encoding/decoding algorithms are proposed. First,a doping and non-uniform selecting(DNS) encoding algorithm is proposed to solve the IC and the generation of short cycles problems. And this can reduce the probability of stopping sets occur during decoding. Second, a hybrid on the fly Gaussian elimination and belief propagation(OFG-BP) decoding algorithm is designed to reduce the decoding delay and efficiently utilize the information of stopping sets. Comparisons via Monte Carlo simulation confirm that the proposed schemes could achieve better overall decoding performances in comparison with conventional schemes.展开更多
Quantum error correction is a crucial technology for realizing quantum computers.These computers achieve faulttolerant quantum computing by detecting and correcting errors using decoding algorithms.Quantum error corre...Quantum error correction is a crucial technology for realizing quantum computers.These computers achieve faulttolerant quantum computing by detecting and correcting errors using decoding algorithms.Quantum error correction using neural network-based machine learning methods is a promising approach that is adapted to physical systems without the need to build noise models.In this paper,we use a distributed decoding strategy,which effectively alleviates the problem of exponential growth of the training set required for neural networks as the code distance of quantum error-correcting codes increases.Our decoding algorithm is based on renormalization group decoding and recurrent neural network decoder.The recurrent neural network is trained through the ResNet architecture to improve its decoding accuracy.Then we test the decoding performance of our distributed strategy decoder,recurrent neural network decoder,and the classic minimum weight perfect matching(MWPM)decoder for rotated surface codes with different code distances under the circuit noise model,the thresholds of these three decoders are about 0.0052,0.0051,and 0.0049,respectively.Our results demonstrate that the distributed strategy decoder outperforms the other two decoders,achieving approximately a 5%improvement in decoding efficiency compared to the MWPM decoder and approximately a 2%improvement compared to the recurrent neural network decoder.展开更多
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) decoding.In this work, an improved s...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) decoding.In 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.展开更多
Topology optimization(TO),a numerical technique to find the optimalmaterial layoutwith a given design domain,has attracted interest from researchers in the field of structural optimization in recent years.For beginner...Topology optimization(TO),a numerical technique to find the optimalmaterial layoutwith a given design domain,has attracted interest from researchers in the field of structural optimization in recent years.For beginners,opensource codes are undoubtedly the best alternative to learning TO,which can elaborate the implementation of a method in detail and easily engage more people to employ and extend the method.In this paper,we present a summary of various open-source codes and related literature on TO methods,including solid isotropic material with penalization(SIMP),evolutionary method,level set method(LSM),moving morphable components/voids(MMC/MMV)methods,multiscale topology optimization method,etc.Simultaneously,we classify the codes into five levels,fromeasy to difficult,depending on their difficulty,so that beginners can get started and understand the form of code implementation more quickly.展开更多
After the pursuit of seventy years,the invention of polar codes indicates that we have found the first capacity-achieving coding with low complexity construction and decoding,which is the great breakthrough of the cod...After the pursuit of seventy years,the invention of polar codes indicates that we have found the first capacity-achieving coding with low complexity construction and decoding,which is the great breakthrough of the coding theory in the past two decades.In this survey,we retrospect the history of polar codes and summarize the advancement in the past ten years.First,the primary principle of channel polarization is investigated such that the basic construction,coding method and the classic successive cancellation(SC)decoding are reviewed.Second,in order to improve the performance of the finite code length,we introduce the guiding principle and conclude five design criteria for the construction,design and implementation of the polar code in the practical communication system based on the exemplar schemes in the literature.Especially,we explain the design principle behind the concatenated coding and rate matching of polar codes in 5G wireless system.Furthermore,the improved SC decoding algorithms,such as SC list(SCL)decoding and SC stack(SCS)decoding etc.,are investigated and compared.Finally,the research prospects of polar codes for the future 6G communication system are explored,including the optimization of short polar codes,coding construction in fading channels,polar coded modulation and HARQ,and the polar coded transmission,namely polar processing.Predictably,as a new coding methodology,polar codes will shine a light on communication theory and unveil a revolution in transmission technology.展开更多
Recently,a generalized successive cancellation list(SCL)decoder implemented with shiftedpruning(SP)scheme,namely the SCL-SP-ωdecoder,is presented for polar codes,which is able to shift the pruning window at mostωtim...Recently,a generalized successive cancellation list(SCL)decoder implemented with shiftedpruning(SP)scheme,namely the SCL-SP-ωdecoder,is presented for polar codes,which is able to shift the pruning window at mostωtimes during each SCL re-decoding attempt to prevent the correct path from being eliminated.The candidate positions for applying the SP scheme are selected by a shifting metric based on the probability that the elimination occurs.However,the number of exponential/logarithm operations involved in the SCL-SP-ωdecoder grows linearly with the number of information bits and list size,which leads to high computational complexity.In this paper,we present a detailed analysis of the SCL-SP-ωdecoder in terms of the decoding performance and complexity,which unveils that the choice of the shifting metric is essential for improving the decoding performance and reducing the re-decoding attempts simultaneously.Then,we introduce a simplified metric derived from the path metric(PM)domain,and a custom-tailored deep learning(DL)network is further designed to enhance the efficiency of the proposed simplified metric.The proposed metrics are both free of transcendental functions and hence,are more hardware-friendly than the existing metrics.Simulation results show that the proposed DL-aided metric provides the best error correction performance as comparison with the state of the art.展开更多
We designed, assembled, and tested a reliable laser system for ^(87)Rb cold atom fountain clocks. The laser system is divided into four modules according to function, which are convenient for installing, adjusting, ma...We designed, assembled, and tested a reliable laser system for ^(87)Rb cold atom fountain clocks. The laser system is divided into four modules according to function, which are convenient for installing, adjusting, maintaining, and replacing of the modules. In each functional module, all optical components are fixed on a baseplate with glue and screws, ensuring the system's structural stability. Mechanical stability was verified in a 6.11g RMS randomvibration test, where the change in output power before and after vibration was less than 5%. Thermal stability was realized by optimizing of the structure and appropriate selection of component materials of the modules through thermal simulation. In the laser splitting and output module, the change in laser power was less than 20% for each fiber in thermal cycles from 5℃ to 43℃. Finally,the functionality of the laser system was verified for a rubidium fountain clock.展开更多
To remove the restriction on code length of polar codes,this paper proposes a construction scheme,called stepwise polar codes,which can gen-erate arbitrary-length polar codes.The stepwise polar codes are generated by ...To remove the restriction on code length of polar codes,this paper proposes a construction scheme,called stepwise polar codes,which can gen-erate arbitrary-length polar codes.The stepwise polar codes are generated by sub-polar codes with different code lengths.To improve coding performance,sub-polar codes are united by polarization effect priority algorithm,which can reduce the number of in-completely polarized channels.Then,the construction method of the generator matrix of the stepwise po-lar code is presented.Furthermore,we prove that the proposed scheme has lower decoding complexity than punctured,multi-kernel polar codes.Simulation results show that the proposed method can achieve similar decoding performance compared with the conventional punctured polar codes,rate-compatible punctured polar code,PC-short and asymmetric polar codes(APC)when code length N=48 and 72,respectively.展开更多
Deep holes are very important in the decoding of generalized RS codes, and deep holes of RS codes have been widely studied, but there are few works on constructing general linear codes based on deep holes. Therefore, ...Deep holes are very important in the decoding of generalized RS codes, and deep holes of RS codes have been widely studied, but there are few works on constructing general linear codes based on deep holes. Therefore, we consider constructing binary linear codes by combining deep holes with binary BCH codes. In this article, we consider the 2-error-correcting binary primitive BCH codes and the extended codes to construct new binary linear codes by combining them with deep holes, respectively. Furthermore, three classes of binary linear codes are constructed, and then we determine the parameters and the weight distributions of these new binary linear codes.展开更多
This paper presents an intelligent protograph construction algorithm.Protograph LDPC codes have shown excellent error correction performance and play an important role in wireless communications.Random search or manua...This paper presents an intelligent protograph construction algorithm.Protograph LDPC codes have shown excellent error correction performance and play an important role in wireless communications.Random search or manual construction are often used to obtain a good protograph,but the efficiency is not high enough and many experience and skills are needed.In this paper,a fast searching algorithm is proposed using the convolution neural network to predict the iterative decoding thresholds of protograph LDPC codes effectively.A special input data transformation rule is applied to provide stronger generalization ability.The proposed algorithm converges faster than other algorithms.The iterative decoding threshold of the constructed protograph surpasses greedy algorithm and random search by about 0.53 dB and 0.93 dB respectively under 100 times of density evolution.Simulation results show that quasi-cyclic LDPC(QC-LDPC)codes constructed from the proposed algorithm have competitive performance compared to other papers.展开更多
In this paper,we propose Triangular Code(TC),a new class of fountain code with near-zero redundancy and linear encoding and decoding computational complexities of OeLklog kT,where k is the packet batch size and L is t...In this paper,we propose Triangular Code(TC),a new class of fountain code with near-zero redundancy and linear encoding and decoding computational complexities of OeLklog kT,where k is the packet batch size and L is the packet data length.Different from previous works where the optimal performance of codes has been shown under asymptotic assumption,TC enjoys near-zero redundancy even under non-asymptotic settings for smallmoderate number of packets.These features make TC suitable for practical implementation in batteryconstrained devices in IoT,D2D and M2M network paradigms to achieve scalable reliability,and minimize latency due to its low decoding delay.TC is a non-linear code,which is encoded using the simple shift and XOR addition operations,and decoded using the simple back-substitution algorithm.Although it is nonlinear code at the packet level,it remains linear code when atomized at the bit level.We use this property to show that the backsubstitution decoder of TC is equivalent to the Belief Propagation(BP)decoder of LT code.Therefore,TC can benefit from rich prolific literature published on LT code,to design efficient code for various applications.Despite the equivalency between the decoders of TC and LT code,we show that compared to state-of-the-art optimized LT code,TC reduces the redundancy of LT code by 68%-99% for k reaching 1024.展开更多
In a recent paper, Hu et al. defined the complete weight distributions of quantum codes and proved the Mac Williams identities, and as applications they showed how such weight distributions may be used to obtain the s...In a recent paper, Hu et al. defined the complete weight distributions of quantum codes and proved the Mac Williams identities, and as applications they showed how such weight distributions may be used to obtain the singleton-type and hamming-type bounds for asymmetric quantum codes. In this paper we extend their study much further and obtain several new results concerning the complete weight distributions of quantum codes and applications. In particular, we provide a new proof of the Mac Williams identities of the complete weight distributions of quantum codes. We obtain new information about the weight distributions of quantum MDS codes and the double weight distribution of asymmetric quantum MDS codes. We get new identities involving the complete weight distributions of two different quantum codes. We estimate the complete weight distributions of quantum codes under special conditions and show that quantum BCH codes by the Hermitian construction from primitive, narrow-sense BCH codes satisfy these conditions and hence these estimate applies.展开更多
Belief propagation(BP)decoding outputs soft information and can be naturally used in iterative receivers.BP list(BPL)decoding provides comparable error-correction performance to the successive cancellation list(SCL)de...Belief propagation(BP)decoding outputs soft information and can be naturally used in iterative receivers.BP list(BPL)decoding provides comparable error-correction performance to the successive cancellation list(SCL)decoding.In this paper,we firstly introduce an enhanced code construction scheme for BPL decoding to improve its errorcorrection capability.Then,a GPU-based BPL decoder with adoption of the new code construction is presented.Finally,the proposed BPL decoder is tested on NVIDIA RTX3070 and GTX1060.Experimental results show that the presented BPL decoder with early termination criterion achieves above 1 Gbps throughput on RTX3070 for the code(1024,512)with 32 lists under good channel conditions.展开更多
The caesium atomic fountain clock is a primary frequency standard.During its operation,a Majorana transition frequency shift will occur once a magnetic field at some special locations along the atomic trajectory is si...The caesium atomic fountain clock is a primary frequency standard.During its operation,a Majorana transition frequency shift will occur once a magnetic field at some special locations along the atomic trajectory is singular.In this study,by developing a physical model,we analyzed the magnetic field requirements for atomic adiabatic transition and calculated the influence of the Majorana atomic transition on the atomic state via a quantum method.Based on the simulation results for the magnetic field in the fountain clock,we applied the Monte Carlo method to simulate the relationship between the Majorana transition frequency shift and the magnetic field at the entrance of the magnetic shielding,as well as the initial atomic population.Measurement of the Majorana transition frequency shift was realized by state-selecting asymmetrically populated atoms.The relationship between the Majorana transition frequency shift and the axial magnetic field at the entrance of the magnetic shielding was obtained.The measured results were essentially consistent with the calculated results.Thus,the magnetic field at the entrance of the magnetic shielding was configured,and the Majorana transition frequency shift of the fountain clock was calculated to be 4.57×10^(-18).展开更多
As a branch of applied mathematics, coding theory plays an important role. Among them, cyclic codes have attracted much attention because of their good algebraic structure and easy analysis performance. In this paper,...As a branch of applied mathematics, coding theory plays an important role. Among them, cyclic codes have attracted much attention because of their good algebraic structure and easy analysis performance. In this paper, we will study one class of cyclic codes over F<sub>3</sub>. Given the length and dimension, we show that it is optimal by proving its minimum distance is equal to 4, according to the Sphere Packing bound.展开更多
基金supported by the National Natural Science Foundation of China(61601147)the Beijing Natural Science Foundation(L182032)。
文摘In this paper,an efficient unequal error protection(UEP)scheme for online fountain codes is proposed.In the buildup phase,the traversing-selection strategy is proposed to select the most important symbols(MIS).Then,in the completion phase,the weighted-selection strategy is applied to provide low overhead.The performance of the proposed scheme is analyzed and compared with the existing UEP online fountain scheme.Simulation results show that in terms of MIS and the least important symbols(LIS),when the bit error ratio is 10-4,the proposed scheme can achieve 85%and 31.58%overhead reduction,respectively.
基金Supported by the National Natural Sciences Foundation of China (No. 61032003)
文摘Digital fountain is applied into deep space communication for its rateless and non-feedback forward error correction.However,the long code length and encoding overhead are confined factors to guarantee a considerable recovery probability as power and buffer-limited equipment in deep space environment.At the same time,the typical fountain decoding is sub-optimum decoding algorithm.We propose a new approach,Dependent Sequences Compensation Algorithm(DSCA),to improve the encoding efficiency by restricting the randomness in fountain encoding.While decoding algorithm is also optimized by redundant information in stopping set.The results show that the optimized method can obtain a 10-4 decoding failure rate with overhead under 0.20 for code length 500,which indicates the usefulness of the proposed approach in deep space communication.
基金supported in part by a grant from the Ph.D. Programs Foundation of Ministry of Education of China under Grants No. 20094307110004National Natural Science Foundation of China under Grants No.61372098, No.61101074Natural Science Foundation of Hunan Province, China under Grants No.12jj2037
文摘In relay-assisted multi-user system, relay coding is important to enhance the robustness and reliability of cooperative transmission. For better adaptability and efficiency, two joint network and fountain coding(JNFC) schemes are proposed. When the condition of all direct channels is worse, JNFC scheme based on distributed LT(DLT) codes is used. Otherwise, JNFC scheme based on multi-dimensional LT(MD-LT) codes is suited. For both two above-mentioned schemes, the united degree distribution design method for short-length fountain codes is proposed. For the latter scheme, MD-LT codes are proposed for equal error protection(EEP) of each user. Simulation results and analysis show that the united degree distribution need less decoding overhead compared with other degree distribution for short-length fountain codes. And then, all users are protected equally in despite of asymmetric uplinks.
基金supported by the National Natural Science Foundation of China (NSFC) under grant No. 61132002National Program on Key Basic Research Project of China (973 Program) under grant No. 2014CB340206+1 种基金the Creative Research Groups of NSFC under grant No. 61321061Aerospace Communications and Terminal Application Technologies Engineering Laboratory in Shenzhen under No.JCYJ20120619140254275
文摘This paper proposed a practicalfeedback scheme for fountain codes based transportprotocol in space communications. In the proposed scheme,the sender is signaled by two types of acknowledgment(ACK) packets.Before decoding, packet loss probability isestimated on the receiver side and encapsulated intoa soft ACKand sent to the sender.After decoding,decoding results are encapsulated into hard ACKsandsent to the sender.There are two contributions in the proposed scheme: 1. Employing physical layer calculation instead of application layer statistics to estimate the packet loss probability of space channel, which can improvethe accuracy and practicality. 2. A cascade overhead-failure probabilityrelationship between the sender and the receiver has been analyzed to help determine the exact numberof packetsneeded byfountain decoding.Simulations show that for space communications,compared with the existing space transport protocols, fountain codes based transport protocolwith the proposed schemecan not only ensure transmission reliability, but also greatly improvelink utilization.
基金supported by the National Natural Science Foundation of China(61371099)the Fundamental Research Funds for the Central Universities of China(HEUCF150812/150810)
文摘Fountain codes are considered to be a promising coding technique in underwater acoustic communication(UAC) which is challenged with the unique propagation features of the underwater acoustic channel and the harsh marine environment. And Luby transform(LT) codes are the first codes fully realizing the digital fountain concept. However, in conventional LT encoding/decoding algorithms, due to the imperfect coverage(IC) of input symbols and short cycles in the generator matrix, stopping sets would occur and terminate the decoding. Thus, the recovery probability is reduced,high coding overhead is required and decoding delay is increased.These issues would be disadvantages while applying LT codes in underwater acoustic communication. Aimed at solving those issues, novel encoding/decoding algorithms are proposed. First,a doping and non-uniform selecting(DNS) encoding algorithm is proposed to solve the IC and the generation of short cycles problems. And this can reduce the probability of stopping sets occur during decoding. Second, a hybrid on the fly Gaussian elimination and belief propagation(OFG-BP) decoding algorithm is designed to reduce the decoding delay and efficiently utilize the information of stopping sets. Comparisons via Monte Carlo simulation confirm that the proposed schemes could achieve better overall decoding performances in comparison with conventional schemes.
基金Project supported by Natural Science Foundation of Shandong Province,China (Grant Nos.ZR2021MF049,ZR2022LLZ012,and ZR2021LLZ001)。
文摘Quantum error correction is a crucial technology for realizing quantum computers.These computers achieve faulttolerant quantum computing by detecting and correcting errors using decoding algorithms.Quantum error correction using neural network-based machine learning methods is a promising approach that is adapted to physical systems without the need to build noise models.In this paper,we use a distributed decoding strategy,which effectively alleviates the problem of exponential growth of the training set required for neural networks as the code distance of quantum error-correcting codes increases.Our decoding algorithm is based on renormalization group decoding and recurrent neural network decoder.The recurrent neural network is trained through the ResNet architecture to improve its decoding accuracy.Then we test the decoding performance of our distributed strategy decoder,recurrent neural network decoder,and the classic minimum weight perfect matching(MWPM)decoder for rotated surface codes with different code distances under the circuit noise model,the thresholds of these three decoders are about 0.0052,0.0051,and 0.0049,respectively.Our results demonstrate that the distributed strategy decoder outperforms the other two decoders,achieving approximately a 5%improvement in decoding efficiency compared to the MWPM decoder and approximately a 2%improvement compared to the recurrent neural network decoder.
基金funded by the Key Project of NSFC-Guangdong Province Joint Program(Grant No.U2001204)the National Natural Science Foundation of China(Grant Nos.61873290 and 61972431)+1 种基金the Science and Technology Program of Guangzhou,China(Grant No.202002030470)the Funding Project of Featured Major of Guangzhou Xinhua University(2021TZ002).
文摘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) decoding.In 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.
基金supported by the National Key R&D Program of China[Grant Number 2020YFB1708300]the National Natural Science Foundation of China[Grant Number 52075184].
文摘Topology optimization(TO),a numerical technique to find the optimalmaterial layoutwith a given design domain,has attracted interest from researchers in the field of structural optimization in recent years.For beginners,opensource codes are undoubtedly the best alternative to learning TO,which can elaborate the implementation of a method in detail and easily engage more people to employ and extend the method.In this paper,we present a summary of various open-source codes and related literature on TO methods,including solid isotropic material with penalization(SIMP),evolutionary method,level set method(LSM),moving morphable components/voids(MMC/MMV)methods,multiscale topology optimization method,etc.Simultaneously,we classify the codes into five levels,fromeasy to difficult,depending on their difficulty,so that beginners can get started and understand the form of code implementation more quickly.
基金supported in part by the Key Program of National Natural Science Foundation of China (No.92067202)in part by the National Natural Science Foundation of China (No.62071058)in part by the Major Key Project of PCL (PCL2021A15)。
文摘After the pursuit of seventy years,the invention of polar codes indicates that we have found the first capacity-achieving coding with low complexity construction and decoding,which is the great breakthrough of the coding theory in the past two decades.In this survey,we retrospect the history of polar codes and summarize the advancement in the past ten years.First,the primary principle of channel polarization is investigated such that the basic construction,coding method and the classic successive cancellation(SC)decoding are reviewed.Second,in order to improve the performance of the finite code length,we introduce the guiding principle and conclude five design criteria for the construction,design and implementation of the polar code in the practical communication system based on the exemplar schemes in the literature.Especially,we explain the design principle behind the concatenated coding and rate matching of polar codes in 5G wireless system.Furthermore,the improved SC decoding algorithms,such as SC list(SCL)decoding and SC stack(SCS)decoding etc.,are investigated and compared.Finally,the research prospects of polar codes for the future 6G communication system are explored,including the optimization of short polar codes,coding construction in fading channels,polar coded modulation and HARQ,and the polar coded transmission,namely polar processing.Predictably,as a new coding methodology,polar codes will shine a light on communication theory and unveil a revolution in transmission technology.
基金supported in part by the National Key Research and Development Program of China under Grant 2018YFB1802303in part by the Zhejiang Provincial Natural Science Foundation of China under Grant LQ20F010010。
文摘Recently,a generalized successive cancellation list(SCL)decoder implemented with shiftedpruning(SP)scheme,namely the SCL-SP-ωdecoder,is presented for polar codes,which is able to shift the pruning window at mostωtimes during each SCL re-decoding attempt to prevent the correct path from being eliminated.The candidate positions for applying the SP scheme are selected by a shifting metric based on the probability that the elimination occurs.However,the number of exponential/logarithm operations involved in the SCL-SP-ωdecoder grows linearly with the number of information bits and list size,which leads to high computational complexity.In this paper,we present a detailed analysis of the SCL-SP-ωdecoder in terms of the decoding performance and complexity,which unveils that the choice of the shifting metric is essential for improving the decoding performance and reducing the re-decoding attempts simultaneously.Then,we introduce a simplified metric derived from the path metric(PM)domain,and a custom-tailored deep learning(DL)network is further designed to enhance the efficiency of the proposed simplified metric.The proposed metrics are both free of transcendental functions and hence,are more hardware-friendly than the existing metrics.Simulation results show that the proposed DL-aided metric provides the best error correction performance as comparison with the state of the art.
文摘We designed, assembled, and tested a reliable laser system for ^(87)Rb cold atom fountain clocks. The laser system is divided into four modules according to function, which are convenient for installing, adjusting, maintaining, and replacing of the modules. In each functional module, all optical components are fixed on a baseplate with glue and screws, ensuring the system's structural stability. Mechanical stability was verified in a 6.11g RMS randomvibration test, where the change in output power before and after vibration was less than 5%. Thermal stability was realized by optimizing of the structure and appropriate selection of component materials of the modules through thermal simulation. In the laser splitting and output module, the change in laser power was less than 20% for each fiber in thermal cycles from 5℃ to 43℃. Finally,the functionality of the laser system was verified for a rubidium fountain clock.
基金supported in part by Joint Fund for Smart Computing of Natural Science Foundation of Shandong Province(ZR2019LZH001)Shandong University Youth Innovation Supporting Program(2019KJN020,2019KJN024)+1 种基金Shandong Key Research and Development Project(2019GGX101066)the Taishan Scholar Program of Shandong Province,the Natural Science Foundation of China(61701284).
文摘To remove the restriction on code length of polar codes,this paper proposes a construction scheme,called stepwise polar codes,which can gen-erate arbitrary-length polar codes.The stepwise polar codes are generated by sub-polar codes with different code lengths.To improve coding performance,sub-polar codes are united by polarization effect priority algorithm,which can reduce the number of in-completely polarized channels.Then,the construction method of the generator matrix of the stepwise po-lar code is presented.Furthermore,we prove that the proposed scheme has lower decoding complexity than punctured,multi-kernel polar codes.Simulation results show that the proposed method can achieve similar decoding performance compared with the conventional punctured polar codes,rate-compatible punctured polar code,PC-short and asymmetric polar codes(APC)when code length N=48 and 72,respectively.
文摘Deep holes are very important in the decoding of generalized RS codes, and deep holes of RS codes have been widely studied, but there are few works on constructing general linear codes based on deep holes. Therefore, we consider constructing binary linear codes by combining deep holes with binary BCH codes. In this article, we consider the 2-error-correcting binary primitive BCH codes and the extended codes to construct new binary linear codes by combining them with deep holes, respectively. Furthermore, three classes of binary linear codes are constructed, and then we determine the parameters and the weight distributions of these new binary linear codes.
基金supported in part with the Project on the Industry Key Technologies of Jiangsu Province(No.BE2017153)the Industry-University-Research Fund of ZTE Corporation.
文摘This paper presents an intelligent protograph construction algorithm.Protograph LDPC codes have shown excellent error correction performance and play an important role in wireless communications.Random search or manual construction are often used to obtain a good protograph,but the efficiency is not high enough and many experience and skills are needed.In this paper,a fast searching algorithm is proposed using the convolution neural network to predict the iterative decoding thresholds of protograph LDPC codes effectively.A special input data transformation rule is applied to provide stronger generalization ability.The proposed algorithm converges faster than other algorithms.The iterative decoding threshold of the constructed protograph surpasses greedy algorithm and random search by about 0.53 dB and 0.93 dB respectively under 100 times of density evolution.Simulation results show that quasi-cyclic LDPC(QC-LDPC)codes constructed from the proposed algorithm have competitive performance compared to other papers.
文摘In this paper,we propose Triangular Code(TC),a new class of fountain code with near-zero redundancy and linear encoding and decoding computational complexities of OeLklog kT,where k is the packet batch size and L is the packet data length.Different from previous works where the optimal performance of codes has been shown under asymptotic assumption,TC enjoys near-zero redundancy even under non-asymptotic settings for smallmoderate number of packets.These features make TC suitable for practical implementation in batteryconstrained devices in IoT,D2D and M2M network paradigms to achieve scalable reliability,and minimize latency due to its low decoding delay.TC is a non-linear code,which is encoded using the simple shift and XOR addition operations,and decoded using the simple back-substitution algorithm.Although it is nonlinear code at the packet level,it remains linear code when atomized at the bit level.We use this property to show that the backsubstitution decoder of TC is equivalent to the Belief Propagation(BP)decoder of LT code.Therefore,TC can benefit from rich prolific literature published on LT code,to design efficient code for various applications.Despite the equivalency between the decoders of TC and LT code,we show that compared to state-of-the-art optimized LT code,TC reduces the redundancy of LT code by 68%-99% for k reaching 1024.
基金the National Natural Science Foundation of China (Grant Nos. 61972413, 61901525, and 62002385)the National Key R&D Program of China (Grant No. 2021YFB3100100)RGC under Grant No. N HKUST619/17 from Hong Kong, China。
文摘In a recent paper, Hu et al. defined the complete weight distributions of quantum codes and proved the Mac Williams identities, and as applications they showed how such weight distributions may be used to obtain the singleton-type and hamming-type bounds for asymmetric quantum codes. In this paper we extend their study much further and obtain several new results concerning the complete weight distributions of quantum codes and applications. In particular, we provide a new proof of the Mac Williams identities of the complete weight distributions of quantum codes. We obtain new information about the weight distributions of quantum MDS codes and the double weight distribution of asymmetric quantum MDS codes. We get new identities involving the complete weight distributions of two different quantum codes. We estimate the complete weight distributions of quantum codes under special conditions and show that quantum BCH codes by the Hermitian construction from primitive, narrow-sense BCH codes satisfy these conditions and hence these estimate applies.
基金supported by the Fundamental Research Funds for the Central Universities (FRF-TP20-062A1)Guangdong Basic and Applied Basic Research Foundation (2021A1515110070)
文摘Belief propagation(BP)decoding outputs soft information and can be naturally used in iterative receivers.BP list(BPL)decoding provides comparable error-correction performance to the successive cancellation list(SCL)decoding.In this paper,we firstly introduce an enhanced code construction scheme for BPL decoding to improve its errorcorrection capability.Then,a GPU-based BPL decoder with adoption of the new code construction is presented.Finally,the proposed BPL decoder is tested on NVIDIA RTX3070 and GTX1060.Experimental results show that the presented BPL decoder with early termination criterion achieves above 1 Gbps throughput on RTX3070 for the code(1024,512)with 32 lists under good channel conditions.
基金Project supported by the National Natural Science Foundation of China(Grant No.12173044)Research and Development Project of Scientific Research Instruments and Equipment of Chinese Academy of Sciences(Grant No.YJKYYQ20200020)+1 种基金Large Research Infrastructures Improvement Funds of Chinese Academy of Sciences(Grant No.DSS-WXGZ-2020-0005)Chinese Academy of Sciences for Western Young Scholars(Grant Nos.XAB2018A06,XAB2019A07,and XAB2018B16)。
文摘The caesium atomic fountain clock is a primary frequency standard.During its operation,a Majorana transition frequency shift will occur once a magnetic field at some special locations along the atomic trajectory is singular.In this study,by developing a physical model,we analyzed the magnetic field requirements for atomic adiabatic transition and calculated the influence of the Majorana atomic transition on the atomic state via a quantum method.Based on the simulation results for the magnetic field in the fountain clock,we applied the Monte Carlo method to simulate the relationship between the Majorana transition frequency shift and the magnetic field at the entrance of the magnetic shielding,as well as the initial atomic population.Measurement of the Majorana transition frequency shift was realized by state-selecting asymmetrically populated atoms.The relationship between the Majorana transition frequency shift and the axial magnetic field at the entrance of the magnetic shielding was obtained.The measured results were essentially consistent with the calculated results.Thus,the magnetic field at the entrance of the magnetic shielding was configured,and the Majorana transition frequency shift of the fountain clock was calculated to be 4.57×10^(-18).
文摘As a branch of applied mathematics, coding theory plays an important role. Among them, cyclic codes have attracted much attention because of their good algebraic structure and easy analysis performance. In this paper, we will study one class of cyclic codes over F<sub>3</sub>. Given the length and dimension, we show that it is optimal by proving its minimum distance is equal to 4, according to the Sphere Packing bound.