CN107085452B - Three-dimensional printed memory (3D-P) based processor - Google Patents

Three-dimensional printed memory (3D-P) based processor Download PDF

Info

Publication number
CN107085452B
CN107085452B CN201610083747.7A CN201610083747A CN107085452B CN 107085452 B CN107085452 B CN 107085452B CN 201610083747 A CN201610083747 A CN 201610083747A CN 107085452 B CN107085452 B CN 107085452B
Authority
CN
China
Prior art keywords
processor
memory
unit
substrate
further characterized
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201610083747.7A
Other languages
Chinese (zh)
Other versions
CN107085452A (en
Inventor
张国飙
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Hangzhou Haicun Information Technology Co Ltd
Original Assignee
Hangzhou Haicun Information Technology Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Hangzhou Haicun Information Technology Co Ltd filed Critical Hangzhou Haicun Information Technology Co Ltd
Priority to CN202011513072.8A priority Critical patent/CN112631367A/en
Priority to CN201610083747.7A priority patent/CN107085452B/en
Priority to CN202011420165.6A priority patent/CN112328535B/en
Priority to US15/487,366 priority patent/US10763861B2/en
Priority to PCT/CN2017/080462 priority patent/WO2017137015A2/en
Publication of CN107085452A publication Critical patent/CN107085452A/en
Priority to US16/188,265 priority patent/US20190114170A1/en
Priority to US16/200,630 priority patent/US20190115922A1/en
Priority to US16/207,189 priority patent/US20190115923A1/en
Priority to US16/458,187 priority patent/US11080229B2/en
Priority to US16/693,370 priority patent/US10848158B2/en
Priority to US16/939,048 priority patent/US11966715B2/en
Priority to US17/065,604 priority patent/US11128302B2/en
Priority to US17/065,632 priority patent/US11128303B2/en
Application granted granted Critical
Publication of CN107085452B publication Critical patent/CN107085452B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H03ELECTRONIC CIRCUITRY
    • H03KPULSE TECHNIQUE
    • H03K19/00Logic circuits, i.e. having at least two inputs acting on one output; Inverting circuits
    • H03K19/02Logic circuits, i.e. having at least two inputs acting on one output; Inverting circuits using specified components
    • H03K19/173Logic circuits, i.e. having at least two inputs acting on one output; Inverting circuits using specified components using elementary logic circuits as components
    • H03K19/177Logic circuits, i.e. having at least two inputs acting on one output; Inverting circuits using specified components using elementary logic circuits as components arranged in matrix form
    • H03K19/17724Structural details of logic blocks
    • H03K19/17728Reconfigurable logic blocks, e.g. lookup tables
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F1/00Details not covered by groups G06F3/00 - G06F13/00 and G06F21/00
    • G06F1/02Digital function generators
    • G06F1/03Digital function generators working, at least partly, by table look-up
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F15/00Digital computers in general; Data processing equipment in general
    • G06F15/76Architectures of general purpose stored program computers
    • G06F15/78Architectures of general purpose stored program computers comprising a single central processing unit
    • G06F15/7839Architectures of general purpose stored program computers comprising a single central processing unit with memory
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F15/00Digital computers in general; Data processing equipment in general
    • G06F15/76Architectures of general purpose stored program computers
    • G06F15/78Architectures of general purpose stored program computers comprising a single central processing unit
    • G06F15/7839Architectures of general purpose stored program computers comprising a single central processing unit with memory
    • G06F15/7842Architectures of general purpose stored program computers comprising a single central processing unit with memory on one IC chip (single chip microcontrollers)
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F7/00Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/38Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation
    • G06F7/48Methods 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/483Computations with numbers represented by a non-linear combination of denominational numbers, e.g. rational numbers, logarithmic number system or floating-point numbers
    • G06F7/487Multiplying; Dividing
    • G06F7/4876Multiplying
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F7/00Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/38Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation
    • G06F7/48Methods 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/50Adding; Subtracting
    • G06F7/501Half or full adders, i.e. basic adder cells for one denomination
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F7/00Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/38Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation
    • G06F7/48Methods 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/52Multiplying; Dividing
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F7/00Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/38Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation
    • G06F7/48Methods 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/544Methods 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
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F7/00Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/38Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation
    • G06F7/48Methods 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/544Methods 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/548Trigonometric functions; Co-ordinate transformations
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F7/00Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/38Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation
    • G06F7/48Methods 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/544Methods 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/556Logarithmic or exponential functions

Abstract

The invention provides a processor based on a three-dimensional printed memory (3D-P). The 3D-P has large capacity and high speed, does not occupy the area of a substrate basically, and can be integrated on various logic circuits. Therefore, using 3D-P to store a look-up table (LUT) for a processor can increase processor speed and reduce chip area. In addition, after the LUTs based on the 3D-P are adopted in different types of calculation, the time spent by the LUTs is more structured, and sequential circuits can be realized between different types of calculation.

Description

Three-dimensional printed memory (3D-P) based processor
Technical Field
The present invention relates to the field of integrated circuits, and more particularly to processors.
Background
The processor needs to perform various complex calculations. Conventional processors are only efficient for conventional addition and conventional multiplication, but other computations take a large number of clock cycles to complete. To this end, the prior art proposes to use look-up tables (LUTs) to perform part of the calculations. For example, us patent 5,046,038 proposes implementing a divider with a LUT, us patent 5,954,787 proposes implementing a trigonometric function calculator with a LUT, us patent 6,263,470 proposes implementing a Reed-Solomon decoder with a LUT, and so on.
The implementation of an exponent unit using a LUT is described in detail in us patent 9,207,910 below. As shown in fig. 1A, the exponent unit employs two LUTs 210, 230. Wherein, the log (x) value 240 of the input x can be found by LUT a 210, then the value of log (x) is multiplied by K at the multiplier 220, and the resulting product 250 can be found by LUT B230 to find the exponent value 260 of x. The patent also discloses a digital processor DSP 200X that contains a plurality of parallel exponent units 200. sup. 1,2001-2 … 200-N, so that a plurality of inputs X are calculated simultaneously1,x2…xNIs used as an index of (1).
The above processors using LUTs all face a common problem, namely, the LUTs 210 and 230 use SRAM cells, which must be formed on a substrate, and the memory cells have a large area, and occupy a large amount of substrate resources. Therefore, the array size of the LUT employed in the prior art cannot be excessive. As described in patent 9,207,910, the size of a single LUT is typically limited to 32 kb. Therefore, in the prior art, the input variable of the LUT can only be a small word width, which results in a limited increase of the calculation speed of the LUT. When a processor employs a large number of parallel computations, these LUTs need to be repeated multiple times, which requires a large amount of substrate area to be consumed, increasing processor cost.
The prior art processors also suffer from the problem that, because the different types of computations employ very different logic circuits, the time they take to complete the computations can vary greatly. This makes it difficult for processors containing multiple computing types to pipeline these computations. This is detrimental to the overall improvement in system performance. Based on the above difficulties, it is necessary to find a large capacity, inexpensive memory to store the LUT for the processor.
Disclosure of Invention
It is a primary object of the present invention to provide a better performing processor.
It is a further object of this invention to provide such a processor which is less costly.
To achieve these and other objects, the present invention proposes a processor based on a three-dimensional printed memory (3D-P). The 3D-P is a kind of three-dimensional memory (3D-M), and the stored information is recorded in a non-electric mode in the factory production process, and the information is permanently fixed and generally can not be changed after being delivered from a factory.
Since the 3D-P memory cell does not need to be electrically programmed, all of the conductivity of its diode can be used to read the data stored in the cell. Therefore, the read circuit of 3D-P can be increased more than ten times compared to 3D-M which can be programmed. The read delay of 3D-P is on the order of 10 ns. If a small array is used (i.e., the number of word lines is less than 1024), the 3D-P read delay can be reduced to ns. Therefore, the 3D-P can meet the requirement of the processor on speed as an LUT memory.
The 3D-P adopts a cross point array, and the area of a memory cell of the cross point array is 4F2(F is the process feature size). And by adopting three-dimensional integration (8 layers or more than 8 layers can be stacked), the 3D-P capacity is far larger than that of an SRAM (the SRAM memory cell area is 50F)2100 times larger than the 3D-P memory element). After the 3D-P storage LUT is adopted, LUTs with the total data quantity of up to 1Tb can be stored on one processor chip. This means that the processor can carry a LUT with a large word width, which can greatly improve the performance of the processor.
More importantly, the 3D-P is located above the substrate circuitry, and the 3D-P occupies substantially no substrate area other than its peripheral circuitry. Thus, the 3D-P may be integrated on a variety of logic circuits. Therefore, 3D-P not only does not increase the processor chip area, but also reduces the chip area. This is not imaginable to the prior art. After the 3D-P is adopted as a carrier of the LUT, the method has the following significant advantages: no matter how complex the computation is, with LUTs, the different types of computation time are structured, i.e. their delays are substantially integer multiples of each other. This facilitates pipelining of complex computations.
Accordingly, the present invention provides a 3D-P based processor, comprising: a substrate, wherein the substrate comprises a substrate circuit, and the substrate circuit comprises at least one logic circuit and at least one peripheral circuit of the 3D-P; at least one printed memory reservoir stacked on the substrate, information of the printed memory reservoir being entered during production in a factory, the printed memory reservoir storing an LUT; the printed memory storage layer is coupled with the logic circuit through the peripheral circuit, and the logic circuit and the lookup table form a computing unit.
Drawings
FIG. 1A is a block circuit diagram of an exponent section of the prior art; fig. 1B is a digital processor based on the above-described exponent unit.
Fig. 2 is a cross-sectional view of a three-dimensional printed memory (3D-P).
Fig. 3 is a circuit diagram of a 3D-P array in the storage layer 16A.
FIG. 4 compares the I-V characteristics of two 3D-P memory cells.
FIG. 5 is a graph of read delay versus number of array word lines, n, for a 3D-P.
FIG. 6 is a top view of the substrate circuitry (i.e., the 3D-P array has been removed) of a 3D-P based index cell.
Fig. 7A is a circuit block diagram of a GF adder; fig. 7B is a 3D-P based GF adder, which is a top view of the substrate circuitry (i.e., the 3D-P array has been removed).
FIG. 8A is an exponential cell based DSP; fig. 8B is a DSP based on multiple computing units.
It is noted that the figures are diagrammatic and not drawn to scale. Dimensions and structures of parts in the figures may be exaggerated or reduced for clarity and convenience. The same reference numbers in different embodiments generally indicate corresponding or similar structures.
Detailed Description
FIG. 2 shows a three-dimensional printed memory (3D-P). It comprises a substrate circuit layer 0K and a plurality of memory layers 16A, 16B stacked on top of each other. The substrate circuit layer 0K contains the transistor 0t and its interconnect line 0 i. Wherein the transistor 0t is formed in a semiconductor substrate 0; the interconnect line 0i is located above the substrate 0. In this embodiment, to guarantee the speed of the substrate circuit 0K, the interconnect line 0i contains 3 (or more than 3) interconnect layers 0M1-0M 3. Each memory layer (e.g., 16A) contains a plurality of bit lines (e.g., 2a, in the y-direction), word lines (e.g., 1a, in the x-direction), and memory cells (e.g., 16 Aaa). The memory layer (e.g., 16A) is coupled to the substrate 0 through a contact via hole (e.g., 1 av). Here, the substrate circuit layer 0K contains peripheral circuits of a 3D-P array.
Fig. 2 also shows two types of 3D-P memory cells 16Aaa and 16 Baa. Each memory cell contains a diode 14. The diode 12 has the following broad characteristics: under the reading voltage, the resistance is small; when the applied voltage is less than the read voltage or in the opposite direction to the read voltage, the resistance is larger. The diode film may be a P-i-N diode or may be a metal oxide (e.g., TiO)2) Diodes, etc. Memory cell 16Baa is a low resistance memory cell (commonly referred to as a '1' memory cell); the memory cell 16Aaa is a high resistance memory cell (generally referred to as a '0' memory cell). The high resistance memory cell 16Aaa includes a layer of insulating film (or high resistance film) 12 more than the low resistance memory cell 16 Baa. As a simple example, the insulating film 12 may be a silicon dioxide film. Due to the presence of the high-resistance insulating film 12, the resistance of the high-resistance memory cell 16Aaa is much higher than that of the low-resistance memory cell 16 Baa. The information stored in the 3D-P can be input during factory production and cannot be rewritten after leaving the factory.
Fig. 3 is a circuit diagram of a 3D-P array in the storage layer 16A. In this figure, the presence of a diode represents a low resistance memory cell and the absence of a diode represents a high resistance memory cell. All address lines in the array are contiguous and do not share address lines with other memory arrays of the same memory layer. Accordingly, the 3D-P array has m bit lines and n word lines. In this embodiment, the number of word lines (n) is less than the number of bit lines (m); the bit lines are coupled to an X-decoder 15 and the word lines are coupled to a Y-decoder/sense circuit 17.
As can be seen from FIGS. 2 and 3, the 3D-P uses a cross-point array with 4F cell area2(F is the process feature size). And by adopting three-dimensional integration (8 layers or more than 8 layers can be stacked), the 3D-P capacity is far larger than that of an SRAM (the SRAM memory cell area is 50F)2100 times larger than the 3D-P memory element). After the 3D-P storage LUT is adopted, LUTs with the total data quantity of up to 1Tb can be stored on one processor chip. This means that the processor can carry a LUT with a large word width, which can greatly improve the performance of the processor.
More importantly, the 3D-P is located above the substrate circuitry, and the 3D-P occupies substantially no substrate area other than its peripheral circuitry. Thus, the 3D-P may be integrated on a variety of logic circuits. Therefore, 3D-P not only does not increase the processor chip area, but also reduces the chip area. This is not imaginable to the prior art.
FIG. 4 compares the I-V characteristics of two 3D-P bins ('0' and '1'). Since the 3D-P memory cells are programmed in a non-electrical manner, their '0' and '1' memory cells have different physical/chemical forms (cells 16Aaa and 16Baa of FIG. 2). In this example, the I-V curves for the '0' and '1' bins are very different. 3D-P reads are very different from programmable 3D-M (i.e., 3D-W). Since the 3D-W memory cell needs to be electrically programmed, its read voltage and read current are very limited. The 3D-P does not need electrical programming, and can adopt larger reading voltage V ″readThe read current I' thereofreadIs an order of magnitude greater than the read current of 3D-W. That is, the read latency of 3D-P is an order of magnitude less than 3D-W. Considering that the read latency of 3D-W is on the order of 100ns and the read latency of 3D-P is on the order of 10ns (assuming the same memory array, 1k x1k) (see patent application "three-dimensional memory based computing system").
FIG. 5 is a graph of read delay versus number of array word lines, n, for a 3D-P. The read delay of 3D-P is proportional to n. If the number of n is reduced from 1k to 100 levels lower (e.g., around 200), the read delay of 3D-P can be further reduced to ns level. This speed enables the 3D-P to act as a LUT memory to meet the speed requirements of the processor
Fig. 6 is a 3D-P based index cell 200, which is a top view of the substrate circuitry (i.e., the 3D-P array has been removed). In this figure, the printed reservoir of LUT a 210 (right slashed area) the printed reservoir of LUT B230 (left slashed area) covers multiplier 220. Input 270 selects the desired log value via X decoders 15A, 15A' of LUT a 210, and readout circuitry 17A outputs the existing log (X) value 240. After multiplying by K through the multiplier, the result 250 is sent to the X decoders 15B, 15B' of the LUT B230 to select the corresponding index value, and the final result 260 is obtained. Note that LUT a 210 and LUT B230 each have one side, and the substrate thereunder does not contain 3D-P peripheral circuits, which facilitates the routing of multiplier 220.
Fig. 7A is a circuit block diagram of a GF adder. The GF adder 300 is described in detail in U.S. patent application 2006/0123325a 1. Where the polynomial multiplier 310 multiplies X, Y, the first 7 bits 340 of the resulting product are sent to the LUT320 for mod computation, and the last 8 bits 360 are added to the mod computed value 350 at the adder 330 to obtain the final result Z.
Fig. 7B is a 3D-P based GF adder, which is a top view of the substrate circuitry (i.e., the 3D-P array has been removed). Similar to FIG. 6, the multi-hour multiplier 310 and the adder are both covered by a 3D-P array 320. The 3D-P array has one side, and the substrate below the 3D-P array does not contain peripheral circuits of 3D-P, so that the substrate logic circuit is convenient to interface with the outside.
FIG. 8A is a DSP 200X' based on exponent unit. It contains a plurality of parallel index units 200-1 ', 2001-2 ' … 200-N ', which all use 3D-P as the storage carrier of LUT and calculate a plurality of inputs x simultaneously1,x2…xNIs used as an index of (1). FIG. 8B is a DSP 200Z' based on multiple computing units. It contains various calculation units including an exponent unit 200 ', a GF multiplication unit 300, a division unit 400', etc. These calculation units all use 3D-P as a storage carrier for the LUT and perform parallel calculations. After 3D-P is adopted as a carrier of the LUT, the method has a remarkable advantage that: no matter how complex the calculation is, after using LUTThe different types of computation time are structured, i.e. their delays are substantially all integer multiples of each other. This facilitates pipelining of complex computations.
The 3D-P based processor provided by the invention has wide application, and the computing unit using the processor comprises: a multiplication unit, a division unit, a trigonometric function unit, an exponent unit, a logarithm unit, a GF multiplication unit, an error detection and correction ECC unit, an encryption unit, a decryption unit, or a function unit (the function unit may implement any function using LUT). It can be applied to various processors including: the system comprises a Central Processing Unit (CPU), a Field Programming Gate Array (FPGA), a digital processor (DSP), an image processor (GPU), a video processor (video processor) or a communication processor modem and the like.
It will be understood that changes in form and detail may be made therein without departing from the spirit and scope of the invention, and are not intended to impede the practice of the invention. The invention, therefore, is not to be restricted except in the spirit of the appended claims.

