Computational memory cell and processing array device using the memory cells for XOR and XNOR computations

Information

  • Patent Grant
  • 10998040
  • Patent Number
    10,998,040
  • Date Filed
    Tuesday, September 19, 2017
    6 years ago
  • Date Issued
    Tuesday, May 4, 2021
    3 years ago
Abstract
A memory cell and processing array that has a plurality of memory are capable of performing logic functions, including an exclusive OR (XOR) or an exclusive NOR (XNOR) logic function. The memory cell may have a read port in which the digital data stored in the storage cell of the memory cell is isolated from the read bit line.
Description
FIELD

The disclosure relates generally to a static random access memory cell that may be used for computations.


BACKGROUND

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.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 illustrates an implementation of a dual port SRAM cell that can perform an XOR or XNOR function;



FIG. 2 illustrates an implementation of a processing array that has a plurality of the SRAM cells shown in FIG. 1 and performs an XOR or XNOR logic function;



FIG. 3 illustrates a write port truth table for the dual port SRAM cell of FIG. 1;



FIG. 4 illustrates a second implementation of a dual port SRAM cell that can perform an XOR or XNOR function and is capable to writing both “0” and “1” data;



FIG. 5 illustrates a write port truth table for the dual port SRAM cell of FIG. 4;



FIG. 6 illustrates an implementation of a processing array that has a plurality of the SRAM cells shown in FIG. 4 and performs an XOR or XNOR logic function;



FIG. 7 illustrates another implementation of a dual port SRAM cell with an alternate write port;



FIGS. 8 and 9 illustrate two example of a latch circuit that may be part of the SRAM cells shown in FIGS. 1, 4 and 7;



FIG. 10 illustrates an implementation of a dual port SRAM cell that can perform an XOR or XNOR function; and



FIG. 11 illustrates another implementation of a dual port SRAM cell that can perform an XOR or XNOR function.





DETAILED DESCRIPTION OF ONE OR MORE EMBODIMENTS

The disclosure is particularly applicable to a CMOS implemented memory cell and processing array with a plurality of the memory cells that are capable to performing an exclusive OR (XOR) or exclusive NOR (XNOR) logic function (collectively a “exclusive logic operation”) 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 exclusive OR (XOR) or exclusive NOR (XNOR) logic function and so are within the scope of this disclosure. For purposes of illustration, a dual port SRAM cell is 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.



FIG. 1 illustrates an implementation of a dual port SRAM cell 100 with an XOR or XNOR function. The dual port SRAM cell 100 may include two cross coupled inverters I31, I32 and two access transistors M33 and M34 that are coupled together as shown in FIG. 1 to form the basic SRAM cell. The SRAM cell may be operated as a storage latch and may have a read port and a write port to form a dual port SRAM. The two inverters I31, I32 are cross coupled since the input of the first inverter is connected to the output of the second inverter (labeled D) and the output of the first inverter (labeled Db) is coupled to the input of the second inverter as shown in FIG. 1. The cross coupled inverters I31, I32 form the latch of the SRAM cell. The access transistor M34 and M33 may have their respective gates connected to a write bit line and its complement bit line (WBL, WBLb), respectively. A write word line carries a signal WE. The write word line WE is coupled to the gate of a transistor M35 that is part of the write access circuitry for the SRAM cell.


The circuit in FIG. 1 may also have a read word line RE, a complementary read word line REb, a read bit line RBL and a read port formed by transistors M31, M32 coupled together and transistors M36, M37 coupled together to form as isolation circuit. The read word line RE may be coupled to the gate of transistor M31 that forms part of the read port while the read bit line RBL is coupled to the drain terminal of transistor M31. The gate of transistor M32 may be coupled to the Db output from the cross coupled inverters I31, I32. The isolation circuit isolates the latch output Db (in the example in FIG. 1) from the read bit line and signal/voltage level of RBL so that 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.


The complimentary read word line REb may be coupled to the gate of transistor M36 that forms part of the read port while the read bit line RBL is coupled to the drain terminal of transistor M36. The gate of transistor M37 may be coupled to the D output from the cross coupled inverters I31, I32. The isolation circuit isolates the latch output D (in the example in FIG. 1) from the read bit line and signal/voltage level of RBL so that the D 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.


