Dehbozorgi et al., 2022 - Google Patents
Realization of processing-in-memory using binary and ternary quantum-dot cellular automataDehbozorgi et al., 2022
- Document ID
- 10373824292888034703
- Author
- Dehbozorgi L
- Sabbaghi-Nadooshan R
- Kashaninia A
- Publication year
- Publication venue
- The Journal of Supercomputing
External Links
Snippet
Abstract Processing-in-memory (PIM) is a computing paradigm through which computations and processing can be performed within the memory of a computer, server, or related devices. There are several ways to implement PIM architectures, but the combination of …
- 239000002096 quantum dot 0 title abstract description 26
Classifications
-
- 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
- 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/3004—Arrangements for executing specific machine instructions to perform operations on memory
-
- 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
- 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
-
- 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
- G06F15/78—Architectures of general purpose stored programme computers comprising a single central processing unit
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N99/00—Subject matter not provided for in other groups of this subclass
- G06N99/002—Quantum computers, i.e. information processing by using quantum superposition, coherence, decoherence, entanglement, nonlocality, teleportation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computer systems based on biological models
- G06N3/02—Computer systems based on biological models using neural network models
-
- 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
- G06F2217/00—Indexing scheme relating to computer aided design [CAD]
- G06F2217/78—Power analysis and optimization
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Asfestani et al. | A unique structure for the multiplexer in quantum-dot cellular automata to create a revolution in design of nanostructures | |
Rashidi et al. | High-performance multiplexer architecture for quantum-dot cellular automata | |
Walus et al. | Computer arithmetic structures for quantum cellular automata | |
Ma et al. | Reversible gates and testability of one dimensional arrays of molecular QCA | |
Heikalabad et al. | Content addressable memory cell in quantum-dot cellular automata | |
Sabbaghi-Nadooshan et al. | A novel QCA implementation of MUX-based universal shift register | |
Wang et al. | An energy-efficient nonvolatile in-memory computing architecture for extreme learning machine by domain-wall nanowire devices | |
Huang et al. | Tile-based QCA design using majority-like logic primitives | |
Khan et al. | Optimal demultiplexer unit design and energy estimation using quantum dot cellular automata | |
Dehbozorgi et al. | Realization of processing-in-memory using binary and ternary quantum-dot cellular automata | |
Naghibzadeh et al. | Design and simulation of a reversible ALU by using QCA cells with the aim of improving evaluation parameters | |
Moharrami et al. | Designing nanoscale counter using reversible gate based on quantum-dot cellular automata | |
Khan et al. | High performance nanocomparator: a quantum dot cellular automata-based approach | |
Angizi et al. | Hybrid spin-CMOS polymorphic logic gate with application in in-memory computing | |
Hasani et al. | A new design of a carry-save adder based on quantum-dot cellular automata | |
Seyedi et al. | New design of a 4-bit ripple carry adder on a nano-scale quantum-dot cellular automata | |
Gaur et al. | Reversible logic: An introduction | |
Alam et al. | Exact stochastic computing multiplication in memristive memory | |
Patidar et al. | An ultra-area-efficient ALU design in QCA technology using synchronized clock zone scheme | |
Ghadamgahi et al. | Novel ternary adders and subtractors in quantum cellular automata | |
Dehbozorgi et al. | Novel fault-tolerant processing in memory cell in ternary quantum-dot cellular automata | |
Lv et al. | Experimental demonstration of magnetic tunnel junction-based computational random-access memory | |
Thapliyal et al. | Reversible logic based design and test of field coupled nanocomputing circuits | |
Wu et al. | Quantum-based serial-parallel multiplier circuit using an efficient nano-scale serial adder | |
Kamrani et al. | A unique reversible gate in quantum-dot cellular automata for implementation of four flip-flops without garbage outputs |