Miller et al., 1994 - Google Patents
Highly efficient exhaustive search algorithm for optimizing canonical Reed-Muller expansions of boolean functionsMiller et al., 1994
- Document ID
- 749114853928556160
- Author
- Miller J
- Thomson P
- Publication year
- Publication venue
- International journal of electronics
External Links
Snippet
A new method is presented for calculating fixed polarity Reed-Muller expansions from the boolean minterms. Direct transformation equations of Reed-Muller expansions with polarity are derived. A highly efficient and flexible exhaustive search algorithm is presented which …
- 238000010845 search algorithm 0 title abstract description 5
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/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
- 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/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
-
- 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
-
- 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/38—Indexing scheme relating to groups G06F7/38 - G06F7/575
-
- 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
-
- 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
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for programme control, e.g. control unit
- G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F15/00—Digital computers in general; Data processing equipment in general
- G06F15/76—Architectures of general purpose stored programme computers
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Bryant | Graph-based algorithms for boolean function manipulation | |
| Miller et al. | Spectral techniques for reversible logic synthesis | |
| Narayan et al. | Partitioned ROBDDs-a compact, canonical and efficiently manipulable representation for Boolean functions | |
| Jang et al. | A fast algorithm for computing a histogram on reconfigurable mesh | |
| Turrini | Optimal group distribution in carry-skip adders | |
| Roth et al. | Algebraic Topological Methods for the Synthesis of Switching Systems—Part III: Minimization of Nonsingular Boolean Trees | |
| US20150070957A1 (en) | Semiconductor device and method of writing/reading entry address into/from semiconductor device | |
| Miller et al. | Highly efficient exhaustive search algorithm for optimizing canonical Reed-Muller expansions of boolean functions | |
| US5787028A (en) | Multiple bit multiplier | |
| CN117692126A (en) | A Paillier homomorphic encryption method and system based on low-complexity modular multiplication algorithm | |
| Sado et al. | Some parallel sorts on a mesh-connected processor array and their time efficiency | |
| CN107210005B (en) | Matrix/key generation device, matrix/key generation system, matrix combination device, matrix/key generation method, and program | |
| Szyprowski et al. | A study of optimal 4-bit reversible circuit synthesis from mixed-polarity Toffoli gates | |
| Majumder et al. | Investigation on Quine McCluskey method: A decimal manipulation based novel approach for the minimization of Boolean function | |
| Kryvyi et al. | Partitioning a set of vectors with nonnegative integer coordinates using logical hardware | |
| US6151617A (en) | Multiplier circuit for multiplication operation between binary and twos complement numbers | |
| EP0733236B1 (en) | Memory addressing for massively parallel processing systems | |
| Debnath et al. | Fast Boolean matching under permutation using representative | |
| EP0888586B1 (en) | Array indexing | |
| Dormido et al. | Synthesis of generalized parallel counters | |
| Lin | Parallel generation of permutations on systolic arrays | |
| Juedes et al. | Kolmogorov complexity, complexity cores, and the distribution of hardness | |
| US7471789B2 (en) | Encryption circuit achieving higher operation speed | |
| KHAN et al. | Mapping of on-set fixed polarity Reed-Muller coefficients from on-set canonical sum of products coefficients and the minimization of pseudo Reed-Muller expressions | |
| Sood et al. | Parallel and pipelined processing of some relational algebra operations |