A new low power dynamic CMOS one bit full adder cell is presented. In this design the time consuming XOR gates are eliminated. It is based on Majority Function. This new cell is compared with two widely used dynamic adders as well as other conventional and recently proposed architectures. It is implemented in two level dynamic CMOS with zipper technique and the number of transistors, chip area ...

We give a new bound on the sum of the linear Fourier coefficients of a Boolean function in terms of its parity decision tree complexity. This result generalizes an inequality of O’Donnell and Servedio for regular decision trees [OS08]. We use this bound to obtain the first non-trivial lower bound on the parity decision tree complexity of the recursive majority function.

A nonlinear multiscale pyramidal transform based on nonoverlapping block decompositions using the median operation and a polynomial approximation is considered. It is shown that this structure can be useful for denoising of one– and two-dimensional (1-D and 2-D) signals. Various denoising techniques are analyzed, including methods based on spatially adaptive thresholding and partial cycle-spinn...

The validity of majority rule in an election with but two candidates— and so also of Condorcet consistency—is challenged. Axioms based on evaluating candidates—paralleling those of K. O. May characterizing majority rule for two candidates based on comparing candidates—lead to another method, majority judgment, that is unique in agreeing with the majority rule on pairs of “polarized” candidates....

Fagin et al. characterized those symmetric Boolean functions which can be computed by small AND/OR circuits of constant depth and unbounded fan-in. Here we provide a similar characterization for d-perceptrons | AND/OR circuits of constant depth and unbounded fan-in with a single MAJORITY gate at the output. We show that a symmetric function has small (quasipolynomial, or 2 log O(1) n size) d-pe...

A new technique for the realisation of soft morphological filters based on the majority gate algorithm is presented in this paper. A pipelined systolic array architecture suitable to perform soft morphological filtering is also presented. The processing times of the proposed hardware structure do not depend on the data window size and the required silicon area is linearly related to the number ...

The purpose of this paper is to extend the Buneman construction of partially labelled trees to the general case. This extension is related with the characterization of median graphs by Mulder and Schrijver. In the first section, we construct a graph G(H) associated with a copair hypergraph H on a finite set X and define the notion of a median graph with latent vertices (called X-median graph). ...