We study the circuit complexity of the powering function, defined as POWm(Z) = Zm for an n-bit integer input Z and an integer exponent m 6 poly(n). Let L̂Td denote the class of functions computable by a depth-d polynomial-size circuit of majority gates. We give a simple proof that POWm 6∈ L̂T2 for any m > 2. Specifically, we prove a 2Ω(n/ logn) lower bound on the size of any depth-2 majority circ...

We provide a zero-knowledge argument for arithmetic circuit satisfiability with a communication complexity that grows logarithmically in the size of the circuit. The round complexity is also logarithmic and for an arithmetic circuit with fan-in 2 gates the computation of the prover and verifier is linear in the size of the circuit. The soundness of our argument relies solely on the well-establi...

An AMD circuit over a nite eld F is a randomized arithmetic circuit that o ers the best possible protection against additive attacks. That is, the e ect of every additive attack that may blindly add a (possibly di erent) element of F to every internal wire of the circuit can be simulated by an ideal attack that applies only to the inputs and outputs. Genkin et al. (STOC 2014, Crypto 2015) intro...

This paper presents a programmable multi-mode finite impulse response (FIR) filter implemented as switched capacitor (SC) technique in CMOS 0.18 μm technology. Intended application of the described circuit is in analog base-band filtering in GSM/WCDMA systems. The proposed filter features a regular structure that allows for elimination of some parasitic capacitances, thus significantly improvin...

The design of modified Wilkinson power divider is done by dividing Quarter wavelength transmission line into two, in-between that complex isolation component and compensation capacitor is added. Complex isolation component provides physical separation and electrical isolation between two output ports. It consist of parallel or series RLC circuit is chosen to realize. To get the widest bandwidth...

A Universal Circuit (UC) is a circuit that can simulate any circuit of a maximum size, given its description as input. In this work, we look back at Valiant’s universal circuit construction from Valiant (STOC 1976). Although it yields asymptotically optimal UC, and has implications for important problems in cryptography such as ”private function evaluation” (PFE) and ”cryptographic program obfu...

This paper proposed an efficient implementation of digital circuit based on the Euclidean Algorithm with modular arithmetic to find Greatest Common Divisor (GCD) of two Binary Numbers given as input to the circuit. Output of the circuit is the GCD of the given inputs. In this paper subtraction-based narrative defined by Euclid is described, the remainder calculation replaced by repeated subtrac...

A four-device broadband solid-state power amplifier, which is based on radial waveguide power-dividing/combining circuit, has been investigated in this work. The fabricated power amplifier combining four monolithic microwave integrated circuit power amplifiers shows a 12–16.6 dB small-signal gain over a broadband from 6 to 14 GHz. The measured maximum output power at 1 dB compression is 25.6 dB...

In data processing processors, adder is a basic digital circuit. To perform any arithmetic operation, addition is the basic operation to perform. To compute fast arithmetic operations adder must be fastest. CSLA is the fastest adder when compare to RCA and CLA. From the structure of CSLA it is observed that there is a scope to reduce area further so that power can be lowered [3-4]. This paper p...