Luo et al., 2020 - Google Patents
Energy efficient in-memory integer multiplication based on Racetrack memoryLuo et al., 2020
- Document ID
- 3039595153764238072
- Author
- Luo T
- Zhang W
- He B
- Liu C
- Maskell D
- Publication year
- Publication venue
- 2020 IEEE 40th International Conference on Distributed Computing Systems (ICDCS)
External Links
Snippet
Both computation-and memory-intensiveness of deep learning models have made the deployment of model inference on edge devices with limited resource and energy budget challenging. Non-Volatile Memory (NVM) based in-memory computing has been proposed …
- 238000005457 optimization 0 abstract description 22
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/52—Multiplying; Dividing
- G06F7/523—Multiplying only
- G06F7/533—Reduction of the number of iteration steps or stages, e.g. using the Booth algorithm, log-sum, odd-even
-
- 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/544—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 for evaluating functions by calculation
- G06F7/5443—Sum of products
-
- 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
- G06F9/30—Arrangements for executing machine-instructions, e.g. instruction decode
- G06F9/30003—Arrangements for executing specific machine instructions
- G06F9/30007—Arrangements for executing specific machine instructions to perform operations on data operands
-
- 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
- G06F2207/3804—Details
-
- 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
-
- 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
-
- 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
- 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
- G06F1/00—Details of data-processing equipment not covered by groups G06F3/00 - G06F13/00, e.g. cooling, packaging or power supply specially adapted for computer application
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F2217/00—Indexing scheme relating to computer aided design [CAD]
- G06F2217/78—Power analysis and optimization
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Angizi et al. | MRIMA: An MRAM-based in-memory accelerator | |
| Angizi et al. | Majority-based spin-CMOS primitives for approximate computing | |
| Liu et al. | Design of semiconductor QCA systems | |
| Venkatesan et al. | Spintastic: Spin-based stochastic logic for energy-efficient computing | |
| Cotofana et al. | Addition related arithmetic operations via controlled transport of charge | |
| Chaves et al. | Energy efficient QCA circuits design: simulating and analyzing partially reversible pipelines | |
| Luo et al. | A racetrack memory based in-memory booth multiplier for cryptography application | |
| Shabbir et al. | A reduced-sp-D3L sum adder-based high frequency 4× 4 Bit multiplier using Dadda algorithm | |
| Luo et al. | Energy efficient in-memory integer multiplication based on Racetrack memory | |
| Naderpour et al. | Reversible multipliers: Decreasing the depth of the circuit | |
| Tiwari et al. | Reversible Logic Gates and Applications-A Low Power Solution to VLSI Chips. | |
| Patidar et al. | An extensible architecture of 32-bit ALU for high-speed computing in QCA technology | |
| Givaki et al. | A generalized residue number system design approach for ultralow-power arithmetic circuits based on deterministic bit-streams | |
| Wu et al. | A STT-assisted SOT MRAM-based in-memory booth multiplier for neural network applications | |
| Zhang et al. | HRCIM-NTT: An Efficient Compute-in-Memory NTT Accelerator With Hybrid-Redundant Numbers | |
| Haghparast et al. | Designing novel quaternary quantum reversible subtractor circuits | |
| Nayeem et al. | Novel reversible division hardware | |
| Kabra et al. | A radix‐8 modulo 2n multiplier using area and power‐optimized hard multiple generator | |
| Luo et al. | A novel two-stage modular multiplier based on racetrack memory for asymmetric cryptography | |
| Gassoumi et al. | Automata (QCA) Technology with a Realistic Clocking Scheme | |
| Oudjida et al. | A new recursive multibit recoding algorithm for high-speed and low-power multiplier | |
| Appasaheb et al. | Design and implementation of an efficient multiplier using vedic mathematics and charge recovery logic | |
| Aoki et al. | High-radix parallel VLSI dividers without using quotient digit selection tables | |
| Erra et al. | Power Reduction of Montgomery Multiplication Architectures Using Clock Gating | |
| Rishi Kiran et al. | Peram: ultra power efficient array multiplier using reversible logic for high-performance mac |