Porwik, 2002 - Google Patents
Efficient calculation of the Reed-Muller form by means of the Walsh transformPorwik, 2002
View PDF- Document ID
- 13614457426093828966
- Author
- Porwik P
- Publication year
External Links
Snippet
The paper describes a spectral method for combinational logic synthesis using the Walsh transform and the Reed-Muller form. A new algorithm is presented that allows us to obtain the mixed polarity Reed-Muller expansion of Boolean functions. The most popular …
- 238000004364 calculation method 0 title description 8
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
- G06F7/38—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation
- G06F7/48—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation using non-contact-making devices, e.g. tube, solid state device; using unspecified devices
- G06F7/50—Adding; Subtracting
- G06F7/505—Adding; Subtracting in bit-parallel fashion, i.e. having a different digit-handling circuit for each denomination
- G06F7/506—Adding; Subtracting in bit-parallel fashion, i.e. having a different digit-handling circuit for each denomination with simultaneous carry generation for, or propagation over, two or more stages
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
- G06F7/38—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation
- G06F7/48—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation using non-contact-making devices, e.g. tube, solid state device; using unspecified devices
- G06F7/52—Multiplying; Dividing
- G06F7/523—Multiplying only
- G06F7/53—Multiplying only in parallel-parallel fashion, i.e. both operands being entered in parallel
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/50—Computer-aided design
- G06F17/5009—Computer-aided design using simulation
- G06F17/504—Formal methods
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
- G06F7/60—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers
- G06F7/72—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers using residue arithmetic
- G06F7/724—Finite field arithmetic
- G06F7/726—Inversion; Reciprocal calculation; Division of elements of a finite field
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/10—Complex mathematical operations
- G06F17/11—Complex mathematical operations for solving equations, e.g. nonlinear equations, general mathematical optimization problems
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
- G06F7/58—Random or pseudo-random number generators
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/10—Complex mathematical operations
- G06F17/14—Fourier, Walsh or analogous domain transformations, e.g. Laplace, Hilbert, Karhunen-Loeve, transforms
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F2207/00—Indexing scheme relating to methods or arrangements for processing data by operating upon the order or content of the data handled
- G06F2207/72—Indexing scheme relating to groups G06F7/72 - G06F7/729
- G06F2207/7219—Countermeasures against side channel or fault attacks
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Ciesielski et al. | Understanding algebraic rewriting for arithmetic circuit verification: a bit-flow model | |
| Miller | Spectral and two-place decomposition techniques in reversible logic | |
| Fujiwara | Computational complexity of controllability/observability problems for combinational circuits | |
| Huan et al. | Using word-level ATPG and modular arithmetic constraint-solving techniques for assertion property checking | |
| Porwik | Efficient calculation of the Reed-Muller form by means of the Walsh transform | |
| Collinsworth et al. | Stochastic number generators with minimum probability conversion circuits | |
| Jankovic et al. | Optimization of GF (4) expressions using the extended dual polarity property | |
| Karpovsky et al. | Spectral techniques for design and testing of computer hardware | |
| Vrudhula et al. | Edge valued binary decision diagrams | |
| Lee et al. | Quantum machine learning based on minimizing Kronecker-Reed-Muller forms and Grover search algorithm with hybrid oracles | |
| Li et al. | A Quantum CAD Accelerator based on Grover's algorithm for finding the minimum Fixed Polarity Reed-Muller form | |
| Stanion et al. | Quasi-algebraic decompositions of switching functions | |
| Thornton et al. | An iterative combinational logic synthesis technique using spectral information | |
| Woods et al. | Efficient solution of systems of Boolean equations | |
| Falkowski | Spectral testing of digital circuits | |
| Yanushkevich | Matrix method for solving multivalued logic differential equations | |
| Falkowski et al. | Hadamard–Walsh spectral characterization of Reed–Muller expansions | |
| Chand et al. | Implementation of High Performance Spanning Tree Adder using Quaternary Logic | |
| Raghavaiah et al. | Quaternary logic based high recital spanning tree parallel prefix adder | |
| Steinbach et al. | Three Models and Some Theorems on Decomposition of Boolean Function | |
| Sarma | EDGE VALUED BINARY DECISION DIAGRAMS | |
| Keren et al. | Use of gray decoding for implementation of symmetric functions | |
| Mathew et al. | A galois field based logic synthesis approach with testability | |
| Falkowski et al. | Hybrid multi-polarity arithmetic–Walsh transform | |
| Dziurzanski et al. | Linear models of circuits based on the multivalued components |