The disclosure relates generally to a computational memory element and in particular to a computational memory element having write data processing.
Memory cells have traditionally been used to store bits of data. It is also possible to architect a memory cell so that the memory cell is able to perform some simple logical functions when multiple memory cells are connected to the same read bit line. For example, when memory cells A, B, and C are connected to a particular read bit line and are read simultaneously, and the memory cells and read bit line circuitry are designed to produce a logical AND result, then the result that appears on the read bit line is AND(a,b,c) (i.e. “a AND b AND c”), where a, b, and c represent the binary data values stored in memory cells A, B, and C respectively.
By themselves, these computational memory cells and read bit line circuitry allow for a single logical function (e.g. AND) to be performed across multiple memory cells connected to the same read bit line, when read simultaneously. However, in many cases more complex logical functions across multiple memory cells connected to the same read bit line are desirable. To facilitate these more complex logical functions, it is desirable to be able to shift/write data between sections of the multiple memory cells and thus, it is desirable to provide additional circuity that facilitates the more complex logical functions and it is to this end that the disclosure is directed.
The disclosure is particularly applicable to a processing array, semiconductor memory or computer that utilizes a plurality of computational memory cells (with each cell being formed with a static random access memory (SRAM) cell) and additional write processing circuitry to provide more complex logical functions based on the data read out of the computational memory cells and it is in this context that the disclosure will be described. It will be appreciated, however, that each memory cell may be other types of volatile and non-volatile memory cell that are within the scope of the disclosure, that other additional write circuity (including more, less or different logic) may be used are within the scope of the disclosure or that different computational memory cell architectures that those disclosed below are within the scope of the disclosure.
The disclosure is directed to a memory/processing array that has a plurality of computing memory cells in an array with additional write processing circuitry. A column of computing memory cells in the array may each have a read bit line and the read bit line for each of the computing memory cells in the column may be tied together as a single read bit line. The memory/processing array may be subdivided into one or more sections (an example of which is shown in
Write circuitry is disclosed that may be used with the memory/processing array with the sections above since it is desirable to be able to shift data between adjacent bit lines in the same section (e.g. between bl-sect[x,y] and bl-sect[x,y+1]), and between the same relative bit lines in adjacent sections (e.g. between bl-sect[x,y] and bl-sect[x+1,y]). To facilitate this ability, the read data storage output in each bit line section (such as bl-sect[x,y]) is connected not only to that bl-sect's write circuitry, but also to the write circuitry associated with its horizontally and vertically adjacent neighbor bl-sects: for example, bl-sect[x,y−1], bl-sect[x,y+1], bl-sect[x−1,y], and bl-sect[x+1,y] for a bit line section in the middle of the array with bit line y in section x. Consequently, the write circuitry in each bl-sect[x,y] receives the read data storage outputs from 5 bl-sects—itself and its 4 neighbors, and during write operations a 5:1 mux is used to select one of those 5 read data storage outputs as the write data for that bit line section (“bl-sect”). It is also desirable to be able to invert the selected data (i.e. the 5:1 mux output) before it is stored in the bl-sect during a write operation. The write processing circuitry may have some simple logic along with a write data inversion control signal to facilitate the write data inversion.
The wordline (WL) generator and read/write logic control circuit 32 may also generate one or more control signals that control the read/write circuitry 34. For example, for the different embodiments of the read/write logic described in the co-pending U.S. patent application Ser. No. 16/111,178 filed on Aug. 23, 2018 and incorporated herein by reference, the one or more control signals may include a Read_Done control signal, an XORacc_En control signal, an ANDacc_En control signal and an ORacc_En control signal. Note that for each different embodiment, a different one or more of the control signals is used so that the wordline (WL) generator and read/write logic control circuit 32 may generate different control signals for each embodiment or the wordline (WL) generator and read/write logic control circuit 32 may generate each of the control signals, but then only certain of the control signals or all of the control signals may be utilized as described in the above incorporated by reference co-pending patent application.
During a read operation, the wordline (WL) generator and read/write logic control circuit 32 may activate one or more word lines that activate one or more computational memory cells so that the read bit lines of those one or more computational memory cells may be read out. Further details of the read operation are not provided here since the read operation is well known.
The circuit in
During reading, multiple cells (with only a single cell being shown in
As shown in
The write port of the cell in
The circuit in
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 one of (M31, M32) or (M36, M37) series transistors is 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. 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 it needs to be stored in 8 cells (with one cell being shown in
RBL=AND(XNOR(RE 1,D1),XNOR(RE 2,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
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 is
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 its RE 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 its RE, 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], . . . ,Key[7],D[7]) EQ11
If all Key[i] is equal to D[i] where i=0-7, then the search result RBL is match. Any one of Key[i] is not equal to D[i], then the search result is not match. Parallel search can be performed in 1 operation by arranging multiple data words along the same word line and on parallel bit lines with each word on 1 bit line. Further details of this computation memory cell may be found in U.S. patent application Ser. Nos. 15/709,399 and 15/709,401 both filed on Sep. 19, 2017 and entitled “Computational Dual Port Sram Cell And Processing Array Device Using The Dual Port Sram Cells For Xor And Xnor Computations”, which are incorporated herein by reference.
The read circuitry 50 may receive inputs from the read bit lines of the computing memory cells of the section (S[x]_RBL[y]) and the write circuitry 54 may receive an input from the read data storage 52 and output data to the word bit lines of the computing memory cells of the section (S[x]_WBL[y] and S[x]_WBLb[y] in the example in
Shifting Data Between Adjacent Bit Line Sections
It is desirable to be able to shift read data between adjacent bit line sections of a processing array. The ability to shift read data between adjacent bit line sections of the processing array allows the processing array to perform more complicated logic functions. For example, if it is desirable for the computational array to add two 16 bit vectors, the processing array may place 1 bit (the same relative bit) from each vector in a single bl-sect so that the entire vectors are spread over 16 bl-sects (say, the same relative bit line across multiple sections). One way to perform the addition in this case is to add the first least significant bits (LSBs) of the 2 vectors (say in bl-sect[0,0]) to generate a “sum” bit and a “carry” bit. The carry bit then needs to be shifted to the bl-sect that contains the next (2nd) 2 LSBs (say bl-sect[1,0]), so that those 2 LSBs plus the carry bit can then be added together to generate the next sum and carry bits. That next (2nd) carry bit then needs to be shifted to the bl-sect that contains the next (3rd) 2 LSBs (bl-sect[2,0]). Etc. So the shifting ability described here provides a mechanism to shift carry bits during an “add” computaion.
One way to provide a mechanism to shift data between adjacent bit lines in the same section, and between the same relative bit lines in adjacent sections, is to connect the read storage 52 output in each bl-sect[x,y] not only to that bl-sect's write logic 54, but also to the write logic 54 associated with its 4 horizontally and vertically adjacent neighbor bl-sects: bl-sect[x,y−1], bl-sect[x,y+1], bl-sect[x−1,y], and bl-sect[x+1,y]. Consequently, the write logic 54 for a particular bl-sect receives the read data storage 52 outputs from 5 bl-sects—itself plus its 4 horizontally and vertically adjacent neighbors.
Since each bl-sect has (up to) 5 read data storage outputs feeding its write logic as shown in
The net result of the 5 read data storage output connections to each bl-sect's write logic 54, and the circuitry to select one of the read data storage outputs (the multiplexer in one embodiment) within each bl-sect, is that each bl-sect can store the read data storage output data (as produced by one or more read operations) from any of the 5 bl-sects—itself plus its 4 neighbors as described, thereby providing a mechanism to shift data between horizontally and vertically adjacent bl-sects.
Note that the “k by n” exemplary array of bl-sects in
Each edge bl-sect along either edge of the processing array has three neighbor bl-sects. Each horizontal edge bl-sect (such as BL-Sect[k,1]) may have two neighbor adjacent bit line section (for example, BL-Sect[k,0] and BL-Sect[k,2] for BL-Sect[k,1]) having an adjacent single read bit line (bit line 0 and bit line 2 in section k for example) horizontally adjacent to the horizontal edge bit line section and a same relative bit line (for example, BL-Sect [k−1,1] for BL-Sect[k,1]) having the same relative read bit line as the read bit line of the horizontal edge bit line section (bit line 1 for both Section k and Section k−1) vertically adjacent to the horizontal edge bit line section. Each vertical edge bl-sect (such as BL-Sect[1,n]) may have one neighbor adjacent bit line section (for example, BL-Sect[1,n−1] for BL-Sect[1,n]) having an adjacent single read bit line (bit line n−1 in section 1 for example) horizontally adjacent to the vertical edge bit line section and two same relative bit line (for example, BL-Sect [0,n] and BL-Sect [2,n] for BL-Sect[1,n]) having the same relative read bit line as the read bit line of the vertical edge bit line section (bit line n for both Section 0, Section 1 and Section 2) vertically adjacent to the vertical edge bit line section.
Like each other bl-sect, the output of the read storage 52 (the read register) (S[x]_RBL[y]_Reg_Out) is output from the read/write circuitry 34 and also sent to the 4 neighboring bl-sects (except for bl-sects along an edge or at a corner) that may be Section[x−1], BL[y], Sect [x+1], BL[y], Sect [x], BL[y−1] and Sect [x], BL[y+1]. The read/write circuits 34 is a means for swapping/shifting data to adjacent bl-sects. In edge and corner bl-sects, the absent read data storage output connection(s) to their respective write multiplexers (corresponding to the particular neighbor bl-sect(s) that the edge and corner bl-sects lack) can simply be tied off, for example set to a logic “0” so that the same write circuitry 54 with the multiplexer 70 in
The S[x−1]_RBL[y] Reg_Out connection to bl_sect[0,y] Write Mux.
The S[x+1]_RBL[y] Reg_Out connection to bl sect[k,y] Write Mux.
The S[x]_RBL[y−1] Reg_Out connection to bl sect[x,0] Write Mux.
The S[x]_RBL[y+1] Reg_Out connection to bl sect[x,n] Write Mux.
Inverting Data Before It Is Stored in the BL-Sect
When the write data inversion control signal is low, the output of the XOR logic 80 is equal to the selected write data. When the write data inversion control signal is high, the output of the XOR logic 80 is equal to the inverted selected write data. In this embodiment, the output of the XOR logic is used as the write data source for the bl-sect during write operations.
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 performs 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 divisional of and claims priority under 35 USC 120 and 121 to U.S. patent application Ser. No. 16/111,183 filed Aug. 23, 2018 and entitled “Write Data Processing Circuits and Methods Associated with Computational Memory Cells” that in turn is a continuation in part of and claims priority under 35 USC 120 to U.S. patent application Ser. No. 15/709,399, filed Sep. 19, 2017 and entitled “Computational Dual Port Sram Cell And Processing Array Device Using The Dual Port Sram Cells For Xor And Xnor Computations”, U.S. patent application Ser. No. 15/709,401, filed Sep. 19, 2017 and entitled “Computational Dual Port Sram Cell And Processing Array Device Using The Dual Port Sram Cells For Xor And Xnor Computations”, U.S. patent application Ser. No. 15/709,379, filed Sep. 19, 2017 and entitled “Computational Dual Port Sram Cell And Processing Array Device Using The Dual Port Sram Cells”, U.S. patent application Ser. No. 15/709,382, filed Sep. 19, 2017 and entitled “Computational Dual Port Sram Cell And Processing Array Device Using The Dual Port Sram Cells”, and U.S. patent application Ser. No. 15/709,385, filed Sep. 19, 2017 and entitled “Computational Dual Port Sram Cell And Processing Array Device Using The Dual Port Sram Cells” that in turn claim priority under 35 USC 119(e) and 120 and claim the benefit of U.S. Provisional Patent Application 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” and U.S. Provisional Patent Application No. 62/430,762, filed Dec. 6, 2016 and entitled “Computational Dual Port Sram Cell And Processing Array Device Using The Dual Port Sram Cells”, the entirety of all 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 |
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 et al. | 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 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 |
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 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 |
9396795 | Jeloka 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 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 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 | Chuang 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 |
10249312 | Kim et al. | Apr 2019 | B2 |
10249362 | Shu et al. | Apr 2019 | B2 |
10388364 | Ishizu et al. | Aug 2019 | B2 |
10425070 | Chen et al. | Sep 2019 | B2 |
10521229 | Shu | Dec 2019 | B2 |
10535381 | Shu et al. | Jan 2020 | B2 |
10659058 | Cheng et al. | May 2020 | B1 |
10673440 | Camarota | Jun 2020 | B1 |
10720205 | Huang et al. | Jul 2020 | B2 |
10725777 | Shu et al. | Jul 2020 | B2 |
10770133 | Haig et al. | Sep 2020 | B1 |
10777262 | Haig | Sep 2020 | B1 |
10847212 | Haig et al. | Nov 2020 | B1 |
10847213 | Haig | Nov 2020 | B1 |
10854284 | Chuang et al. | Dec 2020 | B1 |
10860320 | Haig | Dec 2020 | B1 |
10877731 | Shu | Dec 2020 | B1 |
10891076 | Haig et al. | Jan 2021 | B1 |
10930341 | Shu | Feb 2021 | B1 |
10943648 | Shu et al. | Mar 2021 | B1 |
10958272 | Shu | Mar 2021 | B2 |
10998040 | Shu | May 2021 | B2 |
11094374 | Haig et al. | Aug 2021 | B1 |
20010052822 | Kim et al. | Dec 2001 | A1 |
20020006072 | Kunikiyo | Jan 2002 | A1 |
20020060938 | Song et al. | 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 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 |
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 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 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 |
20080273361 | Dudeck et al. | Nov 2008 | A1 |
20090027947 | Takeda | Jan 2009 | A1 |
20090089646 | Hirose et al. | Apr 2009 | A1 |
20090103390 | Kim | 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 et al. | 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 |
20120212996 | Rao et al. | Aug 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 |
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 et al. | Sep 2014 | A1 |
20150003148 | Iyer et al. | 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 |
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 |
20160141023 | Jung et al. | May 2016 | A1 |
20160225436 | Wang et al. | Aug 2016 | A1 |
20160225437 | Kumar et al. | Aug 2016 | A1 |
20160247559 | Atallah et al. | Aug 2016 | A1 |
20160254045 | Mazumder et al. | Sep 2016 | A1 |
20160284392 | Block et al. | Sep 2016 | A1 |
20160329092 | Akerib | Nov 2016 | A1 |
20170194046 | Yeung, Jr. et al. | Jul 2017 | A1 |
20170345505 | Noel et al. | Nov 2017 | A1 |
20180122456 | Li et al. | 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 |
20180158519 | Shu et al. | Jun 2018 | A1 |
20180158520 | Shu et al. | 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 |
20210027815 | Shu et al. | Jan 2021 | A1 |
Number | Date | Country |
---|---|---|
104752431 | Jan 2019 | CN |
10133281 | Jan 2002 | DE |
2005346922 | Dec 2005 | JP |
201812770 | Apr 2018 | TW |
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. Sep. 22, 2013, Department of Electronics Engineering and Institute of Electronics, National Chiao-Tung University, Hsinchu 300, Taiwan (Accepted: Feb. 11, 2013), 14 pages. |
Takahiko et al., “A Ratio-Less 10-Transistor Cell and Static Column Retention Loop Structure for Fully Digital SRAM Design”, Journal: 2012 4th IEEE International Memory Workshop: 2012, ISBN: 9781467310796 (5 pages). |
Number | Date | Country | |
---|---|---|---|
20210027834 A1 | Jan 2021 | US |
Number | Date | Country | |
---|---|---|---|
62430767 | Dec 2016 | US | |
62430767 | Dec 2016 | US | |
62430762 | Dec 2016 | US | |
62430762 | Dec 2016 | US | |
62430762 | Dec 2016 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 16111183 | Aug 2018 | US |
Child | 17067439 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 15709399 | Sep 2017 | US |
Child | 16111183 | US | |
Parent | 17067439 | US | |
Child | 16111183 | US | |
Parent | 15709401 | Sep 2017 | US |
Child | 17067439 | US | |
Parent | 17067439 | US | |
Child | 17067439 | US | |
Parent | 15709379 | Sep 2017 | US |
Child | 17067439 | US | |
Parent | 17067439 | US | |
Child | 17067439 | US | |
Parent | 15709382 | Sep 2017 | US |
Child | 17067439 | US | |
Parent | 17067439 | US | |
Child | 17067439 | US | |
Parent | 15709385 | Sep 2017 | US |
Child | 17067439 | US |