Claims (9)

1. A three-dimensional printed memory (3D-P) based processor, comprising:
a substrate having a substrate circuit thereon, said substrate circuit comprising at least one logic circuit and at least one peripheral circuit of said three-dimensional printed memory;
at least one printed memory reservoir stacked on the substrate and not contacting any substrate, information of the printed memory reservoir being entered during factory production and storing a look-up table (LUT), at least a portion of the printed memory reservoir covering at least a portion of the logic circuit;
the printed memory storage layer is coupled with the logic circuit through the peripheral circuit, and the logic circuit and the lookup table form a computing unit.
2. The processor of claim 1, further characterized by: the calculation unit at least comprises one of a multiplication unit, a division unit, a trigonometric function unit, an exponent unit, an logarithm unit, a GF multiplication unit, an error detection and correction (ECC) unit, an encryption unit, a decryption unit or a function unit.
3. The processor of claim 1, further characterized by: the processor is a central processing unit CPU, a field programming gate array FPGA, a digital processor DSP, an image processor GPU, a video processor or a communication processor modem.
4. The processor of claim 1, further characterized by: the printed memory reservoir contains a plurality of memory arrays, all address lines in each memory array being contiguous and not sharing address lines with other memory arrays of the same memory layer.
5. The processor of claim 4, further characterized by: the printed memory storage layer contains a memory array, and the substrate under at least one side of the memory array does not contain peripheral circuits of the memory array.
6. The processor of claim 5, further characterized by: includes adjacent first and second memory arrays overlying the logic circuit.
7. The processor of claim 1, further characterized by: at least a portion of the substrate circuitry contains at least three interconnect layers.
8. The processor of claim 1, further characterized by: the number of word lines of the printed memory reservoir is less than the number of bit lines thereof.
9. The processor of claim 1, further characterized by: the number of word lines of the printed memory reservoir is less than 1024.
CN201610083747.7A 2016-02-13 2016-02-13 Three-dimensional printed memory (3D-P) based processor Active CN107085452B (en)

