An improved parallel weighted bit-flipping（PWBF） algorithm is presented. To accelerate the information exchanges between check nodes and variable nodes, the bit-flipping step and the check node updating step of the ...An improved parallel weighted bit-flipping（PWBF） algorithm is presented. To accelerate the information exchanges between check nodes and variable nodes, the bit-flipping step and the check node updating step of the original algorithm are parallelized. The simulation experiments demonstrate that the improved PWBF algorithm provides about 0. 1 to 0. 3 dB coding gain over the original PWBF algorithm. And the improved algorithm achieves a higher convergence rate. The choice of the threshold is also discussed, which is used to determine whether a bit should be flipped during each iteration. The appropriate threshold can ensure that most error bits be flipped, and keep the right ones untouched at the same time. The improvement is particularly effective for decoding quasi-cyclic low-density paritycheck（QC-LDPC） codes.展开更多
The modified mapping method is further improved by the expanded expression of u（ξ） that contains the terms of the first-order derivative of function f（ξ）. Some new exact solutions to the mBBM equation are determ...The modified mapping method is further improved by the expanded expression of u（ξ） that contains the terms of the first-order derivative of function f（ξ）. Some new exact solutions to the mBBM equation are determined by means of the method. We can obtain many new solutions in terms of the Jacobi elliptic functions of the equation.展开更多
基金The National High Technology Research and Development Program of China (863Program) ( No2009AA01Z235,2006AA01Z263)the Research Fund of the National Mobile Communications Research Laboratory of Southeast University(No2008A10)
文摘An improved parallel weighted bit-flipping（PWBF） algorithm is presented. To accelerate the information exchanges between check nodes and variable nodes, the bit-flipping step and the check node updating step of the original algorithm are parallelized. The simulation experiments demonstrate that the improved PWBF algorithm provides about 0. 1 to 0. 3 dB coding gain over the original PWBF algorithm. And the improved algorithm achieves a higher convergence rate. The choice of the threshold is also discussed, which is used to determine whether a bit should be flipped during each iteration. The appropriate threshold can ensure that most error bits be flipped, and keep the right ones untouched at the same time. The improvement is particularly effective for decoding quasi-cyclic low-density paritycheck（QC-LDPC） codes.
基金The project supported by the Science and Technology Foundation of Cuizhou Province of China under Grant No. 20072009
文摘The modified mapping method is further improved by the expanded expression of u（ξ） that contains the terms of the first-order derivative of function f（ξ）. Some new exact solutions to the mBBM equation are determined by means of the method. We can obtain many new solutions in terms of the Jacobi elliptic functions of the equation.
