This paper is concerned with (3,n) and (4,n) regular quasi-cyclic Low Density Parity Check (LDPC) code constructions from elementary number theory.Given the column weight,we determine the shift values of the circulant...This paper is concerned with (3,n) and (4,n) regular quasi-cyclic Low Density Parity Check (LDPC) code constructions from elementary number theory.Given the column weight,we determine the shift values of the circulant permutation matrices via arithmetic analysis.The proposed constructions of quasi-cyclic LDPC codes achieve the following main advantages simultaneously:1) our methods are constructive in the sense that we avoid any searching process;2) our methods ensure no four or six cycles in the bipartite graphs corresponding to the LDPC codes;3) our methods are direct constructions of quasi-cyclic LDPC codes which do not use any other quasi-cyclic LDPC codes of small length like component codes or any other algorithms/cyclic codes like building block;4)the computations of the parameters involved are based on elementary number theory,thus very simple and fast.Simulation results show that the constructed regular codes of high rates perform almost 1.25 dB above Shannon limit and have no error floor down to the bit-error rate of 10-6.展开更多
Because of the speed limitation of the conventional bit-selection strategy in the exi- sting weighted bit flipping algorithms, a high- speed Low-Density Parity-Check （LDPC） dec- oder cannot be realised. To solve thi...Because of the speed limitation of the conventional bit-selection strategy in the exi- sting weighted bit flipping algorithms, a high- speed Low-Density Parity-Check （LDPC） dec- oder cannot be realised. To solve this problem, we propose a fast weighted bit flipping algo- rithm. Specifically, based on the identically dis- tributed error bits, a parallel bit-selection met- hod is proposed to reduce the selection delay of the flipped bits. The delay analysis demon- strates that, the decoding speed of LDPC codes can be significantly improved by the proposed algorithm. Furthermore, simulation results ver- ify the validity of the proposed algorithm.展开更多
From an inelastic excitation and breakup experiment with a12Be beam at 29 MeV/u,a large4He+8He cluster decay width of 1.1(2)MeV is determined for a state at an excitation energy of 10.3 MeV and with a spin parity of 0...From an inelastic excitation and breakup experiment with a12Be beam at 29 MeV/u,a large4He+8He cluster decay width of 1.1(2)MeV is determined for a state at an excitation energy of 10.3 MeV and with a spin parity of 0+.By using the R-matrix analysis,a cluster spectroscopic factor of 0.53(10)is extracted from the cluster partial width,providing a strong support for the clustering structure in12Be.A specially designed zero-degree telescope played an essential role in the present experiment and has been demonstrated to be a promising tool in future studies of the molecular-like resonances near the cluster separation threshold.展开更多
基金supported by the National Natural Science Foundation of China under Grants No.61172085,No.61103221,No.61133014,No.11061130539 and No.61021004
文摘This paper is concerned with (3,n) and (4,n) regular quasi-cyclic Low Density Parity Check (LDPC) code constructions from elementary number theory.Given the column weight,we determine the shift values of the circulant permutation matrices via arithmetic analysis.The proposed constructions of quasi-cyclic LDPC codes achieve the following main advantages simultaneously:1) our methods are constructive in the sense that we avoid any searching process;2) our methods ensure no four or six cycles in the bipartite graphs corresponding to the LDPC codes;3) our methods are direct constructions of quasi-cyclic LDPC codes which do not use any other quasi-cyclic LDPC codes of small length like component codes or any other algorithms/cyclic codes like building block;4)the computations of the parameters involved are based on elementary number theory,thus very simple and fast.Simulation results show that the constructed regular codes of high rates perform almost 1.25 dB above Shannon limit and have no error floor down to the bit-error rate of 10-6.
基金supported in part by the National Natural Science Foundation of China under Grant No.61072069the Fundamental Research Funds for the Central Universities under Grant No.72001859+1 种基金the Important National Science and Technology Specific Projects under Grant No.2011ZX03003-001-04the One Church,One Family,One Purpose Project(111 Project)under Grant No.B08038
文摘Because of the speed limitation of the conventional bit-selection strategy in the exi- sting weighted bit flipping algorithms, a high- speed Low-Density Parity-Check （LDPC） dec- oder cannot be realised. To solve this problem, we propose a fast weighted bit flipping algo- rithm. Specifically, based on the identically dis- tributed error bits, a parallel bit-selection met- hod is proposed to reduce the selection delay of the flipped bits. The delay analysis demon- strates that, the decoding speed of LDPC codes can be significantly improved by the proposed algorithm. Furthermore, simulation results ver- ify the validity of the proposed algorithm.
基金supported by the National Basic Research Program of China(Grant No.2013CB834402)the National Natural Science Foundation of China(Grant Nos.11035001,11275011,11235001,11320101004 andJ1103206)
文摘From an inelastic excitation and breakup experiment with a12Be beam at 29 MeV/u,a large4He+8He cluster decay width of 1.1(2)MeV is determined for a state at an excitation energy of 10.3 MeV and with a spin parity of 0+.By using the R-matrix analysis,a cluster spectroscopic factor of 0.53(10)is extracted from the cluster partial width,providing a strong support for the clustering structure in12Be.A specially designed zero-degree telescope played an essential role in the present experiment and has been demonstrated to be a promising tool in future studies of the molecular-like resonances near the cluster separation threshold.
