Mobile communications are reaching out to every aspect of our daily life,necessitating highefficiency data transmission and support for diverse data types and communication scenarios.Polar codes have emerged as a prom...Mobile communications are reaching out to every aspect of our daily life,necessitating highefficiency data transmission and support for diverse data types and communication scenarios.Polar codes have emerged as a promising solution due to their outstanding error-correction performance and low complexity.Unequal error protection(UEP)involves nonuniform error safeguarding for distinct data segments,achieving a fine balance between error resilience and resource allocation,which ultimately enhancing system performance and efficiency.In this paper,we propose a novel class of UEP rateless polar codes.The codes are designed based on matrix extension of polar codes,and elegant mapping and duplication operations are designed to achieve UEP property while preserving the overall performance of conventional polar codes.Superior UEP performance is attained without significant modifications to conventional polar codes,making it straightforward for compatibility with existing polar codes.A theoretical analysis is conducted on the block error rate and throughput efficiency performance.To the best of our knowledge,this work provides the first theoretical performance analysis of UEP rateless polar codes.Simulation results show that the proposed codes significantly outperform existing polar coding schemes in both block error rate and throughput efficiency.展开更多
Differential pulse-position modulation(DP PM)can achieve a good compromise between power and bandwidth requirements.However,the output sequence has undetectable insertions and deletions.This paper proposes a successiv...Differential pulse-position modulation(DP PM)can achieve a good compromise between power and bandwidth requirements.However,the output sequence has undetectable insertions and deletions.This paper proposes a successive cancellation(SC)decoding scheme based on the weighted levenshtein distance(WLD)of polar codes for correcting insertions/deletions in DPPM systems.In this method,the WLD is used to calculate the transfer probabilities recursively to obtain likelihood ratios,and the low-complexity SC decoding method is built according to the error characteristics to match the DPPM system.Additionally,the proposed SC decoding scheme is extended to list decoding,which can further improve error correction performance.Simulation results show that the proposed scheme can effectively correct insertions/deletions in the DPPM system,which enhances its reliability and performance.展开更多
Blind recognition of low-density paritycheck(LDPC)codes has gradually attracted more attention with the development of military and civil communications.However,in the case of the paritycheck matrices with relatively ...Blind recognition of low-density paritycheck(LDPC)codes has gradually attracted more attention with the development of military and civil communications.However,in the case of the paritycheck matrices with relatively high row weights,the existing blind recognition algorithms based on a candidate set generally perform worse.In this paper,we propose a blind recognition method for LDPC codes,called as tangent function assisted least square(TLS)method,which improves recognition performances by constructing a new cost function.To characterize the constraint degree among received vectors and paritycheck vectors,a feature function based on tangent function is constructed in the proposed algorithm.A cost function based on least square method is also established according to the feature function values satisfying the parity-check relationship.Moreover,the minimum average value in TLS is obtained on the candidate set.Numerical analysis and simulation results show that recognition performances of TLS algorithm are consistent with theoretical results.Compared with existing algorithms,the proposed method possesses better recognition performances.展开更多
Fraction repetition(FR)codes are integral in distributed storage systems(DSS)with exact repair-by-transfer,while pliable fraction repetition codes are vital for DSSs in which both the per-node storage and repetition d...Fraction repetition(FR)codes are integral in distributed storage systems(DSS)with exact repair-by-transfer,while pliable fraction repetition codes are vital for DSSs in which both the per-node storage and repetition degree can easily be adjusted simultaneously.This paper introduces a new type of pliable FR codes,called absolute balanced pliable FR(ABPFR)codes,in which the access balancing in DSS is considered.Additionally,the equivalence between pliable FR codes and resolvable transversal packings in combinatorial design theory is presented.Then constructions of pliable FR codes and ABPFR codes based on resolvable transversal packings are presented.展开更多
Aiming at the problem that the bit error rate(BER)of asymmetrically clipped optical orthogonal frequency division multiplexing(ACO-OFDM)space optical communication system is significantly affected by different turbule...Aiming at the problem that the bit error rate(BER)of asymmetrically clipped optical orthogonal frequency division multiplexing(ACO-OFDM)space optical communication system is significantly affected by different turbulence intensities,the deep learning technique is proposed to the polarization code decoding in ACO-OFDM space optical communication system.Moreover,this system realizes the polarization code decoding and signal demodulation without frequency conduction with superior performance and robustness compared with the performance of traditional decoder.Simulations under different turbulence intensities as well as different mapping orders show that the convolutional neural network(CNN)decoder trained under weak-medium-strong turbulence atmospheric channels achieves a performance improvement of about 10^(2)compared to the conventional decoder at 4-quadrature amplitude modulation(4QAM),and the BERs for both 16QAM and 64QAM are in between those of the conventional decoder.展开更多
In this paper,we first generalize the constant dimension and orbit codes over finite fields to the constant rank and orbit codes over finite chain rings.Then we provide a relationship between constant rank codes over ...In this paper,we first generalize the constant dimension and orbit codes over finite fields to the constant rank and orbit codes over finite chain rings.Then we provide a relationship between constant rank codes over finite chain rings and constant dimension codes over the residue fields.In particular,we prove that an orbit submodule code over a finite chain ring is a constant rank code.Finally,for special finite chain ring F_(q)+γF_(q),we define a Gray mapφfrom(F_(q)+γF_(q))^(n)to F^(2n)_(q),and by using cyclic codes over F_(q)+γF_(q),we obtain a method of constructing an optimum distance constant dimension code over F_(q).展开更多
Shortening is a standard rate-matching method for polar codes in wireless communications.Since polarization-adjusted convolu⁃tional(PAC)codes also have a block length limited to the integer powers of two,they also req...Shortening is a standard rate-matching method for polar codes in wireless communications.Since polarization-adjusted convolu⁃tional(PAC)codes also have a block length limited to the integer powers of two,they also require rate-matching.To this end,we first analyze the limitations of existing shortening patterns for PAC codes and explore their feasibility.Subsequently,we propose a novel shortening scheme for PAC codes based on list decoding,where the receiver is allowed to treat the values of the deleted bits as undetermined.This ap⁃proach uses a specialized PAC codeword and activates multiple decoding paths during the initialization of list decoding,enabling it to achieve the desired reliability.展开更多
The beyond fifth-generation Internet of Things requires more capable channel coding schemes to achieve high-reliability,low-complexity and lowlatency communications.The theoretical analysis of error-correction perform...The beyond fifth-generation Internet of Things requires more capable channel coding schemes to achieve high-reliability,low-complexity and lowlatency communications.The theoretical analysis of error-correction performance of channel coding functions as a significant way of optimizing the transmission reliability and efficiency.In this paper,the efficient estimation methods of the block error rate(BLER)performance for rate-compatible polar codes(RCPC)are proposed under several scenarios.Firstly,the BLER performance of RCPC is generally evaluated in the additive white Gaussian noise channels.That is further extended into the Rayleigh fading channel case using an equivalent estimation method.Moreover,with respect to the powerful decoder such as successive cancellation list decoding,the performance estimation is derived analytically based on the polar weight spectrum and BLER upper bounds.Theoretical evaluation and numerical simulation results show that the estimated performance can fit well the practical simulated results of RCPC under the objective conditions,verifying the validity of our proposed performance estimation methods.Furthermore,the application designs of the reliability estimation of RCPC are explored,particularly in the advantages of the signal-to-noise(SNR)estimation and throughput efficiency optimization of polar coded hybrid automatic repeat request.展开更多
Space laser communication(SLC)is an emerging technology to support high-throughput data transmissions in space networks.In this paper,to guarantee the reliability of high-speed SLC links,we aim at practical implementa...Space laser communication(SLC)is an emerging technology to support high-throughput data transmissions in space networks.In this paper,to guarantee the reliability of high-speed SLC links,we aim at practical implementation of low-density paritycheck(LDPC)decoding under resource-restricted space platforms.Particularly,due to the supply restriction and cost issues of high-speed on-board devices such as analog-to-digital converters(ADCs),the input of LDPC decoding will be usually constrained by hard-decision channel output.To tackle this challenge,density-evolution-based theoretical analysis is firstly performed to identify the cause of performance degradation in the conventional binaryinitialized iterative decoding(BIID)algorithm.Then,a computation-efficient decoding algorithm named multiary-initialized iterative decoding with early termination(MIID-ET)is proposed,which improves the error-correcting performance and computation efficiency by using a reliability-based initialization method and a threshold-based decoding termination rule.Finally,numerical simulations are conducted on example codes of rates 7/8 and 1/2 to evaluate the performance of different LDPC decoding algorithms,where the proposed MIID-ET outperforms the BIID with a coding gain of 0.38 dB and variable node calculation saving of 37%.With this advantage,the proposed MIID-ET can notably reduce LDPC decoder’s hardware implementation complexity under the same bit error rate performance,which successfully doubles the total throughput to 10 Gbps on a single-chip FPGA.展开更多
Digital content such as games,extended reality(XR),and movies has been widely and easily distributed over wireless networks.As a result,unauthorized access,copyright infringement by third parties or eavesdroppers,and ...Digital content such as games,extended reality(XR),and movies has been widely and easily distributed over wireless networks.As a result,unauthorized access,copyright infringement by third parties or eavesdroppers,and cyberattacks over these networks have become pressing concerns.Therefore,protecting copyrighted content and preventing illegal distribution in wireless communications has garnered significant attention.The Intelligent Reflecting Surface(IRS)is regarded as a promising technology for future wireless and mobile networks due to its ability to reconfigure the radio propagation environment.This study investigates the security performance of an uplink Non-Orthogonal Multiple Access(NOMA)system integrated with an IRS and employing Fountain Codes(FCs).Specifically,two users send signals to the base station at separate distances.A relay receives the signal from the nearby user first and then relays it to the base station.The IRS receives the signal from the distant user and reflects it to the relay,which then sends the reflected signal to the base station.Furthermore,a malevolent eavesdropper intercepts both user and relay communications.We construct mathematical equations for Outage Probability(OP),throughput,diversity evaluation,and Interception Probability(IP),offering quantitative insights to assess system security and performance.Additionally,OP and IP are analyzed using a Deep Neural Network(DNN)model.A deeper comprehension of the security performance of the IRS-assisted NOMA systemin signal transmission is provided by Monte Carlo simulations,which are also carried out to confirm the theoretical conclusions.展开更多
Neuroscience (also known as neurobiology) is a science that studies the structure, function, development, pharmacology and pathology of the nervous system. In recent years, C. Cotardo has introduced coding theory into...Neuroscience (also known as neurobiology) is a science that studies the structure, function, development, pharmacology and pathology of the nervous system. In recent years, C. Cotardo has introduced coding theory into neuroscience, proposing the concept of combinatorial neural codes. And it was further studied in depth using algebraic methods by C. Curto. In this paper, we construct a class of combinatorial neural codes with special properties based on classical combinatorial structures such as orthogonal Latin rectangle, disjoint Steiner systems, groupable designs and transversal designs. These neural codes have significant weight distribution properties and large minimum distances, and are thus valuable for potential applications in information representation and neuroscience. This study provides new ideas for the construction method and property analysis of combinatorial neural codes, and enriches the study of algebraic coding theory.展开更多
To improve the decoding performance of quantum error-correcting codes in asymmetric noise channels,a neural network-based decoding algorithm for bias-tailored quantum codes is proposed.The algorithm consists of a bias...To improve the decoding performance of quantum error-correcting codes in asymmetric noise channels,a neural network-based decoding algorithm for bias-tailored quantum codes is proposed.The algorithm consists of a biased noise model,a neural belief propagation decoder,a convolutional optimization layer,and a multi-objective loss function.The biased noise model simulates asymmetric error generation,providing a training dataset for decoding.The neural network,leveraging dynamic weight learning and a multi-objective loss function,mitigates error degeneracy.Additionally,the convolutional optimization layer enhances early-stage convergence efficiency.Numerical results show that for bias-tailored quantum codes,our decoder performs much better than the belief propagation(BP)with ordered statistics decoding(BP+OSD).Our decoder achieves an order of magnitude improvement in the error suppression compared to higher-order BP+OSD.Furthermore,the decoding threshold of our decoder for surface codes reaches a high threshold of 20%.展开更多
This paper proposes a genetic optimization method for the construction of non-binary quasi-cyclic low-density parity-check(NB-QC-LDPC)codes with short block lengths.In our scheme,the initial template base matrices and...This paper proposes a genetic optimization method for the construction of non-binary quasi-cyclic low-density parity-check(NB-QC-LDPC)codes with short block lengths.In our scheme,the initial template base matrices and the corresponding non-binary replacement matrices are constructed by the progressive edge growth algorithm and randomly generated,respectively.The genetic algorithm is then utilized to optimize the base matrices and the replacement ones.The simulation results show that the NB-QC-LDPC codes constructed by the proposed method achieve better decoding performance and lower implementation complexity compared to the existing NB-LDPC codes such as consultative committee for space data system and Bei Dou satellite navigation system.展开更多
In this paper,a sparse graph neural network-aided(SGNN-aided)decoder is proposed for improving the decoding performance of polar codes under bursty interference.Firstly,a sparse factor graph is constructed using the e...In this paper,a sparse graph neural network-aided(SGNN-aided)decoder is proposed for improving the decoding performance of polar codes under bursty interference.Firstly,a sparse factor graph is constructed using the encoding characteristic to achieve high-throughput polar decoding.To further improve the decoding performance,a residual gated bipartite graph neural network is designed for updating embedding vectors of heterogeneous nodes based on a bidirectional message passing neural network.This framework exploits gated recurrent units and residual blocks to address the gradient disappearance in deep graph recurrent neural networks.Finally,predictions are generated by feeding the embedding vectors into a readout module.Simulation results show that the proposed decoder is more robust than the existing ones in the presence of bursty interference and exhibits high universality.展开更多
The construction of polar codes in corre-lated block fading channels is still an open issue to be solved.In this paper,to explicitly reveal the impact of correlation on error performance of polar coded diver-sity comm...The construction of polar codes in corre-lated block fading channels is still an open issue to be solved.In this paper,to explicitly reveal the impact of correlation on error performance of polar coded diver-sity communication systems,an integrated framework has been established to analyze the theoretical error performance of polar codes in correlated block fading channels.First,the upper bound on error probabil-ity of polarized channels is derived based on split po-lar spectrum,which is fully determined by covariance channel matrix as well as the block-wise weight distri-bution of the corresponding polar subcode.Further,to facilitate practical implementations,we design a con-struction metric named polarized correlation weight(PCW)to generate polar codes in correlated block fad-ing channels.Finally,simulation results on block error rate indicate that the proposed metric can exhibit both diversity gain and coding gain compared to the con-ventional methods under successive cancellation de-coding.展开更多
Constituted by BCH component codes and its ordered statistics decoding(OSD),the successive cancellation list(SCL)decoding of U-UV structural codes can provide competent error-correction performance in the short-to-med...Constituted by BCH component codes and its ordered statistics decoding(OSD),the successive cancellation list(SCL)decoding of U-UV structural codes can provide competent error-correction performance in the short-to-medium length regime.However,this list decoding complexity becomes formidable as the decoding output list size increases.This is primarily incurred by the OSD.Addressing this challenge,this paper proposes the low complexity SCL decoding through reducing the complexity of component code decoding,and pruning the redundant SCL decoding paths.For the former,an efficient skipping rule is introduced for the OSD so that the higher order decoding can be skipped when they are not possible to provide a more likely codeword candidate.It is further extended to the OSD variant,the box-andmatch algorithm(BMA),in facilitating the component code decoding.Moreover,through estimating the correlation distance lower bounds(CDLBs)of the component code decoding outputs,a path pruning(PP)-SCL decoding is proposed to further facilitate the decoding of U-UV codes.In particular,its integration with the improved OSD and BMA is discussed.Simulation results show that significant complexity reduction can be achieved.Consequently,the U-UV codes can outperform the cyclic redundancy check(CRC)-polar codes with a similar decoding complexity.展开更多
This study introduces a lightweight deep learning model and a novel synthetic dataset designed to restore damaged one-dimensional(1D)barcodes and Quick Response(QR)codes,addressing critical challenges in logistics ope...This study introduces a lightweight deep learning model and a novel synthetic dataset designed to restore damaged one-dimensional(1D)barcodes and Quick Response(QR)codes,addressing critical challenges in logistics operations.The proposed solution leverages an efficient Pix2Pix-based framework,a type of conditional Generative Adversarial Network(GAN)optimized for image-to-image translation tasks,enabling the recovery of degraded barcodes and QR codes with minimal computational overhead.A core contribution of this work is the development of a synthetic dataset that simulates realistic damage scenarios frequently encountered in logistics environments,such as low contrast,misalignment,physical wear,and environmental interference.By training on this diverse and realistic dataset,the model demonstrates exceptional performance in restoring readability and decoding accuracy.The lightweight architecture,featuring a U-Net-based encoder-decoder with separable convolutions,ensures computational efficiency,making the approach suitable for real-time deployment on embedded and resource-constrained devices commonly used in logistics systems.Experimental results reveal significant improvements:QR code decoding ratios increased from 14%to 99%on training data and from 15%to 68%on validation data,while 1D barcode decoding ratios improved from 7%to 73%on training data and from 9%to 44%on validation data.By providing a robust,resource-efficient solution for restoring damaged barcodes and QR codes,this study offers practical advancements for enhancing the reliability of automated scanning systems in logistics operations,particularly under challenging conditions.展开更多
We construct an infinite family of minimal linear codes over the ring F_(2)+u F_(2).These codes are defined through trace functions and Boolean functions.Their Lee weight distribution is completely computed by Walsh t...We construct an infinite family of minimal linear codes over the ring F_(2)+u F_(2).These codes are defined through trace functions and Boolean functions.Their Lee weight distribution is completely computed by Walsh transformation.By Gray mapping,we obtain a family of minimal binary linear codes from a generic construction,which have prominent applications in secret sharing and secure two-party computation.展开更多
The progressive edge-growth(PEG)al-gorithm is a general method to construct short low-density parity-check(LDPC)codes and it is a greedy method to place each edge with large girths.In order to improve the performance ...The progressive edge-growth(PEG)al-gorithm is a general method to construct short low-density parity-check(LDPC)codes and it is a greedy method to place each edge with large girths.In order to improve the performance of LDPC codes,many im-proved PEG(IPEG)algorithms employ multi metrics to select surviving edges in turn.In this paper,the pro-posed edges metric(EM)based on message-passing algorithm(MPA)is introduced to PEG algorithm and the proposed EM constrained PEG(EM-PEG)algo-rithm mainly considers the independence of message passing from different nodes in Tanner graph.The numerical results show that our EM-PEG algorithm brings better bit error rate(BER)performance gains to LDPC codes than the traditional PEG algorithm and the powerful multi-edge multi-metric constrained PEG algorithm(MM-PEGA)proposed recently.In ad-dition,the multi-edge EM constrained PEG(M-EM-PEG)algorithm which adopts multi-edge EM may fur-ther improve the BER performance.展开更多
基金supported by National Natural Science Foundation of China(No.62301008)China Postdoctoral Science Foundation(No.2022M720272)New Cornerstone Science Foundation through the XPLORER PRIZE。
文摘Mobile communications are reaching out to every aspect of our daily life,necessitating highefficiency data transmission and support for diverse data types and communication scenarios.Polar codes have emerged as a promising solution due to their outstanding error-correction performance and low complexity.Unequal error protection(UEP)involves nonuniform error safeguarding for distinct data segments,achieving a fine balance between error resilience and resource allocation,which ultimately enhancing system performance and efficiency.In this paper,we propose a novel class of UEP rateless polar codes.The codes are designed based on matrix extension of polar codes,and elegant mapping and duplication operations are designed to achieve UEP property while preserving the overall performance of conventional polar codes.Superior UEP performance is attained without significant modifications to conventional polar codes,making it straightforward for compatibility with existing polar codes.A theoretical analysis is conducted on the block error rate and throughput efficiency performance.To the best of our knowledge,this work provides the first theoretical performance analysis of UEP rateless polar codes.Simulation results show that the proposed codes significantly outperform existing polar coding schemes in both block error rate and throughput efficiency.
基金supported by National Natural Science Foundation of China(No.61801327).
文摘Differential pulse-position modulation(DP PM)can achieve a good compromise between power and bandwidth requirements.However,the output sequence has undetectable insertions and deletions.This paper proposes a successive cancellation(SC)decoding scheme based on the weighted levenshtein distance(WLD)of polar codes for correcting insertions/deletions in DPPM systems.In this method,the WLD is used to calculate the transfer probabilities recursively to obtain likelihood ratios,and the low-complexity SC decoding method is built according to the error characteristics to match the DPPM system.Additionally,the proposed SC decoding scheme is extended to list decoding,which can further improve error correction performance.Simulation results show that the proposed scheme can effectively correct insertions/deletions in the DPPM system,which enhances its reliability and performance.
基金Fundamental Research Funds for the Central Universities under Grant 3072025YC0802the National Natural Science Foundation of China under Grant 62001138Heilongjiang Provincial Natural Science Foundation of China under Grant LH2021F009。
文摘Blind recognition of low-density paritycheck(LDPC)codes has gradually attracted more attention with the development of military and civil communications.However,in the case of the paritycheck matrices with relatively high row weights,the existing blind recognition algorithms based on a candidate set generally perform worse.In this paper,we propose a blind recognition method for LDPC codes,called as tangent function assisted least square(TLS)method,which improves recognition performances by constructing a new cost function.To characterize the constraint degree among received vectors and paritycheck vectors,a feature function based on tangent function is constructed in the proposed algorithm.A cost function based on least square method is also established according to the feature function values satisfying the parity-check relationship.Moreover,the minimum average value in TLS is obtained on the candidate set.Numerical analysis and simulation results show that recognition performances of TLS algorithm are consistent with theoretical results.Compared with existing algorithms,the proposed method possesses better recognition performances.
基金Supported in part by the National Key R&D Program of China(No.2020YFA0712300)NSFC(No.61872353)。
文摘Fraction repetition(FR)codes are integral in distributed storage systems(DSS)with exact repair-by-transfer,while pliable fraction repetition codes are vital for DSSs in which both the per-node storage and repetition degree can easily be adjusted simultaneously.This paper introduces a new type of pliable FR codes,called absolute balanced pliable FR(ABPFR)codes,in which the access balancing in DSS is considered.Additionally,the equivalence between pliable FR codes and resolvable transversal packings in combinatorial design theory is presented.Then constructions of pliable FR codes and ABPFR codes based on resolvable transversal packings are presented.
基金supported by the National Natural Science Foundation of China(No.12104141).
文摘Aiming at the problem that the bit error rate(BER)of asymmetrically clipped optical orthogonal frequency division multiplexing(ACO-OFDM)space optical communication system is significantly affected by different turbulence intensities,the deep learning technique is proposed to the polarization code decoding in ACO-OFDM space optical communication system.Moreover,this system realizes the polarization code decoding and signal demodulation without frequency conduction with superior performance and robustness compared with the performance of traditional decoder.Simulations under different turbulence intensities as well as different mapping orders show that the convolutional neural network(CNN)decoder trained under weak-medium-strong turbulence atmospheric channels achieves a performance improvement of about 10^(2)compared to the conventional decoder at 4-quadrature amplitude modulation(4QAM),and the BERs for both 16QAM and 64QAM are in between those of the conventional decoder.
基金Supported by Research Funds of Hubei Province(D20144401,Q20174503)。
文摘In this paper,we first generalize the constant dimension and orbit codes over finite fields to the constant rank and orbit codes over finite chain rings.Then we provide a relationship between constant rank codes over finite chain rings and constant dimension codes over the residue fields.In particular,we prove that an orbit submodule code over a finite chain ring is a constant rank code.Finally,for special finite chain ring F_(q)+γF_(q),we define a Gray mapφfrom(F_(q)+γF_(q))^(n)to F^(2n)_(q),and by using cyclic codes over F_(q)+γF_(q),we obtain a method of constructing an optimum distance constant dimension code over F_(q).
基金supported in part by the National Natural Sciences Foun⁃dation of China(NSFC)under Grant Nos.62301185 and 62027802in part by ZTE Industry⁃University-Institute Cooperation Fundsin part by The Major Key Project of PCL under Grant No.PCL2024A01.
文摘Shortening is a standard rate-matching method for polar codes in wireless communications.Since polarization-adjusted convolu⁃tional(PAC)codes also have a block length limited to the integer powers of two,they also require rate-matching.To this end,we first analyze the limitations of existing shortening patterns for PAC codes and explore their feasibility.Subsequently,we propose a novel shortening scheme for PAC codes based on list decoding,where the receiver is allowed to treat the values of the deleted bits as undetermined.This ap⁃proach uses a specialized PAC codeword and activates multiple decoding paths during the initialization of list decoding,enabling it to achieve the desired reliability.
基金supported by National Natural Science Foundation of China(No.62201596)Research Planning Project of National University of Defense Technology(ZK22-45).
文摘The beyond fifth-generation Internet of Things requires more capable channel coding schemes to achieve high-reliability,low-complexity and lowlatency communications.The theoretical analysis of error-correction performance of channel coding functions as a significant way of optimizing the transmission reliability and efficiency.In this paper,the efficient estimation methods of the block error rate(BLER)performance for rate-compatible polar codes(RCPC)are proposed under several scenarios.Firstly,the BLER performance of RCPC is generally evaluated in the additive white Gaussian noise channels.That is further extended into the Rayleigh fading channel case using an equivalent estimation method.Moreover,with respect to the powerful decoder such as successive cancellation list decoding,the performance estimation is derived analytically based on the polar weight spectrum and BLER upper bounds.Theoretical evaluation and numerical simulation results show that the estimated performance can fit well the practical simulated results of RCPC under the objective conditions,verifying the validity of our proposed performance estimation methods.Furthermore,the application designs of the reliability estimation of RCPC are explored,particularly in the advantages of the signal-to-noise(SNR)estimation and throughput efficiency optimization of polar coded hybrid automatic repeat request.
基金supported by the National Key R&D Program of China(Grant No.2022YFA1005000)the National Natural Science Foundation of China(Grant No.62101308 and 62025110).
文摘Space laser communication(SLC)is an emerging technology to support high-throughput data transmissions in space networks.In this paper,to guarantee the reliability of high-speed SLC links,we aim at practical implementation of low-density paritycheck(LDPC)decoding under resource-restricted space platforms.Particularly,due to the supply restriction and cost issues of high-speed on-board devices such as analog-to-digital converters(ADCs),the input of LDPC decoding will be usually constrained by hard-decision channel output.To tackle this challenge,density-evolution-based theoretical analysis is firstly performed to identify the cause of performance degradation in the conventional binaryinitialized iterative decoding(BIID)algorithm.Then,a computation-efficient decoding algorithm named multiary-initialized iterative decoding with early termination(MIID-ET)is proposed,which improves the error-correcting performance and computation efficiency by using a reliability-based initialization method and a threshold-based decoding termination rule.Finally,numerical simulations are conducted on example codes of rates 7/8 and 1/2 to evaluate the performance of different LDPC decoding algorithms,where the proposed MIID-ET outperforms the BIID with a coding gain of 0.38 dB and variable node calculation saving of 37%.With this advantage,the proposed MIID-ET can notably reduce LDPC decoder’s hardware implementation complexity under the same bit error rate performance,which successfully doubles the total throughput to 10 Gbps on a single-chip FPGA.
基金supported in part by Vietnam National Foundation for Science and Technology Development(NAFOSTED)under Grant 102.04-2021.57in part by Culture,Sports and Tourism R&D Program through the Korea Creative Content Agency grant funded by the Ministry of Culture,Sports and Tourism in 2024(Project Name:Global Talent Training Program for Copyright Management Technology in Game Contents,Project Number:RS-2024-00396709,Contribution Rate:100%).
文摘Digital content such as games,extended reality(XR),and movies has been widely and easily distributed over wireless networks.As a result,unauthorized access,copyright infringement by third parties or eavesdroppers,and cyberattacks over these networks have become pressing concerns.Therefore,protecting copyrighted content and preventing illegal distribution in wireless communications has garnered significant attention.The Intelligent Reflecting Surface(IRS)is regarded as a promising technology for future wireless and mobile networks due to its ability to reconfigure the radio propagation environment.This study investigates the security performance of an uplink Non-Orthogonal Multiple Access(NOMA)system integrated with an IRS and employing Fountain Codes(FCs).Specifically,two users send signals to the base station at separate distances.A relay receives the signal from the nearby user first and then relays it to the base station.The IRS receives the signal from the distant user and reflects it to the relay,which then sends the reflected signal to the base station.Furthermore,a malevolent eavesdropper intercepts both user and relay communications.We construct mathematical equations for Outage Probability(OP),throughput,diversity evaluation,and Interception Probability(IP),offering quantitative insights to assess system security and performance.Additionally,OP and IP are analyzed using a Deep Neural Network(DNN)model.A deeper comprehension of the security performance of the IRS-assisted NOMA systemin signal transmission is provided by Monte Carlo simulations,which are also carried out to confirm the theoretical conclusions.
文摘Neuroscience (also known as neurobiology) is a science that studies the structure, function, development, pharmacology and pathology of the nervous system. In recent years, C. Cotardo has introduced coding theory into neuroscience, proposing the concept of combinatorial neural codes. And it was further studied in depth using algebraic methods by C. Curto. In this paper, we construct a class of combinatorial neural codes with special properties based on classical combinatorial structures such as orthogonal Latin rectangle, disjoint Steiner systems, groupable designs and transversal designs. These neural codes have significant weight distribution properties and large minimum distances, and are thus valuable for potential applications in information representation and neuroscience. This study provides new ideas for the construction method and property analysis of combinatorial neural codes, and enriches the study of algebraic coding theory.
基金supported by the National Natural Science Foundation of China(Grant Nos.62371240,61802175,62401266,and 12201300)the National Key R&D Program of China(Grant No.2022YFB3103800)+2 种基金the Natural Science Foundation of Jiangsu Province(Grant No.BK20241452)the Fundamental Research Funds for the Central Universities(Grant No.30923011014)the fund of Laboratory for Advanced Computing and Intelligence Engineering(Grant No.2023-LYJJ-01-009)。
文摘To improve the decoding performance of quantum error-correcting codes in asymmetric noise channels,a neural network-based decoding algorithm for bias-tailored quantum codes is proposed.The algorithm consists of a biased noise model,a neural belief propagation decoder,a convolutional optimization layer,and a multi-objective loss function.The biased noise model simulates asymmetric error generation,providing a training dataset for decoding.The neural network,leveraging dynamic weight learning and a multi-objective loss function,mitigates error degeneracy.Additionally,the convolutional optimization layer enhances early-stage convergence efficiency.Numerical results show that for bias-tailored quantum codes,our decoder performs much better than the belief propagation(BP)with ordered statistics decoding(BP+OSD).Our decoder achieves an order of magnitude improvement in the error suppression compared to higher-order BP+OSD.Furthermore,the decoding threshold of our decoder for surface codes reaches a high threshold of 20%.
基金supported by the National Natural Science Foundation of China under Grants 62331002。
文摘This paper proposes a genetic optimization method for the construction of non-binary quasi-cyclic low-density parity-check(NB-QC-LDPC)codes with short block lengths.In our scheme,the initial template base matrices and the corresponding non-binary replacement matrices are constructed by the progressive edge growth algorithm and randomly generated,respectively.The genetic algorithm is then utilized to optimize the base matrices and the replacement ones.The simulation results show that the NB-QC-LDPC codes constructed by the proposed method achieve better decoding performance and lower implementation complexity compared to the existing NB-LDPC codes such as consultative committee for space data system and Bei Dou satellite navigation system.
文摘In this paper,a sparse graph neural network-aided(SGNN-aided)decoder is proposed for improving the decoding performance of polar codes under bursty interference.Firstly,a sparse factor graph is constructed using the encoding characteristic to achieve high-throughput polar decoding.To further improve the decoding performance,a residual gated bipartite graph neural network is designed for updating embedding vectors of heterogeneous nodes based on a bidirectional message passing neural network.This framework exploits gated recurrent units and residual blocks to address the gradient disappearance in deep graph recurrent neural networks.Finally,predictions are generated by feeding the embedding vectors into a readout module.Simulation results show that the proposed decoder is more robust than the existing ones in the presence of bursty interference and exhibits high universality.
基金supported by National Natural Science Foundation of China(No.62471054).
文摘The construction of polar codes in corre-lated block fading channels is still an open issue to be solved.In this paper,to explicitly reveal the impact of correlation on error performance of polar coded diver-sity communication systems,an integrated framework has been established to analyze the theoretical error performance of polar codes in correlated block fading channels.First,the upper bound on error probabil-ity of polarized channels is derived based on split po-lar spectrum,which is fully determined by covariance channel matrix as well as the block-wise weight distri-bution of the corresponding polar subcode.Further,to facilitate practical implementations,we design a con-struction metric named polarized correlation weight(PCW)to generate polar codes in correlated block fad-ing channels.Finally,simulation results on block error rate indicate that the proposed metric can exhibit both diversity gain and coding gain compared to the con-ventional methods under successive cancellation de-coding.
基金supported by the National Natural Science Foundation of China(NSFC)with project ID 62071498the Guangdong National Science Foundation(GDNSF)with project ID 2024A1515010213.
文摘Constituted by BCH component codes and its ordered statistics decoding(OSD),the successive cancellation list(SCL)decoding of U-UV structural codes can provide competent error-correction performance in the short-to-medium length regime.However,this list decoding complexity becomes formidable as the decoding output list size increases.This is primarily incurred by the OSD.Addressing this challenge,this paper proposes the low complexity SCL decoding through reducing the complexity of component code decoding,and pruning the redundant SCL decoding paths.For the former,an efficient skipping rule is introduced for the OSD so that the higher order decoding can be skipped when they are not possible to provide a more likely codeword candidate.It is further extended to the OSD variant,the box-andmatch algorithm(BMA),in facilitating the component code decoding.Moreover,through estimating the correlation distance lower bounds(CDLBs)of the component code decoding outputs,a path pruning(PP)-SCL decoding is proposed to further facilitate the decoding of U-UV codes.In particular,its integration with the improved OSD and BMA is discussed.Simulation results show that significant complexity reduction can be achieved.Consequently,the U-UV codes can outperform the cyclic redundancy check(CRC)-polar codes with a similar decoding complexity.
基金supported by the Scientific and Technological Research Council of Turkey(TÜB˙ITAK)through the Industrial R&D Projects Grant Program(TEYDEB)under Project No.3211077(grant recipient:Metin Kahraman)。
文摘This study introduces a lightweight deep learning model and a novel synthetic dataset designed to restore damaged one-dimensional(1D)barcodes and Quick Response(QR)codes,addressing critical challenges in logistics operations.The proposed solution leverages an efficient Pix2Pix-based framework,a type of conditional Generative Adversarial Network(GAN)optimized for image-to-image translation tasks,enabling the recovery of degraded barcodes and QR codes with minimal computational overhead.A core contribution of this work is the development of a synthetic dataset that simulates realistic damage scenarios frequently encountered in logistics environments,such as low contrast,misalignment,physical wear,and environmental interference.By training on this diverse and realistic dataset,the model demonstrates exceptional performance in restoring readability and decoding accuracy.The lightweight architecture,featuring a U-Net-based encoder-decoder with separable convolutions,ensures computational efficiency,making the approach suitable for real-time deployment on embedded and resource-constrained devices commonly used in logistics systems.Experimental results reveal significant improvements:QR code decoding ratios increased from 14%to 99%on training data and from 15%to 68%on validation data,while 1D barcode decoding ratios improved from 7%to 73%on training data and from 9%to 44%on validation data.By providing a robust,resource-efficient solution for restoring damaged barcodes and QR codes,this study offers practical advancements for enhancing the reliability of automated scanning systems in logistics operations,particularly under challenging conditions.
基金National Natural Science Foundation of China(12201171)。
文摘We construct an infinite family of minimal linear codes over the ring F_(2)+u F_(2).These codes are defined through trace functions and Boolean functions.Their Lee weight distribution is completely computed by Walsh transformation.By Gray mapping,we obtain a family of minimal binary linear codes from a generic construction,which have prominent applications in secret sharing and secure two-party computation.
文摘The progressive edge-growth(PEG)al-gorithm is a general method to construct short low-density parity-check(LDPC)codes and it is a greedy method to place each edge with large girths.In order to improve the performance of LDPC codes,many im-proved PEG(IPEG)algorithms employ multi metrics to select surviving edges in turn.In this paper,the pro-posed edges metric(EM)based on message-passing algorithm(MPA)is introduced to PEG algorithm and the proposed EM constrained PEG(EM-PEG)algo-rithm mainly considers the independence of message passing from different nodes in Tanner graph.The numerical results show that our EM-PEG algorithm brings better bit error rate(BER)performance gains to LDPC codes than the traditional PEG algorithm and the powerful multi-edge multi-metric constrained PEG algorithm(MM-PEGA)proposed recently.In ad-dition,the multi-edge EM constrained PEG(M-EM-PEG)algorithm which adopts multi-edge EM may fur-ther improve the BER performance.