Priority Applications (13)

Application Number Priority Date Filing Date Title
CN202011513072.8A CN112631367A (en) 2016-02-13 2016-02-13 Three-dimensional memory based processor
CN201610083747.7A CN107085452B (en) 2016-02-13 2016-02-13 Three-dimensional printed memory (3D-P) based processor
CN202011420165.6A CN112328535B (en) 2016-02-13 2017-04-13 Processor with three-dimensional memory array
US15/487,366 US10763861B2 (en) 2016-02-13 2017-04-13 Processor comprising three-dimensional memory (3D-M) array
PCT/CN2017/080462 WO2017137015A2 (en) 2016-02-13 2017-04-13 Processor containing three-dimensional memory array
US16/188,265 US20190114170A1 (en) 2016-02-13 2018-11-12 Processor Using Memory-Based Computation
US16/200,630 US20190115922A1 (en) 2016-02-13 2018-11-26 Processor For Implementing Mathematical Functions or Models
US16/207,189 US20190115923A1 (en) 2016-02-13 2018-12-03 Processor for Implementing Non-Arithmetic Functions
US16/458,187 US11080229B2 (en) 2016-02-13 2019-06-30 Processor for calculating mathematical functions in parallel
US16/693,370 US10848158B2 (en) 2016-02-13 2019-11-24 Configurable processor
US16/939,048 US11966715B2 (en) 2016-02-13 2020-07-26 Three-dimensional processor for parallel computing
US17/065,604 US11128302B2 (en) 2016-02-13 2020-10-08 Configurable processor doublet based on three-dimensional memory (3D-M)
US17/065,632 US11128303B2 (en) 2016-02-13 2020-10-08 Three-dimensional memory (3D-M)-based configurable processor singlet

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201610083747.7A CN107085452B (en) 2016-02-13 2016-02-13 Three-dimensional printed memory (3D-P) based processor