The cell 100 may further include two more read word line transistors M36, M37 and one extra complementary read word line, REb. When the read port is active, either RE or REb is high and the REb signal/voltage level is the complement of RE signal/voltage level. RBL is pre-charged high, and if either one of-the transistor pair M31, M32 are both turned on or the transistors pair M36, M37 are both turned on, RBL is discharged to 0. If none of (M31, M32) or (M36, M37) series transistors is on, then RBL stay high as 1 since it was precharged high and not coupled to ground. The cell 100 may operate as a dual-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 the read data is accessed on RBL. The cell 100 may further be used for computation where RBL is also used for logic operation. The following equation below, where D is the data stored in the cell and Db is the complement data stored in the cell, describes the functioning/operation of the cell:

RBL=AND(NAND(RE,Db),NAND(REb,D))=XNOR(RE,D)  (EQ1)


If the word size is 8, then the word is stored in 8 cells (with one cell being shown in FIG. 1) on the same bit line. On a search operation, an 8 bit search key can be entered using the RE, REb lines of eight cells to compare the search key with the cell data. If the search key bit is 1, then the corresponding RE=1 and REb=0 for that cell. If the search key bit is 0, then the corresponding RE=0 and REb=1. If all 8 bits match the search key, then RBL will be equal to 1. If any one or more of the 8 bits is not matched, then RBL will be discharged and be 0 indicating no match. Therefore, this cell 100 (when used with 7 other cells for an 8 bit search key) can perform the same XNOR function but uses half the number of cell as the typical SRAM cell. The following equation for the multiple bits on the bit line may describe the operation of the cells as:

RBL=AND(XNOR(RE1,D1),XNOR(RE2,D2), . . . ,XNOR(REi,Di)), where i is the number of active cell.  (EQ2)


By controlling either RE or REb to be a high signal/on, the circuit 100 may also be used to do logic operations mixing true and complement data as shown below:

RBL=AND(D1,D2, . . . ,Dn,Dbn+1,Dbn+2, . . . Dbm)  (EQ3)

where D1, D2, . . . Dn are “n” number of data with RE on and Dbn+1, Dbn+2, . . . Dbm are m-n number of data with REb on.


Furthermore, if the cell 100 stores inverse data, meaning WBL and WBLb shown in FIG. 1 are swapped, then the logic equation EQ1 becomes an XOR function and logic equation EQ3 becomes a NOR function and can be expressed as EQ4 and EQ5:

RBL=XOR(RE,D)  (EQ4)
RBL=NOR(D1,D2, . . . ,Dn,Dbn+1,Dbn+2, . . . Dbm)  (EQ5)


where D1, D2, . . . Dn are n number of data with RE on and Dbn+1, Dbn+2, . . . Dbm are m-n number of data with REb on.


In another embodiment, the read port of the circuit 100 in FIG. 1 may be reconfigured differently to achieve different Boolean equation. Specifically, transistors M31, M32, M36 and M37 may be changed to PMOS, the source terminal of M32 and M37 may be VDD instead of VSS/ground, the bit line is pre-charged to 0 instead of 1, and the word line RE/REb active state is 0. In this embodiment, the logic equations EQ1 is inverted so that RBL is an XOR function of RE and D (EQ6). EQ3 is rewritten as an OR function (EQ7) as follows:

RBL=XOR(RE,D)  (EQ6)
RBL=OR(D1,D2, . . . ,Dn,Dbn+1,Dbn+2, . . . Dbm)  (EQ7)


where D1, D2, . . . Dn are n number of data with RE on and Dbn+1, Dbn+2, . . . Dbm are m-n number of data with REb on.


If the cell stores the inverse data of the above discussed PMOS read port, meaning WBL and WBLb is swapped, then

RBL=XNOR(RE,D)  (EQ8)
RBL=NAND(D1,D2, . . . ,Dn,Dbn+1,Dbn+2, . . . Dbm)  (EQ9)


where D1, D2, . . . Dn are n number of data with RE on and Dbn+1, Dbn+2, . . . Dbm are m-n number of data with REb on.


For example, consider a search operation where a digital word needs to be found in a memory array in which the memory array can be configured as each bit of the word stored on the same bit line. To compare 1 bit of the word, then the data is stored in a cell and the RE signal applied to the cell is the search key (“Key”), then EQ1 can be written as below:

RBL=XNOR(Key,D)  (EQ10)

