Patent Grant
9990967
The present disclosure relates generally to semiconductor memory and methods, and more particularly, to apparatuses and methods related to performing logical operations using sensing circuitry.
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 such as arithmetic logic unit (ALU) circuitry, floating point unit (FPU) circuitry, and/or a combinatorial logic block, for example, which can be used to execute instructions by performing logical operations such as AND, OR, NOT, NAND, NOR, and XOR, and invert (e.g., inversion) logical operations on data (e.g., one or more operands). For example, functional unit circuitry may be used to perform arithmetic operations such as addition, subtraction, multiplication, and/or division on operands via a number of logical operations.
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) 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 instructions 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 is accessed via a bus between the processing resources and the memory array to execute a set of instructions. Processing performance may be improved in a processor-in-memory (PIM) device, in which a processor may be implemented internal and/or near to a memory (e.g., directly on a same chip as the memory array), which may conserve time and power in processing.
An example apparatus comprises a first group of memory cells coupled to an access line and a plurality of sense lines and a second group of memory cells coupled to a plurality of access lines and a sense line. The example apparatus comprises a controller configured to cause sensing circuitry to perform a corner turn operation on an element stored in the first group of memory cells resulting in the element being stored in the second group of memory cells.
According to various embodiments of the present disclosure, sensing circuitry is configured to perform a number of logical operations (e.g., AND operations, SHIFT operations, etc.) to perform the corner turn operation. The corner turn operation can include performing the corner turn operation on a number of elements stored in memory cells of the array coupled to an access line and a plurality of sense lines. For example, the number of elements can be stored in a horizontal fashion, as illustrated in the provided figures below, prior to performing the corner turn operations. The corner turn operation can result in the number of elements being stored in memory cells of the array coupled to a sense line and a plurality of access lines. For example, a result of the corner turn operations can include the number of elements being stored in a vertical fashion, as illustrated below in the provided figures. An element being stored in cells coupled to a single sense line can be beneficial when performing a number of PIM operations in accordance with embodiments of the present disclosure.
As described further herein, in a number of embodiments, the corner turn operations can result in the number of elements being stored in memory cells coupled to a particular sense line and plurality of access lines. For example, the number of elements can be stored vertically in a particular vertical column of memory cells based on a skip value that indicates how many columns to shift the elements when being stored vertically. When the skip value is equal to one, the vertically stored number of elements would be shifted one column. When the skip value is equal to two, the vertically stored number of elements would be shifted two columns, etc.
A number of embodiments of the present disclosure can provide improved parallelism and/or reduced power consumption in association with performing logical operations as compared to previous systems having an external processor (e.g., a processing resource located external from a memory array, such as on a separate integrated circuit chip). For instance, a number of embodiments can provide for performing fully complete logical operations such as integer add, subtract, multiply, divide, and CAM (content addressable memory) functions without transferring data out of the memory array and sensing circuitry via a bus (e.g., data bus, address bus, control bus), for instance. Such logical operations can involve performing a number of logical functions (e.g., logical functions such as AND, OR, NOT, NOR, NAND, XOR, etc.). However, embodiments are not limited to these examples. For instance, performing logical operations can include performing a number of non-Boolean logic operations such as sense amplifier set, sense amplifier clear, copy, compare, destroy, etc.
In previous approaches, data may be transferred from the array and sensing circuitry (e.g., via a bus comprising input/output (I/O) lines) to 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, transferring data from a memory array and sensing circuitry to such processing resource(s) can involve significant power consumption. 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, which can involve performing a sense line (which may be referred to herein as a digit line or data line) address access (e.g., firing of a column decode signal) in order to transfer data from sense lines onto I/O lines (e.g., local I/O lines), moving the data to the array periphery, and providing the data to the circuitry to perform the compute function.
Some advantages of embodiments of the present disclosure over previous approaches can include capability for implementing a greater quantity of logical operations using a same circuit configuration, and increased flexibility in implementing a plurality of logical operations. Logical operations can be selected dynamically from among a number of possible logical operations. Capability to select a number of different logical operations to implement directly can result in faster operations with fewer manipulations and movements (e.g., storing intermediate results) of data. And direct implementation of a plurality of different logical operations can use less power to obtain a result due in part to less movement of intermediate results. Also, embodiments of the present disclosure can be used to directly implement XOR and XNOR logical operations (e.g., in a single operation), rather than by obtaining the result via one or more logical operations involving intermediate results.
Furthermore, the circuitry of the processing resource(s) (e.g., compute engine) may not conform to pitch rules associated with a memory array. For example, the cells of a memory array may have a 4F2 or 6F2 cell size, where “F” is a feature size corresponding to the cells. As such, the devices (e.g., logic gates) associated with ALU circuitry of previous PIM systems may not be capable of being formed on pitch with the memory cells, which can affect chip size and/or memory density, for example.
For example, the sensing circuitry 150 described herein can be formed on a same pitch as a pair of complementary sense lines. As an example, a pair of complementary memory cells may have a cell size with a 6F2 pitch (e.g., 3F×2F). If the pitch of a pair of complementary sense lines for the complementary memory cells is 3F, then the sensing circuitry being on pitch indicates the sensing circuitry (e.g., a sense amplifier and corresponding compute component per respective pair of complementary sense lines) is formed to fit within the 3F pitch of the complementary sense lines.
Furthermore, the circuitry of the processing resource(s) of various prior systems may not conform to pitch rules associated with a memory array. For example, the memory cells of a memory array may have a 4F2 or 6F2 cell size. As such, the devices (e.g., logic gates) associated with ALU circuitry of previous systems may not be capable of being formed on pitch with the memory cells (e.g., on a same pitch as the sense lines), which can affect chip size and/or memory density, for example. In the context of some computing systems and subsystems (e.g., a central processing unit (CPU)), data may be processed in a location that is not on pitch and/or on chip with memory (e.g., memory cells in the array), as described herein. The data may be processed by a processing resource associated with a host, for instance, rather than on pitch with the memory.
In contrast, a number of embodiments of the present disclosure can include the sensing circuitry 150 (e.g., including sense amplifiers and/or compute components) being formed on pitch with the memory cells of the array. The sensing circuitry 150 can be configured for (e.g., capable of) performing logical operations. A number of embodiments of the present disclosure include sensing circuitry formed on pitch with memory cells of the array and capable of performing logical functions such as those described herein below.
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 designator “N,” 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, 206 may reference element “06” in
System 100 includes a host 110 coupled (e.g., connected) 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 smart phone, 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. 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 may also be received to controller 140 (e.g., via address circuitry 142 and/or via bus 154). 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 data 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 controller 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 control circuitry. Controller 140 can be implemented in hardware, firmware, and/or software. Controller 140 can also control shifting circuitry, which can be implemented, for example, in the sensing circuitry 150 according to various embodiments.
Examples of the sensing circuitry 150 are described further below. For instance, in a number of embodiments, the sensing circuitry 150 can comprise a number of sense amplifiers (e.g., sense amplifier shown as 206 in
In a number of embodiments, the sensing circuitry (e.g., 150) can be used to perform logical operations (e.g., corner turn operations) using data stored in array 130 as inputs and store the results of the logical operations back to the array 130 without transferring data via a sense line address access (e.g., without firing a column decode signal). As such, various logical functions can be performed using, and within, sensing circuitry 150 rather than (or in association with) being performed by processing resources external to the sensing circuitry (e.g., by a processor associated with host 110 and/or other processing circuitry, such as ALU circuitry, located on device 120 (e.g., on controller 140 or elsewhere)).
In various previous approaches, data associated with an operand, for instance, would be read from memory via sensing circuitry and provided to external ALU circuitry via I/O lines (e.g., via local I/O lines and/or global I/O lines). The external ALU circuitry could include a number of registers and would perform logical functions using the operands, and the result would be transferred back to the array (e.g., 130) via the I/O lines. In contrast, in a number of embodiments of the present disclosure, sensing circuitry (e.g., 150) is configured to perform logical operations on data stored in memory (e.g., array 130) and store the result back to the memory without enabling an I/O line (e.g., a local I/O line) coupled to the sensing circuitry, which can be formed on pitch with the memory cells of the array. Enabling an I/O line can include enabling (e.g., turning on) a transistor having a gate coupled to a decode signal (e.g., a column decode signal) and a source/drain coupled to the I/O line. Embodiments are not so limited. For instance, in a number of embodiments, the sensing circuitry (e.g., 150) can be used to perform logical operations without enabling column decode lines of the array; however, the local I/O line(s) may be enabled in order to transfer a result to a suitable location other than back to the array (e.g., to an external register).
As such, in a number of embodiments, various circuitry external to array 130 and sensing circuitry 150 (e.g., external registers associated with an ALU) is not needed to perform logical functions as the sensing circuitry 150 can perform the appropriate logical operations to perform such logical functions without the use of an external processing resource. Therefore, the sensing circuitry 150 may be used to compliment and/or to replace, at least to some extent, such an external processing resource (or at least the bandwidth of such an external processing resource). However, in a number of embodiments, the sensing circuitry 150 may be used to perform logical operations (e.g., to execute instructions) in addition to logical operations performed by an external processing resource (e.g., host 110). For instance, host 110 and/or sensing circuitry 150 may be limited to performing only certain logical operations and/or a certain number of logical operations.
The cells of the memory array 230 can be arranged in rows coupled by word lines 204-X (ROW X), 204-Y (ROW Y), etc., and columns coupled by pairs of complementary sense lines (e.g., data lines DIGIT(n)/DIGIT(n)_). The individual sense lines corresponding to each pair of complementary sense lines can also be referred to as data lines 205-1 (D) and 205-2 (D_) respectively. Although only one pair of complementary data lines (e.g., one column) are shown in
Memory cells can be coupled to different data lines and/or word lines. For example, a first source/drain region of a transistor 202-1 can be coupled to data line 205-1 (D), a second source/drain region of transistor 202-1 can be coupled to capacitor 203-1, and a gate of a transistor 202-1 can be coupled to word line 204-Y. A first source/drain region of a transistor 202-2 can be coupled to data line 205-2 (D_), a second source/drain region of transistor 202-2 can be coupled to capacitor 203-2, and a gate of a transistor 202-2 can be coupled to word line 204-X. The cell plate, as shown in
The memory array 230 is coupled to sensing circuitry 250 in accordance with a number of embodiments of the present disclosure. In this example, the sensing circuitry 250 comprises a sense amplifier 206 and a compute component 231 corresponding to respective columns of memory cells (e.g., coupled to respective pairs of complementary data lines). The sensing circuitry 250 can correspond to sensing circuitry 150 shown in
The logical operation selection logic 213 can be configured to include pass gate logic for controlling pass gates that couple the pair of complementary sense lines 205-1 and 205-2 un-transposed between the sense amplifier 206 and the compute component 231 (as shown in
The sense amplifier 206 can be operated to determine a data value (e.g., logic state) stored in a selected memory cell. The sense amplifier 206 can comprise a cross coupled latch, which can be referred to herein as a primary latch. In the example illustrated in
In operation, when a memory cell is being sensed (e.g., read), the voltage on one of the data lines 205-1 (D) or 205-2 (D_) will be slightly greater than the voltage on the other one of data lines 205-1 (D) or 205-2 (D_). An ACT signal can be driven high and the RNL* signal can be driven low to enable (e.g., fire) the sense amplifier 206. The data line 205-1 (D) or 205-2 (D_) having the lower voltage will turn on one of the PMOS transistor 229-1 or 229-2 to a greater extent than the other of PMOS transistor 229-1 or 229-2, thereby driving high the data line 205-1 (D) or 205-2 (D_) having the higher voltage to a greater extent than the other data line 205-1 (D) or 205-2 (D_) is driven high.
Similarly, the data line 205-1 (D) or 205-2 (D_) having the higher voltage will turn on one of the NMOS transistor 227-1 or 227-2 to a greater extent than the other of the NMOS transistor 227-1 or 227-2, thereby driving low the data line 205-1 (D) or 205-2 (D_) having the lower voltage to a greater extent than the other data line 205-1 (D) or 205-2 (D_) is driven low. As a result, after a short delay, the data line 205-1 (D) or 205-2 (D_) having the slightly greater voltage is driven to the voltage of the supply voltage VDD (e.g., through a source transistor (not shown)), and the other data line 205-1 (D) or 205-2 (D_) is driven to the voltage of the reference voltage (e.g., to ground (GND) through a sink transistor (not shown)). Therefore, the cross coupled NMOS transistors 227-1 and 227-2 and PMOS transistors 229-1 and 229-2 serve as a sense amplifier pair, which amplify the differential voltage on the data lines 205-1 (D) and 205-2 (D_) and operate to latch a data value sensed from the selected memory cell.
Embodiments are not limited to the sense amplifier 206 configuration illustrated in
The sense amplifier 206 can, in conjunction with the compute component 231, 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 logical operations associated therewith using less power than various previous approaches. Additionally, since a number of embodiments can eliminate the need to transfer data across I/O lines in order to perform logical functions (e.g., between memory and discrete processor), a number of embodiments can enable an increased parallel processing capability as compared to previous approaches.
The sense amplifier 206 can further include equilibration circuitry 214, which can be configured to equilibrate the data lines 205-1 (D) and 205-2 (D_). In this example, the equilibration circuitry 214 comprises a transistor 224 coupled between data lines 205-1 (D) and 205-2 (D_). The equilibration circuitry 214 also comprises transistors 225-1 and 225-2 each having a first source/drain region coupled to an equilibration voltage (e.g., VDD/2), where VDD is a supply voltage associated with the array. A second source/drain region of transistor 225-1 can be coupled data line 205-1 (D), and a second source/drain region of transistor 225-2 can be coupled data line 205-2 (D_). Gates of transistors 224, 225-1, and 225-2 can be coupled together, and to an equilibration (EQ) control signal line 226. As such, activating EQ enables the transistors 224, 225-1, and 225-2, which effectively shorts data lines 205-1 (D) and 205-2 (D_) together and to the an equilibration voltage (e.g., VDD/2).
Although
As described further below, in a number of embodiments, the sensing circuitry (e.g., sense amplifier 206 and compute component 231) can be operated to perform a selected logical operation and initially store the result in one of the sense amplifier 206 or the compute component 231 without transferring data from the sensing circuitry via an I/O line (e.g., without performing a data line address access via activation of a column decode signal, for instance).
Performance of logical operations (e.g., Boolean logical functions involving data values) is fundamental and commonly used. Boolean logical functions are used in many higher level functions. Consequently, speed and/or power efficiencies that can be realized with improved logical operations, which can translate into speed and/or power efficiencies of higher order functionalities. Described herein are apparatuses and methods for performing logical operations without transferring data via an input/output (I/O) line and/or without transferring data to a control component external to the array. Depending on memory array architecture, the apparatuses and methods for performing the logical operations may not require amplification of a sense line (e.g., data line, digit line, bit line) pair.
As shown in
According to the embodiment illustrated in
According to some embodiments and as illustrated in
The compute components 331 (e.g., stages) of the loadable shift register can comprise a first right-shift transistor 381 having a gate coupled to a first right-shift control line 380 (e.g., “PHASE 1R”), and a second right-shift transistor 386 having a gate coupled to a second right-shift control line 382 (e.g., “PHASE 2R”). Node ST2 of each stage of the loadable shift register is coupled to an input of a first inverter 387. The output of the first inverter 387 (e.g., node SF1) is coupled to one source/drain of the second right-shift transistor 386, and another source/drain of the second right-shift transistor 386 is coupled to an input of a second inverter 388 (e.g., node SF2). The output of the second inverter 388 (e.g., node ST1) is coupled to one source/drain of the first right-shift transistor 381, and another source/drain of the first right-shift transistor 381 is coupled to an input of a second inverter (e.g., node SF2) for an adjacent compute component 331. Latch transistor 385 has a gate coupled to a LATCH control signal 384. One source/drain of the latch transistor 385 is coupled to node ST2, and another source/drain of the latch transistor 385 is coupled to node ST1.
Sense amplifiers 306 can be coupled to respective pairs of complementary sense lines 305-1 and 305-2, and corresponding compute components 331 coupled to the sense amplifiers 306 via respective pass gates 307-1 and 307-2. The gates of the pass gates 307-1 and 307-2 can be controlled by respective logical operation selection logic signals, “Passd” and “Passdb,” which can be output from logical operation selection logic (not shown for clarity).
A first left-shift transistor 389 is coupled between node SF2 of one loadable shift register to node SF1 of a loadable shift register corresponding to an adjacent compute component 331. The channel of second left-shift transistor 390 is coupled from node ST2 to node ST1. The gate of the first left-shift transistor 389 is coupled to a first left-shift control line 391 (e.g., “PHASE 1L”), and the gate of the second left-shift transistor 390 is coupled to a second left-shift control line 392 (e.g., “PHASE 2L”).
The logical operation selection logic 313-6 includes the swap gates 342, as well as logic to control the pass gates 307-1 and 307-2 and the swap gates 342. The logical operation selection logic 313-6 includes four logic selection transistors: logic selection transistor 362 coupled between the gates of the swap transistors 342 and a TF signal control line, logic selection transistor 352 coupled between the gates of the pass gates 307-1 and 307-2 and a TT signal control line, logic selection transistor 354 coupled between the gates of the pass gates 307-1 and 307-2 and a FT signal control line, and logic selection transistor 364 coupled between the gates of the swap transistors 342 and a FF signal control line. Gates of logic selection transistors 362 and 352 are coupled to the true sense line through isolation transistor 350-1 (having a gate coupled to an ISO signal control line). Gates of logic selection transistors 364 and 354 are coupled to the complementary sense line through isolation transistor 350-2 (also having a gate coupled to an ISO signal control line).
Data values on the respective pairs of complementary sense lines 305-1 and 305-2 can be loaded into the corresponding compute components 331 (e.g., loadable shift register) by causing the pass gates 307-1 and 307-2 to conduct, such as by causing the Passd control signal to go high. Gates that are controlled to have continuity (e.g., electrical continuity through a channel) are conducting, and can be referred to herein as being OPEN. Gates that are controlled to not have continuity (e.g., electrical continuity through a channel) are said to be non-conducting, and can be referred to herein as being CLOSED. For instance, continuity refers to a low resistance condition in which a gate is conducting. The data values can be loaded into the respective compute components 331 by either the sense amplifier 306 overpowering the corresponding compute component 331 (e.g., to overwrite an existing data value in the compute component 331) and/or by turning off the PHASE 1R and PHASE 2R control signals 380 and 382 and the LATCH control signal 384. A first latch (e.g., sense amplifier) can be configured to overpower a second latch (e.g., compute component) when the current provided by the first latch and presented to the second latch is sufficient to flip the second latch.
The sense amplifier 306 can be configured to overpower the compute component 331 by driving the voltage on the pair of complementary sense lines 305-1 and 305-2 to the maximum power supply voltage corresponding to a data value (e.g., driving the pair of complementary sense lines 305-1 and 305-2 to the rails), which can change the data value stored in the compute component 331. According to a number of embodiments, the compute component 331 can be configured to communicate a data value to the pair of complementary sense lines 305-1 and 305-2 without driving the voltages of the pair of complementary sense lines 305-1 and 305-2 to the rails (e.g., to VDD or GND). As such, the compute component 331 can be configured to not overpower the sense amplifier 306 (e.g., the data values on the pair of complementary sense lines 305-1 and 305-2 from the compute component 331 will not change the data values stored in the sense amplifier 306 until the sense amplifier is enabled.
Once a data value is loaded into a compute component 331 of the loadable shift register, the true data value is separated from the complement data value by the first inverter 387. The data value can be shifted to the right (e.g., to an adjacent compute component 331) by alternate operation of first right-shift transistor 381 and second right-shift transistor 386, which can be accomplished when the first right-shift control line 380 and the second right-shift control line 382 have periodic signals that go high out-of-phase from one another (e.g., non-overlapping alternating square waves 180 degrees out of phase with one another). LATCH control signal 384 can be activated to cause latch transistor 385 to conduct, thereby latching the data value into a corresponding compute component 331 of the loadable shift register (e.g., while signal PHASE 1R remains low and PHASE 2R remains high to maintain the data value latched in the compute component 331).
Each column of memory cells can be coupled to sensing circuitry (e.g., sensing circuitry 150 shown in
In a number of embodiments, the sensing circuitry (e.g., compute components 431 and sense amplifiers 406) is configured to perform corner turn operations on an element stored in array 401. As an example, a first element (e.g., a 4-bit element) can be stored in a first group of memory cells (e.g., cells 403-0 to 403-3) coupled to a particular access line (e.g., 404-0) and to a number of sense lines (e.g., 405-0 to 405-3), referred to herein as stored in a horizontal fashion, as illustrated. A number of corner turn operations can be performed on the first element, resulting in the first element being stored in a second group of memory cells coupled to a plurality of access lines (e.g., 404-1 to 404-4) and to a sense line (e.g., 405-0), referred to herein as stored in a vertical fashion, as illustrated.
In a number of embodiments, the sensing circuitry (e.g., compute components 431 and sense amplifiers 406) is configured to perform corner turn operations on a plurality of elements stored in array 401. As an example, a first plurality of elements (two elements each 4-bits wide, in this example) can be stored in a first group of memory cells (e.g., cells 403-0 to 403-7) coupled to a particular access line (e.g., 404-0) and to a number of sense lines (e.g., 405-0 to 405-7), referred to herein as stored in a horizontal fashion. A second plurality of elements (e.g., two elements each 4-bits wide, in this example) can be stored in a second group of memory cells coupled to a different access line (e.g., 404-1) and the respective number of sense lines (405-0 to 405-7). A number of corner turn operations can be performed on the first plurality of elements resulting in each of the elements being stored in a third group of memory cells coupled to a plurality of access lines and a sense line (e.g., in a vertical fashion, as illustrated). For example, a first element of the first plurality of elements can be stored in cells coupled to access lines 404-2 to 404-5 and sense line 405-0 after performing the number of corner turn operations. A second element of the first plurality of elements can be stored in cells coupled to access lines 404-2 to 404-5 and sense line 405-1 after performing the number of corner turns. In addition, after performing the number of corner turn operations, a first element of the second plurality of elements can be stored in cells coupled to access lines 404-2 to 404-5 and sense line 405-4 and a second element of the second plurality of elements can be stored in cells coupled to access lines 404-2 to 404-5 and sense line 405-5. While the example described above refers to two elements per row, examples are not so limited.
The example shown in
In the example below, the eight elements are represented by bit-vector SRC 537 (e.g., [1111 1111, 1111 1111, 1111 1111, 1111 1111]), which can be represented in hexadecimal notation as [0X FF,FF,FF,FF] (where the “0X” notation indicates hexadecimal and commas can group a pair of elements for ease of reference) and is shown in
In this example, the bit-vectors TMP_LOOKUP 533, DEST 535, and SRC 537 have a length of 32 bits and eight elements that are each 4 bits wide. It is noted that although hexadecimal notation is used in
The expected result of corner turning SRC 537 (e.g., [0XFF,FF,FF,FF]) is bit-vector [0X88,88,88,88; 0X88,88,88,88; 0X88,88,88,88; 0X88,88,88,88]. As described further below, the result of performing a corner turn can be stored as a bit-vector in a particular group of memory cells. For instance, in the example of
As described further below, the bit vectors 533 (TMP_LOOKUP), 535 (DEST) and 537 (SRC) can be used in association with performing a plurality of corner turn operations on eight elements of the SRC bit-vector 537. The bit-vectors 533, 535, and 537 can be stored in respective groups of memory cells coupled to particular access lines, which may be referred to as temporary storage rows. As used herein, temporary storage rows of memory cells are storing data that may be updated during various phases of a plurality of corner turn operations. As an example, the bit-vectors 533 and 535 can have a same length as the SRC bit-vector 537, respectively, and can be stored in cells coupled to the same sense lines as the SRC bit-vector 537 (e.g., sense lines 405-0 to 405-31). For instance, the bit-vector 533 (TMP_LOOKUP) can have a length of 32 bits and can be stored in a group of cells coupled to access line 404-1 and to sense lines 405-0 to 405-31. The bit-vectors 535 (DEST) can have lengths of 32 bits and can each be stored in a group of cells coupled to access line 404-3 (corresponding to a first row of data), 404-4 (corresponding to a second row of data), 404-5 (corresponding to a third row of data), and 404-6 (corresponding to a fourth row of data) and to sense lines 405-0 to 405-31. The bit-vector 531 (COMP_COMP) represents the data stored in the sensing circuitry (e.g., compute components 431 and/or sense amplifiers 406) corresponding to the sense lines having cells coupled thereto which store elements being divided (e.g., sense lines 405-0 to 405-31 in this example). A first row of data of SRC 537 (e.g., [0XFF,FF,FF,FF]) can have a length of 32 bits and can be stored in a group of cells coupled to access line 404-0 and to sense lines 405-0 to 405-31.
In the example described in association with
The below pseudocode represents instructions executable to perform a number of corner turn operations in a memory in accordance with a number of embodiments of the present disclosure. The example pseudocode is referenced using reference numbers 0-3, which correspond to the reference numbers of the rows shown in the tables of
0. Get Temp Rows TMP_LOOKUP, DEST and Load SRC;
1. Generate LSB;
2. Store COMP_COMP as TMP_LOOKUP;
3. Run fixed LOOP for element width;
For purposes of discussion, the above pseudo code will be divided into a setup phase and a corner turn phase associated with performing a corner turn operation (e.g., corner turning the thirty-two elements of the SRC bit-vector 537). The pseudo code referenced by reference numbers 0-2 can correspond to the setup phase. The setup phase can be performed simultaneously for a number of the corner turn operations. In the example illustrated in
In a number of embodiments, the setup phase can be performed simultaneously for all of the elements that will be corner turned. The results (e.g., the resulting stored bit-vectors) corresponding to a number of operations performed in the setup phase are shown in
Reference number 1 (e.g., “Generate LSB”) of the above pseudocode can be associated with determining a least significant bit (LSB) of each of the elements. A number of methods to determine the LSBs can be used but, as an example, one method can include setting all values of COMP_COMP 531 to include a particular value (e.g., a “1”, resulting in bit-vector [0XFF,FF,FF,FF]), shift left one position while replacing shifted values at an end of an element with “0”s (resulting in bit-vector [0XEE,EE,EE,EE]), and invert the result to obtain LSBs (e.g., [0X11,11,11,11], illustrated as COMP_COMP 531 at 551-1 in
At the conclusion of the setup phase corresponding to reference numbers 0-2 of the above pseudocode, and as shown in row 551-2 of
Reference number 3 (e.g., 3a to 3f) of the above pseudocode corresponds to the corner turn phase of a corner turn operation in accordance with a number of embodiments of the present disclosure. Reference number 3 (e.g., “Run fixed LOOP for element width”) of the above pseudocode is associated with performing a LOOP including a number of iterations corresponding to an element width. In this example, each of the elements of SRC 537 are 4 bits wide therefore four iterations of the loop will be performed. A first iteration of the loop is associated with the description of
During a first iteration of the loop, reference number 3a (e.g., “Perform AND on COMP_COMP and SRC”) of the above pseudocode is associated with performing an AND operation on COMP_COMP 531 (e.g., [0X11,11,11,11]) and SRC 537 (e.g., [0XFF,FF,FF,FF]). Performing the AND operation results in bit-vector [0X11,11,11,11] being stored as COMP_COMP 531, as illustrated at 551-3.1a in
Reference number 3b (e.g., “SHIFT Left=Element Width−C−1”) of the above pseudocode is associated with performing a SHIFT operation on COMP_COMP 531 (e.g., [0X11,11,11,11]). The SHIFT operation is performed in a direction of a most significant bit, as illustrated, which is referred to as a leftward direction in this example. The number of positions to shift each of the data values (e.g., bits) stored as COMP_COMP 531 is determined based on an element width, an iteration of the loop, and a subtraction of a value of “1.” The elements in this example are 4 bits in width and this is the first iteration (corresponding to a value of C=0”, whereas a second iteration has C=1, a third has C=2, and a fourth has C=3). Therefore, a shift is performed equal to shifting each data value three positions (since 4−0−1=3) to the left, as illustrated, resulting in bit-vector [0X88,88,88,88], as illustrated as COMP_COMP 531 at 551-3.1b in
Reference number 3c (e.g., “Store COMP_COMP as DEST row=C”) of the above pseudocode is associated with storing COMP_COMP 531 (e.g., [0X88,88,88,88]) as a row of DEST 535 equal to C (e.g., 0 for a first iteration). For example, COMP_COMP 531 (e.g., [0X88,88,88,88]) is stored in memory cells corresponding to a ROW 0 of DEST 535 (which in this case can refer to memory cells coupled to access line 404-2, which is the 0th row of DEST 535). As a result, a least significant bit of each of the elements is stored in a 0th row of DEST 535. For example, bolded bits of SRC 537 illustrated as [1111 1111, 1111 1111, 1111 1111,1111 1111] correspond to each successively stored bit (also bolded) of DEST 535 [1000 1000, 1000 1000, 1000 1000, 1000 1000; 1000 1000, 1000 1000, 1000 1000, 1000 1000; 1000 1000, 1000 1000, 1000 1000, 1000 1000; 1000 1000, 1000 1000, 1000 1000, 1000 1000]. While in this example the least significant bit is illustrated as a right-most bit, examples are not so limited. A most significant bit could be at a right-most position and then row 0 of DEST 535 would correspond to a most significant bit of each of the elements.
Reference number 3d (e.g., “Load TMP_LOOKUP as COMP_COMP”) of the above pseudocode is associated with loading TMP_LOOKUP 533 (e.g., [0X11,11,11,11]) as COMP_COMP 531, as illustrated at 551-3.1d. For example, each data unit (e.g., bit) of TMP_LOOKUP 533 is loaded into a corresponding compute component (e.g., compute components 431 in
During a second iteration of the loop, reference number 3a (e.g., “Perform AND on COMP_COMP and SRC”) of the above pseudocode is associated with performing an AND operation on COMP_COMP 531 (e.g., [0X22,22,22,22]) and SRC 537 (e.g., [0XFF,FF,FF,FF]). Performing the AND operation results in bit-vector [0X22,22,22,22] being stored as COMP_COMP 531, as illustrated at 551-3.2a in
Reference number 3b (e.g., “SHIFT Left=Element Width−C−1”) of the above pseudocode is associated with performing a SHIFT operation on COMP_COMP 531 (e.g., [0X22,22,22,22]). The SHIFT operation is performed in a direction of a most significant bit, as illustrated, which is referred to as a leftward direction in this example. The number of positions to shift each of the data values (e.g., bits) stored as COMP_COMP 531 is determined based on an element width, an iteration of the loop, and a subtraction of a value of “1.” The elements in this example are 4 bits in width and this is the second iteration (corresponding to a value of C=1”). Therefore, a shift is performed equal to shifting each data value two positions (since 4−1−1=2) to the left, as illustrated, resulting in bit-vector [0X88,88,88,88], as illustrated as COMP_COMP 531 at 551-3.2b in
Reference number 3c (e.g., “Store COMP_COMP as DEST row=C”) of the above pseudocode is associated with storing COMP_COMP 531 (e.g., [0X88,88,88,88]) as a row of DEST 535 equal to C (e.g., 1 for a second iteration). For example, COMP_COMP 531 (e.g., [0X88,88,88,88]) is stored in memory cells corresponding to a ROW 1 of DEST 535 (which in this case can refer to memory cells coupled to access line 404-3, which is the 1st row of DEST 535). As a result, a second least (third most) significant bit of each of the elements is stored in a 1st row of DEST 535. For example, bolded bits of SRC 537 illustrated as [1111 1111, 1111 1111, 1111 1111,1111 1111] correspond to each successively stored bit (also bolded) of DEST 535 [1000 1000, 1000 1000, 1000 1000, 1000 1000; 1000 1000, 1000 1000, 1000 1000, 1000 1000; 1000 1000, 1000 1000, 1000 1000, 1000 1000; 1000 1000, 1000 1000, 1000 1000, 1000 1000]. While in this example the second least (third most) significant bit is illustrated as a third-to-the-right bit, examples are not so limited. A most significant bit could be at a right-most position and then row 1 of DEST 535 would correspond to a second most significant bit of each of the elements.
Reference number 3d (e.g., “Load TMP_LOOKUP as COMP_COMP”) of the above pseudocode is associated with loading TMP_LOOKUP 533 (e.g., [0X22,22,22,22]) as COMP_COMP 531, as illustrated at 551-3.2d. For example, each data unit (e.g., bit) of TMP_LOOKUP 533 is loaded into a corresponding compute component (e.g., compute components 431 in
During a third iteration of the loop, reference number 3a (e.g., “Perform AND on COMP_COMP and SRC”) of the above pseudocode is associated with performing an AND operation on COMP_COMP 531 (e.g., [0X44,44,44,44]) and SRC 537 (e.g., [0XFF,FF,FF,FF]). Performing the AND operation results in bit-vector [0X44,44,44,44] being stored as COMP_COMP 531, as illustrated at 551-3.3a in
Reference number 3b (e.g., “SHIFT Left=Element Width−C−1”) of the above pseudocode is associated with performing a SHIFT operation on COMP_COMP 531 (e.g., [0X44,44,44,44]). The SHIFT operation is performed in a direction of a most significant bit, as illustrated, which is referred to as a leftward direction in this example. The number of positions to shift each of the data values (e.g., bits) stored as COMP_COMP 531 is determined based on an element width, an iteration of the loop, and a subtraction of a value of “1.” The elements in this example are 4 bits in width and this is the third iteration (corresponding to a value of C=2”). Therefore, a shift is performed equal to shifting each data value one position (since 4−2−1=1) to the left, as illustrated, resulting in bit-vector [0X88,88,88,88], as illustrated as COMP_COMP 531 at 551-3.3b in
Reference number 3c (e.g., “Store COMP_COMP as DEST row=C”) of the above pseudocode is associated with storing COMP_COMP 531 (e.g., [0X88,88,88,88]) as a row of DEST 535 equal to C (e.g., 2 for a third iteration). For example, COMP_COMP 531 (e.g., [0X88,88,88,88]) is stored in memory cells corresponding to a ROW 2 of DEST 535 (which in this case can refer to memory cells coupled to access line 404-4, which is the 2nd row of DEST 535). As a result, a second most (third least) significant bit of each of the elements is stored in a 2nd row of DEST 535. For example, bolded bits of SRC 537 illustrated as [1111 1111, 1111 1111, 1111 1111,1111 1111] correspond to each successively stored bit (also bolded) of DEST 535 [1000 1000, 1000 1000, 1000 1000, 1000 1000; 1000 1000, 1000 1000, 1000 1000, 1000 1000; 1000 1000, 1000 1000, 1000 1000, 1000 1000; 1000 1000, 1000 1000, 1000 1000, 1000 1000]. While in this example the second most (third least) significant bit is illustrated as a third from-the-right (second from the left) bit, examples are not so limited. A most significant bit could be at a right-most position and then row 2 of DEST 535 would correspond to a third most significant bit of each of the elements.
Reference number 3d (e.g., “Load TMP_LOOKUP as COMP_COMP”) of the above pseudocode is associated with loading TMP_LOOKUP 533 (e.g., [0X44,44,44,44]) as COMP_COMP 531, as illustrated at 551-3.3d. For example, each data unit (e.g., bit) of TMP_LOOKUP 533 is loaded into a corresponding compute component (e.g., compute components 431 in
During a fourth iteration of the loop, reference number 3a (e.g., “Perform AND on COMP_COMP and SRC”) of the above pseudocode is associated with performing an AND operation on COMP_COMP 531 (e.g., [0X88,88,88,88]) and SRC 537 (e.g., [0XFF,FF,FF,FF]). Performing the AND operation results in bit-vector [0X88,88,88,88] being stored as COMP_COMP 531, as illustrated at 551-3.4a in
Reference number 3b (e.g., “SHIFT Left=Element Width−C−1”) of the above pseudocode is associated with performing a SHIFT operation on COMP_COMP 531 (e.g., [0X88,88,88,88]). The SHIFT operation is performed in a direction of a most significant bit, as illustrated, which is referred to as a leftward direction in this example. The number of positions to shift each of the data values (e.g., bits) stored as COMP_COMP 531 is determined based on an element width, an iteration of the loop, and a subtraction of a value of “1.” The elements in this example are 4 bits in width and this is the fourth iteration (corresponding to a value of C=3”). Therefore, a shift is performed equal to shifting each data value zero positions (since 4−3−1=0) to the left, as illustrated, resulting in COMP_COMP 531 remaining bit-vector [0X88,88,88,88], as illustrated as COMP_COMP 531 at 551-3.4b in
Reference number 3c (e.g., “Store COMP_COMP as DEST row=C”) of the above pseudocode is associated with storing COMP_COMP 531 (e.g., [0X88,88,88,88]) as a row of DEST 535 equal to C (e.g., 3 for a fourth iteration). For example, COMP_COMP 531 (e.g., [0X88,88,88,88]) is stored in memory cells corresponding to a ROW 3 of DEST 535 (which in this case can refer to memory cells coupled to access line 404-5, which is the 3rd row of DEST 535). As a result, a most significant bit of each of the elements is stored in a 3rd row of DEST 535. For example, bolded bits of SRC 537 illustrated as [1111 1111, 1111 1111, 1111 1111,1111 1111] correspond to each successively stored bit (also bolded) of DEST 535 [1000 1000, 1000 1000, 1000 1000, 1000 1000; 1000 1000, 1000 1000, 1000 1000, 1000 1000; 1000 1000, 1000 1000, 1000 1000, 1000 1000; 1000 1000, 1000 1000, 1000 1000, 1000 1000]. While in this example the most significant bit is illustrated as a furthest left bit, examples are not so limited. A most significant bit could be at a right-most position and then row 3 of DEST 535 would correspond to a least significant bit of each of the elements.
Reference number 3d (e.g., “Load TMP_LOOKUP as COMP_COMP”) of the above pseudocode is associated with loading TMP_LOOKUP 533 (e.g., [0X88,88,88,88]) as COMP_COMP 531, as illustrated at 551-3.4d. For example, each data unit (e.g., bit) of TMP_LOOKUP 533 is loaded into a corresponding compute component (e.g., compute components 431 in
The example shown in
In the example below, the eight elements are represented by bit-vector SRC 645 (e.g., [1010 1010, 1010 1010, 1010 1010, 1010 1010]), which can be represented in hexadecimal notation as [0X AA,AA,AA,AA] (where the “0X” notation indicates hexadecimal and commas can group a pair of elements for ease of reference) and is shown in
In this example, the bit-vectors TMP_LOOKUP 641, DEST 643, and SRC 645 have a length of 32 bits and eight elements that are each 4 bits wide. It is noted that although hexadecimal notation is used in
The example illustrated in
As described further below, the bit vectors 641 (TMP_LOOKUP), 643 (DEST) and 645 (SRC) can be used in association with performing a plurality of corner turn operations with a skip on eight elements of the SRC bit-vector 645. The bit-vectors 641, 643, and 645 can be stored in respective groups of memory cells coupled to particular access lines, which may be referred to as temporary storage rows. As used herein, temporary storage rows of memory cells are storing data that may be updated during various phases of a plurality of corner turn operations. As an example, the bit-vectors 641 and 643 can have a same length as the SRC bit-vector 645, respectively, and can be stored in cells coupled to the same sense lines as the SRC bit-vector 645 (e.g., sense lines 405-0 to 405-31). For instance, the bit-vector 641 (TMP_LOOKUP) can have a length of 32 bits and can be stored in a group of cells coupled to access line 404-1 and to sense lines 405-0 to 405-31. The bit-vectors 643 (DEST) can have lengths of 32 bits and can each be stored in a group of cells coupled to access line 404-3 (corresponding to a first row of data), 404-4 (corresponding to a second row of data), 404-5 (corresponding to a third row of data), and 404-6 (corresponding to a fourth row of data) and to sense lines 405-0 to 405-31. The bit-vector 631 (COMP_COMP) represents the data stored in the sensing circuitry (e.g., compute components 431 and/or sense amplifiers 406) corresponding to the sense lines having cells coupled thereto which store elements being divided (e.g., sense lines 405-0 to 405-31 in this example). A first row of data of SRC 645 (e.g., [0XAA,AA,AA,AA]) can have a length of 32 bits and can be stored in a group of cells coupled to access line 404-0 and to sense lines 405-0 to 405-31.
In the example described in association with
The below pseudocode represents instructions executable to perform a number of corner turn operations in a memory in accordance with a number of embodiments of the present disclosure. The example pseudocode is referenced using reference numbers 0-3, which correspond to the reference numbers of the rows shown in the tables of
0. Get Temp Rows TMP_LOOKUP, DEST and Load SRC;
1. Generate LSB;
2. Store COMP_COMP as TMP_LOOKUP;
3. Run fixed LOOP for element width;
For purposes of discussion, the above pseudo code will be divided into a setup phase and a corner turn phase associated with performing a corner turn operation (e.g., corner turning the thirty-two elements of the SRC bit-vector 645). The pseudo code referenced by reference numbers 0-2 can correspond to the setup phase. The setup phase can be performed simultaneously for a number of the corner turn operations. In the example illustrated in
In a number of embodiments, the setup phase can be performed simultaneously for all of the elements that will be corner turned. The results (e.g., the resulting stored bit-vectors) corresponding to a number of operations performed in the setup phase are shown in
Reference number 1 (e.g., “Generate LSB”) of the above pseudocode can be associated with determining a least significant bit (LSB) of each of the elements. A number of methods to determine the LSBs can be used but, as an example, one method can include setting all values of COMP_COMP 631 to include a particular value (e.g., a “1”, resulting in bit-vector [0XFF,FF,FF,FF]), shift left one position while replacing shifted values at an end of an element with “0”s (resulting in bit-vector [0XEE,EE,EE,EE]), and invert the result to obtain LSBs (e.g., [0X11,11,11,11], illustrated as COMP_COMP 631 at 653-1 in
At the conclusion of the setup phase corresponding to reference numbers 0-2 of the above pseudocode, and as shown in row 653-2 of
Reference number 3 (e.g., 3a to 3g) of the above pseudocode corresponds to the corner turn phase of a corner turn operation in accordance with a number of embodiments of the present disclosure. Reference number 3 (e.g., “Run fixed LOOP for element width”) of the above pseudocode is associated with performing a LOOP including a number of iterations corresponding to an element width. In this example, each of the elements of SRC 645 are 4 bits wide therefore four iterations of the loop will be performed. A first iteration of the loop is associated with the description of
During a first iteration of the loop, reference number 3a (e.g., “Perform AND on COMP_COMP and SRC”) of the above pseudocode is associated with performing an AND operation on COMP_COMP 531 (e.g., [0X11,11,11,11]) and SRC 645 (e.g., [0XAA,AA,AA,AA]). Performing the AND operation results in bit-vector [0X00,00,00,00] being stored as COMP_COMP 531, as illustrated at 653-3.1a in
Reference number 3b (e.g., “SHIFT Left=Element Width−C−1”) of the above pseudocode is associated with performing a SHIFT operation on COMP_COMP 631 (e.g., [0X00,00,00,00]). The SHIFT operation is performed in a direction of a most significant bit, as illustrated, which is referred to as a leftward direction in this example. The number of positions to shift each of the data values (e.g., bits) stored as COMP_COMP 631 is determined based on an element width, an iteration of the loop, and a subtraction of a value of “1.” The elements in this example are 4 bits in width and this is the first iteration (corresponding to a value of C=0”, whereas a second iteration has C=1, a third has C=2, and a fourth has C=3). Therefore, a shift is performed equal to shifting each data value three positions (since 4−0−1=3) to the left, as illustrated, resulting in bit-vector [0X00,00,00,00], as illustrated as COMP_COMP 631 at 653-3.1b in
Reference number 3c (e.g., “SHIFT right Equal to Skip”) of the above pseudocode is associated with performing a SHIFT based on a particular skip value. A skip value can refer to a value that indicates how many shifts to perform in order to relocate an element stored in cells coupled to a plurality of access lines and a sense line. For example, a skip value of one (1) can indicate to store a value in a cell coupled to a second sense line rather than a first sense line when the first and the second sense lines are neighboring sense lines (e.g., sense lines 405-0 and 405-1). A skip value of two can indicate to store a data value in a third sense line (e.g., 405-2) rather than a first sense line (e.g., 405-0), etc. In this example described in relation to
Reference number 3d (e.g., “Store COMP_COMP as DEST row=C”) of the above pseudocode is associated with storing COMP_COMP 631 (e.g., [0X00,00,00,00]) as a row of DEST 643 equal to C (e.g., 0 for a first iteration). For example, COMP_COMP 631 (e.g., [0X00,00,00,00]) is stored in memory cells corresponding to a ROW 0 of DEST 643 (which in this case can refer to memory cells coupled to access line 404-2, which is the 0th row of DEST 643). As a result, a least significant bit of each of the elements is stored in a 0th row of DEST 643. For example, bolded bits of SRC 645 illustrated as [1010 1010, 1010 1010, 1010 1010, 1010 1010] correspond to each successively stored bit (also bolded) of DEST 643 [0000 0000, 0000 0000, 0000 0000, 0000 0000; 0000 0000, 0000 0000, 0000 0000, 0000 0000; 0000 0000, 0000 0000, 0000 0000, 0000 0000; 0000 0000, 0000 0000, 0000 0000, 0000 0000]. While in this example the least significant bit is illustrated as a right-most bit, examples are not so limited. A most significant bit could be at a right-most position and then row 0 of DEST 643 would correspond to a most significant bit of each of the elements.
Reference number 3e (e.g., “Load TMP_LOOKUP as COMP_COMP”) of the above pseudocode is associated with loading TMP_LOOKUP 641 (e.g., [0X11,11,11,11]) as COMP_COMP 631, as illustrated at 653-3.1e. For example, each data unit (e.g., bit) of TMP_LOOKUP 641 is loaded into a corresponding compute component (e.g., compute components 431 in
During a second iteration of the loop, reference number 3a (e.g., “Perform AND on COMP_COMP and SRC”) of the above pseudocode is associated with performing an AND operation on COMP_COMP 631 (e.g., [0X22,22,22,22]) and SRC 645 (e.g., [0XAA,AA,AA,AA]). Performing the AND operation results in bit-vector [0X22,22,22,22] being stored as COMP_COMP 631, as illustrated at 653-3.2a in
Reference number 3b (e.g., “SHIFT Left=Element Width−C−1”) of the above pseudocode is associated with performing a SHIFT operation on COMP_COMP 631 (e.g., [0X22,22,22,22]). The SHIFT operation is performed in a direction of a most significant bit, as illustrated, which is referred to as a leftward direction in this example. The number of positions to shift each of the data values (e.g., bits) stored as COMP_COMP 631 is determined based on an element width, an iteration of the loop, and a subtraction of a value of “1.” The elements in this example are 4 bits in width and this is the second iteration (corresponding to a value of C=1”). Therefore, a shift is performed equal to shifting each data value two positions (since 4−1−1=2) to the left, as illustrated, resulting in bit-vector [0X88,88,88,88], as illustrated as COMP_COMP 631 at 653-3.2b in
Reference number 3c (e.g., “SHIFT right Equal to Skip”) of the above pseudocode is associated with performing a SHIFT based on a particular skip value. In this example described in relation to
Reference number 3d (e.g., “Store COMP_COMP as DEST row=C”) of the above pseudocode is associated with storing COMP_COMP 631 (e.g., [0X44,44,44,44]) as a row of DEST 643 equal to C (e.g., 1 for a second iteration). For example, COMP_COMP 631 (e.g., [0X44,44,44,44]) is stored in memory cells corresponding to a ROW 1 of DEST 643 (which in this case can refer to memory cells coupled to access line 404-3, which is the 1st row of DEST 643). As a result, a second least (third most) significant bit of each of the elements is stored in a 1st row of DEST 643. For example, bolded bits of SRC 645 illustrated as [1010 1010, 1010 1010, 1010 1010, 1010 1010] correspond to each successively stored bit (also bolded) of DEST 643 [0000 0000, 0000 0000, 0000 0000, 0000 0000; 0100 0100, 0100 0100, 0100 0100, 0100 0100; 0000 0000, 0000 0000, 0000 0000, 0000 0000; 0000 0000, 0000 0000, 0000 0000, 0000 0000], illustrated as [0X00,00,00,00; 0X44,44,44,44; 0X00,00,00,00; 0X00,00,00,00] at 653-3.2d. While in this example the least significant bit is illustrated as a right-most bit, examples are not so limited. A most significant bit could be at a right-most position and then row 1 of DEST 643 would correspond to a second most significant bit of each of the elements.
Reference number 3e (e.g., “Load TMP_LOOKUP as COMP_COMP”) of the above pseudocode is associated with loading TMP_LOOKUP 641 (e.g., [0X22,22,22,22]) as COMP_COMP 631, as illustrated at 653-3.2e. For example, each data unit (e.g., bit) of TMP_LOOKUP 641 is loaded into a corresponding compute component (e.g., compute components 431 in
During a third iteration of the loop, reference number 3a (e.g., “Perform AND on COMP_COMP and SRC”) of the above pseudocode is associated with performing an AND operation on COMP_COMP 631 (e.g., [0X44,44,44,44]) and SRC 645 (e.g., [AA,AA,AA,AA]). Performing the AND operation results in bit-vector [0X00,00,00,00] being stored as COMP_COMP 631, as illustrated at 653-3.3a in
Reference number 3b (e.g., “SHIFT Left=Element Width−C−1”) of the above pseudocode is associated with performing a SHIFT operation on COMP_COMP 631 (e.g., [0X00,00,00,00]). The SHIFT operation is performed in a direction of a most significant bit, as illustrated, which is referred to as a leftward direction in this example. The number of positions to shift each of the data values (e.g., bits) stored as COMP_COMP 631 is determined based on an element width, an iteration of the loop, and a subtraction of a value of “1.” The elements in this example are 4 bits in width and this is the third iteration (corresponding to a value of C=2”). Therefore, a shift is performed equal to shifting each data value one position (since 4−2−1=1) to the left, as illustrated, resulting in bit-vector [0X00,00,00,00], as illustrated as COMP_COMP 631 at 653-3.3b in
Reference number 3c (e.g., “SHIFT right Equal to Skip”) of the above pseudocode is associated with performing a SHIFT based on a particular skip value. In this example described in relation to
Reference number 3d (e.g., “Store COMP_COMP as DEST row=C”) of the above pseudocode is associated with storing COMP_COMP 631 (e.g., [0X00,00,00,00]) as a row of DEST 643 equal to C (e.g., 2 for a third iteration). For example, COMP_COMP 631 (e.g., [0X00,00,00,00]) is stored in memory cells corresponding to a ROW 2 of DEST 643 (which in this case can refer to memory cells coupled to access line 404-3, which is the 2nd row of DEST 643). As a result, a third least (second most) significant bit of each of the elements is stored in a 2nd row of DEST 643. For example, bolded bits of SRC 645 illustrated as [1010 1010, 1010 1010, 1010 1010, 1010 1010] correspond to each successively stored bit (also bolded) of DEST 643 [0000 0000, 0000 0000, 0000 0000, 0000 0000; 0100 0100, 0100 0100, 0100 0100, 0100 0100; 0000 0000, 0000 0000, 0000 0000, 0000 0000; 0000 0000, 0000 0000, 0000 0000, 0000 0000], illustrated as [0X00,00,00,00; 0X44,44,44,44; 0X00,00,00,00; 0X00,00,00,00] at 653-3.3d. While in this example the least significant bit is illustrated as a right-most bit, examples are not so limited. A most significant bit could be at a right-most position and then row 2 of DEST 643 would correspond to a second most significant bit of each of the elements.
Reference number 3e (e.g., “Load TMP_LOOKUP as COMP_COMP”) of the above pseudocode is associated with loading TMP_LOOKUP 641 (e.g., [0X44,44,44,44]) as COMP_COMP 631, as illustrated at 653-3.3e. For example, each data unit (e.g., bit) of TMP— LOOKUP 641 is loaded into a corresponding compute component (e.g., compute components 431 in
During a fourth iteration of the loop, reference number 3a (e.g., “Perform AND on COMP_COMP and SRC”) of the above pseudocode is associated with performing an AND operation on COMP_COMP 631 (e.g., [0X88,88,88,88]) and SRC 645 (e.g., [0XAA,AA,AA,AA]). Performing the AND operation results in bit-vector [0X88,88,88,88] being stored as COMP_COMP 631, as illustrated at 653-3.4a in
Reference number 3b (e.g., “SHIFT Left=Element Width−C−1”) of the above pseudocode is associated with performing a SHIFT operation on COMP_COMP 631 (e.g., [0X88,88,88,88]). The SHIFT operation is performed in a direction of a most significant bit, as illustrated, which is referred to as a leftward direction in this example. The number of positions to shift each of the data values (e.g., bits) stored as COMP_COMP 631 is determined based on an element width, an iteration of the loop, and a subtraction of a value of “1.” The elements in this example are 4 bits in width and this is the fourth iteration (corresponding to a value of C=3”). Therefore, a shift is performed equal to shifting each data value zero positions (since 4−3−1=0) to the left, as illustrated, resulting in COMP_COMP 631 remaining bit-vector [0X88,88,88,88], as illustrated as COMP_COMP 631 at 653-3.4b in
Reference number 3c (e.g., “SHIFT right Equal to Skip”) of the above pseudocode is associated with performing a SHIFT based on a particular skip value. In this example described in relation to
Reference number 3d (e.g., “Store COMP_COMP as DEST row=C”) of the above pseudocode is associated with storing COMP_COMP 631 (e.g., [0X44,44,44,44]) as a row of DEST 643 equal to C (e.g., 3 for a fourth iteration). For example, COMP_COMP 631 (e.g., [0X00,00,00,00]) is stored in memory cells corresponding to a ROW 3 of DEST 643 (which in this case can refer to memory cells coupled to access line 404-3, which is the 3rd row of DEST 643). As a result, a most significant bit of each of the elements is stored in a 3rd row of DEST 643. For example, bolded bits of SRC 645 illustrated as [1010 1010, 1010 1010, 1010 1010, 1010 1010] correspond to each successively stored bit (also bolded) of DEST 643 [0000 0000, 0000 0000, 0000 0000, 0000 0000; 0100 0100, 0100 0100, 0100 0100, 0100 0100; 0000 0000, 0000 0000, 0000 0000, 0000 0000; 0100 0100, 0100 0100, 0100 0100, 0100 0100], illustrated as [0X00,00,00,00; 0X44,44,44,44; 0X00,00,00,00; 0X44,44,44,44] at 653-3.4d. While in this example the least significant bit is illustrated as a right-most bit, examples are not so limited. A most significant bit could be at a right-most position and then row 3 of DEST 643 would correspond to a least significant bit of each of the elements.
Reference number 3e (e.g., “Load TMP_LOOKUP as COMP_COMP”) of the above pseudocode is associated with loading TMP_LOOKUP 641 (e.g., [0X88,88,88,88]) as COMP_COMP 631, as illustrated at 653-3.4e. For example, each data unit (e.g., bit) of TMP_LOOKUP 641 is loaded into a corresponding compute component (e.g., compute components 431 in
Logic Table 7-1 illustrated in
Via selective control of the pass gates 207-1 and 207-2 and the swap transistors 242, each of the three columns of the upper portion of Logic Table 7-1 can be combined with each of the three columns of the lower portion of Logic Table 7-1 to provide nine (e.g., 3×3) different result combinations, corresponding to nine different logical operations, as indicated by the various connecting paths shown at 775. The nine different selectable logical operations that can be implemented by the sensing circuitry 250 are summarized in Logic Table 7-2.
The columns of Logic Table 7-2 show a heading 780 that includes the states of logic selection control signals (e.g., FF, FT, TF, TT). For example, the state of a first logic selection control signal (e.g., FF) is provided in row 776, the state of a second logic selection control signal (e.g., FT) is provided in row 777, the state of a third logic selection control signal (e.g., TF) is provided in row 778, and the state of a fourth logic selection control signal (e.g., TT) is provided in row 779. The particular logical operation corresponding to the results is summarized in row 747.
The timing diagram shown in
As shown in
With the ROW X data value latched in the compute component 331, equilibration is disabled (e.g., EQ goes low at time T9). At time T10, ROW Y goes high to access (e.g., select) the ROW Y memory cell. At time T11, the sense amplifier 306 is enabled (e.g., SENSE AMP goes high), which drives the complementary sense lines 305-1 and 305-2 to the appropriate rail voltages (e.g., VDD and GND) responsive to the ROW Y data value (e.g., as shown by the DIGIT and DIGIT_signals), and the ROW Y data value is latched in the sense amplifier 306. At time T12, the PHASE 2R and PHASE 2L signals go low, which disables feedback on the latch of the compute component 331 (e.g., by turning off transistors 386 and 390, respectively) such that the value stored in the compute component may be overwritten during the logical operation. Also, at time T12, ISO goes low, which disables isolation transistors 350-1 and 350-2. Since the desired logical operation in this example is an AND operation, at time T13, TT is enabled while TF, FT and FF remain disabled (as shown in TABLE 7-2, FF=0, FT=0, TF=0, and TT=1 corresponds to a logical AND operation). Whether enabling TT results in PASS going high depends on the value stored in the compute component 331 when ISO is disabled at time T12. For example, enable transistor 352 will conduct if node ST2 was high when ISO is disabled, and enable transistor will not conduct if node ST2 was low when ISO was disabled at time T12.
In this example, if PASS goes high at time T13, the pass transistors 307-1 and 307-2 are enabled such that the DIGIT and DIGIT_signals, which correspond to the ROW Y data value, are provided to the respective compute component nodes ST2 and SF2. As such, the value stored in the compute component 331 (e.g., the ROW X data value) may be flipped, depending on the value of DIGIT and DIGIT_(e.g., the ROW Y data value). In this example, if PASS stays low at time T13, the pass transistors 307-1 and 307-2 are not enabled such that the DIGIT and DIGIT_signals, which correspond to the ROW Y data value, remain isolated from the nodes ST2 and SF2 of the compute component 331. As such, the data value in the compute component (e.g., the ROW X data value) would remain the same.
At time T14, TT is disabled, which results in PASS going (or remaining) low, such that the pass transistors 307-1 and 307-2 are disabled. It is noted that PASS* remains low between time T13 and T14 since the TF and FF signals remain low. At time T15, ROW Y is disabled, and PHASE 2R, PHASE 2L, and ISO are enabled. Enabling PHASE 2R and PHASE 2L at time T15 enables feedback on the latch of the compute component 331 such that the result of the AND operation (e.g., “A” AND “B”) is latched therein. Enabling ISO at time T15 again couples nodes ST2 and SF2 to the gates of the enable transistors 352, 354, 362, and 364. At time T16, equilibration is enabled (e.g., EQ goes high such that DIGIT and DIGIT are driven to an equilibrate voltage) and the sense amplifier 306 is disabled (e.g., SENSE AMP goes low).
The result of the AND operation, which is initially stored in the compute component 331 in this example, can be transferred back to the memory array (e.g., to a memory cell coupled to ROW X, ROW Y, and/or a different row via the complementary sense lines) and/or to an external location (e.g., an external processing component) via I/O lines.
The above sequence (e.g., enabling/disabling PHASE 1L and subsequently enabling/disabling PHASE 2L) can be repeated to achieve a desired number of left shifts. For instance, in this example, a second left shift is performed by enabling PHASE 1L at time T21 and disabling PHASE 1L at time T22. PHASE 2L is subsequently enabled at time T23 to complete the second left shift. Subsequent to the second left shift, PHASE 2L remains enabled and PHASE 2R is enabled (e.g., at time T24) such that feedback is enabled to latch the data values in the compute component latches.
The signaling indicated at times T0 through T9 for
In this example, if PASS goes high at time T13, the pass transistors 307-1 and 307-2 are enabled such that the DIGIT and DIGIT_signals, which correspond to the ROW Y data value, are provided to the respective compute component nodes ST2 and SF2. As such, the value stored in the compute component 331 (e.g., the ROW X data value) may be flipped, depending on the value of DIGIT and DIGIT_ (e.g., the ROW Y data value). In this example, if PASS stays low at time T13, the pass transistors 307-1 and 307-2 are not enabled such that the DIGIT and DIGIT_signals, which correspond to the ROW Y data value, remain isolated from the nodes ST2 and SF2 of the compute component 331. As such, the data value in the compute component (e.g., the ROW X data value) would remain the same. In this example, if PASS* goes high at time T13, the swap transistors 342 are enabled such that the DIGIT and DIGIT_signals, which correspond to the ROW Y data value, are provided to the respective compute component nodes ST2 and SF2 in a transposed manner (e.g., the “true” data value on DIGIT(n) would be provided to node SF2 and the “complement” data value on DIGIT(n)_ would be provided to node ST2). As such, the value stored in the compute component 331 (e.g., the ROW X data value) may be flipped, depending on the value of DIGIT and DIGIT_ (e.g., the ROW Y data value). In this example, if PASS* stays low at time T13, the swap transistors 342 are not enabled such that the DIGIT and DIGIT_signals, which correspond to the ROW Y data value, remain isolated from the nodes ST2 and SF2 of the compute component 331. As such, the data value in the compute component (e.g., the ROW X data value) would remain the same.
At time T14, TF and FT are disabled, which results in PASS and PASS* going (or remaining) low, such that the pass transistors 307-1 and 307-2 and swap transistors 342 are disabled. At time T15, ROW Y is disabled, and PHASE 2R, PHASE 2L, and ISO are enabled. Enabling PHASE 2R and PHASE 2L at time T15 enables feedback on the latch of the compute component 331 such that the result of the XOR operation (e.g., “A” XOR “B”) is latched therein. Enabling ISO at time T15 again couples nodes ST2 and SF2 to the gates of the enable transistors 352, 354, 362, and 364. At time T16, equilibration is enabled (e.g., EQ goes high such that DIGIT and DIGIT_ are driven to an equilibrate voltage) and the sense amplifier 306 is disabled (e.g., SENSE AMP goes low).
The result of the XOR operation, which is initially stored in the compute component 331 in this example, can be transferred back to the memory array (e.g., to a memory cell coupled to ROW X, ROW Y, and/or a different row via the complementary sense lines) and/or to an external location (e.g., an external processing component) via I/O lines.
The above sequence (e.g., enabling/disabling PHASE 1R and subsequently enabling/disabling PHASE 2R) can be repeated to achieve a desired number of right shifts. For instance, in this example, a second right shift is performed by enabling PHASE 1R at time T21 and disabling PHASE 1R at time T22. PHASE 2R is subsequently enabled at time T23 to complete the second right shift. Subsequent to the second right shift, PHASE 1R remains disabled, PHASE 2R remains enabled, and PHASE 2L is enabled (e.g., at time T24) such that feedback is enabled to latch the data values in the compute component latches.
Although the examples described in
While example embodiments including various combinations and configurations of sensing circuitry, sense amps, compute components, dynamic latches, isolation devices, and/or shift circuitry have been illustrated and described herein, embodiments of the present disclosure are not limited to those combinations explicitly recited herein. Other combinations and configurations of the sensing circuitry, sense amps, compute component, dynamic latches, isolation devices, and/or shift circuitry disclosed herein are expressly included within the scope of this disclosure.
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. 15/133,861, filed Apr. 20, 2016, which issues as U.S. Pat. No. 9,659,605 on May 23, 2017, the contents of which are included herein by reference.
| Number | Name | Date | Kind |
|---|---|---|---|
| 4380046 | Fung | Apr 1983 | A |
| 4435792 | Bechtolsheim | Mar 1984 | A |
| 4435793 | Ochii | Mar 1984 | A |
| 4727474 | Batcher | Feb 1988 | A |
| 4843264 | Galbraith | Jun 1989 | A |
| 4852065 | Baddiley | Jul 1989 | A |
| 4958378 | Bell | Sep 1990 | A |
| 4977542 | Matsuda et al. | Dec 1990 | A |
| 5023838 | Herbert | Jun 1991 | A |
| 5034636 | Reis et al. | Jul 1991 | A |
| 5079739 | Petersen | Jan 1992 | A |
| 5201039 | Sakamura | Apr 1993 | A |
| 5210850 | Kelly et al. | May 1993 | A |
| 5253308 | Johnson | Oct 1993 | A |
| 5276643 | Hoffman et al. | Jan 1994 | A |
| 5325519 | Long et al. | Jun 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 |
| 5406525 | Nicholes | Apr 1995 | A |
| 5430687 | Hung et al. | Jul 1995 | A |
| 5440482 | Davis | Aug 1995 | A |
| 5446690 | Tanaka et al. | Aug 1995 | A |
| 5449907 | McKeeman | Sep 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 |
| 5606707 | Tomassi | Feb 1997 | 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 |
| 5724291 | Matano | Mar 1998 | A |
| 5724366 | Furutani | Mar 1998 | A |
| 5740340 | Purcell et al. | Apr 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 |
| 5954831 | Chang | 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 |
| 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 |
| 6411333 | Auld et al. | Jun 2002 | B1 |
| 6418498 | Martwick | Jul 2002 | B1 |
| 6466499 | Blodgett | Oct 2002 | B1 |
| 6510098 | Taylor | Jan 2003 | B1 |
| 6563754 | Lien et al. | May 2003 | B1 |
| 6578058 | Nygaard | Jun 2003 | B1 |
| 6731542 | Le et al. | May 2004 | B1 |
| 6754746 | Leung et al. | Jun 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 | 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 |
| 7489543 | Lee | Feb 2009 | B1 |
| 7532529 | Dadashev et al. | May 2009 | B2 |
| 7535769 | Cernea | May 2009 | B2 |
| 7546438 | Chung | Jun 2009 | B2 |
| 7546516 | Helbig | 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 |
| 7907473 | Ishizaki et al. | 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 | Mohklesi | 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 |
| 8284606 | Liu | 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 |
| 8437217 | Pekny | May 2013 | B2 |
| 8447962 | Hughes et al. | May 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 |
| 8688962 | Raikin et al. | Apr 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 |
| 9659605 | Zawodny | May 2017 | B1 |
| 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 |
| 20030167426 | Slobodnik | Sep 2003 | A1 |
| 20030196030 | Elliott et al. | Oct 2003 | A1 |
| 20030222879 | Rong 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 |
| 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 |
| 20060036801 | Jones et al. | Feb 2006 | 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 |
| 20070241405 | Popoff | Oct 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 |
| 20090067218 | Graber | Mar 2009 | A1 |
| 20090154238 | Lee | Jun 2009 | A1 |
| 20090154273 | Borot et al. | Jun 2009 | A1 |
| 20090254697 | Akerib | Oct 2009 | 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 |
| 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 |
| 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 |
| 20140040596 | Fleischer et al. | Feb 2014 | A1 |
| 20140185395 | Seo | 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 |
| 20150078108 | Cowles et al. | Mar 2015 | A1 |
| 20150085589 | Lu et al. | Mar 2015 | A1 |
| 20150089166 | Kogge | Mar 2015 | A1 |
| 20150120987 | Wheeler | Apr 2015 | A1 |
| 20150134713 | Wheeler | May 2015 | A1 |
| 20150270015 | Murphy et al. | Sep 2015 | A1 |
| 20150279466 | Manning | Oct 2015 | A1 |
| 20150324290 | Leidel | Nov 2015 | A1 |
| 20150325272 | Murphy | Nov 2015 | A1 |
| 20150356009 | Wheeler et al. | Dec 2015 | A1 |
| 20150356022 | Leidel et al. | Dec 2015 | A1 |
| 20150357007 | Manning et al. | Dec 2015 | A1 |
| 20150357008 | Manning et al. | Dec 2015 | A1 |
| 20150357019 | Wheeler et al. | Dec 2015 | A1 |
| 20150357020 | Manning | Dec 2015 | A1 |
| 20150357021 | Hush | Dec 2015 | A1 |
| 20150357022 | Hush | Dec 2015 | A1 |
| 20150357023 | Hush | Dec 2015 | A1 |
| 20150357024 | Hush et al. | Dec 2015 | A1 |
| 20150357047 | Tiwari | Dec 2015 | A1 |
| 20160062672 | Wheeler | Mar 2016 | A1 |
| 20160062673 | Tiwari | Mar 2016 | A1 |
| 20160062692 | Finkbeiner et al. | Mar 2016 | A1 |
| 20160062733 | Tiwari | Mar 2016 | A1 |
| 20160063284 | Tiwari | Mar 2016 | A1 |
| 20160064045 | La Fratta | Mar 2016 | A1 |
| 20160064047 | Tiwari | Mar 2016 | A1 |
| 20160098208 | Willcock | Apr 2016 | A1 |
| 20160098209 | Leidel et al. | Apr 2016 | A1 |
| 20160188250 | Wheeler | Jun 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 |
|---|
| Warren Jr., Henry S., “Hacker's Delight”, Second Edition, Oct. 2013, pp. 181-184 and 194. |
| 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. |
| Stojmenovic, “Multiplicative Circulant Networks Topological Properties and Communication Algorithms”, (25 pgs.), Discrete Applied Mathematics 77 (1997) 281-305. |
| “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. |
| 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. |
| Debnath, Biplob, Bloomflash: Bloom Filter on Flash-Based Storage, 2011 31st Annual Conference on Distributed Computing Systems, Jun. 20-24, 2011, 10 pgs. |
| Pagiamtzis, Kostas, “Content-Addressable Memory Introduction”, Jun. 25, 2007, (6 pgs.), retrieved from: http://www.pagiamtzis.com/cam/camintro. |
| 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. |
| International Search Report and Written Opinion for PCT Application No. PCT/US2013/043702, dated Sep. 26, 2013, (11 pgs.). |
| 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. |
| 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. |
| 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. |
| 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. |
| 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. |
| U.S. Appl. No. 13/449,082, entitled, “Methods and Apparatus for Pattern Matching,” filed Apr. 17, 2012, (37 pgs.). |
| U.S. Appl. No. 13/743,686, entitled, “Weighted Search and Compare in a Memory Device,” filed Jan. 17, 2013, (25 pgs.). |
| U.S. Appl. No. 13/774,636, entitled, “Memory as a Programmable Logic Device,” filed Feb. 22, 2013, (30 pgs.). |
| U.S. Appl. No. 13/774,553, entitled, “Neural Network in a Memory Device,” filed Feb. 22, 2013, (63 pgs.). |
| U.S. Appl. No. 13/796,189, entitled, “Performing Complex Arithmetic Functions in a Memory Device,” filed Mar. 12, 2013, (23 pgs.). |
| Number | Date | Country | |
|---|---|---|---|
| 20170309316 A1 | Oct 2017 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | 15133861 | Apr 2016 | US |
| Child | 15591899 | US |
