This paper deals with a hybrid active power filter with injection circuit (IHAPF). This paper concluded that the stability of the IHAPF based on detection supply current is superior to that of others. To minimize the capacity of IHAPF, an adaptive fuzzy dividing frequency-control method,.The generalized integrator is used for dividing frequency integral control, while fuzzy arithmetic is used f...

This paper deals with a hybrid active power filter with injection circuit (IHAPF). This paper concluded that the stability of the IHAPF based on detection supply current is superior to that of others. To minimize the capacity of IHAPF, an adaptive fuzzy dividing frequency-control method,.The generalized integrator is used for dividing frequency integral control, while fuzzy arithmetic is used f...

In this paper we compare the performance of several range arithmetic methods in evaluating problems in symbolicnumeric circuit analysis. Symbolic-numeric circuit analysis involves solving systems of linear equations in order to obtain the values of currents and voltages in a given circuit. Symbolic circuit expressions contain a large number of product terms and long chains of arithmetic operati...

This paper proposes an architecture of dynamically reconfigurable arithmetic circuit. Dynamic reconfiguration is a technique to realize required functions by changing hardware construction during operations. The proposed circuit is based on a complex number multiply-accumulation circuit which is used frequently in the field of digital signal processing. In addition, the proposed circuit perform...

We explore the expressivity of constraint satisfaction problems (CSPs) in the arithmetic circuit model. While CSPs are known to yield VNP-complete polynomials in the general case, we show that for different restrictions of the structure of the CSPs we get characterizations of different arithmetic circuit classes. In particular we give the first natural non-circuit characterization of VP, the cl...

• Innovative work by Kabanets and Impagliazzo [KI03] shows that, in some cases, providing lower bounds on arithmetic circuit size can yield consequences about Boolean complexity classes. For instance, one of the most important problems in BPP that is not known to be in P is Arithmetic Circuit Identity Testing (ACIT), the problem of determining if two arithmetic circuits compute the same functio...