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.展开更多
This article investigates channel allocation for cognitive networks, which is difficult to obtain the optimal allocation distribution. We first study interferences between nodes in cognitive networks and establish the...This article investigates channel allocation for cognitive networks, which is difficult to obtain the optimal allocation distribution. We first study interferences between nodes in cognitive networks and establish the channel allocation model with interference constraints. Then we focus on the use of evolutionary algorithms to solve the optimal allocation distribution. We further consider that the search time can be reduced by means of parallel computing, and then a parallel algorithm based APO is proposed. In contrast with the existing algorithms, we decompose the allocation vector into a number of sub-vectors and search for optimal allocation distribution of sub-vector in parallel. In order to speed up converged rate and improve converged value, some typical operations of evolutionary algorithms are modified by two novel operators. Finally, simulation results show that the proposed algorithm drastically outperform other optimal solutions in term of the network utilization.展开更多
An optimal maintenance policy tor deteriorating components based on quasi renew-process model is presented. In this policy, the first N - 1 failures of a component are maintained by repairs and the N＇h failure is mai...An optimal maintenance policy tor deteriorating components based on quasi renew-process model is presented. In this policy, the first N - 1 failures of a component are maintained by repairs and the N＇h failure is maintained by replacement. The policy takes replacement actions at component lev- el by considering the fact that more and more components are designed to be field replaceable and maintenance activities are setting free from system halt. Concerning system structure impact, impor- tance measure is employed in the optimization procedure which aims at maximizing the long-rnn prof- it per unit time. Two example series parallel systems are taken to illustrate the policy and it is proved to work well. According to importance analysis, components are classified into important ones and unimportant ones based on the system behavior under their failures. Simulation results show that the presented policy makes a clear distinction between them and takes effective mainte- nance actions to compensate the deteriorating of components.展开更多
基金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.
基金supported in part by the National Natural Science Foundation under Grant No.61072069National Science and Technology Major Project of the Ministry of Science and Technology of China under Grant No.2012ZX03003012
文摘This article investigates channel allocation for cognitive networks, which is difficult to obtain the optimal allocation distribution. We first study interferences between nodes in cognitive networks and establish the channel allocation model with interference constraints. Then we focus on the use of evolutionary algorithms to solve the optimal allocation distribution. We further consider that the search time can be reduced by means of parallel computing, and then a parallel algorithm based APO is proposed. In contrast with the existing algorithms, we decompose the allocation vector into a number of sub-vectors and search for optimal allocation distribution of sub-vector in parallel. In order to speed up converged rate and improve converged value, some typical operations of evolutionary algorithms are modified by two novel operators. Finally, simulation results show that the proposed algorithm drastically outperform other optimal solutions in term of the network utilization.
基金Supported by the National High Technology Research and Development Programme of China(No.2008AA01A204)the National Natural Science Foundation of China(No.61003047,61173020)International Science & Technology Cooperation Project(No.2010DFA14400)
文摘An optimal maintenance policy tor deteriorating components based on quasi renew-process model is presented. In this policy, the first N - 1 failures of a component are maintained by repairs and the N＇h failure is maintained by replacement. The policy takes replacement actions at component lev- el by considering the fact that more and more components are designed to be field replaceable and maintenance activities are setting free from system halt. Concerning system structure impact, impor- tance measure is employed in the optimization procedure which aims at maximizing the long-rnn prof- it per unit time. Two example series parallel systems are taken to illustrate the policy and it is proved to work well. According to importance analysis, components are classified into important ones and unimportant ones based on the system behavior under their failures. Simulation results show that the presented policy makes a clear distinction between them and takes effective mainte- nance actions to compensate the deteriorating of components.
