In this paper we describe a new architecture of a frequcncy-lo-voltage convcrtcr VVC) :md iLs high frequency intcgrated applications. The circuit is of a rcduccd complexity and its CMOS implcmcnlalion requires a very small area. Besides its small integration arca, thc circuit is vcry fast and has many inlcrcsting high frequcncy applications. This FVC is used to build an integrated high-precisio...

The test generation problem for a sequential circuit capable of generating tests with combinational test generation complexity can be reduced to that for the combinational circuit formed by replacing each FF in the sequential circuit by a wire. In this paper, we consider an application of this approach to general sequential circuits. We propose a test generation method using circuit pseudo-tran...

residue number system (rns) is a carry-free and non-weighed integer system. in this paper an improved three-moduli set  in reverse converter based on crt algorithm is proposed. crt algorithm can perform a better delay and hardware implementation in modules via other algorithms. this moduli is based on p that covers a wide range on modules and supports the whole range of its modules in dynamic r...

• 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...

This paper is a modification of a result of Codenotti and Lotti [2]. They studied the area-time complexity of an n-bit VLSI counter in the synchronous VLSI model (see [1]). They proved a lower bound AT 2= fl(n log n) and proposed a circuit of complexity AT 2-O(n log4n). This circuit satisfied the property that all I / O ports lay on the border of the circuit. Henceforth, we shall call the synch...

We study the computational complexity of two Boolean non-linearity measures: the nonlinearity and the multiplicative complexity. We show that if one-way functions exist, no algorithm can compute the multiplicative complexity in time 2 O(n) given the truth table of length 2 n , in fact under the same assumption it is impossible to approximate the multiplicative complexity within a factor of (2 −...

We introduce total wire length as salient complexity measure for an analysis of the circuit complexity of sensory processing in biological neural systems and neuromorphic engineering. Furthermore we introduce a set of basic computational problems that apparently need to be solved by circuits for translationand scale-invariant sensory processing. Finally we exhibit a number of circuit design str...

We study the circuit complexity of boolean functions in a certain infinite basis. The basis consists of all functions that take value 1 on antichains over the boolean cube. We prove that the circuit complexity of the parity function and the majority function of n variables in this basis is b 2 c and ⌊ n 2 ⌋ +1 respectively. We show that the asymptotic of the maximum complexity of n-variable boo...