Systolic implementation of multiplication over GF(2m) is usually very efficient in area-time complexity,but its latency is usually very large.Thus,two low latency systolic multipliers over GF(2m) based on general irre...Systolic implementation of multiplication over GF(2m) is usually very efficient in area-time complexity,but its latency is usually very large.Thus,two low latency systolic multipliers over GF(2m) based on general irreducible polynomials and irreducible pentanomials are presented.First,a signal flow graph(SFG) is used to represent the algorithm for multiplication over GF(2m).Then,the two low latency systolic structures for multiplications over GF(2m) based on general irreducible polynomials and pentanomials are presented from the SFG by suitable cut-set retiming,respectively.Analysis indicates that the proposed two low latency designs involve at least one-third less area-delay product when compared with the existing designs,To the authors' knowledge,the time-complexity of the structures is the lowest found in literature for systolic GF(2m) multipliers based on general irreducible polynomials and pentanomials.The proposed low latency designs are regular and modular,and therefore they are suitable for many time critical applications.展开更多
In this paper, finite time consensus problem is discussed for multiple non-holonomic mobile agents with constant communication delay. The objective is to design non-smooth distributed control laws such that multiple n...In this paper, finite time consensus problem is discussed for multiple non-holonomic mobile agents with constant communication delay. The objective is to design non-smooth distributed control laws such that multiple non-holonomic mobile agents can be all in agreement within any given finite time larger than communication delay. The authors propose a novel switching control strategy with the help of Lyapunov-based method and graph theory.展开更多
Finite-time stability of a class of fractional-order neural networks is investigated in this paper. By Laplace transform, the generalized Gronwa11 inequality and estimates of Mittag-Leffier functions, sufficient condi...Finite-time stability of a class of fractional-order neural networks is investigated in this paper. By Laplace transform, the generalized Gronwa11 inequality and estimates of Mittag-Leffier functions, sufficient conditions are pre- sented to ensure the finite-time stability of such neural models with the Caputo fractionM derivatives. Furthermore, results about asymptotical stability of fractional-order neural models are also obtained.展开更多
基金Project(61174132) supported by the National Natural Science Foundation of ChinaProject(09JJ6098) supported by the Natural Science Foundation of Hunan Province,China
文摘Systolic implementation of multiplication over GF(2m) is usually very efficient in area-time complexity,but its latency is usually very large.Thus,two low latency systolic multipliers over GF(2m) based on general irreducible polynomials and irreducible pentanomials are presented.First,a signal flow graph(SFG) is used to represent the algorithm for multiplication over GF(2m).Then,the two low latency systolic structures for multiplications over GF(2m) based on general irreducible polynomials and pentanomials are presented from the SFG by suitable cut-set retiming,respectively.Analysis indicates that the proposed two low latency designs involve at least one-third less area-delay product when compared with the existing designs,To the authors' knowledge,the time-complexity of the structures is the lowest found in literature for systolic GF(2m) multipliers based on general irreducible polynomials and pentanomials.The proposed low latency designs are regular and modular,and therefore they are suitable for many time critical applications.
基金supported by the Young Faculty Foundation of Tianjin University under Grant No.TJUYFF-08B73
文摘In this paper, finite time consensus problem is discussed for multiple non-holonomic mobile agents with constant communication delay. The objective is to design non-smooth distributed control laws such that multiple non-holonomic mobile agents can be all in agreement within any given finite time larger than communication delay. The authors propose a novel switching control strategy with the help of Lyapunov-based method and graph theory.
基金Supported by the Specialized Research Fund for the Doctoral Program of Higher Education of China under Grant No.20093401120001the Natural Science Foundation of Anhui Province under Grant No.11040606M12+1 种基金the Natural Science Foundation of Anhui Education Bureau under Grant No.KJ2010A035the 211 Project of Anhui University under Grant No.KJJQ1102
文摘Finite-time stability of a class of fractional-order neural networks is investigated in this paper. By Laplace transform, the generalized Gronwa11 inequality and estimates of Mittag-Leffier functions, sufficient conditions are pre- sented to ensure the finite-time stability of such neural models with the Caputo fractionM derivatives. Furthermore, results about asymptotical stability of fractional-order neural models are also obtained.
