The existing constructions of quasi-cyclic low-density parity-check （QC-LDPC） codes do not consider the problems of small stopping sets and small girth together in the Tanner graph, while their existences will lead ...The existing constructions of quasi-cyclic low-density parity-check （QC-LDPC） codes do not consider the problems of small stopping sets and small girth together in the Tanner graph, while their existences will lead to the bit error rate （BER） performance of QC-LDPC codes being much poorer than that of randomly constructed LDPC codes even decoding failure. To solve the problem, some theorems of the specific chosen parity-check matrix of QC-LDPC codes without small stopping sets and small girth are proposed. A novel construction for QC-LDPC codes with long block lengths is presented by multiplying mmin or the multiple of mmin, which is the minimum order of the identity matrix for the chosen parity-check matrix. The simulation results show that the specific chosen parity-check matrix of QC-LDPC codes can effectively avoid specified stopping sets and small girth and exhibit excellent BER performance than random LDPC codes with the same longer codes length.展开更多
The syndrome a posteriori probability of the log-likelihood ratio of intercepted codewords is used to develop an algorithm that recognizes the polar code length and generator matrix of the underlying polar code.Based ...The syndrome a posteriori probability of the log-likelihood ratio of intercepted codewords is used to develop an algorithm that recognizes the polar code length and generator matrix of the underlying polar code.Based on the encoding structure,three theorems are proved,two related to the relationship between the length and rate of the polar code,and one related to the relationship between frozen-bit positions,information-bit positions,and codewords.With these three theorems,polar codes can be quickly reconstruced.In addition,to detect the dual vectors of codewords,the statistical characteristics of the log-likelihood ratio are analyzed,and then the information-and frozen-bit positions are distinguished based on the minimumerror decision criterion.The bit rate is obtained.The correctness of the theorems and effectiveness of the proposed algorithm are validated through simulations.The proposed algorithm exhibits robustness to noise and a reasonable computational complexity.展开更多
The aim of this paper is to simulate and study the early moments of the reactive ballistics of a large caliber projectile fired from a gun,combining 0D and 2D axisymmetric Computational Fluid Dynamics(CFD)approaches.F...The aim of this paper is to simulate and study the early moments of the reactive ballistics of a large caliber projectile fired from a gun,combining 0D and 2D axisymmetric Computational Fluid Dynamics(CFD)approaches.First,the methodology is introduced with the development of an interior ballistics(IB)lumped parameter code(LPC),integrating an original image processing method for calculating the specific regression of propellant grains that compose the gun propellant.The ONERA CFD code CEDRE,equipped with a Dynamic Mesh Technique(DMT),is then used in conjunction with the developed LPC to build a dedicated methodology to calculate IB.First results obtained on the AGARD gun and 40 mm gun test cases are in a good agreement with the existing literature.CEDRE is also used to calculate inter-mediate ballistics(first milliseconds of free flight of the projectile)with a multispecies and reactive approach either starting from the gun muzzle plane or directly following IB.In the latter case,an inverse problem involving a Latin hypercube sampling method is used to find a gun propellant configuration that allows the projectile to reach a given exit velocity and base pressure when IB ends.The methodology developed in this work makes it possible to study the flame front of the intermediate flash and depressurization that occurs in a base bleed(BB)channel at the gun muzzle.Average pressure variations in the BB channel during depressurization are in good agreement with literature.展开更多
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.展开更多
Code acquisition is the kernel operation for signal synchronization in the spread-spectrum receiver.To reduce the computational complexity and latency of code acquisition,this paper proposes an efficient scheme employ...Code acquisition is the kernel operation for signal synchronization in the spread-spectrum receiver.To reduce the computational complexity and latency of code acquisition,this paper proposes an efficient scheme employing sparse Fourier transform(SFT)and the relevant hardware architecture for field programmable gate array(FPGA)and application-specific integrated circuit(ASIC)implementation.Efforts are made at both the algorithmic level and the implementation level to enable merged searching of code phase and Doppler frequency without incurring massive hardware expenditure.Compared with the existing code acquisition approaches,it is shown from theoretical analysis and experimental results that the proposed design can shorten processing latency and reduce hardware complexity without degrading the acquisition probability.展开更多
基金supported by the National Natural Science Foundation of China (60572093)Specialized Research Fund for the Doctoral Program of Higher Education (20050004016)
文摘The existing constructions of quasi-cyclic low-density parity-check （QC-LDPC） codes do not consider the problems of small stopping sets and small girth together in the Tanner graph, while their existences will lead to the bit error rate （BER） performance of QC-LDPC codes being much poorer than that of randomly constructed LDPC codes even decoding failure. To solve the problem, some theorems of the specific chosen parity-check matrix of QC-LDPC codes without small stopping sets and small girth are proposed. A novel construction for QC-LDPC codes with long block lengths is presented by multiplying mmin or the multiple of mmin, which is the minimum order of the identity matrix for the chosen parity-check matrix. The simulation results show that the specific chosen parity-check matrix of QC-LDPC codes can effectively avoid specified stopping sets and small girth and exhibit excellent BER performance than random LDPC codes with the same longer codes length.
基金supported by the National Natural Science Foundation of China(62371465)Taishan Scholar Project of Shandong Province(ts201511020)the Chinese National Key Laboratory of Science and Technology on Information System Security(6142111190404).
文摘The syndrome a posteriori probability of the log-likelihood ratio of intercepted codewords is used to develop an algorithm that recognizes the polar code length and generator matrix of the underlying polar code.Based on the encoding structure,three theorems are proved,two related to the relationship between the length and rate of the polar code,and one related to the relationship between frozen-bit positions,information-bit positions,and codewords.With these three theorems,polar codes can be quickly reconstruced.In addition,to detect the dual vectors of codewords,the statistical characteristics of the log-likelihood ratio are analyzed,and then the information-and frozen-bit positions are distinguished based on the minimumerror decision criterion.The bit rate is obtained.The correctness of the theorems and effectiveness of the proposed algorithm are validated through simulations.The proposed algorithm exhibits robustness to noise and a reasonable computational complexity.
基金the French Defense Innovation Agency (AID)the French Procurement Agency for Armament (DGA)ONERA's scientific direction for funding and supporting the present work
文摘The aim of this paper is to simulate and study the early moments of the reactive ballistics of a large caliber projectile fired from a gun,combining 0D and 2D axisymmetric Computational Fluid Dynamics(CFD)approaches.First,the methodology is introduced with the development of an interior ballistics(IB)lumped parameter code(LPC),integrating an original image processing method for calculating the specific regression of propellant grains that compose the gun propellant.The ONERA CFD code CEDRE,equipped with a Dynamic Mesh Technique(DMT),is then used in conjunction with the developed LPC to build a dedicated methodology to calculate IB.First results obtained on the AGARD gun and 40 mm gun test cases are in a good agreement with the existing literature.CEDRE is also used to calculate inter-mediate ballistics(first milliseconds of free flight of the projectile)with a multispecies and reactive approach either starting from the gun muzzle plane or directly following IB.In the latter case,an inverse problem involving a Latin hypercube sampling method is used to find a gun propellant configuration that allows the projectile to reach a given exit velocity and base pressure when IB ends.The methodology developed in this work makes it possible to study the flame front of the intermediate flash and depressurization that occurs in a base bleed(BB)channel at the gun muzzle.Average pressure variations in the BB channel during depressurization are in good agreement with literature.
基金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 Science Foundation of China(61801503).
文摘Code acquisition is the kernel operation for signal synchronization in the spread-spectrum receiver.To reduce the computational complexity and latency of code acquisition,this paper proposes an efficient scheme employing sparse Fourier transform(SFT)and the relevant hardware architecture for field programmable gate array(FPGA)and application-specific integrated circuit(ASIC)implementation.Efforts are made at both the algorithmic level and the implementation level to enable merged searching of code phase and Doppler frequency without incurring massive hardware expenditure.Compared with the existing code acquisition approaches,it is shown from theoretical analysis and experimental results that the proposed design can shorten processing latency and reduce hardware complexity without degrading the acquisition probability.