If Key=D, then RBL=1. If the word size is 8 bits as D[0:7], then the search key Key[0:7] is an RE signal applied to each cell corresponding to the value of each bit in the search key, then EQ2 can be expressed as search result and be written as below:

RBL=AND(XNOR(Key[0],D[0]),XNOR(Key[1],D[1]), . . . ,XNOR(Key[7],D[7]))   (EQ11)

If all Key[i] is equal to D[i] where i=0-7, then the search result RBL is a match. If any one or more of Key[i] is not equal to D[i], then the search result is not a match. A parallel search can be performed in one operation by arranging multiple data words along the same word line and on parallel bit lines with each word on one bit line.



FIG. 2 illustrates an implementation of a processing array 200 that has a plurality of the SRAM cells shown in FIG. 1 (cell 00, . . . , cell 0n and cell m0, . . . , cell mn formed in an array) that can perform an XOR or XNOR logic function or the other logic functions as disclosed above. The array shown is formed by M word lines (RE0, REb0, WE0, . . . , REm, REbm, WEm) and N bit lines (WBLb0, WBL0, RBL0, . . . , WBLbn, WBLn, RBLn). The processing array 200 may have a word line generator 202 that generates the word line signals/voltage levels and a plurality of bit line read/write logic circuits (BL Read/Write Logic 0, . . . , BL Read/Write Logic n) 204 that receive and process the bit line signals to generate the results of the Boolean logic function.


In a read cycle, WL generator 202 generates one or multiple RE or REb signals in a cycle and RBL forms Boolean functions as described above whose results are sensed/read by the BL Read/Write Logic 204. The BL Read/Write Logic 204 processes the RBL result and sends it 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 from its own bit line or from the neighboring bit line in a latch so that the next cycle Read/Write logic can perform logic with the latched RBL result data.


In a write cycle, 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 from the neighboring RBL or from out of this processing array. The ability of BL Read/Write Logic 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. For example, WBL can be written to a data if RBL=1. If RBL=0, then a write is not performed.



FIG. 3 illustrates a write port truth table for the dual port SRAM cell of FIG. 1. If WE is 0, no write is performed (as reflected by the D(n−1) shown in FIG. 3). If WE is 1, then the storage nodes D and its complement Db are written by WBL and WBLb. D=1 and Db=0 if WBL=1 and WBLb=0. D=0 and D=1 if WBL=0 and WBLb=1. If both WBL and WBLb are 0, then no write is performed. So this cell can perform Selective Write function with WBL=WBLb=0, with WE=1.


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 XOR cell illustrated in FIG. 1, this can be accomplished by taking 2 cycles to write data in which data “1” is written in one cycle and data “0” is written in the other cycle.


In another embodiment of the SRAM cell shown in FIG. 4, the SRAM cell may have similar transistors as the cell in FIG. 1 that are coupled as described above and operate as described above (although labeled with different reference identifiers, M61-M67, I61 and I62 instead of M31-M37, I31 and I32 respectively) and three extra transistors M68, M69, M610 and one extra complementary write word line WEb that are coupled as shown in FIG. 4. Like the SRAM cell in FIG. 1, the SRAM cell in FIG. 4 can also use inverted data and different reconfigurations like the SRAM cell in FIG. 1. The three added transistors allow the inverted data (Db) to be written to the cells with WEb high, at the same time as data is being written to the cell with WE high. Thus, this embodiment of the SRAM cell is capable of writing both “0” and “1” data simultaneously. FIG. 5 shows the truth table of the write operation for the cell shown in FIG. 4. The first 4 rows, WEb=0, the write operation is the same as shown in cell shown in FIG. 1. However, when WE=0 and WEb=1, inverted data is written, meaning D=1, if WBL=0, WBLb=1; D=0 if WBL=1, WBLb=0. Selective Write is performed the same way with WE=0, WEb=1 that no write is performed if both WBL=WBLb=0. WE and WEb both are 1 is not allowed that cell is undefined under this condition. FIG. 6 illustrates an implementation of a processing array 600 that has a plurality of the SRAM cells shown in FIG. 4 and performs an XOR/XNOR or other logic functions and it has the same elements that operate in the same manner as shown in FIG. 2, but has the added WEb signals that are generated by the WL generator 602.


