## Parity Function Detection and Realization Using a Small Set of Spectral Coefficients (1995)

Venue: | IEEE/ACM INTERNATIONAL WORKSHOP ON LOGIC SYNTHESIS (IWLS |

Citations: | 2 - 1 self |

### BibTeX

@INPROCEEDINGS{Thornton95parityfunction,

author = {M. A. Thornton and V. S. S. Nair},

title = {Parity Function Detection and Realization Using a Small Set of Spectral Coefficients},

booktitle = { IEEE/ACM INTERNATIONAL WORKSHOP ON LOGIC SYNTHESIS (IWLS},

year = {1995},

pages = {8--39},

publisher = {}

}

### OpenURL

### Abstract

A technique to detect and realize a parity logic function using a linear number of spectral coefficients is presented. Recent advances in computation methods for the spectra of a Boolean function have resulted in the determination of a single coefficient very efficiently. The use of a small set of spectral coefficients offers low cost and attractive alternatives to more traditional digital logic design and analysis techniques when coupled with the use of the new spectral computation approach. The detection and realization of the class of parity functions is an important problem since it generally requires the computation of 2 n Walsh coefficients when spectral methods are used, or, extensive symbolic algebraic manipulation when other methods are used. The method presented in this paper only requires the computation of n + 2 Walsh coefficients and n + 1 non-Walsh coefficients to detect and realize a parity function.

### Citations

169 |
Threshold Logic and its Applications
- Muroga
- 1971
(Show Context)
Citation Context ...nt input. However, the fact that a particular coefficient is computed to be 0 does not necessarily imply that the corresponding x i is redundant. This property is formally proven in the work given in =-=[10]-=-. The fact that degenerate functions will always have at least one zero-valued Chow parameter is used in the method we develop here, thus, in the remainder of this paper we assume the Chow parameters ... |

134 | Spectral transforms for large Boolean functions with applications to technology mapping
- Clarke, McMillan, et al.
- 1993
(Show Context)
Citation Context ...uit optimizers require a structural input and provide an output that is also in a netlist form. Recently, some efficient spectral computation methods have been proposed that use BDDs as input [1] [6] =-=[7]-=- [8]. However, if the circuit is in the form of a netlist initially, it may be more work to obtain a suitable variable ordering and then build a BDD representation than it would be to compute the spec... |

46 |
Discrete and Switching Functions
- DAVIO, DESCHAMPS, et al.
- 1978
(Show Context)
Citation Context ...mapping of a specific transformation matrix. Common transformation matrices include the Reed-Muller transformation matrix [2], or the Walsh family of matrices such as the Rademacher-Walsh or Hadamard =-=[3]-=-. As developed in [4], each row of the transformation matrix may be considered to be the output vector of a logic function, and thus the transformation matrices may be viewed as being composed of a co... |

30 |
Modern Logic Design
- Green
- 1986
(Show Context)
Citation Context ...function is defined as a vector of integer values obtained through the linear mapping of a specific transformation matrix. Common transformation matrices include the Reed-Muller transformation matrix =-=[2]-=-, or the Walsh family of matrices such as the Rademacher-Walsh or Hadamard [3]. As developed in [4], each row of the transformation matrix may be considered to be the output vector of a logic function... |

28 |
On the characterization of threshold functions
- CHOW
- 1961
(Show Context)
Citation Context ...s and a single i th ordered Walsh coefficient, where i may range from 2 to n. The 0 th and 1 st ordered Walsh coefficients are usually referred to as the Chow parameters in recognition of the work in =-=[5]-=- although the original definition differs slightly from that originally defined by Chow. The realization portion of this process uses n+1 spectral coefficients corresponding to constituent functions t... |

23 | Efficient calculation of spectral coefficients and their applications
- THORNTON, NAIR
- 1995
(Show Context)
Citation Context ...circuit optimizers require a structural input and provide an output that is also in a netlist form. Recently, some efficient spectral computation methods have been proposed that use BDDs as input [1] =-=[6]-=- [7] [8]. However, if the circuit is in the form of a netlist initially, it may be more work to obtain a suitable variable ordering and then build a BDD representation than it would be to compute the ... |

15 |
Fast Spectrum Computation for Logic Functions using Binary Decision Diagrams
- Fujita, Yang
- 1995
(Show Context)
Citation Context ...optimizers require a structural input and provide an output that is also in a netlist form. Recently, some efficient spectral computation methods have been proposed that use BDDs as input [1] [6] [7] =-=[8]-=-. However, if the circuit is in the form of a netlist initially, it may be more work to obtain a suitable variable ordering and then build a BDD representation than it would be to compute the spectral... |

10 | Iterative Combinational Logic synthesis Techniques using Spectral Data
- Thornton, Nair
- 1992
(Show Context)
Citation Context ... transformation matrix. Common transformation matrices include the Reed-Muller transformation matrix [2], or the Walsh family of matrices such as the Rademacher-Walsh or Hadamard [3]. As developed in =-=[4]-=-, each row of the transformation matrix may be considered to be the output vector of a logic function, and thus the transformation matrices may be viewed as being composed of a collection of logic fun... |

3 | Efficient Spectral Coefficient Calculation Using Circuit Output Probabilities
- Thornton, Nair
- 1994
(Show Context)
Citation Context ... advent of an efficient method for the computation of a single spectral coefficient of a Boolean function comes a renewed interest in the use of these quantities for circuit design and analysis tasks =-=[1]-=-. In particular, methods that use a small subset of spectral coefficients are especially attractive since the computational efficiency provided by the new calculation technique is augmented by reducin... |

2 |
The Computation of a Boolean Function Spec trum Using a Structural Input
- Thornton, Nair
- 1994
(Show Context)
Citation Context ...onential number of BDD vertices versus a much smaller netlist. For these classes of circuits, the use of an efficient spectral computation technique using a structural input such as that described in =-=[9]-=- is clearly advantageous. The remainder of this paper is organized as follows. Section 2 contains a brief discussion of the notation and definitions used in this development. Section 3 contains the ma... |