The disclosure relates generally to a static random access memory cell that may be used for computations.
An array of memory cells, such as dynamic random access memory (DRAM) cells, static random access memory (SRAM) cells, content addressable memory (CAM) cells or non-volatile memory cells, is a well-known mechanism used in various computer or processor based devices to store digital bits of data. The various computer and processor based devices may include computer systems, smartphone devices, consumer electronic products, televisions, internet switches and routers and the like. The array of memory cells are typically packaged in an integrated circuit or may be packaged within an integrated circuit that also has a processing device within the integrated circuit. The different types of typical memory cells have different capabilities and characteristics that distinguish each type of memory cell. For example, DRAM cells take longer to access, lose their data contents unless periodically refreshed, but are relatively cheap to manufacture due to the simple structure of each DRAM cell. SRAM cells, on the other hand, have faster access times, do not lose their data content unless power is removed from the SRAM cell and are relatively more expensive since each SRAM cell is more complicated than a DRAM cell. CAM cells have a unique function of being able to address content easily within the cells and are more expensive to manufacture since each CAM cell requires more circuitry to achieve the content addressing functionality.
Various computation devices that may be used to perform computations on digital, binary data are also well-known. The computation devices may include a microprocessor, a CPU, a microcontroller and the like. These computation devices are typically manufactured on an integrated circuit, but may also be manufactured on an integrated circuit that also has some amount of memory integrated onto the integrated circuit. In these known integrated circuits with a computation device and memory, the computation device performs the computation of the digital binary data bits while the memory is used to store various digital binary data including, for example, the instructions being executed by the computation device and the data being operated on by the computation device.
More recently, devices have been introduced that use memory arrays or storage cells to perform computation operations. In some of these devices, a processor array to perform computations may be formed from memory cells. These devices may be known as in-memory computational devices.
Big data operations are data processing operations in which a large amount of data must be processed. Machine learning uses artificial intelligence algorithms to analyze data and typically require a lot of data to perform. The big data operations and machine learning also are typically very computationally intensive applications that often encounter input/output issues due to a bandwidth bottleneck between the computational device and the memory that stores the data. The above in-memory computational devices may be used, for example, for these big data operations and machine learning applications since the in-memory computational devices perform the computations within the memory thereby eliminating the bandwidth bottleneck.
An SRAM cell can be configured to perform basic Boolean operations such as AND, OR, NAND and NOR. This SRAM cell can also support a Selective Write operation. However, this SRAM cell cannot perform certain logic functions that may be desirable. For example, it is desirable to be able to implement an exclusive OR (XOR) logic function since the XOR logic function is frequently used in a search operation when the search key needs to be compared to the contents in storage.
One of the most basic operations of a graphics processing unit (GPU) is a floating point calculation. The floating point calculation may be performed by well-known full adder circuitry. In a typical system, the floating point calculation using the full adder may be performed in 4 clock cycles. However, it is desirable to be able to perform the floating point calculation in a single clock cycle and it is to this end that the disclosure is directed.
The disclosure is particularly applicable to a CMOS implemented memory cell and processing array with a plurality of the memory cells that are capable two logic computations that may be used to perform a full adder operation in a single clock cycle and it is in this context that the disclosure will be described. It will be appreciated, however, that the memory cell and processing array has greater utility and is not limited to the below disclosed implementations since the memory cell may be constructed using different processes and may have different circuit configurations than those disclosed below that perform the two computations and so are within the scope of this disclosure. For purposes of illustration, a dual port AND cell and a 3-port SRAM complementary XOR cell are disclosed below and in the figures. However, it is understood that the SRAM computation cell and processing array may also be implemented with an SRAM cell having three or more ports and the disclosure is not limited to the dual port SRAM cell disclosed below. It is also understood that the SRAM cell having three or more ports may be slightly differently constructed than the dual port SRAM shown in the figures, but one skilled in the art would understand how to construct those three or more port SRAMs for the disclosure below. Furthermore, although an SRAM cell is used in the examples below, it is understood that the disclosed memory cell for computation and the processing array using the memory cells may be implemented using various different types of memory cells including the DRAMs, CAMs, non-volatile memory cells and non-volatile memory devices and these implementations using the various types of memory cells are within the scope of the disclosure.
The circuit in
In operation, the dual port SRAM cell may read data stored in the latch using a signal on the read word line (RE) to address/activate the dual port SRAM cell and the read bit line (RBL) to read the data stored in the dual port SRAM cell. The dual port SRAM cell may write data into the dual port SRAM cell by addressing/activating the dual port SRAM cell using a signal on the write word line (WE) and then writing data into the dual port SRAM cell using the word bit lines (WBL, WBLb).
During reading, multiple cells (with only a single cell being shown in
The Db signal of the cell 100 may be coupled to a gate of transistor M12 to drive the RBL line. However, unlike the typical 6T cell, the Db signal is isolated from the RBL line and its signal/voltage level by the transistors M11, M12 (together forming the isolation circuit). Because the Db signal/value is isolated from the RBL line and signal/voltage level, the Db signal is not susceptible to the lower bit line level caused by multiple “0” data stored in multiple cells in contrast to the typical SRAM cell. Therefore, for the cell in
The write port of the cell in
The storage cell/latch device (I11 and I12 in
The read port transistors M11 and M12 (the isolation circuits) can be PMOS instead of NMOS. If transistors M11 and M12 are PMOS with the source of M12 coupled to VDD, then RBL is pre-charged to 0 and RBL is 1 if Db of one or more cells turned on is 0 and RBL is 0 if Db of all cells is 1. In other words, RBL=NAND (Db0, Db1, etc.)=OR (D0, D1, etc.), where D0, D1, etc. are the true data of the cells turned on and Db0, Db1, etc. are the complement data. It can also perform NAND function by storing inverted data such that if D is stored at the gate of M22, instead of Db, then RBL=NAND (D0, D1, etc.). Further details of this cell are disclosed in U.S. patent application Ser. No. 15/709,379, filed Sep. 19, 2017, Ser. No. 15/709,382, filed Sep. 19, 2017 and Ser. No. 15/709,385, filed Sep. 19, 2017, all of which are incorporated herein by reference.
In a read operation, WL generator 202 generates one or multiple RE signals in each segment to form a Boolen function on RBLs1 and RBLs2. The BL Read/Write Logic 204 processes the inputs from RBLs1 and RBLs2 and sends the results back to its WBL/WBLb for writing/using in that cell, or to the neighboring BL Read/Write Logic for writing/using in that neighboring cell, or send it out of this processing array. Alternatively, the BL Read/Write logic 204 can store RBL result and/or RBLb result from its own bit line or from the neighboring bit line in a register or latch so that the next cycle Read/Write logic can perform logic with the latched RBL and/or RBLb result data.
In a write operation, the WL generator 202 generates one or more WE signals for the cells to be written and the BL Read/Write Logic 204 processes the write data, either from its own RBL or RBLb line, or from the neighboring RBL or RBLb line or from out of this processing array. The ability of BL Read/Write Logic 204 to process the data from the neighboring bit line means that the data can be shifting from one bit line to the neighboring bit line and one or more or all bit lines in the processing array may be shifting concurrently. The BL Read/Write Logic 204 can also decide not to write for a Selective Write operation based on RBL result and/or RBLb result. For example, WBL can be written to a data if RBL=1. If RBL=0, then a write is not performed.
Each BL Read/Write Logic 204 may have one or more Boolean logic circuits that perform various Boolean operations using the read bit lines as inputs. For example, each BL Read/Write Logic 204 may include one or more of AND, OR and/or XOR circuitry that may be implemented in various known manners and the disclosure is not limited to the particular implementation of the AND, OR and/or XOR circuitry in the BL Read/Write Logic 204.
Using the cell 100 in
RBL=AND(D1,D2,Dn) (EQ1)
The detailed RBL functions are disclosed in U.S. patent application Ser. No. 16/111,178, filed Aug. 23, 2018 that is incorporated herein by reference and will not be described further here.
When doing a Selective Write, it is often desired to write data “1” on some cells and data “0” to other cells on the same bit line. For the Dual-port AND cell illustrated in
Using the processing array 200 and the cell 100 described above, the 3 inputs of the full adder may be stored in the cells along the same bit line and BL Read/Write Logic and thus the processing array may generate sum and carry outputs in the cells and BL Read/Write Logic after the logic operation. In this example implementation, the cell that stores the Bin input is shared as Sum output, Bout, and the cell that stores Cin cell may be shared as Carry output Cout.
In states 1, 3, 6 and 8 shown in
Y1=XOR(Ain,Cin) (EQ2)
Bout=Bin, if Y1=0 (EQ3)
Bout=NOT(Bin), if Y1=1 (EQ4)
Cout=Cin, if Y1=0 (EQ5)
Cout=Bin, if Y1=1 (EQ6)
A non-limiting example of the circuitry of the BL read/write circuitry 204 is shown in
An XOR gate 600 in
Y2=NOT(Bin) (EQ9)
Y1 is a selective write control signal so that, if Y1=1, AND gates 604 and 606 are on, and:
WBL=Y2=NOT(Bin) (EQ10)
WBLb=Bin (EQ11)
During a write operation, the WE signal of the B cell (cell storing Bin) is active and if Y1 is 1, then Y2, or NOT(Bin) is written into B cell. If Y1 is 0, then WBL=WBLb=0, no write is performed though WE of the B cell is on, the B cell retains the Bin value which completes the full adder logic for Bout as described in EQ3 and EQ4. The write operation may be performed in the second half of the normal memory clock cycle during the period when Kb is high. In this manner, the read is performed (to perform the computation) in the first half of the cycle when K is high and the write is performed in the second half of the cycle when Kb is high and therefore full adder logic for B is completed in one cycle.
In
To do a 16-bit Adder, for example, we need to have 16 bits of Ain and Bin inputs and a register in the BL read/write logic 204 to store Cin so that 16 or more cells in each of segment 1 and segment 2 are needed for the 16 bit adder. Unlike Ain and Bin, Cin just needs 1 bit storage for a multiple bits full adder, so Cin is suitable to store in a register while Ain and Bin are stored in the memory cells of the processing array 200.
The implementation of the circuitry 204 in
In this example, the full adder logic is performed with additional input W to AND with A, this is very useful in multiplication. Note that Ain, Bin, Cin and W are used in this example, but a person with skill in the art can easily uses the inversion of these parameters with slight modification of the circuit 204 to achieve the same result which are within the scope of this disclosure.
The circuit in
The cell 700 shown in
When the read ports of cell 700 are active, it may operate such that either RE or REb is high and the REb signal/voltage level is the complement of RE signal/voltage level. It may also operate such that RE or REb signal/voltage levels both high or both low. RBL is pre-charged high, and if the transistor pair M71, M72 are both turned on, RBL is discharged to 0. If either one of M71, M72 transistors is off, then RBL stay high as 1 since it was precharged high and not coupled to ground. RBLb is also pre-charged high, and if the transistor pair M76, M77 are both turned on, RBLb is discharged to 0. If either one of M76, M77 transistors is off, then RBLb stay high as 1 since it was precharged high and not coupled to ground. The cell 700 may operate as a 3-port SRAM cell. The write operation is activated by WE and the data is written by toggling of WBL and WBLb. The read operation is activated by RE and REb, the read data is accessed on RBL or RBLb. The cell 700 may further be used for computation where RBL and RBLb are also used for logic operation.
In a read operation, WL generator 802 generates one or multiple RE and REb signals in each segment to form a Boolen function on RBL and RBLb. The BL Read/Write Logic 204 processes the inputs from RBL and RBLb and sends the results back to its WBL/WBLb for writing/using in that cell, or to the neighboring BL Read/Write Logic for writing/using in that neighboring cell, or send it out of this processing array. Alternatively, the BL Read/Write logic 804 can store RBL result and/or RBLb result from its own bit line or from the neighboring bit line in a register or latch so that the next cycle Read/Write logic can perform logic with the latched RBL and/or RBLb result data.
In a write operation, the WL generator 802 generates one or more WE signals for the cells to be written and the BL Read/Write Logic 204 processes the write data, either from its own RBL or RBLb line, or from the neighboring RBL or RBLb line or from out of this processing array. The ability of BL Read/Write Logic 804 to process the data from the neighboring bit line means that the data can be shifting from one bit line to the neighboring bit line and one or more or all bit lines in the processing array may be shifting concurrently. The BL Read/Write Logic 804 can also decide not to write for a Selective Write operation based on RBL result and/or RBLb result. For example, WBL can be written to a data if RBL=1. If RBL=0, then a write is not performed.
Each BL Read/Write Logic 804 may have one or more Boolean logic circuits that perform various Boolean operations using the read bit lines as inputs. For example, each BL Read/Write Logic 804 may include one or more of AND, OR and/or XOR circuitry that may be implemented in various known manners and the disclosure is not limited to the particular implementation of the AND, OR and/or XOR circuitry in the BL Read/Write Logic 804. Like the processing array shown in
A non-limiting example of the circuitry of the BL read/write circuitry 804 that may be used in the processing array 800 in
Using the processing array 800 in
An XOR gate 900 in
Y2=NOT(Bin) (EQ16)
Y1 is a selective write control signal. Thus, if Y1 is 1, AND gates 904 and 906 of the logic 804 are on, and:
WBL=Y2=NOT(Bin) (EQ17)
WBLb=Bin (EQ18)
The operations performed in EQ14-18 perform the same functionality illustrated as EQ7-11 above and the full adder logic is performed in 1 cycle in this embodiment as well. Furthermore, the operation of the inverter 902 and a MUX 907 are the same as described above.
In a read operation, WL generator 1002 generates one or multiple RE and REb signals in each segment to form a Boolen function on RBLs1 and RBLs2. The BL Read/Write Logic 1004 processes the inputs from RBLs1, RBLs1b pair and RBLs2, RBLs2b pair and sends the results back to its WBL/WBLb for writing/using in that cell, or to the neighboring BL Read/Write Logic for writing/using in that neighboring cell, or sends it out of this processing array. Alternatively, the BL Read/Write logic 1004 can store RBL result and/or RBLb result from its own bit line or from the neighboring bit line in a register or latch so that the next cycle Read/Write logic can perform logic with the latched RBL and/or RBLb result data.
In a write operation, the WL generator 1002 generates one or more WE signals for the cells to be written and the BL Read/Write Logic 1004 processes the write data, either from its own RBL or RBLb line, or from the neighboring RBL or RBLb line or from out of this processing array. The ability of BL Read/Write Logic 1004 to process the data from the neighboring bit line means that the data can be shifting from one bit line to the neighboring bit line and one or more or all bit lines in the processing array may be shifting concurrently. The BL Read/Write Logic 1004 can also decide not to write for a Selective Write operation based on RBL result and/or RBLb result. For example, WBL can be written to a data if RBL=1. If RBL=0, then a write is not performed.
Each BL Read/Write Logic 1004 may have one or more Boolean logic circuits that perform various Boolean operations using the read bit lines as inputs. For example, each BL Read/Write Logic 104 may include one or more of AND, OR and/or XOR circuitry that may be implemented in various known manners and the disclosure is not limited to the particular implementation of the AND, OR and/or XOR circuitry in the BL Read/Write Logic 1004.
A non-limiting example of the circuitry of the BL read/write circuitry 1004 is shown in
It may be desirable to use the processing array 1000 with BL read write logic 1004 in the middle of the bit line so the bit line length is half as long as compared to the processing array 800 shown in
In the examples discussed above, the write bit lines are connected to both segment 1 and 2. Alternatively, however, the write bit lines may be divided into 2 segments like read bit line with additional segment write control to toggle either or both segments. This can reduce the power by writing only half of the bit lines.
In this example, the WC and WD signals are registered or latched by Kb, the clock edge of the second half of the clock. The read enable (RE) signals of the processing array 1000 in
A Mux 1305 receives signal Y1 as input and is controlled by a WCmux control signal. If WCmux=1, then Mux 1305 sends out output WCout=Y1. WCout is sent to Reg 1308 to be registered by Kb and the output of the Reg 1308 is output signal WC. WC is sent to the next stage Write Data Logic as selective write control signal. A Mux 1306 receives signal Y2 (NOT(Bin)) as input and is controlled by a RDmux control signal. If RDmux=1, then Mux 1306 sends out output RDout=Y2. The RDout output is sent to Reg 1309 to be registered by Kb that results the output WD. WD is sent to the next stage Write Data Logic as write data signal with the value as Bout.
In summary, in the full adder operation, Cin is stored in Reg 1310; WCmux and RDmux are high to select Y1 and Y2 to be WC and WD, respectively, for the selective write operation for the next stage to write Bout to the B cell. Cin is needed in the beginning of the cycle for the operation of next full adder bit, and it is stored in the register in 1202, bypassing the circuit path of the next stage's Write Data Logic. Bout is the result of the full adder operation, and it is not required as input for the next bit's operation, so it can go through the circuit path of Write Data Logic without delaying the speed of the operation.
The write control and read data logic circuit 1202 also performs other Boolean operations. For example, an AND gate 1304 receive RBL1 and RBL2 that generates a Y3 signal as output. Y3 has the following value:
Y3=AND(RBL1,RBL2)=AND(RBLs1,RBLs1b,RBLs2,RBLs2b) (EQ19)
Signal Y3 is the compare result of both RBL segment 1 and RBL segment 2. If the search key is comprised of read word lines in both segment 1 and segment 2, then Y3 yields the combined compare result. If the search key is comprised of only REs of segment 1, and none of RE and REb of segment 2 is active, then RBLs2 and RBLs2b stay as 1 because each is pre-charged 1 and Y3 yields the compare result of segment 1. Similarly, if the search key is comprised of only REs and REbs of segment 2, and none of RE and REb of segment 1 is active, then RBLs1 and RBLs1b stay as 1 because each is pre-charged 1 and Y3 yields the compare result of segment 2. In summary, Y3 yields the compare result of REs and REbs turned on in both segment 1 or segment 2 or in either segment 1 or segment 2.
Y3 is sent to Mux 1305 an input. When WCmux=0, Mux 1305 outputs WCout that is equal to the value of Y3. WCout is registered by Reg 1308 with Kb to generate output WC. WC is sent to the next stage Write Data Logic 1204 as selective write control signal. In this example WCmux=0, selective write control signal is the combined compare result of the active cells of segment 1 and 2. If the combined compare result WC is 1, meaning the search key is matched with the cells' content, then the write operation is on and the Write Data Logic 1204 will select a write data to be written into the write bit line. If the combined compare result WC is 0, meaning the search key is not matched with the cells' content, then the write operation is off and the Write Data Logic 1204 will not perform the writing.
Y3 may be sent to Mux 1306 an input. When RDmux=0, Mux 1306 yields output RDout whose value is equal to the value of the Y3 signal. RDout is registered by Reg 1309 with Kb to generate output WD. WD is sent to the next stage Write Data Logic 1204 as write data to be written into the write bit line. Because Y3 is the AND result of RBLs1, RBLs1b, RBLs2, RBLs2b, Y3 can also be shown as:
Y3=AND(D1s1,D2s1, . . . ,Dms1,D1bs1,D2bs1, . . . ,Dnbs1,D1s2,D2s2, . . . ,Dps2,D1bs2,D2bs2, . . . ,Dqbs2) (EQ20)
D1s1 is the data in the cell with RE active on segment 1, D1bs1 is the data in the cell with REb active on segment 1, D1s2 is the data in the cell with RE active on segment 2, D1bs2 is the data in the cell with REb active on segment 2. Thus, Y3 can also be shown as:
Y3=AND(D1s1,D2s1, . . . ,Dms1,D1s2,D2s2, . . . ,Dps2) if only RE of segment 1 and 2 are active (EQ21)
Y3=AND(D1bs1,D2bs1, . . . ,Dnbs1,D1bs2,D2bs2, . . . ,Dqbs2)=NOR(D1s1,D2s1, . . . ,Dns1,D1s2,D2s2, . . . ,Dqs2) if only REb of segment 1 and 2 are active (EQ22)
Y2 has a value of NOT(Bin) in the full adder operation, but it may also be uses as write data of NAND function of RBLs2 and RBLs2b in other operations. For example, WD can be shown, when RDmux=1, as:
WD=NAND(RBLs2,RBLs2b)=NAND(D1s2,D2s2, . . . ,Dps2,D1bs2,D2bs2, . . . ,Dqbs2) (EQ23)
WD=OR(D1s2,D2s2, . . . ,Dqs2) if only REb of segment 2 is active (EQ24)
In summary, this demonstrates four basic functions that can be performed in one cycle using the processing array 1000 in
1. Full Adder Operation
2. Search Operation.
3. NAND/OR function of RBLs2, RBLs2b
4. Combined Boolean operation of RBLs1, RBLs1b, RBLs2 and RBLs2b.
The foregoing description, for purpose of explanation, has been described with reference to specific embodiments. However, the illustrative discussions above are not intended to be exhaustive or to limit the disclosure to the precise forms disclosed. Many modifications and variations are possible in view of the above teachings. The embodiments were chosen and described in order to best explain the principles of the disclosure and its practical applications, to thereby enable others skilled in the art to best utilize the disclosure and various embodiments with various modifications as are suited to the particular use contemplated.
The system and method disclosed herein may be implemented via one or more components, systems, servers, appliances, other subcomponents, or distributed between such elements. When implemented as a system, such systems may include an/or involve, inter alia, components such as software modules, general-purpose CPU, RAM, etc. found in general-purpose computers. In implementations where the innovations reside on a server, such a server may include or involve components such as CPU, RAM, etc., such as those found in general-purpose computers.
Additionally, the system and method herein may be achieved via implementations with disparate or entirely different software, hardware and/or firmware components, beyond that set forth above. With regard to such other components (e.g., software, processing components, etc.) and/or computer-readable media associated with or embodying the present inventions, for example, aspects of the innovations herein may be implemented consistent with numerous general purpose or special purpose computing systems or configurations. Various exemplary computing systems, environments, and/or configurations that may be suitable for use with the innovations herein may include, but are not limited to: software or other components within or embodied on personal computers, servers or server computing devices such as routing/connectivity components, hand-held or laptop devices, multiprocessor systems, microprocessor-based systems, set top boxes, consumer electronic devices, network PCs, other existing computer platforms, distributed computing environments that include one or more of the above systems or devices, etc.
In some instances, aspects of the system and method may be achieved via or performed by logic and/or logic instructions including program modules, executed in association with such components or circuitry, for example. In general, program modules may include routines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular instructions herein. The inventions may also be practiced in the context of distributed software, computer, or circuit settings where circuitry is connected via communication buses, circuitry or links. In distributed settings, control/instructions may occur from both local and remote computer storage media including memory storage devices.
The software, circuitry and components herein may also include and/or utilize one or more type of computer readable media. Computer readable media can be any available media that is resident on, associable with, or can be accessed by such circuits and/or computing components. By way of example, and not limitation, computer readable media may comprise computer storage media and communication media. Computer storage media includes volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data. Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital versatile disks (DVD) or other optical storage, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and can accessed by computing component. Communication media may comprise computer readable instructions, data structures, program modules and/or other components. Further, communication media may include wired media such as a wired network or direct-wired connection, however no media of any such type herein includes transitory media. Combinations of the any of the above are also included within the scope of computer readable media.
In the present description, the terms component, module, device, etc. may refer to any type of logical or functional software elements, circuits, blocks and/or processes that may be implemented in a variety of ways. For example, the functions of various circuits and/or blocks can be combined with one another into any other number of modules. Each module may even be implemented as a software program stored on a tangible memory (e.g., random access memory, read only memory, CD-ROM memory, hard disk drive, etc.) to be read by a central processing unit to implement the functions of the innovations herein. Or, the modules can comprise programming instructions transmitted to a general purpose computer or to processing/graphics hardware via a transmission carrier wave. Also, the modules can be implemented as hardware logic circuitry implementing the functions encompassed by the innovations herein. Finally, the modules can be implemented using special purpose instructions (SIMD instructions), field programmable logic arrays or any mix thereof which provides the desired level performance and cost.
As disclosed herein, features consistent with the disclosure may be implemented via computer-hardware, software and/or firmware. For example, the systems and methods disclosed herein may be embodied in various forms including, for example, a data processor, such as a computer that also includes a database, digital electronic circuitry, firmware, software, or in combinations of them. Further, while some of the disclosed implementations describe specific hardware components, systems and methods consistent with the innovations herein may be implemented with any combination of hardware, software and/or firmware. Moreover, the above-noted features and other aspects and principles of the innovations herein may be implemented in various environments. Such environments and related applications may be specially constructed for performing the various routines, processes and/or operations according to the invention or they may include a general-purpose computer or computing platform selectively activated or reconfigured by code to provide the necessary functionality. The processes disclosed herein are not inherently related to any particular computer, network, architecture, environment, or other apparatus, and may be implemented by a suitable combination of hardware, software, and/or firmware. For example, various general-purpose machines may be used with programs written in accordance with teachings of the invention, or it may be more convenient to construct a specialized apparatus or system to perform the required methods and techniques.
Aspects of the method and system described herein, such as the logic, may also be implemented as functionality programmed into any of a variety of circuitry, including programmable logic devices (“PLDs”), such as field programmable gate arrays (“FPGAs”), programmable array logic (“PAL”) devices, electrically programmable logic and memory devices and standard cell-based devices, as well as application specific integrated circuits. Some other possibilities for implementing aspects include: memory devices, microcontrollers with memory (such as EEPROM), embedded microprocessors, firmware, software, etc. Furthermore, aspects may be embodied in microprocessors having software-based circuit emulation, discrete logic (sequential and combinatorial), custom devices, fuzzy (neural) logic, quantum devices, and hybrids of any of the above device types. The underlying device technologies may be provided in a variety of component types, e.g., metal-oxide semiconductor field-effect transistor (“MOSFET”) technologies like complementary metal-oxide semiconductor (“CMOS”), bipolar technologies like emitter-coupled logic (“ECL”), polymer technologies (e.g., silicon-conjugated polymer and metal-conjugated polymer-metal structures), mixed analog and digital, and so on.
It should also be noted that the various logic and/or functions disclosed herein may be enabled using any number of combinations of hardware, firmware, and/or as data and/or instructions embodied in various machine-readable or computer-readable media, in terms of their behavioral, register transfer, logic component, and/or other characteristics. Computer-readable media in which such formatted data and/or instructions may be embodied include, but are not limited to, non-volatile storage media in various forms (e.g., optical, magnetic or semiconductor storage media) though again does not include transitory media. Unless the context clearly requires otherwise, throughout the description, the words “comprise,” “comprising,” and the like are to be construed in an inclusive sense as opposed to an exclusive or exhaustive sense; that is to say, in a sense of “including, but not limited to.” Words using the singular or plural number also include the plural or singular number respectively. Additionally, the words “herein,” “hereunder,” “above,” “below,” and words of similar import refer to this application as a whole and not to any particular portions of this application. When the word “or” is used in reference to a list of two or more items, that word covers all of the following interpretations of the word: any of the items in the list, all of the items in the list and any combination of the items in the list.
Although certain presently preferred implementations of the invention have been specifically described herein, it will be apparent to those skilled in the art to which the invention pertains that variations and modifications of the various implementations shown and described herein may be made without departing from the spirit and scope of the invention. Accordingly, it is intended that the invention be limited only to the extent required by the applicable rules of law.
While the foregoing has been with reference to a particular embodiment of the disclosure, it will be appreciated by those skilled in the art that changes in this embodiment may be made without departing from the principles and spirit of the disclosure, the scope of which is defined by the appended claims.
This application is a continuation in part of and claims priority under 35 USC 120 to U.S. patent application Ser. No. 16/445,006 filed Jun. 18, 2019 and entitled “Processing Array Device That Performs One Cycle Full Adder Operation And Bit Line Read/Write Logic Features” and also claims the benefit under 35 USC 119(e) to U.S. Provisional Patent Application Ser. No. 62/865,078 filed Jun. 21, 2019 and entitled “Processing Array Device That Performs One Cycle Full Adder Operation And Bit Line Read/Write Logic Features”, both of which are incorporated herein by reference.
Number | Name | Date | Kind |
---|---|---|---|
3451694 | Hass | Jun 1969 | A |
3747952 | Graebe | Jul 1973 | A |
3795412 | John | Mar 1974 | A |
4227717 | Bouvier | Oct 1980 | A |
4308505 | Messerschmitt | Dec 1981 | A |
4587496 | Wolaver | May 1986 | A |
4594564 | Yarborough, Jr. | Jun 1986 | A |
4677394 | Vollmer | Jun 1987 | A |
4716322 | D'Arrigo et al. | Dec 1987 | A |
4741006 | Yamaguchi et al. | Apr 1988 | A |
4856035 | Lewis | Aug 1989 | A |
5008636 | Markinson | Apr 1991 | A |
5302916 | Pritchett | Apr 1994 | A |
5375089 | Lo | Dec 1994 | A |
5382922 | Gersbach et al. | Jan 1995 | A |
5400274 | Jones et al. | Mar 1995 | A |
5473574 | Clemen et al. | Dec 1995 | A |
5530383 | May | Jun 1996 | A |
5535159 | Nii | Jul 1996 | A |
5563834 | Longway et al. | Oct 1996 | A |
5587672 | Ranganathan et al. | Dec 1996 | A |
5608354 | Hori | Mar 1997 | A |
5661419 | Bhagwan | Aug 1997 | A |
5696468 | Nise | Dec 1997 | A |
5736872 | Sharma et al. | Apr 1998 | A |
5744979 | Goetting | Apr 1998 | A |
5744991 | Jefferson et al. | Apr 1998 | A |
5748044 | Xue | May 1998 | A |
5768559 | Iino et al. | Jun 1998 | A |
5805912 | Johnson et al. | Sep 1998 | A |
5883853 | Zheng et al. | Mar 1999 | A |
5937204 | Schinnerer | Aug 1999 | A |
5942949 | Wilson et al. | Aug 1999 | A |
5963059 | Partovi et al. | Oct 1999 | A |
5969576 | Trodden | Oct 1999 | A |
5969986 | Wong | Oct 1999 | A |
5977801 | Boerstler | Nov 1999 | A |
5999458 | Nishimura et al. | Dec 1999 | A |
6005794 | Sheffield et al. | Dec 1999 | A |
6044034 | Katakura | Mar 2000 | A |
6058063 | Jang | May 2000 | A |
6072741 | Taylor | Jun 2000 | A |
6100721 | Durec et al. | Aug 2000 | A |
6100736 | Wu et al. | Aug 2000 | A |
6114920 | Moon et al. | Sep 2000 | A |
6115320 | Mick et al. | Sep 2000 | A |
6133770 | Hasegawa | Oct 2000 | A |
6167487 | Camacho | Dec 2000 | A |
6175282 | Yasuda | Jan 2001 | B1 |
6226217 | Riedlinger et al. | May 2001 | B1 |
6262937 | Arcoleo et al. | Jul 2001 | B1 |
6263452 | Jewett et al. | Jul 2001 | B1 |
6265902 | Klemmer et al. | Jul 2001 | B1 |
6286077 | Choi et al. | Sep 2001 | B1 |
6366524 | Abedifard | Apr 2002 | B1 |
6377127 | Fukaishi et al. | Apr 2002 | B1 |
6381684 | Hronik et al. | Apr 2002 | B1 |
6385122 | Chang | May 2002 | B1 |
6407642 | Dosho et al. | Jun 2002 | B2 |
6418077 | Naven | Jul 2002 | B1 |
6441691 | Jones et al. | Aug 2002 | B1 |
6448757 | Hill | Sep 2002 | B2 |
6473334 | Bailey et al. | Oct 2002 | B1 |
6483361 | Chiu | Nov 2002 | B1 |
6504417 | Cecchi et al. | Jan 2003 | B1 |
6538475 | Johansen et al. | Mar 2003 | B1 |
6567338 | Mick | May 2003 | B1 |
6594194 | Gold | Jul 2003 | B2 |
6642747 | Chiu | Nov 2003 | B1 |
6661267 | Walker et al. | Dec 2003 | B2 |
6665222 | Wright et al. | Dec 2003 | B2 |
6683502 | Groen et al. | Jan 2004 | B1 |
6683930 | Dalmia | Jan 2004 | B1 |
6732247 | Berg et al. | May 2004 | B2 |
6744277 | Chang et al. | Jun 2004 | B1 |
6757854 | Zhao et al. | Jun 2004 | B1 |
6789209 | Suzuki et al. | Sep 2004 | B1 |
6816019 | Delbo′ et al. | Nov 2004 | B2 |
6838951 | Nieri et al. | Jan 2005 | B1 |
6842396 | Kono | Jan 2005 | B2 |
6853696 | Moser et al. | Feb 2005 | B1 |
6854059 | Gardner | Feb 2005 | B2 |
6856202 | Lesso | Feb 2005 | B2 |
6859107 | Moon et al. | Feb 2005 | B1 |
6882237 | Singh et al. | Apr 2005 | B2 |
6897696 | Chang et al. | May 2005 | B2 |
6933789 | Molnar et al. | Aug 2005 | B2 |
6938142 | Pawlowski | Aug 2005 | B2 |
6940328 | Lin | Sep 2005 | B2 |
6954091 | Wurzer | Oct 2005 | B2 |
6975554 | Lapidus et al. | Dec 2005 | B1 |
6998922 | Jensen et al. | Feb 2006 | B2 |
7002404 | Gaggl et al. | Feb 2006 | B2 |
7002416 | Pettersen et al. | Feb 2006 | B2 |
7003065 | Homol et al. | Feb 2006 | B2 |
7017090 | Endou et al. | Mar 2006 | B2 |
7019569 | Fan-Jiang | Mar 2006 | B2 |
7042271 | Chung et al. | May 2006 | B2 |
7042792 | Lee et al. | May 2006 | B2 |
7042793 | Masuo | May 2006 | B2 |
7046093 | McDonagh et al. | May 2006 | B1 |
7047146 | Chuang et al. | May 2006 | B2 |
7053666 | Tak et al. | May 2006 | B2 |
7095287 | Maxim et al. | Aug 2006 | B2 |
7099643 | Lin | Aug 2006 | B2 |
7141961 | Hirayama et al. | Nov 2006 | B2 |
7142477 | Tran et al. | Nov 2006 | B1 |
7152009 | Bokui et al. | Dec 2006 | B2 |
7180816 | Park | Feb 2007 | B2 |
7200713 | Cabot et al. | Apr 2007 | B2 |
7218157 | Van De Beek et al. | May 2007 | B2 |
7233214 | Kim et al. | Jun 2007 | B2 |
7246215 | Lu et al. | Jul 2007 | B2 |
7263152 | Miller et al. | Aug 2007 | B2 |
7269402 | Uozumi et al. | Sep 2007 | B2 |
7282999 | Da Dalt et al. | Oct 2007 | B2 |
7312629 | Chuang et al. | Dec 2007 | B2 |
7313040 | Chuang et al. | Dec 2007 | B2 |
7330080 | Stoiber et al. | Feb 2008 | B1 |
7340577 | Van Dyke et al. | Mar 2008 | B1 |
7349515 | Chew et al. | Mar 2008 | B1 |
7352249 | Balboni et al. | Apr 2008 | B2 |
7355482 | Meltzer | Apr 2008 | B2 |
7355907 | Chen et al. | Apr 2008 | B2 |
7369000 | Wu et al. | May 2008 | B2 |
7375593 | Self | May 2008 | B2 |
7389457 | Chen et al. | Jun 2008 | B2 |
7439816 | Lombaard | Oct 2008 | B1 |
7463101 | Tung | Dec 2008 | B2 |
7464282 | Abdollahi-Alibeik et al. | Dec 2008 | B1 |
7487315 | Hur et al. | Feb 2009 | B2 |
7489164 | Madurawe | Feb 2009 | B2 |
7512033 | Hur et al. | Mar 2009 | B2 |
7516385 | Chen et al. | Apr 2009 | B2 |
7538623 | Jensen et al. | May 2009 | B2 |
7545223 | Watanabe | Jun 2009 | B2 |
7565480 | Ware et al. | Jul 2009 | B2 |
7577225 | Azadet et al. | Aug 2009 | B2 |
7592847 | Liu et al. | Sep 2009 | B2 |
7595657 | Chuang et al. | Sep 2009 | B2 |
7622996 | Liu | Nov 2009 | B2 |
7630230 | Wong | Dec 2009 | B2 |
7633322 | Zhuang et al. | Dec 2009 | B1 |
7635988 | Madurawe | Dec 2009 | B2 |
7646215 | Chuang et al. | Jan 2010 | B2 |
7646648 | Arsovski | Jan 2010 | B2 |
7659783 | Tai | Feb 2010 | B2 |
7660149 | Liaw | Feb 2010 | B2 |
7663415 | Chatterjee et al. | Feb 2010 | B2 |
7667678 | Guttag | Feb 2010 | B2 |
7675331 | Jung et al. | Mar 2010 | B2 |
7689941 | Ooi et al. | Mar 2010 | B1 |
7719329 | Smith et al. | May 2010 | B1 |
7719330 | Lin et al. | May 2010 | B2 |
7728675 | Kennedy et al. | Jun 2010 | B1 |
7737743 | Gao et al. | Jun 2010 | B1 |
7746181 | Moyal | Jun 2010 | B1 |
7746182 | Ramaswamy et al. | Jun 2010 | B2 |
7750683 | Huang et al. | Jul 2010 | B2 |
7760032 | Ardehali | Jul 2010 | B2 |
7760040 | Zhang et al. | Jul 2010 | B2 |
7760532 | Shirley et al. | Jul 2010 | B2 |
7782655 | Shau | Aug 2010 | B2 |
7812644 | Cha et al. | Oct 2010 | B2 |
7830212 | Lee et al. | Nov 2010 | B2 |
7839177 | Soh | Nov 2010 | B1 |
7843239 | Sohn et al. | Nov 2010 | B2 |
7843721 | Chou et al. | Nov 2010 | B1 |
7848725 | Zolfaghari et al. | Dec 2010 | B2 |
7859919 | De La Cruz, II et al. | Dec 2010 | B2 |
7876163 | Hachigo | Jan 2011 | B2 |
7916554 | Pawlowski | Mar 2011 | B2 |
7920409 | Clark et al. | Apr 2011 | B1 |
7920665 | Lombaard | Apr 2011 | B1 |
7924599 | Evans, Jr. et al. | Apr 2011 | B1 |
7940088 | Sampath et al. | May 2011 | B1 |
7944256 | Masuda | May 2011 | B2 |
7956695 | Ding et al. | Jun 2011 | B1 |
7965108 | Liu et al. | Jun 2011 | B2 |
8004920 | Ito et al. | Aug 2011 | B2 |
8008956 | Shin et al. | Aug 2011 | B1 |
8044724 | Rao et al. | Oct 2011 | B2 |
8063707 | Wang | Nov 2011 | B2 |
8087690 | Kim | Jan 2012 | B2 |
8089819 | Noda et al. | Jan 2012 | B2 |
8117567 | Arsovski | Feb 2012 | B2 |
8174332 | Lombaard et al. | May 2012 | B1 |
8218707 | Mai | Jul 2012 | B2 |
8242820 | Kim | Aug 2012 | B2 |
8258831 | Banai et al. | Sep 2012 | B1 |
8284593 | Russell et al. | Oct 2012 | B2 |
8294502 | Lewis et al. | Oct 2012 | B2 |
8400200 | Kim et al. | Mar 2013 | B1 |
8488408 | Shu et al. | Jul 2013 | B1 |
8493774 | Kung et al. | Jul 2013 | B2 |
8526256 | Gosh et al. | Sep 2013 | B2 |
8542050 | Chuang et al. | Sep 2013 | B2 |
8575982 | Shu et al. | Nov 2013 | B1 |
8593860 | Shu et al. | Nov 2013 | B2 |
8625334 | Liaw | Jan 2014 | B2 |
8643418 | Ma et al. | Feb 2014 | B2 |
8692621 | Snowden et al. | Apr 2014 | B2 |
8693236 | Shu et al. | Apr 2014 | B2 |
8817550 | Oh | Aug 2014 | B1 |
8837207 | Jou et al. | Sep 2014 | B1 |
8885439 | Shu et al. | Nov 2014 | B1 |
8971096 | Jung et al. | Mar 2015 | B2 |
8982649 | Shu et al. | Mar 2015 | B2 |
8995162 | Sang et al. | Mar 2015 | B2 |
9018992 | Shu et al. | Apr 2015 | B1 |
9030893 | Jung et al. | May 2015 | B2 |
9053768 | Shu et al. | Jun 2015 | B2 |
9059691 | Lin | Jun 2015 | B2 |
9070477 | Clark | Jun 2015 | B1 |
9083356 | Cheng | Jul 2015 | B1 |
9093135 | Khailany et al. | Jul 2015 | B2 |
9094025 | Cheng | Jul 2015 | B1 |
9135986 | Shu et al. | Sep 2015 | B2 |
9142285 | Hwang et al. | Sep 2015 | B2 |
9159391 | Shu et al. | Oct 2015 | B1 |
9171634 | Zheng et al. | Oct 2015 | B2 |
9177646 | Arsovski | Nov 2015 | B2 |
9196324 | Haig et al. | Nov 2015 | B2 |
9240229 | Oh et al. | Jan 2016 | B1 |
9311971 | Oh | Apr 2016 | B1 |
9318174 | Chuang et al. | Apr 2016 | B1 |
9356611 | Shu et al. | May 2016 | B1 |
9384822 | Shu et al. | Jul 2016 | B2 |
9385032 | Shu | Jul 2016 | B2 |
9396790 | Chhabra et al. | Jul 2016 | B1 |
9401200 | Chan et al. | Jul 2016 | B1 |
9412440 | Shu et al. | Aug 2016 | B1 |
9413295 | Chang | Aug 2016 | B1 |
9431079 | Shu et al. | Aug 2016 | B1 |
9443575 | Yabuuchi | Sep 2016 | B2 |
9484076 | Shu et al. | Nov 2016 | B1 |
9494647 | Chuang et al. | Nov 2016 | B1 |
9552872 | Jung et al. | Jan 2017 | B2 |
9608651 | Cheng | Mar 2017 | B1 |
9613670 | Chuang et al. | Apr 2017 | B2 |
9613684 | Shu et al. | Apr 2017 | B2 |
9640540 | Liaw | May 2017 | B1 |
9679631 | Haig et al. | Jun 2017 | B2 |
9685210 | Ghosh | Jun 2017 | B1 |
9692429 | Chang et al. | Jun 2017 | B1 |
9697890 | Wang | Jul 2017 | B1 |
9722618 | Cheng | Aug 2017 | B1 |
9729159 | Cheng | Aug 2017 | B1 |
9789840 | Farooq et al. | Oct 2017 | B2 |
9804856 | Oh et al. | Oct 2017 | B2 |
9847111 | Shu et al. | Dec 2017 | B2 |
9853633 | Cheng et al. | Dec 2017 | B1 |
9853634 | Chang | Dec 2017 | B2 |
9859902 | Chang | Jan 2018 | B2 |
9916889 | Duong | Mar 2018 | B1 |
9935635 | Kim et al. | Apr 2018 | B2 |
9966118 | Shu et al. | May 2018 | B2 |
10065594 | Fukawatase et al. | Sep 2018 | B2 |
10153042 | Ehrman et al. | Dec 2018 | B2 |
10192592 | Shu et al. | Jan 2019 | B2 |
10249362 | Shu et al. | Apr 2019 | B2 |
10388364 | Ishizu | Aug 2019 | B2 |
10425070 | Chen et al. | Sep 2019 | B2 |
10535381 | Shu et al. | Jan 2020 | B2 |
10659058 | Cheng et al. | May 2020 | B1 |
10847212 | Haig et al. | Nov 2020 | B1 |
10847213 | Haig et al. | Nov 2020 | B1 |
10854284 | Chuang et al. | Dec 2020 | B1 |
10860320 | Haig et al. | Dec 2020 | B1 |
10877731 | Shu et al. | Dec 2020 | |
10891076 | Haig et al. | Jan 2021 | |
20010052822 | Kim et al. | Dec 2001 | A1 |
20020006072 | Kunikiyo | Jan 2002 | A1 |
20020060938 | Song et al. | May 2002 | A1 |
20020136074 | Hanzawa | Sep 2002 | A1 |
20020154565 | Noh et al. | Oct 2002 | A1 |
20020168935 | Han | Nov 2002 | A1 |
20030016689 | Hoof | Jan 2003 | A1 |
20030107913 | Nii | Jun 2003 | A1 |
20030185329 | Dickmann | Oct 2003 | A1 |
20040052152 | Kono | Mar 2004 | A1 |
20040053510 | Little et al. | Mar 2004 | A1 |
20040062138 | Partsch et al. | Apr 2004 | A1 |
20040090413 | Yoo | May 2004 | A1 |
20040160250 | Kim et al. | Aug 2004 | A1 |
20040169565 | Gaggl et al. | Sep 2004 | A1 |
20040199803 | Suzuki et al. | Oct 2004 | A1 |
20040240301 | Rao | Dec 2004 | A1 |
20040264279 | Wordeman et al. | Dec 2004 | A1 |
20040264286 | Ware et al. | Dec 2004 | A1 |
20050024912 | Chen et al. | Feb 2005 | A1 |
20050026329 | Kim et al. | Feb 2005 | A1 |
20050036394 | Shiraishi | Feb 2005 | A1 |
20050186930 | Rofougaran et al. | Aug 2005 | A1 |
20050226079 | Zhu et al. | Oct 2005 | A1 |
20050226357 | Yoshimura | Oct 2005 | A1 |
20050253658 | Maeda et al. | Nov 2005 | A1 |
20050285862 | Noda et al. | Dec 2005 | A1 |
20060039227 | Lai et al. | Feb 2006 | A1 |
20060055434 | Tak et al. | Mar 2006 | A1 |
20060119443 | Azam et al. | Jun 2006 | A1 |
20060139105 | Maxim et al. | Jun 2006 | A1 |
20060143428 | Noda et al. | Jun 2006 | A1 |
20060248305 | Fang | Nov 2006 | A1 |
20070001721 | Chen et al. | Jan 2007 | A1 |
20070047283 | Miyanishi | Mar 2007 | A1 |
20070058407 | Dosaka et al. | Mar 2007 | A1 |
20070096790 | Chuang et al. | May 2007 | A1 |
20070097765 | Chuang et al. | May 2007 | A1 |
20070109030 | Park | May 2007 | A1 |
20070115739 | Huang | May 2007 | A1 |
20070139997 | Suzuki et al. | Jun 2007 | A1 |
20070171713 | Hunter et al. | Jul 2007 | A1 |
20070189101 | Lambrache | Aug 2007 | A1 |
20070229129 | Nakagawa | Oct 2007 | A1 |
20070266286 | Chen et al. | Nov 2007 | A1 |
20070268039 | Chuang et al. | Nov 2007 | A1 |
20080010429 | Rao | Jan 2008 | A1 |
20080049484 | Sasaki | Feb 2008 | A1 |
20080068096 | Feng et al. | Mar 2008 | A1 |
20080079467 | Hou et al. | Apr 2008 | A1 |
20080080230 | Liaw | Apr 2008 | A1 |
20080117707 | Manickavasakam et al. | May 2008 | A1 |
20080129402 | Han et al. | Jun 2008 | A1 |
20080155362 | Chang et al. | Jun 2008 | A1 |
20080175039 | Thomas et al. | Jul 2008 | A1 |
20080181029 | Joshi et al. | Jul 2008 | A1 |
20080265957 | Luong et al. | Oct 2008 | A1 |
20080272800 | Chuang et al. | Nov 2008 | A1 |
20080273361 | Dudeck et al. | Nov 2008 | A1 |
20090027947 | Takeda | Jan 2009 | A1 |
20090089646 | Hirose et al. | Apr 2009 | A1 |
20090141566 | Arsovski | Jun 2009 | A1 |
20090154257 | Fukaishi et al. | Jun 2009 | A1 |
20090161468 | Fujioka | Jun 2009 | A1 |
20090231943 | Kunce et al. | Sep 2009 | A1 |
20090256642 | Lesso | Oct 2009 | A1 |
20090296869 | Chao et al. | Dec 2009 | A1 |
20090319871 | Shirai et al. | Dec 2009 | A1 |
20100020590 | Hsueh et al. | Jan 2010 | A1 |
20100085086 | Nedovic et al. | Apr 2010 | A1 |
20100157715 | Pyeon | Jun 2010 | A1 |
20100169675 | Kajihara | Jul 2010 | A1 |
20100172190 | Lavi et al. | Jul 2010 | A1 |
20100177571 | Shori et al. | Jul 2010 | A1 |
20100214815 | Tam et al. | Aug 2010 | A1 |
20100232202 | Lu et al. | Sep 2010 | A1 |
20100260001 | Kasprak et al. | Oct 2010 | A1 |
20100271138 | Thakur et al. | Oct 2010 | A1 |
20100322022 | Shinozaki et al. | Dec 2010 | A1 |
20110018597 | Lee et al. | Jan 2011 | A1 |
20110063898 | Ong | Mar 2011 | A1 |
20110153932 | Ware et al. | Jun 2011 | A1 |
20110211401 | Chan | Sep 2011 | A1 |
20110267914 | Ishikura et al. | Nov 2011 | A1 |
20110280307 | Macinnis et al. | Nov 2011 | A1 |
20110292743 | Zimmerman | Dec 2011 | A1 |
20110299353 | Ito et al. | Dec 2011 | A1 |
20120049911 | Ura | Mar 2012 | A1 |
20120133114 | Choi et al. | May 2012 | A1 |
20120153999 | Kim | Jun 2012 | A1 |
20120242382 | Tsuchiya et al. | Sep 2012 | A1 |
20120243347 | Sampigethaya et al. | Sep 2012 | A1 |
20120250440 | Wu | Oct 2012 | A1 |
20120281459 | Teman et al. | Nov 2012 | A1 |
20120327704 | Chan et al. | Dec 2012 | A1 |
20130039131 | Haig et al. | Feb 2013 | A1 |
20130083591 | Wuu et al. | Apr 2013 | A1 |
20130148414 | Haig et al. | Jun 2013 | A1 |
20130148415 | Shu et al. | Jun 2013 | A1 |
20130170289 | Grover et al. | Jul 2013 | A1 |
20140056093 | Tran et al. | Feb 2014 | A1 |
20140125390 | Ma | May 2014 | A1 |
20140136778 | Khailany et al. | May 2014 | A1 |
20140185366 | Chandwani et al. | Jul 2014 | A1 |
20140219011 | Shu et al. | Aug 2014 | A1 |
20140269019 | Kolar et al. | Sep 2014 | A1 |
20140286083 | Shu et al. | Sep 2014 | A1 |
20140289440 | Shu | Sep 2014 | A1 |
20140289460 | Shu et al. | Sep 2014 | A1 |
20140304463 | Haig et al. | Oct 2014 | A1 |
20150003148 | Iyer | Jan 2015 | A1 |
20150029782 | Jung et al. | Jan 2015 | A1 |
20150063052 | Manning | Mar 2015 | A1 |
20150187763 | Kim et al. | Jul 2015 | A1 |
20150213858 | Tao et al. | Jul 2015 | A1 |
20150248927 | Fujiwara et al. | Sep 2015 | A1 |
20150279453 | Fujiwara et al. | Oct 2015 | A1 |
20150302917 | Grover et al. | Oct 2015 | A1 |
20150310901 | Jung et al. | Oct 2015 | A1 |
20150357027 | Shu et al. | Dec 2015 | A1 |
20150357028 | Huang et al. | Dec 2015 | A1 |
20160005458 | Shu et al. | Jan 2016 | A1 |
20160027500 | Chuang et al. | Jan 2016 | A1 |
20160064068 | Mojumder et al. | Mar 2016 | A1 |
20160132339 | Oh et al. | May 2016 | A1 |
20160141023 | Jung et al. | May 2016 | A1 |
20160189766 | Haig et al. | Jun 2016 | A1 |
20160196858 | Chuang et al. | Jul 2016 | A1 |
20160225436 | Wang et al. | Aug 2016 | A1 |
20160225437 | Kumar et al. | Aug 2016 | A1 |
20160247559 | Atallah et al. | Aug 2016 | A1 |
20160284392 | Block et al. | Sep 2016 | A1 |
20160293231 | Shu et al. | Oct 2016 | A1 |
20160329092 | Akerib | Nov 2016 | A1 |
20160343415 | Shu et al. | Nov 2016 | A1 |
20160344380 | Chang | Nov 2016 | A1 |
20160364348 | Shu | Dec 2016 | A1 |
20170063372 | Chuang et al. | Mar 2017 | A1 |
20170125074 | Shu et al. | May 2017 | A1 |
20170194046 | Yeung, Jr. | Jul 2017 | A1 |
20170345505 | Noel et al. | Nov 2017 | A1 |
20180060082 | Oh et al. | Mar 2018 | A1 |
20180109248 | Cheng et al. | Apr 2018 | A1 |
20180122456 | Li et al. | May 2018 | A1 |
20180123603 | Chang | May 2018 | A1 |
20180157488 | Shu et al. | Jun 2018 | A1 |
20180157621 | Shu | Jun 2018 | A1 |
20180158517 | Shu et al. | Jun 2018 | A1 |
20180158518 | Shu et al. | Jun 2018 | A1 |
20180158519 | Shu et al. | Jun 2018 | A1 |
20180158520 | Shu et al. | Jun 2018 | A1 |
20180218761 | Shu et al. | Aug 2018 | A1 |
20200117398 | Haig et al. | Apr 2020 | A1 |
20200160905 | Charles et al. | May 2020 | A1 |
20200301707 | Shu et al. | Sep 2020 | A1 |
20200403616 | Shu et al. | Dec 2020 | A1 |
Number | Date | Country |
---|---|---|
104752431 | Jan 2019 | CN |
10133281 | Jan 2002 | DE |
2005346922 | Dec 2005 | JP |
Entry |
---|
US 10,564,982 B1, 02/2020, Oh et al. (withdrawn) |
Wang et al., “A Two-Write and Two-Read Multi-Port SRAM with Shared Write Bit-Line Scheme and Selective Read Path for Low Power Operation”, Journal of Low Power Electronics vol. 9. 9-22, 2013, Department of Electronics Engineering and Institute of Electronics, National Chiao-Tung University, Hsinchu 300, Taiwan (Received: Oct. 15, 2012: Accepted: Feb. 11, 2013), 14 pages. |
Number | Date | Country | |
---|---|---|---|
62865078 | Jun 2019 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 16445006 | Jun 2019 | US |
Child | 16798270 | US |