It is desired to do a sequence of logic operation on the processing array of 200 in FIG. 2 or 600 in FIG. 6. The sequence of logic operation can be implemented as logic operation described from EQ 1 to EQ11 and a Selective Write operation in the same cycle. One particular example as Compare and Write operation. WL Generator can send out a value on one pair or a plurality of pairs of the read word lines and complementary read word lines and compares with the value stored in the cells. The compare operation is an XNOR operation, meaning if the value is matched, RBL of those matched bit lines will be 1, and RBL of those unmatched bit lines will be 0. Matched bit lines' BL Read/Write logic can do Selective Write and write the values to the cells with write word lines are on; and unmatched bitlines' BL Read/Write logic will not perform the writing. The XOR cells in 200 and 600 are a dual port cell, RBL and WBL are separate lines and RE and WE are separate lines, so the compare operation on RBL of one set of RE and the selective write operation on WBL of the other set of WE can be performed at the same cycle. A sequence of Compare and Write operation can be done as a pipelined operation such that the first cycle is to do the Compare operation and RBL result is latched in BL Read/Write Logic, and the following cycle is to do Selective Write based on the previous cycle's latched RBL result, and on the same cycle do the next Compare operation. In this manner, RE, WE, RBL and WBL are just toggled once in a cycle to complete Compare and Write operation. U.S. Patent application 62/430,372, owned by the same assignee as the present application and incorporated herein by reference further describe a Full Adder implementation by doing 4 cycles Compare and write operation.


Returning to FIG. 2, on the write cycle, the WE of an unselected cell is 0, but one of WBL and WBLb is 1. For example, WEm is 1 for the cell m0 to be written, but WE0 is 0 for cell 00 not to be written. In the cell in FIG. 1, D and Db of the unselected cell shall keep the original value. But if D of the unselected cell stores a “1” and the drain of M35 is 0 and WBLb is 1, then at the instant M33 gate is turned on, the capacitance charge of node D is charge sharing with the capacitance of node N, the drain of M35 and sources of M33 and M34. The high level of D is lowered by this charge sharing, and if the node N capacitance is high enough, the level will be lowered such that I41 and I42 latch flip to the opposite data.



FIG. 7 illustrates another implementation of a dual port SRAM cell 700 showing only an alternate write port that improves the charge sharing issue noted above. The cell 700 would have the similar read port(s) as shown in FIG. 1 although those ports are not shown in FIG. 7 for clarity purposes. In particular, in this embodiment, transistor M35 in FIG. 1 may be split into transistors M95 and M96 as shown in FIG. 7. In this embodiment, the node D can only charge share with a drain of M93 and source of M95, and the node D is no longer affected by the high voltage level of drain of M94 to avoid the data flipping to the opposite state. This improves the weakness of the unselective cell's charge sharing. The other way to improve FIG. 1 is to increase the capacitance of node D by having bigger gate size of I31 and I32 and the gate of read port. Note that it works the same way if transistors M93(M94), M95(M96) are swapped such that M93 with WBLb gated is tied to node D and M95 is tied to VSS. The splitting of the pull down transistor applies to all the write port of the cell discussed in this disclosure.


Returning to FIG. 1, the latch device I31 and I32 can be a simple inverter. To do a successful writing, the driver strength of series transistor M33 and M35 needs to be stronger than the pull up PMOS transistor of I32. This ratio needs to be around 2 to 3 times. In advanced technology like 28 nm or better, the layout of the PMOS and NMOS is preferred to have an equal length. So the PMOS transistor of I31 and I32 could be actually 2 or more PMOS transistors in series, this is shown as FIG. 8. For the ease of the layout, 1 or more of the series PMOS transistor could be tied to ground, this is shown in FIG. 9. The latch inverter in FIGS. 8 and 9 can be used in all the cells shown in figures and described above.


As set forth above, the disclosed computation SRAM cell and processing array may be implemented using an SRAM cell having more than 2 ports, such as a 3 port SRAM, a 4 port SRAM, etc. For example, the SRAM computation cell may be a 3-port cell that has 2 read ports and 1 write port. In this non-limiting example, the 3 port SRAM cell may be used to perform an operation like Y=OR (AND (A, B), AND (A,C)) more efficiently. Using the 3 port SRAM, the value of variable A is used twice using the 2 read ports. In this example operation, Y can be calculated in one cycle in which an AND (A,B) result is on RBL1 and an AND (A,C) result is on RBL2; and on the same cycle RBL2 data can be sent to RBL1 to do the OR operation to generate the final result. Therefore, this logic equation/operation can be done in 1 cycle when word lines are toggled once to generate the result, compared to 2 cycles of the dual port cell. Similarly, a 4 port SRAM cell could be used as well and the disclosure is not limited to any particular number of ports of the SRAM cell.


