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 paper presents the improved element-free Galerkin (IEFG) method for three-dimensional wave propa- gation. The improved moving least-squares (IMLS) approx- imation is employed to construct the shape function, w...The paper presents the improved element-free Galerkin (IEFG) method for three-dimensional wave propa- gation. The improved moving least-squares (IMLS) approx- imation is employed to construct the shape function, which uses an orthogonal function system with a weight function as the basis function. Compared with the conventional moving least-squares (MLS) approximation, the algebraic equation system in the IMLS approximation is not ill-conditioned, and can be solved directly without deriving the inverse matrix. Because there are fewer coefficients in the IMLS than in the MLS approximation, fewer nodes are selected in the IEFG method than in the element-free Galerkin method. Thus, the IEFG method has a higher computing speed. In the IEFG method, the Galerkin weak form is employed to obtain a dis- cretized system equation, and the penalty method is applied to impose the essential boundary condition. The traditional difference method for two-point boundary value problems is selected for the time discretization. As the wave equations and the boundary-initial conditions depend on time, the scal- ing parameter, number of nodes and the time step length are considered for the convergence study.展开更多
By analyzing the structures of circuits,a novel approach for signal probability estimation of very large-scale integration(VLSI)based on the improved weighted averaging algorithm(IWAA)is proposed.Considering the failu...By analyzing the structures of circuits,a novel approach for signal probability estimation of very large-scale integration(VLSI)based on the improved weighted averaging algorithm(IWAA)is proposed.Considering the failure probability of the gate,first,the first reconvergent fan-ins corresponding to the reconvergent fan-outs were identified to locate the important signal correlation nodes based on the principle of homologous signal convergence.Secondly,the reconvergent fan-in nodes of the multiple reconverging structure in the circuit were identified by the sensitization path to determine the interference sources to the signal probability calculation.Then,the weighted signal probability was calculated by combining the weighted average approach to correct the signal probability.Finally,the reconvergent fan-out was quantified by the mixed-calculation strategy of signal probability to reduce the impact of multiple reconvergent fan-outs on the accuracy.Simulation results on ISCAS85 benchmarks circuits show that the proposed method has approximate linear time-space consumption with the increase in the number of the gate,and its accuracy is 4.2%higher than that of the IWAA.展开更多
Recently,the fundamental problem with Hybrid Mobile Ad-hoc Net-works(H-MANETs)is tofind a suitable and secure way of balancing the load through Internet gateways.Moreover,the selection of the gateway and overload of th...Recently,the fundamental problem with Hybrid Mobile Ad-hoc Net-works(H-MANETs)is tofind a suitable and secure way of balancing the load through Internet gateways.Moreover,the selection of the gateway and overload of the network results in packet loss and Delay(DL).For optimal performance,it is important to load balance between different gateways.As a result,a stable load balancing procedure is implemented,which selects gateways based on Fuzzy Logic(FL)and increases the efficiency of the network.In this case,since gate-ways are selected based on the number of nodes,the Energy Consumption(EC)was high.This paper presents a novel Node Quality-based Clustering Algo-rithm(NQCA)based on Fuzzy-Genetic for Cluster Head and Gateway Selection(FGCHGS).This algorithm combines NQCA with the Improved Weighted Clus-tering Algorithm(IWCA).The NQCA algorithm divides the network into clusters based upon node priority,transmission range,and neighbourfidelity.In addition,the simulation results tend to evaluate the performance effectiveness of the FFFCHGS algorithm in terms of EC,packet loss rate(PLR),etc.展开更多
Most of the important agronomic traits in crop plants, such as yield, quality and stress response, are quantitative and jointly controlled by many genomic loci or major genes. Improving these complex traits depends on...Most of the important agronomic traits in crop plants, such as yield, quality and stress response, are quantitative and jointly controlled by many genomic loci or major genes. Improving these complex traits depends on the combination of beneficial alleles at the quantitative trait loci (QTLs). However, the conventional cross breeding method is extremely time-consuming and laborious for pyramiding multiple QTLs. In certain cases, this approach might be technically difficult because of close linkage between genes separately responsible for desirable and undesirable traits.展开更多
基金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 by the National Natural Science Foundation of China (11171208)Shanghai Leading Academic Discipline Project (S30106)
文摘The paper presents the improved element-free Galerkin (IEFG) method for three-dimensional wave propa- gation. The improved moving least-squares (IMLS) approx- imation is employed to construct the shape function, which uses an orthogonal function system with a weight function as the basis function. Compared with the conventional moving least-squares (MLS) approximation, the algebraic equation system in the IMLS approximation is not ill-conditioned, and can be solved directly without deriving the inverse matrix. Because there are fewer coefficients in the IMLS than in the MLS approximation, fewer nodes are selected in the IEFG method than in the element-free Galerkin method. Thus, the IEFG method has a higher computing speed. In the IEFG method, the Galerkin weak form is employed to obtain a dis- cretized system equation, and the penalty method is applied to impose the essential boundary condition. The traditional difference method for two-point boundary value problems is selected for the time discretization. As the wave equations and the boundary-initial conditions depend on time, the scal- ing parameter, number of nodes and the time step length are considered for the convergence study.
基金The National Natural Science Foundation of China(No.61502422)the Natural Science Foundation of Zhejiang Province(No.LY18F020028,LQ15F020006)the Natural Science Foundation of Zhejiang University of Technology(No.2014XY007)
文摘By analyzing the structures of circuits,a novel approach for signal probability estimation of very large-scale integration(VLSI)based on the improved weighted averaging algorithm(IWAA)is proposed.Considering the failure probability of the gate,first,the first reconvergent fan-ins corresponding to the reconvergent fan-outs were identified to locate the important signal correlation nodes based on the principle of homologous signal convergence.Secondly,the reconvergent fan-in nodes of the multiple reconverging structure in the circuit were identified by the sensitization path to determine the interference sources to the signal probability calculation.Then,the weighted signal probability was calculated by combining the weighted average approach to correct the signal probability.Finally,the reconvergent fan-out was quantified by the mixed-calculation strategy of signal probability to reduce the impact of multiple reconvergent fan-outs on the accuracy.Simulation results on ISCAS85 benchmarks circuits show that the proposed method has approximate linear time-space consumption with the increase in the number of the gate,and its accuracy is 4.2%higher than that of the IWAA.
文摘Recently,the fundamental problem with Hybrid Mobile Ad-hoc Net-works(H-MANETs)is tofind a suitable and secure way of balancing the load through Internet gateways.Moreover,the selection of the gateway and overload of the network results in packet loss and Delay(DL).For optimal performance,it is important to load balance between different gateways.As a result,a stable load balancing procedure is implemented,which selects gateways based on Fuzzy Logic(FL)and increases the efficiency of the network.In this case,since gate-ways are selected based on the number of nodes,the Energy Consumption(EC)was high.This paper presents a novel Node Quality-based Clustering Algo-rithm(NQCA)based on Fuzzy-Genetic for Cluster Head and Gateway Selection(FGCHGS).This algorithm combines NQCA with the Improved Weighted Clus-tering Algorithm(IWCA).The NQCA algorithm divides the network into clusters based upon node priority,transmission range,and neighbourfidelity.In addition,the simulation results tend to evaluate the performance effectiveness of the FFFCHGS algorithm in terms of EC,packet loss rate(PLR),etc.
基金supported by Genetically Modified Breeding Major Projects(No.2016ZX08010-002-008)the National Natural Science Foundation of China(Nos.31501239 and 31401454)
文摘Most of the important agronomic traits in crop plants, such as yield, quality and stress response, are quantitative and jointly controlled by many genomic loci or major genes. Improving these complex traits depends on the combination of beneficial alleles at the quantitative trait loci (QTLs). However, the conventional cross breeding method is extremely time-consuming and laborious for pyramiding multiple QTLs. In certain cases, this approach might be technically difficult because of close linkage between genes separately responsible for desirable and undesirable traits.