Patent Grant
11663005
The present disclosure relates generally to semiconductor memory apparatuses and methods, and more particularly, to apparatuses and methods related to vector population count determination in memory.
Memory devices are typically provided as internal, semiconductor, integrated circuits in computers or other electronic systems. There are many different types of memory including volatile and non-volatile memory. Volatile memory can require power to maintain its data (e.g., host data, error data, etc.) and includes random access memory (RAM), dynamic random access memory (DRAM), static random access memory (SRAM), synchronous dynamic random access memory (SDRAM), and thyristor random access memory (TRAM), among others. Non-volatile memory can provide persistent data by retaining stored data when not powered and can include NAND flash memory, NOR flash memory, and resistance variable memory such as phase change random access memory (PCRAM), resistive random access memory (RRAM), and magnetoresistive random access memory (MRAM), such as spin torque transfer random access memory (STT RAM), among others.
Electronic systems often include a number of processing resources (e.g., one or more processors), which may retrieve and execute instructions and store the results of the executed instructions to a suitable location. A processor can comprise a number of functional units (e.g., herein referred to as functional unit circuitry such as arithmetic logic unit (ALU) circuitry, floating point unit (FPU) circuitry, and/or a combinatorial logic block, for example, which can execute instructions to perform logical operations such as AND, OR, NOT, NAND, NOR, and XOR logical operations on data (e.g., one or more operands).
A number of components in an electronic system may be involved in providing instructions to the functional unit circuitry for execution. The instructions may be generated, for instance, by a processing resource such as a controller and/or host processor. Data (e.g., the operands on which the instructions will be executed to perform the logical operations) may be stored in a memory array that is accessible by the functional unit circuitry. The instructions and/or data may be retrieved from the memory array and sequenced and/or buffered before the functional unit circuitry begins to execute instructions on the data. Furthermore, as different types of operations may be executed in one or multiple clock cycles through the functional unit circuitry, intermediate results of the operations and/or data may also be sequenced and/or buffered.
In many instances, the processing resources (e.g., processor and/or associated functional unit circuitry) may be external to the memory array, and data can be accessed (e.g., via a bus between the processing resources and the memory array to execute instructions). Data can be moved from the memory array to registers external to the memory array via a bus.
The present disclosure includes apparatuses and methods related to vector population counting in memory. An example method comprises determining, using sensing circuitry, a vector population count of a number of fixed length elements of a vector stored in a memory array. A determination of a population count of a vector element can be performed in memory. For example, a determination of a vector population count can include determining a number of bits that are programmed to logical state 1, for example. Also, a determination of a vector population count can include determining a number of bits that are programmed to logical state 0, for example. For example, a determination of how many bits in a vector are programmed to a particular logical state. The determination of a vector population count can include performing a number of AND operations, shift operations, and invert operations without transferring data via an input/output (I/O) line, for example.
In a number of examples, an element can represent an object and/or other construct, which may be stored in memory as a bit-vector. As an example, a number of bits can be stored in memory cells coupled to a particular access line (e.g., a row) of a memory array as a vector. The vector can comprise a number of elements which may have fixed lengths (e.g., each element is the same length). For example, the elements are 2n bits in length, where n is a positive integer.
A number of embodiments of the present disclosure can provide a reduction of the number of computations and/or time involved in performing a determination of the vector population count for a plurality of fixed length elements relative to previous approaches. For instance, the number of computations and/or the time to perform a determination of a vector population count can be reduced by performing operations in memory in parallel (e.g., simultaneously). Performing a determination of a vector population count as described herein can also reduce power consumption as compared to previous approaches. In accordance with a number of embodiments, a determination of a vector population count can be performed on elements (e.g., data in the form of bit-vectors including elements of fixed length stored in an array) without transferring data out of the memory array and/or sensing circuitry via a bus (e.g., data bus, address bus, control bus, etc.). A determination of a vector population count can involve performing a number of operations (e.g., AND operations, OR operations, shift operations, invert operations, and BlockOR operations, etc.). However, embodiments are not limited to these examples.
In various previous approaches, fixed length elements may be transferred from the array and sensing circuitry to a number of registers via a bus comprising input/output (I/O) lines. The number of registers can be used by a processing resource such as a processor, microprocessor, and/or compute engine, which may comprise ALU circuitry and/or other functional unit circuitry configured to perform the appropriate logical operations. However, often only a single function can be performed by the ALU circuitry, and transferring data to/from memory from/to registers via a bus can involve significant power consumption and time requirements. Even if the processing resource is located on a same chip as the memory array, significant power can be consumed in moving data out of the array to the compute circuitry (e.g., ALU), which can involve performing a sense line address access (e.g., firing of a column decode signal) in order to transfer data from sense lines onto I/O lines, moving the data to the array periphery, and providing the data to a register in association with determining a vector population count, for instance.
In the following detailed description of the present disclosure, reference is made to the accompanying drawings that form a part hereof, and in which is shown by way of illustration how one or more embodiments of the disclosure may be practiced. These embodiments are described in sufficient detail to enable those of ordinary skill in the art to practice the embodiments of this disclosure, and it is to be understood that other embodiments may be utilized and that process, electrical, and/or structural changes may be made without departing from the scope of the present disclosure. As used herein, the designators “S,” “T,” “U,” “V,” “W,” etc., particularly with respect to reference numerals in the drawings, indicates that a number of the particular feature so designated can be included. As used herein, “a number of” a particular thing can refer to one or more of such things (e.g., a number of memory arrays can refer to one or more memory arrays).
The figures herein follow a numbering convention in which the first digit or digits correspond to the drawing figure number and the remaining digits identify an element or component in the drawing. Similar elements or components between different figures may be identified by the use of similar digits. For example, 231 may reference element “31” in
System 100 includes a host 110 coupled to memory device 120, which includes a memory array 130. Host 110 can be a host system such as a personal laptop computer, a desktop computer, a digital camera, a mobile telephone, or a memory card reader, among various other types of hosts. Host 110 can include a system motherboard and/or backplane and can include a number of processing resources (e.g., one or more processors, microprocessors, or some other type of controlling circuitry). The system 100 can include separate integrated circuits or both the host 110 and the memory device 120 can be on the same integrated circuit. The system 100 can be, for instance, a server system and/or a high performance computing (HPC) system and/or a portion thereof. Although the example shown in
For clarity, the system 100 has been simplified to focus on features with particular relevance to the present disclosure. The memory array 130 can be a DRAM array, SRAM array, STT RAM array, PCRAM array, TRAM array, RRAM array, NAND flash array, and/or NOR flash array, for instance. The array 130 can comprise memory cells arranged in rows coupled by access lines (which may be referred to herein as word lines or select lines) and columns coupled by sense lines (which may be referred to herein as digit lines or data lines). Although a single array 130 is shown in
The memory device 120 includes address circuitry 142 to latch address signals provided over an I/O bus 156 (e.g., a data bus) through I/O circuitry 144. Address signals are received and decoded by a row decoder 146 and a column decoder 152 to access the memory array 130. Data can be read from memory array 130 by sensing voltage and/or current changes on the sense lines using sensing circuitry 150. The sensing circuitry 150 can read and latch a page (e.g., row) of data from the memory array 130. The I/O circuitry 144 can be used for bi-directional data communication with host 110 over the I/O bus 156. The write circuitry 148 is used to write data to the memory array 130.
Controller 140 decodes signals provided by control bus 154 from the host 110. These signals can include chip enable signals, write enable signals, and address latch signals that are used to control operations performed on the memory array 130, including data read, data write, and data erase operations. In various embodiments, the control circuitry 140 is responsible for executing instructions from the host 110. The controller 140 can be a state machine, a sequencer, or some other type of controller.
An example of the sensing circuitry 150 is described further below in association with
In various previous approaches, data associated with a determination of a length of an element, for instance, would be read from memory via sensing circuitry and provided to an external ALU (e.g., via a bus). The external ALU circuitry would be used to perform the vector population count determination using the elements (which may be referred to as operands or inputs) and the result could be transferred back to the array via the local I/O lines. In contrast, in a number of embodiments of the present disclosure, sensing circuitry (e.g., 150) is configured to perform a determination of a vector population count on data stored in memory cells in memory array 130 and store the result back to the array 130 without enabling a local I/O line coupled to the sensing circuitry.
As such, in a number of embodiments, registers and/or an ALU external to array 130 and sensing circuitry 150 may not be needed to perform the vector population count determination as the sensing circuitry 150 can be operated to perform the appropriate operations involved in performing the vector population count determination using the address space of memory array 130. Additionally, the determination of the vector population count can be performed without the use of an external processing resource.
Memory cells can be coupled to different data lines and/or word lines. For example, a first source/drain region of a transistor 202-3 can be coupled to data line 205-1 (D), a second source/drain region of transistor 202-3 can be coupled to capacitor 203-3, and a gate of a transistor 202-3 can be coupled to word line 204-Y. A first source/drain region of a transistor 202-4 can be coupled to data line 205-2 (D_), a second source/drain region of transistor 202-4 can be coupled to capacitor 203-4, and a gate of a transistor 202-4 can be coupled to word line 204-X. The cell plate, as shown in
The memory array 230 is coupled to sensing circuitry 250-1, 250-2, 250-3, etc., in accordance with a number of embodiments of the present disclosure. Sensing circuitry comprises a sense amplifier and a compute component corresponding to respective columns of memory cells (e.g., coupled to respective pairs of complementary data lines). In this example, the sensing circuitry 250-1 comprises a sense amplifier 206-1 and a compute component 231-1 corresponding to respective columns of memory cells (e.g., memory cells 201-1 and 201-2 coupled to respective pairs of complementary data lines). Sensing circuitry 250-2 comprises a sense amplifier 206-2 and a compute component 231-2 corresponding to respective columns of memory cells (e.g., memory cells 201-3 and 201-4 coupled to respective pairs of complementary data lines). Sensing circuitry 250-3 comprises a sense amplifier 206-3 and a compute component 231-3 corresponding to respective columns of memory cells (e.g., memory cells 201-5 and 201-6 coupled to respective pairs of complementary data lines). A sense amplifier (e.g., sense amplifier 206-1) can comprise a cross coupled latch, which can be referred to herein as a primary latch. The sense amplifier (e.g., sense amplifier 206-1) can be configured, for example, as described with respect to
In the example illustrated in
In this example, data line D 205-1 can be coupled to a first source/drain region of transistors 216-1 and 239-1, as well as to a first source/drain region of load/pass transistor 218-1. Data line D_ 205-2 can be coupled to a first source/drain region of transistors 216-2 and 239-2, as well as to a first source/drain region of load/pass transistor 218-2.
The gates of load/pass transistor 218-1 and 218-2 can be commonly coupled to a LOAD control signal, or respectively coupled to a PASSD/PASSDB control signal, as discussed further below. A second source/drain region of load/pass transistor 218-1 can be directly coupled to the gates of transistors 216-1 and 239-2. A second source/drain region of load/pass transistor 218-2 can be directly coupled to the gates of transistors 216-2 and 239-1.
A second source/drain region of transistor 216-1 can be directly coupled to a first source/drain region of pull-down transistor 214-1. A second source/drain region of transistor 239-1 can be directly coupled to a first source/drain region of pull-down transistor 207-1. A second source/drain region of transistor 216-2 can be directly coupled to a first source/drain region of pull-down transistor 214-2. A second source/drain region of transistor 239-2 can be directly coupled to a first source/drain region of pull-down transistor 207-2. A second source/drain region of each of pull-down transistors 207-1, 207-2, 214-1, and 214-2 can be commonly coupled together to a reference voltage (e.g., ground (GND)). A gate of pull-down transistor 207-1 can be coupled to an AND control signal line, a gate of pull-down transistor 214-1 can be coupled to an ANDinv control signal line 213-1, a gate of pull-down transistor 214-2 can be coupled to an ORinv control signal line 213-2, and a gate of pull-down transistor 207-2 can be coupled to an OR control signal line.
The gate of transistor 239-1 can be referred to as node S1, and the gate of transistor 239-2 can be referred to as node S2. The circuit shown in
The configuration of compute component 231-2 shown in
Inverting transistors can pull-down a respective data line in performing certain logical operations. For example, transistor 216-1 (having a gate coupled to S2 of the dynamic latch) in series with transistor 214-1 (having a gate coupled to an ANDinv control signal line 213-1) can be operated to pull-down data line 205-1 (D), and transistor 216-2 (having a gate coupled to S1 of the dynamic latch) in series with transistor 214-2 (having a gate coupled to an ANDinv control signal line 213-2) can be operated to pull-down data line 205-2 (D_).
The latch 264 can be controllably enabled by coupling to an active negative control signal line 212-1 (COMP_COMPB) and an active positive control signal line 212-2 (COMP_COMP) rather than be configured to be continuously enabled by coupling to ground and VDD. In various embodiments, load/pass transistors 208-1 and 208-2 can each have a gate coupled to one of a LOAD control signal or a PASSD/PASSDB control signal.
According to some embodiments, the gates of load/pass transistors 218-1 and 218-2 can be commonly coupled to a LOAD control signal. In the configuration where the gates of load/pass transistors 218-1 and 218-2 are commonly coupled to the LOAD control signal, transistors 218-1 and 218-2 can be load transistors. Activating the LOAD control signal causes the load transistors to conduct, and thereby load complementary data onto nodes S1 and S2. The LOAD control signal can be elevated to a voltage greater than VDD to pass a full VDD level to S1/S2. However, the LOAD control signal need not be elevated to a voltage greater than VDD is optional, and functionality of the circuit shown in
According to some embodiments, the gate of load/pass transistor 218-1 can be coupled to a PASSD control signal, and the gate of load/pass transistor 218-2 can be coupled to a PASSDB control signal. In the configuration where the gates of transistors 218-1 and 218-2 are respectively coupled to one of the PASSD and PASSDB control signals, transistors 218-1 and 218-2 can be pass transistors. Pass transistors can be operated differently (e.g., at different times and/or under different voltage/current conditions) than load transistors. As such, the configuration of pass transistors can be different than the configuration of load transistors.
Load transistors are constructed to handle loading associated with coupling data lines to the local dynamic nodes S1 and S2, for example. Pass transistors are constructed to handle heavier loading associated with coupling data lines to an adjacent Comp_Compulator (e.g., through the shift circuitry 223-2 in memory array 230, as shown in
In a number of embodiments, the compute component 231-2, including the latch 264, can comprise a number of transistors formed on pitch with the transistors of the corresponding memory cells of an array (e.g., array 230 shown in
The voltages or currents on the respective data lines D and D_ can be provided to the respective latch inputs 217-1 and 217-2 of the cross coupled latch 264 (e.g., the input of the secondary latch). In this example, the latch input 217-1 is coupled to a first source/drain region of transistors 208-1 and 209-1 as well as to the gates of transistors 208-2 and 209-2. Similarly, the latch input 217-2 can be coupled to a first source/drain region of transistors 208-2 and 209-2 as well as to the gates of transistors 208-1 and 209-1.
In this example, a second source/drain region of transistor 209-1 and 209-2 is commonly coupled to a negative control signal line 1312-1 (e.g., ground (GND) or COMP_COMPB control signal similar to control signal RnIF shown in
The enabled cross coupled latch 264 operates to amplify a differential voltage between latch input 217-1 (e.g., first common node) and latch input 217-2 (e.g., second common node) such that latch input 217-1 is driven to either the activated positive control signal voltage (e.g., VDD) or the activated negative control signal voltage (e.g., ground), and latch input 217-2 is driven to the other of the activated positive control signal voltage (e.g., VDD) or the activated negative control signal voltage (e.g., ground).
As shown in
In the example illustrated in
Although the shift circuitry 223-2 shown in
Embodiments of the present disclosure are not limited to the configuration of shift circuitry 223-2 shown in
Although not shown in
In a number of embodiments, a sense amplifier (e.g., 206) can comprise a number of transistors formed on pitch with the transistors of the corresponding compute component 231-2 and/or the memory cells of an array (e.g., 230 shown in
The voltages or currents on the respective data lines D and D_ can be provided to the respective latch inputs 233-1 and 233-2 of the cross coupled latch 215 (e.g., the input of the secondary latch). In this example, the latch input 233-1 is coupled to a first source/drain region of transistors 227-1 and 229-1 as well as to the gates of transistors 227-2 and 229-2. Similarly, the latch input 233-2 can be coupled to a first source/drain region of transistors 227-2 and 229-2 as well as to the gates of transistors 227-1 and 229-1. The compute component 231-2, which may be referred to herein as an Comp_Compulator, can be coupled to latch inputs 233-1 and 233-2 of the cross coupled latch 215 as shown; however, embodiments are not limited to the example shown in
In this example, a second source/drain region of transistor 227-1 and 227-2 is commonly coupled to an active negative control signal 228 (RnIF). A second source/drain region of transistors 229-1 and 229-2 is commonly coupled to an active positive control signal 290 (ACT). The ACT signal 290 can be a supply voltage (e.g., VDD) and the RnIF signal can be a reference voltage (e.g., ground). Activating signals 228 and 290 enables the cross coupled latch 215.
The enabled cross coupled latch 215 operates to amplify a differential voltage between latch input 233-1 (e.g., first common node) and latch input 233-2 (e.g., second common node) such that latch input 233-1 is driven to one of the ACT signal voltage and the RnIF signal voltage (e.g., to one of VDD and ground), and latch input 233-2 is driven to the other of the ACT signal voltage and the RnIF signal voltage.
The sense amplifier 206 can also include circuitry configured to equilibrate the data lines D and D_ (e.g., in association with preparing the sense amplifier for a sensing operation). In this example, the equilibration circuitry comprises a transistor 224 having a first source/drain region coupled to a first source/drain region of transistor 225-1 and data line D 205-1. A second source/drain region of transistor 224 can be coupled to a first source/drain region of transistor 225-2 and data line D_ 205-2. A gate of transistor 224 can be coupled to gates of transistors 225-1 and 225-2.
The second source drain regions of transistors 225-1 and 225-2 are coupled to an equilibration voltage 238 (e.g., VDD/2), which can be equal to VDD/2, where VDD is a supply voltage associated with the array. The gates of transistors 224, 225-1, and 225-2 can be coupled to control signal 225 (EQ). As such, activating EQ enables the transistors 224, 225-1, and 225-2, which effectively shorts data line D to data line D_ such that the data lines D and D_ are equilibrated to equilibration voltage VDD/2. According to a number of embodiments of the present disclosure, a number of logical operations can be performed using the sense amplifier 206 and compute component 231-2, and the result can be stored in the sense amplifier and/or compute component.
The sensing circuitry 250 can be operated in several modes to perform logical operations, including a first mode in which a result of the logical operation is initially stored in the sense amplifier 206, and a second mode in which a result of the logical operation is initially stored in the compute component 231-2. Additionally with respect to the first operating mode, sensing circuitry 250 can be operated in both pre-sensing (e.g., sense amps fired before logical operation control signal active) and post-sensing (e.g., sense amps fired after logical operation control signal active) modes with a result of a logical operation being initially stored in the sense amplifier 206.
As described further below, the sense amplifier 206 can, in conjunction with the compute component 231-2, be operated to perform various logical operations using data from an array as input. In a number of embodiments, the result of a logical operation can be stored back to the array without transferring the data via a data line address access (e.g., without firing a column decode signal such that data is transferred to circuitry external from the array and sensing circuitry via local I/O lines). As such, a number of embodiments of the present disclosure can enable performing various operations (e.g., logical operations, mathematical operations, etc.) using less power than various previous approaches. Additionally, since a number of embodiments eliminate the need to transfer data across I/O lines in order to perform operations (e.g., between memory and discrete processor), a number of embodiments can enable an increased parallel processing capability as compared to previous approaches.
Each column of memory cells can be coupled to sensing circuitry (e.g., sensing circuitry 150 shown in
The memory cells 303 can store a number of bit-vectors. For example, cells 303-0 to 303-31 can store a 32-bit bit-vector. An example 32-bit bit-vector can include bit-vector [0111 0101, 0000 0111, 0101 0000, 0101 0101]. The notation of commas in the provided example bit-vector indicates a separation of elements in the bit-vector. For example, each of the elements are eight (8) bits in length, wherein each element is separated by a comma. The example 32-bit source bit-vector includes 4 elements. The first element [0111 0101] can be stored in cells 303-0 to 303-7 and represent a numerical base sixteen (16) value of 75. The second element [0000 0111] can be stored in cells 303-8 to 303-15 and represent a numerical base sixteen (16) value of 7. The third element [0101 0000] can be stored in cells 303-16 to 303-23 and represent a numerical base sixteen (16) value of 50. The fourth element [0101 0101] can be stored in cells 303-24 to 303-31 and represent a base sixteen (16) numerical value of 55. However, embodiments are not so limited. The example 32-bit bit-vector is provided as an example for illustrative purposes and bit-vectors are not limited to such values.
In a number of embodiments, the sensing circuitry (e.g., compute components 331 and sense amplifiers 306) is configured to perform a determination of a vector population count of a number of elements stored in array 301. As an example, a first element of a plurality of fixed length elements can be stored in a first group of memory cells (e.g., cells 303-0 to 303-7) coupled to a particular access line (e.g., 304-0) and to a first number of sense lines (e.g., 305-0 to 305-7), a second element of the plurality of fixed length elements can be stored in a second group of memory cells (e.g., cells 303-8 to 303-15) coupled to the access line (e.g., 304-0) and a second number of sense lines (e.g., 305-8 to 305-15), a third element of the plurality of fixed length elements can be stored in a third group of cells (e.g., cells 303-16 to 303-23) coupled to the access line (e.g., 304-0) and a third number of sense lines (e.g., 305-16 to 305-23), and a fourth element of the plurality of fixed length elements can be stored in a fourth group of memory cells (e.g., cells 303-24 to 303-31) coupled to the access line (e.g., 304-0) and a fourth number of sense lines (e.g., 305-24 to 305-31). While the example illustrates a fixed length of 8 bits for each of the elements, embodiments are not so limited. The fixed length elements can be 2n in length, where n is a positive integer. For example, each element in a vector can be a fixed length and there can be any number of elements in a vector.
An example determination of a vector population count is described below in association with
The example described in association with
The element mask in the example described in
In this example, the bit-vectors Temp_Lookup 433, Reduction 435, Elem_Mask 437, and Destination 439 have a length of 32 bits. In this example, the four elements represented by the Elem_Mask 437 each have a fixed length. For instance, each of the four elements are represented by a respective 8-bits (e.g., each of the four elements comprise 8 bits). It is noted that although hexadecimal notation is used in
As described further below, the result of a determination of a vector population count can be stored as a bit-vector and/or a data value in a particular group of memory cells (e.g., as Destination bit-vector 439). For instance, in the example of
As described further below, the bit vectors 433 (Temp_Lookup), 435 (Reduction), 437 (Elem_Mask), and 439 (Destination) can be used in association with determining a population count of a source bit-vector (e.g., the 32-bit example bit-vector including a plurality of fixed length elements). The bit-vectors 433, 435, 437, and 439 can be stored in respective groups of memory cells coupled to particular access lines, which may be referred to as temporary storage rows (e.g., rows storing data that may be updated during various phases of a vector population count determination and may not be accessible to a user).
In the example described in association with
In a number of examples, a determination of a vector population count includes performing a number of AND operations, shift operations, invert operations, and BlockOR operations. The determination includes performing the AND operations, shift operations, and invert operations without transferring data via an input/output (I/O) line to determine a vector population count. The number of AND operations, invert operations, and shift operations can be performed using sensing circuitry on pitch with each of a number of columns of complementary sense lines.
In a number of embodiments, a “BlockOR” operation can be performed in association with determining whether one or more (e.g., any) of the compute components (e.g., 331-0 to 331-X) and/or sense amplifiers (e.g., 306-0 to 306-U) coupled to a particular group of sense lines (e.g., 305-0 to 305-S) store a particular data value (e.g., a “1” or a “0”). For example, determining whether any of the compute components 331-0 to 331-31 coupled to sense lines 305-0 to 305-31 store a particular data value can include charging (e.g., precharging) a local I/O line such as local I/O line 334 shown in
Transferring the voltages corresponding to the data latched in the selected compute components 331-0 to 331-31 can include activating (e.g., in parallel) the column decode lines (e.g., column decode lines 310-0 to 310-W in
As an example, to determine whether one or more of the selected compute components 331-0 to 331-31 stores (e.g., latches) a data value of “1” (e.g., a logic 1 which can be represented by a supply voltage Vcc), the I/O line (e.g., I/O line 334) can be precharged to a ground voltage (e.g., 0V, which can represent a latched data value of “0”). The corresponding column decode lines 310-0 to 310-31 can be activated, and if one or more of the selected compute components 331-0 to 331-31 stores a logic 1 (e.g., Vcc), then the SSA (e.g., SSA 312) can sense a pull up (e.g., increase) of the voltage on the I/O line (e.g., I/O line 334) which indicates that at least one of the selected compute components 331-0 to 331-31 stores a “1,” which can be indicated by the BlockOR operation returning a “true” bit (e.g., “1”). In this example, if none of the compute components 331-0 to 331-31 stored a “1,” then the voltage on the I/O line would not be pulled up, which can be indicated by the BlockOR operation returning a false bit (e.g., “0”).
Alternatively, to determine whether one or more of the selected compute components 331-0 to 331-31 stores (e.g., latches) a data value of “0,” the I/O line (e.g., I/O line 334) can be pre-charged to a supply voltage (e.g., Vcc). The corresponding column decode lines 310-0 to 310-31 can be activated, and if one or more of the selected compute components 331-0 to 331-31 stores a logic 0 (e.g., 0V), then the SSA (e.g., SSA 312) can sense a pull down (e.g., decrease) of the voltage on the I/O line (e.g., I/O line 334) which indicates that at least one of the selected compute components 331-0 to 331-31 stores a “0.”
The determination of whether one or more compute components (e.g., 331-0 to 331-X) and/or sense amplifiers (e.g., 306-0 to 306-U) coupled to selected column decode lines (e.g., column decode lines 310-0 to 310-W) stores a particular data value (e.g., a data value of “1”) is effectively performing a logic “OR” operation (e.g., since the operation returns a “1” if any of the data values are “1” and the operation returns a “0” only if all of the data values are “0”), which is why the operation may be referred to as a “BlockOR” operation. Embodiments of the present disclosure are not limited to particular pre-charge voltages of the local I/O line and/or to particular voltage values corresponding to logic “1” and logic “0”.
The pseudo code below represents instructions executable to perform a number of operations to determine a vector population count in a memory in accordance with a number of embodiments of the present disclosure. A first portion of the pseudo code can include:
The first portion of the pseudo code listed above is associated with initializing a number of groups of memory cells for use as temporary storage rows. Initializing refers to designating and/or assigning particular access lines used to store particular bit-vectors for performing the vector population count determination. For example, the number of groups of memory cells can be initialized and/or designated groups of cells coupled to respective access lines (e.g., rows) that store data (e.g., on a temporary basis) in association with performing the vector population count determination. For example, a first group of memory cells can be coupled to a particular access line (e.g., 304-R, illustrated as ROW N) and can store a bit-vector referred to as a “Temp_Lookup” bit-vector. A second group of memory cells can be coupled to another access line (e.g., an additional access line also designated by 304-R but in addition to the initialized row for the Temp_Lookup bit-vector above) and can store a bit-vector referred to as a “Reduction” bit-vector. A third group of memory cells can be coupled to another access line (e.g., an additional access line also designated by 304-R but in addition to the initialized row for the Temp_Lookup and Reduction bit-vectors above) and can store a bit-vector referred to as an “Elem_Mask” bit-vector. A fourth group of memory cells can be coupled to another access line (e.g., an additional access line also designated by 304-R but in addition to the initialized row for the Temp_Lookup, Reduction, and Elem_Mask bit-vectors above) and can store a bit-vector referred to as a “Destination” bit-vector. Embodiments are not limited to a particular number of temporary storage rows and/or to storage of the corresponding bit-vectors on particular access lines. Also, although the groups of memory cells used to store bit-vectors may be referred to as “rows,” the respective groups of memory cells may comprise fewer than all of the cells coupled to a particular access line. Furthermore, in a number of embodiments, temporary storage rows can refer to access lines which may not be addressable by a user (e.g., access lines that are outside of a user-addressable address space).
Also, the first portion pseudo code listed above (e.g., “Calculate Number of Iterations”) is associated with determining how many comparison iterations to perform, wherein each iteration compares 2I bits of the element. Therefore a first iteration compares the first 21=2 bits of an element in the vector, a second iteration compares the first 22=4 bits of an element in the vector, and a third iteration compares the first 23=8 bits of an element in the vector, and so on, for example. Calculating the number of iterations includes taking the loge of the element size, since the element size is 2n, the number of iterations will be loge 2n=n and, for example, a vector population count determination having 16 bit elements would include performing 4 iterations.
A second portion of the pseudo code can be associated with obtaining an element mask and includes:
The second portion of the pseudo code above illustrates obtaining an element mask, which represents a most significant bit of each of the elements of the number of fixed length elements. As an example, a bit pattern comprising a “1” in a MSB position and all “0s” in the remaining bit positions can be used to indicate the MSBs of the constituent elements of a source bit-vector (e.g., example 32-bit bit-vector described above). Obtaining the element mask includes a number of steps, corresponding to pseudo code above. Set Comp_Comp corresponds to the setting the latches of the compute components to all logical l's. Shift Comp_Comp Right by 1 corresponds to the shifting of the bits of Comp_Comp to the right by 1 place. Load Comp_Comp and Reduction with Inverse of Comp_Comp corresponds to the taking the inverse of the shifted vector in Comp_Comp and storing the inverse of the Comp_Comp in the Comp_Comp and in Reduction. Shift Comp_Comp Right by Element Width and Perform OR Operation with Comp_Comp and Reduction corresponds to shifting the Comp_Comp by the element width and performing an OR operation with the vector stored in Reduction. The process of shifting by the element width and performing the OR operation is done a number of times until the values of the Comp_Comp vector have been shifted through the entire vector. Once the values of the Comp_Comp vector have been shifted through the entire vector, then next step in the pseudo code can be performed. Load Comp_Comp in Elem_Mask and Reduction corresponds to loading the vector from the Comp_Comp, which is the element mask that has been calculated according to the pseudo code listed described, into Elem_Mask and Reduction. These vectors in Elem_Mask and Reduction will be used during the third portion of the pseudo code, which will be described below.
The remaining portions of the pseudo code, the third, fourth, and fifth portions, described below can be performed a number of times. The pseudo code below can be performed as part of each iteration in determining a vector population count. For example, the pseudo code below can be performed as part of a first iteration and the output from the first iteration can be used while performing the pseudo code below as part of a second iteration, and so on, until all the iterations are complete and the output of the final iteration is the vector population count.
A third portion of the pseudo code can be associated with obtaining a reduction bit-vector and includes:
The third portion of the pseudo code above illustrates obtaining a reduction bit-vector. Load Elem_Mask in Reduction corresponds to loading Reduction with the element mask and Load Elem_Mask in Comp_Comp corresponds to loading Comp_Comp with the element mask. Each iteration that includes the pseudo code above includes calculating the shift that can be performed for the iteration, which corresponds to 2I-1. A first loop of shifting the vector in the Comp_Comp and performing an OR operation with the vector in the Reduction can be performed. Each iteration includes performing the first loop from c to the c=2. A second loop of shifting the vector in the Comp_Comp by 2*I, and performing an OR operation with the vector in Temp_Lookup. Each iteration includes determining the reduction vector width, which is 2I, and the efficient ratio, which is the element size divided by the reduction vector width. Each iteration includes performing the second loop from c to the efficient ratio.
Load Elem_Mask in Reduction corresponds to loading the element mask in Temp_Lookup and Shift Comp_Comp Right by 2I-1 corresponds to shifting the bits of the element mask stored in Comp_Comp to the right by 2I-1 places. Perform OR operation with Comp_Comp and Reduction corresponds to performing an OR operation with the vectors in Comp_Comp and Reduction. Load Comp_Comp in Temp_Lookup corresponds to loading the result of the OR operation of the vectors in Comp_Comp and Reduction discussed above in Temp_Lookup. Shift Comp_Comp Right by 2*I corresponds to shifting the vector stored in Comp_Comp to the right 2*I places. Perform OR operation with Comp_Comp and Temp_Lookup corresponds to performing an OR operation with the vectors in Comp_Comp and Temp_Lookup. Load Comp_Comp in Reduction corresponds to loading the result of the OR operation of the vectors in Comp_Comp and Temp_Lookup discussed above in Reduction, which is the reduction bit-vector for an iteration of the pseudo code above.
A fourth portion of the pseudo code can be associated with obtaining a pattern mask and includes:
The fourth portion of the pseudo code above illustrates obtaining a pattern mask. The pattern mask can include a first portion and a second portion. Determining the first portion of the pattern mask includes Perform AND Operation with Comp_Comp and Destination, which corresponds to performing an AND operation with the reduction vector and the destination. For a first iteration, the destination is the source vector for the vector population count determination and for each subsequent iteration the destination is the output of the previous iteration. Shift Comp_Comp Right by 2I-1 corresponds to shifting the result of the AND operation with the reduction vector and source vector that is stored in Comp_Comp to the right 2I-1 places. When generating the first portion of the pattern mask, the vector in the Comp_Comp that resulted from performing an AND operation with the reduction vector and the destination is shifted 2I-1 places. Load Comp_Comp in Temp_Lookup corresponds to loading the shifted vector from Comp_Comp to Temp_Lookup which is the first portion of the pattern mask.
Determining the second portion of the pattern mask includes Load Inverse of Reduction in Comp_Comp, which corresponds to loading the inverse of Reduction in Comp_Comp. Perform AND Operation with Comp_Comp and Destination corresponds to performing an AND operation with the inverse of the reduction vector for the first iteration and the destination For a first iteration, the destination is the source vector for the vector population count determination and for each subsequent iteration the destination is the output of the previous iteration. Load Comp_Comp in Destination corresponds to loading the result of the AND operation from the inverse of the reduction vector and the destination to Destination, which is the second portion of the pattern mask.
A fifth portion of the pseudo code can be associated with performing a half add operation of the first and second portions of a pattern mask and includes:
The fifth portion of the pseudo code above illustrates obtaining an output for an iteration of the pseudo code by performing a half add operation with the first and second portions of the pattern mask. Perform a Half Add operation with Comp_Comp and Destination corresponds to performing a Half Add operation of the first portion of the pattern mask in Comp_Comp and the second portion of the pattern mask in Destination. The sum portion of the half add operation is stored in Destination and the carry portion of the half add operation is stored in Comp_Comp. Comp_Comp Left by 1 corresponds to shifting the carry of the half add operation described above to the left by 1. Check for Carry Values in Comp_Comp corresponds to checking for any carry values that remain in the Comp_Comp after a half add and shift is performed. A BlockOR operation may be performed to check if carry values remain in the Comp_Comp. In this example, the BlockOR operation is determining whether a data value of “1” is stored in at least one compute component. If there are carry values remaining in the Comp_Comp, as indicated by the BlockOR operation, then a number of half add and shift operations are performed until carry values are no longer remaining in the Comp_Comp. An iteration is complete when there are no longer carry values in the Comp_Comp and the Destination is the output for the iteration.
The steps below represent an example of performing the pseudo code associated with determining a vector population count in a memory in accordance with a number of embodiments of the present disclosure. The example is referenced using reference numbers 1-7, which correspond to the reference numbers of the rows shown in the tables of
1. Obtain Temp Rows
2. Calculate Number of Iterations
3. Obtain Elem_Mask
4. Load Source Vector in Destination
5. Perform First Iteration
6. Perform Second Iteration
7. Perform Third Iteration
For purposes of discussion, the example above will be divided into a setup phase and a determination phase associated with determining a vector population count. The steps referenced by reference numbers 1-4 can correspond to the setup phase. In the example illustrated in
Rows 451-1 to 451-4 of the table in
Reference number 2 (e.g., “Calculate Number of Iterations”) of the example above is associated with determining how many comparison iterations to perform in the example, wherein each iteration compares 2I bits of the element. Therefore the first iteration compares the first 21=2 bits of an element in the vector, the second iteration compares the first 22=4 bits of an element in the vector, and the third iteration compares the first 23=8 bits of an element in the vector, and so on, for example. Calculating the number of iterations includes taking the loge of the element size. In the example illustrated in
Reference number 3 (e.g., “Obtain Elem_Mask”) of the example above is associated with calculation of an elemental mask (e.g., [0x80808080]) and storing the elemental mask as the Elem_Mask bit-vector 437. The Elem_Mask 437 represents a most significant bit of each of the elements of the number of fixed length elements. As an example, a bit pattern (e.g., the element mask referred to as Elem_Mask 437 in
Reference number 4 (e.g., “Load Source Vector in Destination”) of the example above is associated with loading the vector that will be analyzed during the vector population count determination to Destination 439. The example source bit-vector is [0111 0101, 0000 0111, 0101 0000, 0101 0101] and is stored in Destination as [0x75075055]. The source vector is loaded in Destination 439 and used during a number of iterations of this example, which are described below. At the conclusion of the setup phase corresponding to reference numbers 1-4 of the example above, and as shown in row 451-4 of
Reference numbers 5-7 of the example above (e.g., “Perform First Iteration”) corresponds to the determination phase of a vector population count determination in accordance with a number of embodiments of the present disclosure. The determination phase can comprise performing a number of iterations corresponding to reference numbers 5-7. The number of iterations for determining a vector population count is dependent on the size of the elements in the vector. The number of iterations to determine a vector population count is equal to the log2 of the element size, which is log2 8=3 in the example above. In the example above, reference number 5 corresponds to a first iteration that comprises execution of the steps corresponding to reference numbers 5.a-5.d, reference number 6 corresponds to a second iteration that comprises execution of the steps corresponding to reference numbers 6.a-6.d, and reference number 7 corresponds to a third iteration that comprises execution of the steps corresponding to reference numbers 7.a-7.d.
Reference number 5 of the example (e.g., Perform First Iteration”) corresponds to the first iteration of the determination phase. The first iteration compares the first two bits of each element when executing the example above to determine the vector population count. At reference number 5.a (e.g., “Obtain Reduction”), a reduction vector for the first iteration is obtained. Reference numbers 5.a.1-5.a.9 correspond to the calculation of the reduction vector for the first iteration. The reduction vector is used during subsequent steps of the first iteration.
Reference number 5.a.1 of the example above (e.g., “Load Elem_Mask in Reduction”) corresponds to loading Reduction 435 with the element mask, as illustrated line 451-5.a.1 in
Reference number 5.a.3 of the example above (e.g., “Load Elem_Mask in Temp_Lookup”) corresponds to loading the element mask in Temp_Lookup 433, as illustrated line 451-5.a.3 in
Reference number 5.b of the example above (e.g., Obtain First Portion of Pattern”) corresponds to creating the pattern mask for first iteration of the determination phase. Reference numbers 5.b.1-5.b.3 correspond to the calculation of the first portion of the pattern mask for the first iteration. The first portion of the pattern mask is used during subsequent steps of the first iteration.
Reference number 5.b.1 of the example above (e.g., “Perform AND Operation with Comp_Comp and Destination”) corresponds to performing an AND operation with the reduction vector for the first iteration and the destination, which is the source vector for the vector population count determination, as illustrated in line 451-5.b.1 in
Reference number 5.c of the example above (e.g., Obtain Second Portion of Pattern”) corresponds to creating the pattern mask for first iteration of the determination phase. Reference numbers 5.c.1-5.c.3 correspond to the calculation of the second portion of the pattern mask for the first iteration. The second portion of the pattern mask is used during subsequent steps of the first iteration.
Reference number 5.c.1 of the example above (e.g., “Load Inverse of Reduction in Comp_Comp”) corresponds to loading the inverse of Reduction 435 (e.g., the reduction vector) in Comp_Comp 431, as illustrated in line 451-5.b.1 in
Reference number 5.d of the example above (e.g., Perform a Half Add operation with the First Portion and the Second Portion of the Pattern”) corresponds to creating the destination output for first iteration of the determination phase. Reference numbers 5.d.1-5.d.6 correspond to the calculation of the destination for the first iteration. The destination of the first iteration is used during subsequent steps in the second iteration.
Reference number 5.d.1 of the example above (e.g., “Perform a Half Add operation with Temp_Lookup and Destination”) corresponds to performing a Half Add operation of the first and second portions of the pattern mask for the first iteration. Temp_Lookup stores the first portion of the pattern mask, as described above in association with reference number 5.b.3, and Destination stores the second portion of the pattern mask, as described above in association with reference number 5.c.3. A half add operation is an operation with two result vectors, a sum vector and a carry vector. In a half add operation, an input of 0 from both vectors results in a sum of 0 and a carry of 0, an input of 1 from one vector and a 0 from another vector results in a sum of 1 and a carry of 0, and an input of 1 from both vectors results in a sum of 0 and a carry of 1. The results of the half add operation are illustrated in line 451-5.d.1 in
Reference number 6 of the example above (e.g., “Perform Second Iteration”) corresponds to the second iteration of the determination phase. The second iteration compares the first four bits of each element when executing the example above to determine the vector population count. At reference number 6.a (e.g., “Obtain Reduction”), a reduction vector for the second iteration is obtained. Reference numbers 6.a.1-6.a.9 correspond to the calculation of the reduction vector for the second iteration. The reduction vector is used during subsequent steps of the second iteration.
Reference number 6.a.1 of the example above (e.g., “Load Elem_Mask in Reduction”) corresponds to loading Reduction 435 with the element mask, as illustrated line 451-6.a.1 in
Reference number 6.a.3 of the example above (e.g., “Shift Comp_Comp Right by 1”) corresponds to shifting the element mask in Comp_Comp 431 to the right by 1, as illustrated line 451-6.a.3 in
Reference number 6.b of the example above (e.g., Obtain First Portion of Pattern”) corresponds to creating the pattern mask for second iteration of the determination phase. Reference numbers 6.b.1-6.b.3 correspond to the calculation of the first portion of the pattern mask for the second iteration. The first portion of the pattern mask is used during subsequent steps of the second iteration.
Reference number 6.b.1 of the example above (e.g., “Perform AND Operation with Comp_Comp and Destination”) corresponds to performing an AND operation with the reduction vector for the second iteration and the destination, which is the result of the first iteration, as illustrated in line 451-6.b.1 in
Reference number 6.c of the example above (e.g., Obtain Second Portion of Pattern”) corresponds to creating the pattern mask for second iteration of the determination phase. Reference numbers 6.c.1-6.c.3 correspond to the calculation of the second portion of the pattern mask for the second iteration. The second portion of the pattern mask is used during subsequent steps of the second iteration.
Reference number 6.c.1 of the example above (e.g., “Load Inverse of Reduction in Comp_Comp”) corresponds to loading the inverse of the reduction vector in Comp_Comp 431, as illustrated in line 451-6.b.1 in
Reference number 6.d of the example above (e.g., Perform a Half Add operation with the First Portion and the Second Portion of the Pattern”) corresponds to creating the destination output for second iteration of the determination phase. Reference numbers 6.d.1-6.d.6 correspond to the calculation of the output for the first iteration. The output of the first iteration, stored in Destination 439, is used during subsequent steps in the third iteration.
Reference number 6.d.1 of the example above (e.g., “Perform a Half Add operation with Temp_Lookup and Destination”) corresponds performing a Half Add operation of the first and second portions of the pattern mask of the second iteration. Temp_Lookup stores the first portion of the pattern mask, as described above in association with reference number 6.b.3, and Destination stores the second portion of the pattern mask, as described above in association with reference number 6.c.3. The results of the half add operation are illustrated in line 451-6.d.1 in
Reference number 7 of the example above (e.g., “Perform Third Iteration”) corresponds to the third iteration of the determination phase. The third iteration compares the all eight bits of each element when executing the example above to determine the vector population count. At reference number 7.a (e.g., “Obtain Reduction”), a reduction vector for the third iteration is obtained. Reference numbers 7.a.1-7.a.10 correspond to the calculation of the reduction vector for the third iteration. The reduction vector is used during subsequent steps of the third iteration.
Reference number 7.a.1 of the example above (e.g., “Load Elem_Mask in Reduction”) corresponds to loading Reduction 435 with the element mask, as illustrated line 451-7.a.1 in
Reference number 7.a.3 of the example above (e.g., “Shift Comp_Comp Right by 1”) corresponds to shifting the element mask in Comp_Comp 431 to the right by 1, as illustrated line 451-7.a.3 in
Reference number 7.b of the example above (e.g., Obtain First Portion of Pattern”) corresponds to creating the pattern mask for third iteration of the determination phase. Reference numbers 7.b.1-7.b.3 correspond to the calculation of the first portion of the pattern mask for the third iteration. The first portion of the pattern mask is used during subsequent steps of the third iteration.
Reference number 7.b.1 of the example above (e.g., “Perform AND Operation with Comp_Comp and Destination”) corresponds to performing an AND operation with the reduction vector for the third iteration and the destination, which is the result of the second iteration, as illustrated in line 451-7.b.1 in
Reference number 7.c of the example above (e.g., Obtain Second Portion of Pattern”) corresponds to creating the pattern mask for third iteration of the determination phase. Reference numbers 7.c.1-7.c.3 correspond to the calculation of the second portion of the pattern mask for the third iteration. The second portion of the pattern mask is used during subsequent steps of the third iteration.
Reference number 7.c.1 of the example above (e.g., “Load Inverse of Reduction in Comp_Comp”) corresponds to loading the inverse of the reduction vector in Comp_Comp 431, as illustrated in line 451-7.c.1 in
Reference number 7.d of the example above (e.g., Perform a Half Add operation with the First Portion and the Second Portion of the Pattern”) corresponds to creating the destination output for second iteration of the determination phase. Reference numbers 7.d.1-7.d.6 correspond to the calculation of the output for the first iteration. The output of the first iteration, stored in Destination 439, is used during subsequent steps in the third iteration.
Reference number 7.d.1 of the example above (e.g., “Perform a Half Add operation with Temp_Lookup and Destination”) corresponds to performing a Half Add operation of the first and second portions of the pattern mask of the third iteration. Temp_Lookup stores the first portion of the pattern mask, as described above in association with reference number 7.b.3, and Destination stores the second portion of the pattern mask, as described above in association with reference number 7.c.3. The results of the half add operation are illustrated in line 451-7.d.1 in
In the example illustrated in
The first operation phase of a logical operation described below involves loading a first operand of the logical operation into the Comp_Compulator. The time references (e.g., t1, etc.) shown in
At time t1, the equilibration signal 526 is deactivated, and then a selected row is enabled (e.g., the row corresponding to a memory cell whose data value is to be sensed and used as a first input). Signal 504-0 represents the voltage signal applied to the selected row (e.g., Row Y 204-Y shown in
At time t3, the sense amplifier (e.g., 206 shown in
According to some embodiments, the primary latch of sense amplifier 206 can be coupled to the complementary data lines D and D_ through respective pass transistors (not shown in
At time t4, the pass transistors (if present) can be enabled (e.g., via respective Passd and Passdb control signals 511 applied to control lines coupled to the respective gates of the pass transistors going high). At time t5, the Comp_Compulator positive control signal 512-1 (e.g., Comp_Compb) and the Comp_Compulator positive control signal 512-2 (e.g., Comp_Comp) are activated via respective control lines 212-1 and 212-2 shown in
At time t6, the Passd control signal 511 (and the Passdb control signal) goes low thereby turning off the pass transistors (if present). However, since the Comp_Compulator control signals COMP_COMPB 512-1 and COMP_COMP 512-2 remain activated, an Comp_Compulated result is stored (e.g., latched) in the secondary latches (e.g., Comp_Compulator). At time t7, the row signal 504-0 is deactivated, and the array sense amps are disabled at time t8 (e.g., sense amplifier control signals 528 and 590 are deactivated).
At time t9, the data lines D and D_ are equilibrated (e.g., equilibration signal 526 is activated), as illustrated by data line voltage signals 505-1 and 505-2 moving from their respective rail values to the equilibration voltage (VDD/2). The equilibration consumes little energy due to the law of conservation of energy. As described above in association with
As shown in the timing diagrams illustrated in
At time t3, the sense amplifier (e.g., 206 shown in
As shown in timing diagrams illustrated in
Since the Comp_Compulator was previously enabled, activating only Passd (511-1 as shown in
Similarly, in an example OR/NOR operation shown in the timing diagram illustrated in
At the conclusion of an intermediate operation phase such as that shown in
For example, performing a last operation phase of an R-input can include performing the operation phase shown in
A NAND operation can be implemented, for example, by storing the result of the R−1 iterations for an AND operation in the sense amplifier, then inverting the sense amplifier before conducting the last operation phase to store the result (described below). A NOR operation can be implemented, for example, by storing the result of the R−1 iterations for an OR operation in the sense amplifier, then inverting the sense amplifier before conducting the last operation phase to store the result (described below).
The last operation phase illustrated in the timing diagram of
As shown in timing diagram illustrated in
Activating the Passd control signal 511 (and Passdb signal) (e.g., in association with an AND or OR operation) transfers the Comp_Compulated output stored in the secondary latch of compute component 231 shown in
For an OR operation, if any of the memory cells sensed in the prior operation phases (e.g., the first operation phase of
The result of the R-input AND or OR logical operations can then be stored back to a memory cell of array 230 shown in
The timing diagram illustrated in
As shown in
Although the example of performing a last operation phase of an R-input was discussed above with respect to
The functionality of the sensing circuitry 250 of
Initially storing the result of a particular operation in the sense amplifier 206 (e.g., without having to perform an additional operation to move the result from the compute component 231 (e.g., Comp_Compulator) to the sense amplifier 206) is advantageous because, for instance, the result can be written to a row (of the array of memory cells) or back into the Comp_Compulator without performing a precharge cycle (e.g., on the complementary data lines 205-1 (D) and/or 205-2 (D_).
An example of pseudo code associated with loading (e.g., copying) a first data value stored in a cell coupled to row 204-X into the Comp_Compulator can be summarized as follows:
In the pseudo code above, “Deactivate EQ” indicates that an equilibration signal (EQ signal shown in
After Row X is enabled, in the pseudo code above, “Fire Sense Amps” indicates that the sense amplifier 206 is enabled to set the primary latch and subsequently disabled. For example, as shown at t3 in
The four sets of possible sense amplifier and Comp_Compulator signals illustrated in
After firing the sense amps, in the pseudo code above, “Activate LOAD” indicates that the LOAD control signal goes high as shown at t4 in
After setting the secondary latch from the data values stored in the sense amplifier (and present on the data lines 205-1 (D) and 205-2 (D_) in
After storing the data value on the secondary latch, the selected row (e.g., ROW X) is disabled (e.g., deselected, closed such as by deactivating a select signal for a particular row) as indicated by “Close Row X” and indicated at t6 in
A subsequent operation phase associated with performing the AND or the OR operation on the first data value (now stored in the sense amplifier 206 and the secondary latch of the compute component 231 shown in
In the pseudo code above, “Deactivate EQ” indicates that an equilibration signal corresponding to the sense amplifier 206 is disabled (e.g., such that the complementary data lines 205-1 (D) and 205-2 (D_) are no longer shorted to VDD/2), which is illustrated in
After Row Y is enabled, in the pseudo code above, “Fire Sense Amps” indicates that the sense amplifier 206 is enabled to amplify the differential signal between 205-1 (D) and 205-2 (D_), resulting in a voltage (e.g., VDD) corresponding to a logic 1 or a voltage (e.g., GND) corresponding to a logic 0 being on data line 205-1 (D) (and the voltage corresponding to the other logic state being on complementary data line 205-2 (D_). As shown at t10 in
After the second data value sensed from the memory cell 202-1 coupled to Row Y is stored in the primary latch of sense amplifier 206, in the pseudo code above, “Close Row Y” indicates that the selected row (e.g., ROW Y) can be disabled if it is not desired to store the result of the AND logical operation back in the memory cell corresponding to Row Y. However,
With the first data value (e.g., Row X) stored in the dynamic latch of the Comp_Compulator 231 and the second data value (e.g., Row Y) stored in the sense amplifier 206, if the dynamic latch of the compute component 231 contains a “0” (i.e., a voltage corresponding to a “0” on node S2 and a voltage corresponding to a “1” on node S1), the sense amplifier data is written to a “0” (regardless of the data value previously stored in the sense amp) since the voltage corresponding to a “1” on node S1 causes transistor 209-1 to conduct thereby coupling the sense amplifier 206 to ground through transistor 209-1, pass transistor 207-1 and data line 205-1 (D). When either data value of an AND operation is “0,” the result is a “0.” Here, when the second data value (in the dynamic latch) is a “0,” the result of the AND operation is a “0” regardless of the state of the first data value, and so the configuration of the sensing circuitry causes the “0” result to be written and initially stored in the sense amplifier 206. This operation leaves the data value in the Comp_Compulator unchanged (e.g., from Row X).
If the secondary latch of the Comp_Compulator contains a “1” (e.g., from Row X), then the result of the AND operation depends on the data value stored in the sense amplifier 206 (e.g., from Row Y). The result of the AND operation should be a “1” if the data value stored in the sense amplifier 206 (e.g., from Row Y) is also a “1,” but the result of the AND operation should be a “0” if the data value stored in the sense amplifier 206 (e.g., from Row Y) is also a “0.” The sensing circuitry 250 is configured such that if the dynamic latch of the Comp_Compulator contains a “1” (i.e., a voltage corresponding to a “1” on node S2 and a voltage corresponding to a “0” on node S1), transistor 209-1 does not conduct, the sense amplifier is not coupled to ground (as described above), and the data value previously stored in the sense amplifier 206 remains unchanged (e.g., Row Y data value so the AND operation result is a “1” if the Row Y data value is a “1” and the AND operation result is a “0” if the Row Y data value is a “0”). This operation leaves the data value in the Comp_Compulator unchanged (e.g., from Row X).
After the result of the AND operation is initially stored in the sense amplifier 206, “Deactivate AND” in the pseudo code above indicates that the AND control signal goes low as shown at t12 in
Although the timing diagrams illustrated in
A subsequent operation phase can alternately be associated with performing the OR operation on the first data value (now stored in the sense amplifier 206 and the secondary latch of the compute component 231) and the second data value (stored in a memory cell 202-1 coupled to Row Y 204-Y). The operations to load the Row X data into the sense amplifier and Comp_Compulator that were previously described with respect to times t1-t7 shown in
The “Deactivate EQ” (shown at t8 in
With the first data value (e.g., Row X) stored in the secondary latch of the compute component 231 and the second data value (e.g., Row Y) stored in the sense amplifier 206, if the dynamic latch of the Comp_Compulator contains a “0” (i.e., a voltage corresponding to a “0” on node S2 and a voltage corresponding to a “1” on node S1), then the result of the OR operation depends on the data value stored in the sense amplifier 206 (e.g., from Row Y). The result of the OR operation should be a “1” if the data value stored in the sense amplifier 206 (e.g., from Row Y) is a “1,” but the result of the OR operation should be a “0” if the data value stored in the sense amplifier 206 (e.g., from Row Y) is also a “0.” The sensing circuitry 250 is configured such that if the dynamic latch of the Comp_Compulator contains a “0,” with the voltage corresponding to a “0” on node S2, transistor 209-2 is off and does not conduct (and pass transistor 207-1 is also off since the AND control signal is not asserted) so the sense amplifier 206 is not coupled to ground (either side), and the data value previously stored in the sense amplifier 206 remains unchanged (e.g., Row Y data value such that the OR operation result is a “1” if the Row Y data value is a “1” and the OR operation result is a “0” if the Row Y data value is a “0”).
If the dynamic latch of the Comp_Compulator contains a “1” (i.e., a voltage corresponding to a “1” on node S2 and a voltage corresponding to a “0” on node S1), transistor 209-2 does conduct (as does pass transistor 207-2 since the OR control signal is asserted), and the sense amplifier 206 input coupled to data line 205-2 (D_) is coupled to ground since the voltage corresponding to a “1” on node S2 causes transistor 209-2 to conduct along with pass transistor 207-2 (which also conducts since the OR control signal is asserted). In this manner, a “1” is initially stored in the sense amplifier 206 as a result of the OR operation when the secondary latch of the Comp_Compulator contains a “1” regardless of the data value previously stored in the sense amp. This operation leaves the data in the Comp_Compulator unchanged.
After the result of the OR operation is initially stored in the sense amplifier 206, “Deactivate OR” in the pseudo code above indicates that the OR control signal goes low as shown at t12 in
The sensing circuitry 250 illustrated in
In a similar approach to that described above with respect to inverting the data values for the AND and OR operations described above, the sensing circuitry shown in
The “Deactivate EQ,” “Open Row X,” “Fire Sense Amps,” “Activate LOAD,” and “Deactivate LOAD” shown in the pseudo code above indicate the same functionality as the same operations in the pseudo code for the “Copy Row X into the Comp_Compulator” initial operation phase described above prior to pseudo code for the AND operation and OR operation. However, rather than closing the Row X and Precharging after the Row X data is loaded into the sense amplifier 206 and copied into the dynamic latch, a compliment version of the data value in the dynamic latch of the Comp_Compulator can be placed on the data line and thus transferred to the sense amplifier 206 by enabling (e.g., causing transistor to conduct) and disabling the invert transistors (e.g., ANDinv and ORinv). This results in the sense amplifier 206 being flipped from the true data value that was previously stored in the sense amplifier to a compliment data value (e.g., inverted data value) stored in the sense amp. For example, a true or compliment version of the data value in the Comp_Compulator can be transferred to the sense amplifier by activating and deactivating ANDinv and ORinv. This operation leaves the data in the Comp_Compulator unchanged.
Because the sensing circuitry 250 shown in
When performing logical operations in this manner, the sense amplifier 206 can be pre-seeded with a data value from the dynamic latch of the Comp_Compulator to reduce overall current utilized because the sense amps 206 are not at full rail voltages (e.g., supply voltage or ground/reference voltage) when Comp_Compulator function is copied to the sense amplifier 206. An operation sequence with a pre-seeded sense amplifier 206 either forces one of the data lines to the reference voltage (leaving the complementary data line at VDD/2, or leaves the complementary data lines unchanged. The sense amplifier 206 pulls the respective data lines to full rails when the sense amplifier 206 fires. Using this sequence of operations will overwrite data in an enabled row.
A SHIFT operation can be accomplished by multiplexing (“muxing”) two neighboring data line complementary pairs using a traditional DRAM isolation (ISO) scheme. According to embodiments of the present disclosure, the shift circuitry 223 can be used for shifting data values stored in memory cells coupled to a particular pair of complementary data lines to the sensing circuitry 250 (e.g., sense amplifier 206) corresponding to a different pair of complementary data lines (e.g., such as a sense amplifier 206 corresponding to a left or right adjacent pair of complementary data lines. As used herein, a sense amplifier 206 corresponds to the pair of complementary data lines to which the sense amplifier is coupled when isolation transistors 221-1 and 221-2 are conducting. The SHIFT operations (right or left) do not pre-copy the Row X data value into the Comp_Compulator. Operations to shift right Row X can be summarized as follows:
In the pseudo code above, “Deactivate Norm and Activate Shift” indicates that a NORM control signal goes low causing isolation transistors 221-1 and 221-2 of the shift circuitry 223 to not conduct (e.g., isolate the sense amplifier from the corresponding pair of complementary data lines). The SHIFT control signal goes high causing isolation transistors 221-3 and 221-4 to conduct, thereby coupling the sense amplifier 206 to the left adjacent pair of complementary data lines (e.g., on the memory array side of non-conducting isolation transistors 221-1 and 221-2 for the left adjacent pair of complementary data lines).
After the shift circuitry 223 is configured, the “Deactivate EQ,” “Open Row X,” and “Fire Sense Amps” shown in the pseudo code above indicate the same functionality as the same operations in the pseudo code for the “Copy Row X into the Comp_Compulator” initial operation phase described above prior to pseudo code for the AND operation and OR operation. After these operations, the Row X data value for the memory cell coupled to the left adjacent pair of complementary data lines is shifted right and stored in the sense amplifier 206.
In the pseudo code above, “Activate Norm and Deactivate Shift” indicates that a NORM control signal goes high causing isolation transistors 221-1 and 221-2 of the shift circuitry 223 to conduct (e.g., coupling the sense amplifier to the corresponding pair of complementary data lines), and the SHIFT control signal goes low causing isolation transistors 221-3 and 221-4 to not conduct and isolating the sense amplifier 206 from the left adjacent pair of complementary data lines (e.g., on the memory array side of non-conducting isolation transistors 221-1 and 221-2 for the left adjacent pair of complementary data lines). Since Row X is still active, the Row X data value that has been shifted right is transferred to Row X of the corresponding pair of complementary data lines through isolation transistors 221-1 and 221-2.
After the Row X data values are shifted right to the corresponding pair of complementary data lines, the selected row (e.g., ROW X) is disabled as indicated by “Close Row X” in the pseudo code above, which can be accomplished by the access transistor turning off to decouple the selected cell from the corresponding data line. Once the selected row is closed and the memory cell is isolated from the data lines, the data lines can be precharged as indicated by the “Precharge” in the pseudo code above. A precharge of the data lines can be accomplished by an equilibrate operation, as described above.
Operations to shift left Row X can be summarized as follows:
In the pseudo code above, “Activate Norm and Deactivate Shift” indicates that a NORM control signal goes high causing isolation transistors 221-1 and 221-2 of the shift circuitry 223 to conduct, and the SHIFT control signal goes low causing isolation transistors 221-3 and 221-4 to not conduct. This configuration couples the sense amplifier 206 to a corresponding pair of complementary data lines and isolates the sense amplifier from the right adjacent pair of complementary data lines.
After the shift circuitry is configured, the “Deactivate EQ,” “Open Row X,” and “Fire Sense Amps” shown in the pseudo code above indicate the same functionality as the same operations in the pseudo code for the “Copy Row X into the Comp_Compulator” initial operation phase described above prior to pseudo code for the AND operation and OR operation. After these operations, the Row X data value for the memory cell coupled to the pair of complementary data lines corresponding to the sense circuitry 250 is stored in the sense amplifier 206.
In the pseudo code above, “Deactivate Norm and Activate Shift” indicates that a NORM control signal goes low causing isolation transistors 221-1 and 221-2 of the shift circuitry 223 to not conduct (e.g., isolate the sense amplifier from the corresponding pair of complementary data lines), and the SHIFT control signal goes high causing isolation transistors 221-3 and 221-4 to conduct coupling the sense amplifier to the left adjacent pair of complementary data lines (e.g., on the memory array side of non-conducting isolation transistors 221-1 and 221-2 for the left adjacent pair of complementary data lines. Since Row X is still active, the Row X data value that has been shifted left is transferred to Row X of the left adjacent pair of complementary data lines.
After the Row X data values are shifted left to the left adjacent pair of complementary data lines, the selected row (e.g., ROW X) is disabled as indicated by “Close Row X,” which can be accomplished by the access transistor turning off to decouple the selected cell from the corresponding data line. Once the selected row is closed and the memory cell is isolated from the data lines, the data lines can be precharged as indicated by the “Precharge” in the pseudo code above. A precharge of the data lines can be accomplished by an equilibrate operation, as described above.
According to various embodiments, general computing can be enabled in a memory array core of a processor-in-memory (PIM) device such as a DRAM one transistor per memory cell (e.g., 1T1C) configuration at 6F{circumflex over ( )}2 or 4F{circumflex over ( )}2 memory cell sizes, for example. The advantage of the apparatuses and methods described herein is not realized in terms of single instruction speed, but rather the cumulative speed that can be achieved by an entire bank of data being computed in parallel without ever transferring data out of the memory array (e.g., DRAM) or firing a column decode. In other words, data transfer time can be eliminated. For example, apparatus of the present disclosure can perform ANDS or ORs simultaneously using data values in memory cells coupled to a data line (e.g., a column of 16K memory cells).
In previous approach sensing circuits where data is moved out for logical operation processing (e.g., using 32 or 64 bit registers), fewer operations can be performed in parallel compared to the apparatus of the present disclosure. In this manner, significantly higher throughput is effectively provided in contrast to conventional configurations involving a central processing unit (CPU) discrete from the memory such that data must be transferred there between. An apparatus and/or methods according to the present disclosure can also use less energy/area than configurations where the CPU is discrete from the memory. Furthermore, an apparatus and/or methods of the present disclosure can improve upon the smaller energy/area advantages since the in-memory-array logical operations save energy by eliminating certain data value transfers.
Although specific embodiments have been illustrated and described herein, those of ordinary skill in the art will appreciate that an arrangement calculated to achieve the same results can be substituted for the specific embodiments shown. This disclosure is intended to cover adaptations or variations of one or more embodiments of the present disclosure. It is to be understood that the above description has been made in an illustrative fashion, and not a restrictive one. Combination of the above embodiments, and other embodiments not specifically described herein will be apparent to those of skill in the art upon reviewing the above description. The scope of the one or more embodiments of the present disclosure includes other applications in which the above structures and methods are used. Therefore, the scope of one or more embodiments of the present disclosure should be determined with reference to the appended claims, along with the full range of equivalents to which such claims are entitled.
In the foregoing Detailed Description, some features are grouped together in a single embodiment for the purpose of streamlining the disclosure. This method of disclosure is not to be interpreted as reflecting an intention that the disclosed embodiments of the present disclosure have to use more features than are expressly recited in each claim. Rather, as the following claims reflect, inventive subject matter lies in less than all features of a single disclosed embodiment. Thus, the following claims are hereby incorporated into the Detailed Description, with each claim standing on its own as a separate embodiment.
This application is a Continuation of U.S. application Ser. No. 16/207,786, filed Dec. 3, 2018, which issues as U.S. Pat. No. 10,896,042 on Jan. 19, 2021, which is a Continuation of U.S. application Ser. No. 15/065,483, filed Mar. 9, 2016, which issued as U.S. Pat. No. 10,146,537 on Dec. 4, 2018, which claims the benefit of U.S. Provisional Application No. 62/132,891, filed Mar. 13, 2015, the contents of which are included herein by reference.
| Number | Name | Date | Kind |
|---|---|---|---|
| 3711692 | Batcher | Jan 1973 | A |
| 4189716 | Krambeck | Feb 1980 | A |
| 4380046 | Fung | Apr 1983 | A |
| 4435792 | Bechtolsheim | Mar 1984 | A |
| 4435793 | Ochii | Mar 1984 | A |
| 4486848 | Kaminski | Dec 1984 | A |
| 4498177 | Larson | Feb 1985 | A |
| 4727474 | Batcher | Feb 1988 | A |
| 4843264 | Galbraith | Jun 1989 | A |
| 4958378 | Bell | Sep 1990 | A |
| 4977542 | Matsuda et al. | Dec 1990 | A |
| 4989168 | Kuroda et al. | Jan 1991 | A |
| 5023838 | Herbert | Jun 1991 | A |
| 5034636 | Reis et al. | Jul 1991 | A |
| 5201039 | Sakamura | Apr 1993 | A |
| 5210850 | Kelly et al. | May 1993 | A |
| 5253308 | Johnson | Oct 1993 | A |
| 5276643 | Hoffmann et al. | Jan 1994 | A |
| 5325519 | Long et al. | Jun 1994 | A |
| 5339447 | Balmer | Aug 1994 | A |
| 5367488 | An | Nov 1994 | A |
| 5379257 | Matsumura et al. | Jan 1995 | A |
| 5386379 | Ali-Yahia et al. | Jan 1995 | A |
| 5398213 | Yeon et al. | Mar 1995 | A |
| 5430687 | Hung et al. | Jul 1995 | A |
| 5440482 | Davis | Aug 1995 | A |
| 5446690 | Tanaka et al. | Aug 1995 | A |
| 5473576 | Matsui | Dec 1995 | A |
| 5481500 | Reohr et al. | Jan 1996 | A |
| 5485373 | Davis et al. | Jan 1996 | A |
| 5506811 | McLaury | Apr 1996 | A |
| 5541865 | Ashkenazi | Jul 1996 | A |
| 5570306 | Soo | Oct 1996 | A |
| 5615404 | Knoll et al. | Mar 1997 | A |
| 5638128 | Hoogenboom | Jun 1997 | A |
| 5638317 | Tran | Jun 1997 | A |
| 5654936 | Cho | Aug 1997 | A |
| 5678021 | Pawate et al. | Oct 1997 | A |
| 5717616 | Morris | Feb 1998 | A |
| 5724291 | Matano | Mar 1998 | A |
| 5724366 | Furutani | Mar 1998 | A |
| 5734599 | Lee et al. | Mar 1998 | A |
| 5751987 | Mahant-Shetti et al. | May 1998 | A |
| 5787458 | Miwa | Jul 1998 | A |
| 5854636 | Watanabe et al. | Dec 1998 | A |
| 5867429 | Chen et al. | Feb 1999 | A |
| 5870504 | Nemoto et al. | Feb 1999 | A |
| 5915084 | Wendell | Jun 1999 | A |
| 5935263 | Keeth et al. | Aug 1999 | A |
| 5953738 | Rao | Sep 1999 | A |
| 5986942 | Sugibayashi | Nov 1999 | A |
| 5991209 | Chow | Nov 1999 | A |
| 5991785 | Alidina et al. | Nov 1999 | A |
| 6005799 | Rao | Dec 1999 | A |
| 6009020 | Nagata | Dec 1999 | A |
| 6092186 | Betker et al. | Jul 2000 | A |
| 6122211 | Morgan et al. | Sep 2000 | A |
| 6125071 | Kohno et al. | Sep 2000 | A |
| 6134164 | Lattimore et al. | Oct 2000 | A |
| 6147514 | Shiratake | Nov 2000 | A |
| 6151244 | Fujino et al. | Nov 2000 | A |
| 6157578 | Brady | Dec 2000 | A |
| 6158042 | Shagam | Dec 2000 | A |
| 6163862 | Adams et al. | Dec 2000 | A |
| 6166942 | Vo et al. | Dec 2000 | A |
| 6172918 | Hidaka | Jan 2001 | B1 |
| 6175514 | Henderson | Jan 2001 | B1 |
| 6181698 | Hariguchi | Jan 2001 | B1 |
| 6208544 | Beadle et al. | Mar 2001 | B1 |
| 6226215 | Yoon | May 2001 | B1 |
| 6301153 | Takeuchi et al. | Oct 2001 | B1 |
| 6301164 | Manning et al. | Oct 2001 | B1 |
| 6304477 | Naji | Oct 2001 | B1 |
| 6389507 | Sherman | May 2002 | B1 |
| 6418498 | Martwick | Jul 2002 | B1 |
| 6430251 | Gold | Aug 2002 | B1 |
| 6466499 | Blodgett | Oct 2002 | B1 |
| 6510098 | Taylor | Jan 2003 | B1 |
| 6563754 | Lien et al. | May 2003 | B1 |
| 6578058 | Nygaard | Jun 2003 | B1 |
| 6664967 | Cook | Dec 2003 | B1 |
| 6731542 | Le et al. | May 2004 | B1 |
| 6754746 | Leung et al. | Jun 2004 | B1 |
| 6760837 | Laurenti et al. | Jul 2004 | B1 |
| 6768679 | Le et al. | Jul 2004 | B1 |
| 6807614 | Chung | Oct 2004 | B2 |
| 6816422 | Hamade et al. | Nov 2004 | B2 |
| 6819612 | Achter | Nov 2004 | B1 |
| 6894549 | Eliason | May 2005 | B2 |
| 6943579 | Hazanchuk et al. | Sep 2005 | B1 |
| 6948056 | Roth et al. | Sep 2005 | B1 |
| 6950771 | Fan et al. | Sep 2005 | B1 |
| 6950898 | Merritt et al. | Sep 2005 | B2 |
| 6956770 | Khalid et al. | Oct 2005 | B2 |
| 6961272 | Schreck | Nov 2005 | B2 |
| 6965648 | Smith et al. | Nov 2005 | B1 |
| 6985394 | Kim | Jan 2006 | B2 |
| 6987693 | Cernea et al. | Jan 2006 | B2 |
| 7020017 | Chen et al. | Mar 2006 | B2 |
| 7028170 | Saulsbury | Apr 2006 | B2 |
| 7045834 | Tran et al. | May 2006 | B2 |
| 7054178 | Shiah et al. | May 2006 | B1 |
| 7058880 | Ding et al. | Jun 2006 | B1 |
| 7061817 | Raad et al. | Jun 2006 | B2 |
| 7079407 | Dimitrelis | Jul 2006 | B1 |
| 7173857 | Kato et al. | Feb 2007 | B2 |
| 7187585 | Li et al. | Mar 2007 | B2 |
| 7196928 | Chen | Mar 2007 | B2 |
| 7260565 | Lee et al. | Aug 2007 | B2 |
| 7260672 | Garney | Aug 2007 | B2 |
| 7372715 | Han | May 2008 | B2 |
| 7400532 | Aritome | Jul 2008 | B2 |
| 7406494 | Magee | Jul 2008 | B2 |
| 7447720 | Beaumont | Nov 2008 | B2 |
| 7454451 | Beaumont | Nov 2008 | B2 |
| 7457181 | Lee et al. | Nov 2008 | B2 |
| 7532529 | Dadashev et al. | May 2009 | B2 |
| 7535769 | Cernea | May 2009 | B2 |
| 7546438 | Chung | Jun 2009 | B2 |
| 7562198 | Noda et al. | Jul 2009 | B2 |
| 7574466 | Beaumont | Aug 2009 | B2 |
| 7602647 | Li et al. | Oct 2009 | B2 |
| 7663928 | Tsai et al. | Feb 2010 | B2 |
| 7685365 | Rajwar et al. | Mar 2010 | B2 |
| 7692466 | Ahmadi | Apr 2010 | B2 |
| 7752417 | Manczak et al. | Jul 2010 | B2 |
| 7791962 | Noda et al. | Sep 2010 | B2 |
| 7796453 | Riho et al. | Sep 2010 | B2 |
| 7805587 | Van Dyke et al. | Sep 2010 | B1 |
| 7808854 | Takase | Oct 2010 | B2 |
| 7827372 | Bink et al. | Nov 2010 | B2 |
| 7869273 | Lee et al. | Jan 2011 | B2 |
| 7898864 | Dong | Mar 2011 | B2 |
| 7924628 | Danon et al. | Apr 2011 | B2 |
| 7937535 | Ozer et al. | May 2011 | B2 |
| 7957206 | Bauser | Jun 2011 | B2 |
| 7979667 | Allen et al. | Jul 2011 | B2 |
| 7996749 | Ding et al. | Aug 2011 | B2 |
| 8042082 | Solomon | Oct 2011 | B2 |
| 8045391 | Mokhlesi | Oct 2011 | B2 |
| 8059438 | Chang et al. | Nov 2011 | B2 |
| 8095825 | Hirotsu et al. | Jan 2012 | B2 |
| 8117462 | Snapp et al. | Feb 2012 | B2 |
| 8164942 | Gebara et al. | Apr 2012 | B2 |
| 8208328 | Hong | Jun 2012 | B2 |
| 8213248 | Moon et al. | Jul 2012 | B2 |
| 8223568 | Seo | Jul 2012 | B2 |
| 8238173 | Akerib et al. | Aug 2012 | B2 |
| 8274841 | Shimano et al. | Sep 2012 | B2 |
| 8279683 | Klein | Oct 2012 | B2 |
| 8310884 | Iwai et al. | Nov 2012 | B2 |
| 8332367 | Bhattacherjee et al. | Dec 2012 | B2 |
| 8339824 | Cooke | Dec 2012 | B2 |
| 8339883 | Yu et al. | Dec 2012 | B2 |
| 8347154 | Bahali et al. | Jan 2013 | B2 |
| 8351292 | Matano | Jan 2013 | B2 |
| 8356144 | Hessel et al. | Jan 2013 | B2 |
| 8417921 | Gonion et al. | Apr 2013 | B2 |
| 8462532 | Argyres | Jun 2013 | B1 |
| 8484276 | Carlson et al. | Jul 2013 | B2 |
| 8495438 | Roine | Jul 2013 | B2 |
| 8503250 | Demone | Aug 2013 | B2 |
| 8526239 | Kim | Sep 2013 | B2 |
| 8533245 | Cheung | Sep 2013 | B1 |
| 8555037 | Gonion | Oct 2013 | B2 |
| 8599613 | Abiko et al. | Dec 2013 | B2 |
| 8605015 | Guttag et al. | Dec 2013 | B2 |
| 8625376 | Jung et al. | Jan 2014 | B2 |
| 8644101 | Jun et al. | Feb 2014 | B2 |
| 8650232 | Stortz et al. | Feb 2014 | B2 |
| 8683183 | Sprangle | Mar 2014 | B2 |
| 8873272 | Lee | Oct 2014 | B2 |
| 8964496 | Manning | Feb 2015 | B2 |
| 8971124 | Manning | Mar 2015 | B1 |
| 9015390 | Klein | Apr 2015 | B2 |
| 9047193 | Lin et al. | Jun 2015 | B2 |
| 9165023 | Moskovich et al. | Oct 2015 | B2 |
| 9235414 | Gopal et al. | Jan 2016 | B2 |
| 9513907 | Ould-Ahmend-Vall et al. | Dec 2016 | B2 |
| 20010007112 | Porterfield | Jul 2001 | A1 |
| 20010008492 | Higashiho | Jul 2001 | A1 |
| 20010010057 | Yamada | Jul 2001 | A1 |
| 20010028584 | Nakayama et al. | Oct 2001 | A1 |
| 20010043089 | Forbes et al. | Nov 2001 | A1 |
| 20020059355 | Peleg et al. | May 2002 | A1 |
| 20020073127 | Hossain | Jun 2002 | A1 |
| 20020083106 | Becker | Jun 2002 | A1 |
| 20020095450 | Karim et al. | Jul 2002 | A1 |
| 20030167426 | Slobodnik | Sep 2003 | A1 |
| 20030196030 | Elliott et al. | Oct 2003 | A1 |
| 20030222879 | Lin et al. | Dec 2003 | A1 |
| 20040073592 | Kim et al. | Apr 2004 | A1 |
| 20040073773 | Demjanenko | Apr 2004 | A1 |
| 20040085840 | Vali et al. | May 2004 | A1 |
| 20040095826 | Perner | May 2004 | A1 |
| 20040154002 | Ball et al. | Aug 2004 | A1 |
| 20040205289 | Srinivasan | Oct 2004 | A1 |
| 20040223580 | Shackleford et al. | Nov 2004 | A1 |
| 20040240251 | Nozawa et al. | Dec 2004 | A1 |
| 20050015557 | Wang et al. | Jan 2005 | A1 |
| 20050078514 | Scheuerlein et al. | Apr 2005 | A1 |
| 20050097417 | Agrawal et al. | May 2005 | A1 |
| 20060047937 | Selvaggi et al. | Mar 2006 | A1 |
| 20060069849 | Rudelic | Mar 2006 | A1 |
| 20060146623 | Mizuno et al. | Jul 2006 | A1 |
| 20060149804 | Luick et al. | Jul 2006 | A1 |
| 20060181917 | Kang et al. | Aug 2006 | A1 |
| 20060215432 | Wickeraad et al. | Sep 2006 | A1 |
| 20060225072 | Lari et al. | Oct 2006 | A1 |
| 20060291282 | Liu et al. | Dec 2006 | A1 |
| 20070103986 | Chen | May 2007 | A1 |
| 20070171747 | Hunter et al. | Jul 2007 | A1 |
| 20070180006 | Gyoten et al. | Aug 2007 | A1 |
| 20070180184 | Sakashita et al. | Aug 2007 | A1 |
| 20070195602 | Fong et al. | Aug 2007 | A1 |
| 20070285131 | Sohn | Dec 2007 | A1 |
| 20070285979 | Turner | Dec 2007 | A1 |
| 20070291532 | Tsuji | Dec 2007 | A1 |
| 20080025073 | Arsovski | Jan 2008 | A1 |
| 20080037333 | Kim et al. | Feb 2008 | A1 |
| 20080052711 | Forin et al. | Feb 2008 | A1 |
| 20080137388 | Krishnan et al. | Jun 2008 | A1 |
| 20080165601 | Matick et al. | Jul 2008 | A1 |
| 20080178053 | Gorman et al. | Jul 2008 | A1 |
| 20080215937 | Dreibelbis et al. | Sep 2008 | A1 |
| 20080282136 | Yamashita | Nov 2008 | A1 |
| 20090016480 | Moyer et al. | Jan 2009 | A1 |
| 20090019100 | Moyer et al. | Jan 2009 | A1 |
| 20090067218 | Graber | Mar 2009 | A1 |
| 20090154238 | Lee | Jun 2009 | A1 |
| 20090154273 | Borot et al. | Jun 2009 | A1 |
| 20090254697 | Akerib | Oct 2009 | A1 |
| 20100049779 | Blaner et al. | Feb 2010 | A1 |
| 20100067296 | Li | Mar 2010 | A1 |
| 20100091582 | Vali et al. | Apr 2010 | A1 |
| 20100172190 | Lavi et al. | Jul 2010 | A1 |
| 20100210076 | Gruber et al. | Aug 2010 | A1 |
| 20100226183 | Kim | Sep 2010 | A1 |
| 20100308858 | Noda et al. | Dec 2010 | A1 |
| 20100332895 | Billing et al. | Dec 2010 | A1 |
| 20110051523 | Manabe et al. | Mar 2011 | A1 |
| 20110063919 | Chandrasekhar et al. | Mar 2011 | A1 |
| 20110093662 | Walker et al. | Apr 2011 | A1 |
| 20110103151 | Kim et al. | May 2011 | A1 |
| 20110119467 | Cadambi et al. | May 2011 | A1 |
| 20110122695 | Li et al. | May 2011 | A1 |
| 20110140741 | Zerbe et al. | Jun 2011 | A1 |
| 20110142419 | Zou et al. | Jun 2011 | A1 |
| 20110219260 | Nobunaga et al. | Sep 2011 | A1 |
| 20110238717 | Bell | Sep 2011 | A1 |
| 20110267883 | Lee et al. | Nov 2011 | A1 |
| 20110317496 | Bunce et al. | Dec 2011 | A1 |
| 20120005397 | Lim et al. | Jan 2012 | A1 |
| 20120017039 | Margetts | Jan 2012 | A1 |
| 20120023281 | Kawasaki et al. | Jan 2012 | A1 |
| 20120120705 | Mitsubori et al. | May 2012 | A1 |
| 20120134216 | Singh | May 2012 | A1 |
| 20120134225 | Chow | May 2012 | A1 |
| 20120134226 | Chow | May 2012 | A1 |
| 20120140540 | Agam et al. | Jun 2012 | A1 |
| 20120182798 | Hosono et al. | Jul 2012 | A1 |
| 20120195146 | Jun et al. | Aug 2012 | A1 |
| 20120198310 | Tran et al. | Aug 2012 | A1 |
| 20120246380 | Akerib et al. | Sep 2012 | A1 |
| 20120265964 | Murata et al. | Oct 2012 | A1 |
| 20120281486 | Rao et al. | Nov 2012 | A1 |
| 20120303627 | Keeton et al. | Nov 2012 | A1 |
| 20130003467 | Klein | Jan 2013 | A1 |
| 20130061006 | Hein | Mar 2013 | A1 |
| 20130107623 | Kavalipurapu et al. | May 2013 | A1 |
| 20130117541 | Choquette et al. | May 2013 | A1 |
| 20130124783 | Yoon et al. | May 2013 | A1 |
| 20130132702 | Patel et al. | May 2013 | A1 |
| 20130138646 | Sirer et al. | May 2013 | A1 |
| 20130163362 | Kim | Jun 2013 | A1 |
| 20130173888 | Hansen et al. | Jul 2013 | A1 |
| 20130205114 | Badam et al. | Aug 2013 | A1 |
| 20130219112 | Okin et al. | Aug 2013 | A1 |
| 20130227361 | Bowers et al. | Aug 2013 | A1 |
| 20130257483 | Bulzacchelli | Oct 2013 | A1 |
| 20130283122 | Anholt et al. | Oct 2013 | A1 |
| 20130286705 | Grover et al. | Oct 2013 | A1 |
| 20130326154 | Haswell | Dec 2013 | A1 |
| 20130332707 | Gueron et al. | Dec 2013 | A1 |
| 20140185395 | Seo | Jul 2014 | A1 |
| 20140189307 | Valentine et al. | Jul 2014 | A1 |
| 20140215185 | Danielsen | Jul 2014 | A1 |
| 20140247673 | Muralimanohar et al. | Sep 2014 | A1 |
| 20140250279 | Manning | Sep 2014 | A1 |
| 20140281371 | Thantry et al. | Sep 2014 | A1 |
| 20140344934 | Jorgensen | Nov 2014 | A1 |
| 20150029798 | Manning | Jan 2015 | A1 |
| 20150042380 | Manning | Feb 2015 | A1 |
| 20150063052 | Manning | Mar 2015 | A1 |
| 20150089166 | Kogge | Mar 2015 | A1 |
| 20150134713 | Wheeler | May 2015 | A1 |
| 20150199150 | Jeon et al. | Jul 2015 | A1 |
| 20150324290 | Leidel | Nov 2015 | A1 |
| 20150325272 | Murphy | Nov 2015 | A1 |
| 20160098200 | Guz et al. | Apr 2016 | A1 |
| Number | Date | Country |
|---|---|---|
| 102141905 | Aug 2011 | CN |
| 0214718 | Mar 1987 | EP |
| 2026209 | Feb 2009 | EP |
| H0831168 | Feb 1996 | JP |
| 2009259193 | Mar 2015 | JP |
| 10-0211482 | Aug 1998 | KR |
| 100821616 | Apr 2008 | KR |
| 10-2010-0134235 | Dec 2010 | KR |
| 10-2013-0049421 | May 2013 | KR |
| 485601 | May 2002 | TW |
| 200532708 | Oct 2005 | TW |
| 201218070 | May 2012 | TW |
| 201346724 | Nov 2013 | TW |
| 2001065359 | Sep 2001 | WO |
| 2010079451 | Jul 2010 | WO |
| 2013062596 | May 2013 | WO |
| 2013081588 | Jun 2013 | WO |
| 2013095592 | Jun 2013 | WO |
| Entry |
|---|
| Boyd et al., “On the General Applicability of Instruction-Set Randomization”, Jul.-Sep. 2010, (14 pgs.), vol. 7, Issue 3, IEEE Transactions on Dependable and Secure Computing. (Provided in U.S. Appl. No. 15/065,483). |
| Stojmenovic, “Multiplicative Circulant Networks Topological Properties and Communication Algorithms”, (25 pgs.), Discrete Applied Mathematics 77 (1997) 281-305. (Provided in U.S. Appl. No. 15/065,483). |
| “4.9.3 MINLOC and MAXLOC”, Jun. 12, 1995, (5pgs.), Message Passing Interface Forum 1.1, retrieved from http://www.mpi-forum.org/docs/mpi-1.1/mpi-11-html/node79.html (Provided in U.S. Appl. No. 15/065,483). |
| Derby, et al., “A High-Performance Embedded DSP Core with Novel SIMD Features”, Apr. 6-10, 2003, (4 pgs), vol. 2, pp. 301-304, 2003 IEEE International Conference on Accoustics, Speech, and Signal Processing. (Provided in U.S. Appl. No. 15/065,483). |
| Debnath, Biplob, Bloomflash: Bloom Filter on Flash-Based Storage, 2011 31st Annual Conference on Distributed Computing Systems, Jun. 20-24, 2011, 10 pgs. (Provided in U.S. Appl. No. 15/065,483). |
| Pagiamtzis, Kostas, “Content-Addressable Memory Introduction”, Jun. 25, 2007, (6 pgs.), retrieved from: http://www.pagiamtzis.com/cam/camintro (Provided in U.S. Appl. No. 15/065,483). |
| Pagiamtzis, et al., “Content-Addressable Memory (CAM) Circuits and Architectures: A Tutorial and Survey”, Mar. 2006, (16 pgs.), vol. 41, No. 3, IEEE Journal of Solid-State Circuits. (Provided in U.S. Appl. No. 15/065,483). |
| International Search Report and Written Opinion for PCT Application No. PCT/US2013/043702, dated Sep. 26, 2013, (11 pgs.). (Provided in U.S. Appl. No. 15/065,483). |
| Elliot, et al., “Computational RAM: Implementing Processors in Memory”, Jan.-Mar. 1999, (10 pgs.), vol. 16, Issue 1, IEEE Design and Test of Computers Magazine. (Provided in U.S. Appl. No. 15/065,483). |
| Dybdahl, et al., “Destructive-Read in Embedded DRAM, Impact on Power Consumption,” Apr. 2006, (10 pgs.), vol. 2, Issue 2, Journal of Embedded Computing-Issues in embedded single-chip multicore architectures. (Provided in U.S. Appl. No. 15/065,483). |
| Kogge, et al., “Processing In Memory: Chips to Petaflops,” May 23, 1997, (8 pgs.), retrieved from: http://www.cs.ucf.edu/courses/cda5106/summer02/papers/kogge97PIM.pdf. (Provided in U.S. Appl. No. 15/065,483). |
| Draper, et al., “The Architecture of the DIVA Processing-In-Memory Chip,” Jun. 22-26, 2002, (12 pgs.), ICS '02, retrieved from: http://www.isi.edu/˜draper/papers/ics02.pdf (Provided in U.S. Appl. No. 15/065,483). |
| Adibi, et al., “Processing-In-Memory Technology for Knowledge Discovery Algorithms,” Jun. 25, 2006, (10 pgs.), Proceeding of the Second International Workshop on Data Management on New Hardware, retrieved from: http://www.cs.cmu.edu/˜damon2006/pdf/adibi06inmemory.pdf. (Provided in U.S. Appl. No. 15/065,483). |
| U.S. Appl. No. 15/065,483, entitled, “Methods and Apparatus for Pattern Matching,” filed Apr. 17, 2012, (37 pgs.). (Provided in U.S. Appl. No. 15/065,483). |
| U.S. Appl. No. 15/065,483, entitled, “Weighted Search and Compare in a Memory Device,” filed Jan. 17, 2013, (25 pgs.). (Provided in U.S. Appl. No. 15/065,483). |
| U.S. Appl. No. 15/065,483, entitled, “Memory as a Programmable Logic Device,” filed Feb. 22, 2013, (30 pgs.). (Provided in U.S. Appl. No. 15/065,483). |
| U.S. Appl. No. 15/065,483, entitled, “Neural Network in a Memory Device,” filed Feb. 22, 2013, (63 pgs.). (Provided in U.S. Appl. No. 15/065,483). |
| U.S. Appl. No. 15/065,483, entitled, “Performing Complex Arithmetic Functions in a Memory Device,” filed Mar. 12, 2013, (23 pgs.). (Provided in U.S. Appl. No. 15/065,483). |
| Warren Jr., Henry S., “Hacker's Delight”, Second Edition, Oct. 2013, pp. 181-184 and 194. (Provided in U.S. Appl. No. 15/065,483). |
| Number | Date | Country | |
|---|---|---|---|
| 20210132946 A1 | May 2021 | US |
| Number | Date | Country | |
|---|---|---|---|
| 62132891 | Mar 2015 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | 16207786 | Dec 2018 | US |
| Child | 17151039 | US | |
| Parent | 15065483 | Mar 2016 | US |
| Child | 16207786 | US |