In the processing array disclosed above, the processing array can also do parallel shifting operation to shift the data from one bit line to the neighboring bit line on one or more or all bit lines concurrently.



FIG. 10 illustrates an implementation of a dual port SRAM cell 1000 that may be used for computation. The cell in FIG. 10 has the same isolation circuits (M101, M102, M106, M107) for the read bit line, the same storage latches (I101, I102), the same read word line and complementary read word line as the cell described in FIG. 1. However, the Selective Write implementation is different in FIG. 10. The active low write word line, WEb, is connected to an input to a NOR logic gate 1103 whose other input is connected to the active low Selective Write control signal, SWb, to control the gate of access transistors M103 and M104. SWb is running in the same direction as the bit line. The writing to the cell can only happen when both write word line and selective write signals are active.



FIG. 11 illustrates another implementation of a dual port SRAM cell 1100 that may be used for computation. FIG. 11 is similar to FIG. 10, with selective write control signal SW, to combine with write word line, WE, to control the selective write operation. 2 access transistors M113 and M118 are in series to couple the storage latches to write bit line, WBL, and similarly, 2 access transistors M114 and M119 are in series to couple the storage latches to complementary write bit line, WBLb. The gates of M113 and M114 are coupled to WE and the gates of M118 and M119 are coupled to SW. SW is running in the same direction as the bit line. The writing to the cell can only happen when both write word line and selective write signals are active.


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 and/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.

Claims
  • 1. A processing array, comprising: at least one read bit line;at least two memory cells connected to the same at least one read bit line, each memory cell having a storage cell that stores data and complementary data and an isolation circuit that buffers the storage cell from signals on the at least one read bit line, the isolation circuit having a read word line that provides access by the at least one read bit line to the complementary data stored in the storage cell and a complementary read word line that provides access by the at least one read bit line to the data stored in the storage cell; andwherein the at least one read bit line is configured to provide read access to the storage cell data or the storage cell complementary data of each memory cell and the read word line and complementary read word line of the at least two memory cells are configured to be activated concurrently to form an exclusive logic function signal output from one of the at least two memory cells on the at least one read bit line.
  • 2. The processing array of claim 1 further comprising a plurality of memory cells connected to the at least one read bit line to perform the exclusive logic function wherein each of the plurality of memory cells being turned on to perform the exclusive logic function does not adversely affect the performance of the exclusive logic function.
  • 3. The processing array of claim 2 wherein the exclusive logic function further comprises one of an AND operation, an NOR operation, an OR operation and a NAND operation.
  • 4. The processing array of claim 1 further comprising a plurality of memory cells connected to the at least one read bit line wherein a plurality of memory cells are activated to form a combinational logic result of the exclusive logic function of each memory cell on the at least one read bit line.
  • 5. The processing array of claim 1 further comprising a write bit line connected to the at least two memory cells wherein data is written into the storage cell of one or more of the at least two memory cells using the write bit line.
  • 6. The processing array of claim 5, wherein each memory cell is capable of performing a selective write operation.
  • 7. The processing array of claim 6, wherein the processing array is capable of performing a logic operation and selective write operation in one cycle.
  • 8. The processing array of claim 6, wherein the processing array is capable of performing a compare operation and a selective write operation in one cycle, the compare operation being performed with a value entered on one pair or a plurality pairs of read word lines and complementary read word lines and a compare result is generated and latched on the read bit line or a plurality of compare results are generated and latched on a plurality of read bit lines, and based on a previous cycle's latched compare result the selective write is performed on a current cycle on one pair or a plurality pairs of write bit lines and complementary write bit lines onto the cells activated by one or a plurality of write word lines.
  • 9. The processing array of claim 1 further comprising a plurality of memory cells connected to the at least one read bit line and a write bit line connected to the plurality of memory cells wherein data may be written into the storage cell of one or more of the plurality of memory cells.
  • 10. The processing array of claim 9 further comprising a write port that buffers the storage cell of each of the plurality of memory cells so that writing of data into any number of storage cells on a write bit line is performed.
  • 11. The processing array of claim 1, wherein the exclusive logic function is one of an exclusive OR operation and an exclusive NOR operation.
  • 12. The processing array of claim 1, wherein the processing array is capable of performing a parallel shifting operation.
  • 13. The processing array of claim 1, wherein the processing array is capable of performing a search operation, wherein the search operation is performed with a search key entered on one pair or a plurality pairs of read word lines and complementary read word lines and the search result is on the read bit line or plurality of read bit lines.
  • 14. The processing array of claim 1, wherein each memory cell is a static random access memory cell.
  • 15. The processing array of claim 14, wherein each static random access memory cell is one of a two port static random access memory cell, a three port static random access memory cell and a four port static random access memory cell.
  • 16. The processing array of claim 1, wherein each memory cell is a non-volatile memory.
  • 17. The processing array of claim 16, wherein the non-volatile memory is one of a non-volatile memory cell and a non-volatile memory device.
  • 18. A processing array, comprising: at least one read bit line;at least two memory cells connected to the same at least one read bit line, each memory cell having a storage cell that stores data and complementary data and an isolation circuit that buffers the storage cell from signals on the at least one read bit line, the isolation circuit having a read word line that provides access by the at least one read bit line to the complementary data stored in the storage cell and a complementary read word line that provides access by the at least one read bit line to the data stored in the storage cell; andone of the at least two memory cells forms, when the read word line and complementary read word line are activated concurrently, an exclusive logic function signal output from the one of the at least two memory cells on the at least one read bit line.
PRIORITY CLAIMS/RELATED APPLICATIONS

This application claims the benefit and priority under 35 USC 119(e) and 120 to U.S. Provisional Patent Application Ser. No. 62/430,767 filed Dec. 6, 2016 and entitled “Computational Dual Port SRAM Cell And Processing Array Device Using The Dual Port SRAM Cells For Xor And Xnor Computations”, the entirety of which is incorporated herein by reference.

US Referenced Citations (406)
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 Jan 1995 A
5400274 Jones 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
6310880 Waller Oct 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 Jun 2004 B1
6789209 Suzuki et al. Sep 2004 B1
6816019 Delbo' et al. Nov 2004 B2
6836419 Loughmiller Dec 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
7719329 Smith 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
7813161 Luthra Oct 2010 B2
7830212 Lee et al. Nov 2010 B2
7839177 Soh Nov 2010 B1
7843239 Sohn et al. Nov 2010 B2
7843721 Chou 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 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 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 Sep 2012 B1
8284593 Russell Oct 2012 B2
8294502 Lewis et al. Oct 2012 B2
8400200 Shu et al. Mar 2013 B1
8488408 Shu et al. Jul 2013 B1
8493774 Kung Jul 2013 B2
8526256 Gosh 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 Apr 2014 B2
8817550 Oh Aug 2014 B1
8837207 Jou Sep 2014 B1
8885439 Shu et al. Nov 2014 B1
8971096 Jung et al. Mar 2015 B2
8995162 Sang Mar 2015 B2
9018992 Shu et al. Apr 2015 B1
9030893 Jung 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 Jul 2015 B2
9094025 Cheng Jul 2015 B1
9135986 Shu Sep 2015 B2
9142285 Hwang et al. Sep 2015 B2
9159391 Shu et al. Oct 2015 B1
9171634 Zheng 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 Jul 2016 B1
9396795 Jeloka et al. Jul 2016 B1
9401200 Chan 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 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 et al. 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 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 Chuang et al. Apr 2018 B2
9966118 Shu et al. May 2018 B2
10065594 Fukawatase Sep 2018 B2
10153042 Ehrman Dec 2018 B2
10192592 Shu et al. Jan 2019 B2
10249312 Kim et al. Apr 2019 B2
10249362 Shu Apr 2019 B2
10388364 Ishizu et al. Aug 2019 B2
10425070 Cheng et al. Sep 2019 B2
10521229 Shu et al. Dec 2019 B2
10535381 Shu et al. Jan 2020 B2
10659058 Cheng et al. May 2020 B1
10673440 Camarota Jun 2020 B1
10770133 Haig et al. Sep 2020 B1
10777262 Haig et al. Sep 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 B1
10891076 Haig et al. Jan 2021 B1
20010052822 Kim et al. Dec 2001 A1
20020006072 Kunikiyo Jan 2002 A1
20020060938 Song May 2002 A1
20020136074 Hanzawa et al. 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
20040053510 Little 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 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 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 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
20070109030 Park May 2007 A1
20070115739 Huang May 2007 A1
20070139997 Suzuki Jun 2007 A1
20070171713 Hunter Jul 2007 A1
20070189101 Lambrache et al. Aug 2007 A1
20070229129 Nakagawa Oct 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 May 2008 A1
20080129402 Han et al. Jun 2008 A1
20080155362 Chang et al. Jun 2008 A1
20080175039 Thomas Jul 2008 A1
20080181029 Joshi et al. Jul 2008 A1
20080265957 Luong et al. Oct 2008 A1
20080273361 Dudeck et al. Nov 2008 A1
20090027947 Takeda Jan 2009 A1
20090089646 Hirose Apr 2009 A1
20090141566 Arsovski Jun 2009 A1
20090154257 Fujioka 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 Jul 2010 A1
20100177571 Shori et al. Jul 2010 A1
20100214815 Tam Aug 2010 A1
20100232202 Lu 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 et al. Sep 2011 A1
20110267914 Ishikura 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 May 2012 A1
20120153999 Kim Jun 2012 A1
20120242382 Tsuchiya et al. Sep 2012 A1
20120243347 Sampigethaya Sep 2012 A1
20120250440 Wu Oct 2012 A1
20120281459 Teman et al. Nov 2012 A1
20120327704 Chan Dec 2012 A1
20130039131 Haig et al. Feb 2013 A1
20130083591 Wuu Apr 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
20140269019 Kolar Sep 2014 A1
20150003148 Iyer et al. Jan 2015 A1
20150029782 Jung Jan 2015 A1
20150063052 Manning Mar 2015 A1
20150187763 Kim et al. Jul 2015 A1
20150213858 Tao Jul 2015 A1
20150248927 Fujiwara Sep 2015 A1
20150279453 Fujiwara Oct 2015 A1
20150302917 Grover Oct 2015 A1
20150310901 Jung Oct 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 Mar 2016 A1
20160141023 Jung May 2016 A1
20160225436 Wang Aug 2016 A1
20160225437 Kumar Aug 2016 A1
20160247559 Atallah et al. Aug 2016 A1
20160284392 Block et al. Sep 2016 A1
20160329092 Akerib Nov 2016 A1
20170194046 Yeung, Jr. et al. Jul 2017 A1
20170345505 Noel Nov 2017 A1
20180122456 Li May 2018 A1
20180123603 Chang May 2018 A1
20180157621 Shu et al. Jun 2018 A1
20180158517 Shu et al. Jun 2018 A1
20180158518 Shu et al. Jun 2018 A1
20180158520 Shu Jun 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
Foreign Referenced Citations (3)
Number Date Country
104752431 Jul 2015 CN
10133281 Jan 2002 DE
2005-346922 Dec 2005 JP
Non-Patent Literature Citations (9)
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 (Accepted: Feb. 11, 2013), 14 pages.
Accompanies a new application submitted herewith.
Is filed within three (3) months of the Filing Date or before the mailing date of a First Office Action on the merits; or.
After the period defined in (b) but before the mailing date of a Final Rejection or Notice of Allowance, or.
Is filed after the first Office Action and more than three months after the application's filed or PCT national stage date of entry filing but, as far as is known to the undersigned prior to the mailing date of either a final rejection or a notice of allowance, and is accompanied by either the fee set forth in 37 CFR § 1.17(p) or a certification as specified in 37 CFR § 1.97(e), as checked below or.
Is filed after the mailing date of either a final rejection or a notice of allowance, and the issue fee has not been paid, and is accompanied by the requisite petition fee set forth in 37 CFR § 1.17(p) and a certification as specified in 37 CFR § 1.97(e), as checked below.
Each item of information contained in the Information Disclosure Statement was first cited in a communication from a foreign patent office in a counterpart foreign application not more than three months prior to the filing date of the Information Disclosure Statement; or.
No item of information contained in the Information Disclosure Statement was cited in a communication from a foreign patent office in a counterpart foreign application, and, to the knowledge of the person signing this Statement after making reasonable inquiry, no item of information contained in the Information Disclosure Statement was known to any individual designated in § 1.56(c) more than three months prior to the filing of the Information Disclosure Statement.
Related Publications (1)
Number Date Country
20180158519 A1 Jun 2018 US
Provisional Applications (1)
Number Date Country
62430767 Dec 2016 US