Related Child Applications (1)

Application Number Title Priority Date Filing Date
CN202011513072.8A Division CN112631367A (en) 2016-02-13 2016-02-13 Three-dimensional memory based processor

Publications (2)

Publication Number Publication Date
CN107085452A CN107085452A (en) 2017-08-22
CN107085452B true CN107085452B (en) 2021-01-15

Family

ID=59614015

Family Applications (3)

Application Number Title Priority Date Filing Date
CN201610083747.7A Active CN107085452B (en) 2016-02-13 2016-02-13 Three-dimensional printed memory (3D-P) based processor
CN202011513072.8A Pending CN112631367A (en) 2016-02-13 2016-02-13 Three-dimensional memory based processor
CN202011420165.6A Active CN112328535B (en) 2016-02-13 2017-04-13 Processor with three-dimensional memory array

Family Applications After (2)

Application Number Title Priority Date Filing Date
CN202011513072.8A Pending CN112631367A (en) 2016-02-13 2016-02-13 Three-dimensional memory based processor
CN202011420165.6A Active CN112328535B (en) 2016-02-13 2017-04-13 Processor with three-dimensional memory array

Country Status (1)

Country Link
CN (3) CN107085452B (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109545783A (en) * 2017-09-22 2019-03-29 成都海存艾匹科技有限公司 Three-dimensional computations chip containing three-dimensional memory array
CN112597098A (en) * 2018-12-10 2021-04-02 杭州海存信息技术有限公司 Discrete three-dimensional processor

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1434396A (en) * 1995-01-18 2003-08-06 惠普公司 Multivariate digital data converter
CN103594471A (en) * 2012-08-17 2014-02-19 成都海存艾匹科技有限公司 Three-dimensional writable printed memory
CN104205234A (en) * 2012-03-30 2014-12-10 英特尔公司 Generic address scrambler for memory circuit test engine
CN104298608A (en) * 2013-07-17 2015-01-21 英飞凌科技股份有限公司 Memory access by using address bit permutation

Family Cites Families (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1099695C (en) * 1998-09-24 2003-01-22 张国飙 Three-dimensional read-only memory
AU2002241918B2 (en) * 2001-01-16 2007-01-18 Gr Intellectual Reserve, Llc Enhanced data storage and retrieval devices and systems and methods for utilizing the same
US7509363B2 (en) * 2001-07-30 2009-03-24 Ati Technologies Ulc Method and system for approximating sine and cosine functions
CN101694841B (en) * 2004-11-05 2012-06-27 张国飙 Integrated circuit of three-dimension memory
US8273610B2 (en) * 2010-11-18 2012-09-25 Monolithic 3D Inc. Method of constructing a semiconductor device and structure
US20150317255A1 (en) * 2011-02-15 2015-11-05 Chengdu Haicun Ip Technology Llc Secure Printed Memory
CN103632699B (en) * 2012-08-22 2016-09-28 成都海存艾匹科技有限公司 Three-dimensional storage containing address/data converter chip
US9129859B2 (en) * 2013-03-06 2015-09-08 Intel Corporation Three dimensional memory structure
KR102051961B1 (en) * 2013-03-13 2019-12-17 삼성전자주식회사 Memory device and method of manufacturing the same
CN104392962B (en) * 2014-04-28 2017-06-13 中国科学院微电子研究所 Three-dimensional semiconductor device manufacture method

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1434396A (en) * 1995-01-18 2003-08-06 惠普公司 Multivariate digital data converter
CN104205234A (en) * 2012-03-30 2014-12-10 英特尔公司 Generic address scrambler for memory circuit test engine
CN103594471A (en) * 2012-08-17 2014-02-19 成都海存艾匹科技有限公司 Three-dimensional writable printed memory
CN104298608A (en) * 2013-07-17 2015-01-21 英飞凌科技股份有限公司 Memory access by using address bit permutation

Also Published As

Publication number Publication date
CN112328535A (en) 2021-02-05
CN112328535B (en) 2024-03-05
CN112631367A (en) 2021-04-09
CN107085452A (en) 2017-08-22

Similar Documents

Publication Publication Date Title
US20190102358A1 (en) Resistive random access memory matrix multiplication structures and methods
US20150347019A1 (en) Systems and methods for segmenting data structures in a memory system
US9734129B2 (en) Low complexity partial parallel architectures for Fourier transform and inverse Fourier transform over subfields of a finite field
US20100238705A1 (en) Nonvolatile memory device and method system including the same
TW201602900A (en) Memory module
US9274721B2 (en) Nonvolatile memory device and data management method thereof
US8327062B2 (en) Memory circuit and method for programming in parallel a number of bits within data blocks
KR101958727B1 (en) Permutational memory cells
CN107085452B (en) Three-dimensional printed memory (3D-P) based processor
KR20140090879A (en) Nonvolitile memory device and read method thereof
Kingra et al. Dual-configuration in-memory computing bitcells using SiOx RRAM for binary neural networks
CN108073523A (en) Arithmetical circuit and semiconductor devices
US11205681B2 (en) Memory for embedded applications
KR20190138702A (en) Refresh of memory based on the set margin
JP2006351061A (en) Memory circuit
Bae et al. Extension of two-port sneak current cancellation scheme to 3-D vertical RRAM crossbar array
US10438655B2 (en) Apparatuses and methods of distributing addresses in memory devices for mitigating write disturbance
US8054667B2 (en) Multilevel one-time programmable memory device
US20200302996A1 (en) Read and Logic Operation Methods for Voltage-Divider Bit-Cell Memory Devices
JP2012502526A (en) Method for obtaining elliptic curve with encryption support for encryption application, reconstruction method of elliptic curve, multiplication method of point on scalar and scalar
Ravi et al. Memristor‐based 2D1M architecture: Solution to sneak paths in multilevel memory
CN111033617B (en) Sensing operations in memory
JP6968975B2 (en) Program behavior in memory
US9460779B2 (en) Memory sensing method using one-time sensing table and associated memory device
Belay et al. Analysis of array biasing in crosspoint memories for leakage power minimization

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant