WO2009003115A1 - Concurrent multiple-dimension word-addressable memory architecture - Google Patents
Concurrent multiple-dimension word-addressable memory architecture Download PDFInfo
- Publication number
- WO2009003115A1 WO2009003115A1 PCT/US2008/068388 US2008068388W WO2009003115A1 WO 2009003115 A1 WO2009003115 A1 WO 2009003115A1 US 2008068388 W US2008068388 W US 2008068388W WO 2009003115 A1 WO2009003115 A1 WO 2009003115A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- memory
- bit
- dimension
- addressable
- bitwidth
- Prior art date
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F12/00—Accessing, addressing or allocating within memory systems or architectures
- G06F12/02—Addressing or allocation; Relocation
- G06F12/0207—Addressing or allocation; Relocation with multidimensional access, e.g. row/column, matrix
-
- G—PHYSICS
- G11—INFORMATION STORAGE
- G11C—STATIC STORES
- G11C8/00—Arrangements for selecting an address in a digital store
- G11C8/10—Decoders
-
- G—PHYSICS
- G11—INFORMATION STORAGE
- G11C—STATIC STORES
- G11C8/00—Arrangements for selecting an address in a digital store
- G11C8/16—Multiple access memory array, e.g. addressing one storage element via at least two independent addressing line groups
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/27—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes using interleaving techniques
- H03M13/2703—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes using interleaving techniques the interleaver involving at least two directions
- H03M13/2707—Simple row-column interleaver, i.e. pure block interleaving
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/27—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes using interleaving techniques
- H03M13/276—Interleaving address generation
- H03M13/2764—Circuits therefore
Definitions
- Embodiments of the invention are related to memory architecture. More particularly embodiments of the invention are related to memory architecture optimized for random matrix process capability.
- RAM Random access memory
- ASICs application specific integrated circuits
- SoC system-on-chip
- CMOS complementary metal-oxide-semiconductor
- CAM Content Addressable Memory
- Fig. IA a simple memory containing four words addressable linearly (i.e., one dimension only) either 0, 1, 2 or 3 is illustrated in Fig. IA.
- the memory access via conventional integrated circuit memory architectures is limited to either read or write the selected (addressed) 4- bit word 110, as illustrated. If an application requires that bit 2 of the word 0, 1, 2 and 3 are read / written (e.g., 120 in Fig. IB), four memory access cycles will be required.
- Exemplary embodiments of the invention are directed to memory architecture optimized for random matrix operations.
- an embodiment of the invention can include an N-dimension addressable memory comprising: an N-dimension array of bit cells; and logic configured to address each bit cell using N-Dimension Addressing, wherein N is at least two and wherein the array of bit cells is addressable by N orthogonal address spaces.
- Another embodiment of the invention can include a bit cell of an N orthogonal dimension addressable memory comprising: a bit storage element; N word lines; and N bit lines, wherein N is at least two.
- Another embodiment of the invention can include a method of accessing memory comprising: establishing a first set of addressable words from an N-dimension array of bit cells; and establishing a second set of addressable words from the N- dimension array of bit cells, wherein N is at least two and the first and the second set address spaces are orthogonal.
- Fig. IA is a block diagram of an array of memory which illustrates a conventional addressing operation.
- Fig. IB is a block diagram of an array of memory which illustrates desired bits to be read.
- Fig. 2 is a block diagram of a memory architecture for a generalized N-
- Fig. 3 is a circuit diagram of an N-Dimension Addressing (NDA) Static Random
- FIGs. 4A and 4B illustrate addressing a 2-Dimension Word Addressable (DWA) memory.
- DWA 2-Dimension Word Addressable
- Fig. 5 illustrates a 4x4 2-Dimension Word Addressable (DWA) memory.
- DWA 2-Dimension Word Addressable
- Fig. 6 illustrates a 2-Dimension Word Addressable (DWA) MxNx2 memory in an MxN matrix ping-pong buffer configuration.
- DWA 2-Dimension Word Addressable
- Fig. 2 illustrates a block diagram of a generalized N orthogonal dimension word- addressable memory 200 according to at least one embodiment of the invention.
- N is an integer larger than or equal to 2.
- An N orthogonal dimension word- addressable memory contains an array of memory bit cells each of which can be addressable by N orthogonal addressing spaces or an N-Dimension Addressing (NDA) scheme.
- NDA N-Dimension Addressing
- Each of the N dimensions has a data word input port (e.g., 212), a data word address port (e.g., 214), and an access control line (e.g., 216).
- Each of the N dimensions also has a corresponding data word output port (e.g., 222).
- the functionality of input port 212 and output port 222 can be combined in a common input / output port that can be used for both data input and data output.
- an embodiment of the invention can include an N-dimension addressable memory 200 having an N-dimension array of bit cells 210 and logic configured (e.g., decoders 1- N) to address each bit cell using N-Dimension Addressing (NDA), where N is at least two.
- NDA N-Dimension Addressing
- the array of bit cells 210 is addressable by N orthogonal addressing spaces, as discussed above.
- the logic configured to address each bit cell can comprise N address decoders (e.g., 242). Each address decoder can be configured to receive a data word address 214, and a dimension access control signal 216.
- word select multiplexer (e.g., 252) can be included for each N-dimension, which can work in cooperation with a corresponding address decoder (e.g., 242) to achieve the random matrix addressing for random matrix read / write operations.
- the memory can include logic configured to read/write data for each N-dimension such as sense amplifiers, line drivers and the like that may also be included depending on the specific memory type.
- Fig. 3 illustrates an NDA SRAM-based bit cell implementation according to at least one embodiment of the invention.
- the NDA SRAM bit cell illustrated in Fig. 3 can be arranged similar to a conventional SRAM bit cell to form a compact N- Dimension Word Addressable (N-DWA) SRAM.
- N-DWA N- Dimension Word Addressable
- a 2-dimensional array in an exemplary embodiment of the invention can occupy the equivalent area of a conventional 2-port static random access memory (SRAM).
- SRAM 2-port static random access memory
- embodiments of the invention are not limited to any particular arrangement.
- an embodiment of the invention can include a bit cell 300 of an N orthogonal dimension addressable memory.
- the bit cell can include a bit storage element 310, N word lines 320, and N bit lines 330, where N is at least two.
- the bit cell can be part of a static random access memory (SRAM), as discussed above.
- SRAM static random access memory
- each of the bit lines can include a first line (e.g., 334) coupled to the storage element 310 and a second line (e.g., 332) coupled to the storage element, wherein a bit value is determined by a differential voltage between the first 334 and second 332 lines when word dl is selected, as is well known in the art.
- each of the N word lines 320 are coupled to a device (e.g., transistors 322 and 324) configured to couple a corresponding bit line (332 and 334) from the N bit lines to the storage element 310, if the word line is activated.
- a device e.g., transistors 322 and 324 configured to couple a corresponding bit line (332 and 334) from the N bit lines to the storage element 310, if the word line is activated.
- any of the N bit lines can be selected and the value of the storage element can be read or written using that bit line. Since the bitcell operational details are not needed for an understanding of embodiments of the invention and are well known in the art, a detailed discussion will not be provided herein.
- the N-Dimension Word Addressable (N-DWA) memory can have N concurrent memory access channels each of which comprises a data word input port Din(i), a data word address port Addr(i), a data word output port Dout(i), and a control port Ctrl(i), where i designates one of the N orthogonal addressing space.
- the bitwidth of either Din(i) or Dout(i) defines the number of bits per word, i.e., the number of target NDA bit cells addressed (selected) each time by the word address Addr(i).
- Ctrl(i) provides one or more control signals for selecting one of the supported access operations such as a word read operation or a word write operation.
- NDA N-Dimension Addressing
- embodiments of the invention can include an N-DWA memory structure that is configured for the target matrix-oriented application as following in Table 1.
- a 2-DWA memory can be used as described in the following in Table 2.
- Figs. 4A and 4B illustrate an addressing scheme for a 2-Dimension Word
- Addressable (DWA) memory in accordance with at least one embodiment of the invention.
- Address (1) (Addr (I)) is used to address sixteen 2-bit words. Each of the 2-bit words (e.g., 0-15) represents a 2-element row of a target matrix data.
- Address (2) (Addr (2)) is used to address eight 4-bit words (e.g., 0-7). Each of the 4-bit words represents a 4-element column of a target matrix data.
- Addr (1) memory is illustrated for Addr (1).
- the memory can be addressed by Addr (1) which comprises sixteen 2-bit words each of which represents a 2-element row of target matrix data as illustrated.
- memory matrix 1 includes words 0-3; matrix 2, includes words 4-7; matrix 3, includes words 8-11; and matrix 4 includes words 12-15. Accordingly, if two bits in the second row of matrix 4 are to be read / written, Addr (1) can be set to the value 13 and a single read / write operation can be performed and a 2-bit word can be outputted / stored.
- Addr (2) memory is illustrated for Addr (2).
- the memory can be addressed by Addr (2) which comprises eight 4-bit words (0-7) each of which represents a 4-element column of target matrix data.
- memory matrix 1 includes words 0- 1; matrix 2, includes words 2-3; matrix 3, includes words 4-5; and matrix 4 includes words 7-8.
- Addr (2) can be set to the value 1 and a single read / write operation can be performed. For exampled for a read operation, a 4-bit output of the column data in matrix 1, column 1 can then be obtained in a single operation.
- 4-bit data can be stored to matrix 1 , column 1 in a single operation.
- a 2-Dimension Word Addressable memory configured as indicated in Table 3 and illustrated in Fig. 5 can be created to offer concurrent and single-cycle 4- bit row and column word accesses of the target 4x4 matrix data.
- the matrix is similar to the one illustrated in Figs. IA and IB.
- an N-DWA memory can be used for block interleaving and de-interleaving which are typical tasks performed in digital communication systems, such as Code Division Multiple Access (CDMA), CDMA2000, and WCDMA systems.
- a block interleaver can accept the coded symbols in blocks by filling the columns of an M-row-by-N-column (MxN) array. Then, the interleaved symbols can be fed to a modulator one row at a time.
- MxN M-row-by-N-column
- the block de -interleaver on the other hand performs the inverse operation.
- Block interleaving and de-interleaving are well known in the art, so further details will not be provided herein (see, e.g., Bernard Sklar, Digital Communications Fundamentals and Applications, second edition, page 464).
- DWA memory configured for an MxN (e.g., 4x6) matrix operation can be used to implement a block interleaving or de-interleaving hardware design without extra logic.
- MxN e.g., 4x6
- 2-DWA memory with storage for 2 MxN matrixes, as shown in the right column of Table 4 and as illustrated in Fig. 6, can be used to form a ping-pong buffer 600.
- the 2-DWA MxNx2 memory can function as an MxN matrix ping-pong buffer configuration 600 for block interleaving or de -interleaving to achieve high- performance one symbol per memory cycle throughput. An example of this configuration is illustrated in Fig. 6.
- the interleaver input sequence can directly fill the ping buffer 610 in a column by column manner with an input sequence (e.g., (0, 1, 2, 3) (4, 5, 6, 7) ).
- the interleaved output sequence e.g., (0, 4, 8, 12, 16, 20) (1, 5, 9, 13, 17, 21) Certainly can be directly retrieved on a row by row basis from the pong buffer 620. Accordingly, an interleaved output sequence can be generated without any additional logic.
- the interleaving can also be determined based on the configuration of the memory array (e.g., MxN).
- the de-interleaving operation can be achieved by a similar configuration which is the reciprocal of the interleaving operation.
- the interleaved output sequence e.g., (0, 4, 8, 12, 16, 20) (1, 5, 9, 13, 17, 21)
- the interleaved output sequence can be directly de- interleaved by reading the data out column by column (e.g., (0, 1, 2, 3) (4, 5, 6, 7) ...) to recover the original input sequence.
- the de-interleaving function can also be achieved directly from the memory without any additional logic.
- embodiments of the invention are not limited to those applications.
- objects may be defined as an array in memory and motion may be simulated by moving the object a certain number of columns or rows in the array.
- Embodiments of the invention allow for flexible addressing of memory arrays so that object movement and processing can be improved. Accordingly, embodiments of the invention are not limited to the examples and illustrations contained herein.
- an embodiment can include a method of accessing memory comprising establishing a first set of addressable words from an N-dimension array of bit cells and establishing a second set of addressable words from the N-dimension array of bit cells.
- N is at least two and the first set of addressable words and the second set of addressable words are orthogonal.
- the method can further include determining a bitwidth(i) for each set of addressable words as a number of elements per vector per dimension (e.g., 2 and 4 for Figs. 4A and 4B, respectively).
- the first set of addressable words has a different bitwidth than the second set of addressable words.
- the first set of addressable words may also have the same bitwidth as the second set of addressable words (see, e.g. Fig. 5) while still being orthogonal.
- Embodiments can further include writing an input sequence to the first set of addressable words and reading an output sequence from the second set of addressable words, which can result in an interleaved output. Still further, the input sequence can be written to a first buffer (e.g., a ping buffer) and output sequence can be read out of a second buffer (e.g., a pong buffer).
- a first buffer e.g., a ping buffer
- output sequence can be read out of a second buffer (e.g., a pong buffer).
Abstract
Description
Claims
Priority Applications (5)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
KR1020107001695A KR101114695B1 (en) | 2007-06-25 | 2008-06-26 | Concurrent multiple-dimension word-addressable memory architecture |
EP08772064.5A EP2165334B1 (en) | 2007-06-25 | 2008-06-26 | Concurrent multiple-dimension word-addressable memory architecture |
CN200880022161.3A CN101689396B (en) | 2007-06-25 | 2008-06-26 | Concurrent multiple-dimension word-addressable |
EP12168085.4A EP2523352B1 (en) | 2007-06-25 | 2008-06-26 | Block interleaver |
JP2010515129A JP2010537351A (en) | 2007-06-25 | 2008-06-26 | Parallel multidimensional word addressable memory architecture |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US11/767,639 US8120989B2 (en) | 2007-06-25 | 2007-06-25 | Concurrent multiple-dimension word-addressable memory architecture |
US11/767,639 | 2007-06-25 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2009003115A1 true WO2009003115A1 (en) | 2008-12-31 |
Family
ID=39796859
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/US2008/068388 WO2009003115A1 (en) | 2007-06-25 | 2008-06-26 | Concurrent multiple-dimension word-addressable memory architecture |
Country Status (7)
Country | Link |
---|---|
US (2) | US8120989B2 (en) |
EP (2) | EP2523352B1 (en) |
JP (1) | JP2010537351A (en) |
KR (1) | KR101114695B1 (en) |
CN (2) | CN106294196B (en) |
TW (1) | TW200910375A (en) |
WO (1) | WO2009003115A1 (en) |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20170329702A1 (en) * | 2014-11-05 | 2017-11-16 | Renesas Electronics Europe Gmbh | Memory access unit |
KR102504906B1 (en) | 2022-04-20 | 2023-03-02 | 주식회사 덴탈스튜디오 | Drill for elevation a mucous membrane of maxillary sinus |
Families Citing this family (12)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20060190517A1 (en) * | 2005-02-02 | 2006-08-24 | Guerrero Miguel A | Techniques for transposition of a matrix arranged in a memory as multiple items per word |
US8120989B2 (en) * | 2007-06-25 | 2012-02-21 | Qualcomm Incorporated | Concurrent multiple-dimension word-addressable memory architecture |
US20110157194A1 (en) * | 2009-12-31 | 2011-06-30 | Omri Eisenbach | System, data structure, and method for processing multi-dimensional video data |
WO2012059121A1 (en) | 2010-11-01 | 2012-05-10 | Telefonaktiebolaget L M Ericsson (Publ) | Memory arrangement for accessing matrices |
US9361973B2 (en) | 2013-10-28 | 2016-06-07 | Cypress Semiconductor Corporation | Multi-channel, multi-bank memory with wide data input/output |
US9083340B1 (en) * | 2014-05-15 | 2015-07-14 | Xilinx, Inc. | Memory matrix |
KR101558172B1 (en) * | 2014-10-14 | 2015-10-08 | 숭실대학교산학협력단 | The method and device for interleaving for error distribution and the recording medium for performing the method |
KR102485210B1 (en) | 2016-08-18 | 2023-01-06 | 에스케이하이닉스 주식회사 | Semiconductor Memory Apparatus |
US9922696B1 (en) | 2016-10-28 | 2018-03-20 | Samsung Electronics Co., Ltd. | Circuits and micro-architecture for a DRAM-based processing unit |
US10817493B2 (en) | 2017-07-07 | 2020-10-27 | Raytheon Company | Data interpolation |
CN112216323A (en) | 2017-09-04 | 2021-01-12 | 华为技术有限公司 | Memory cell and static random access memory |
CN113205846A (en) * | 2021-05-13 | 2021-08-03 | 上海科技大学 | SRAM cell suitable for high speed content addressing and memory Boolean logic computation |
Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5099452A (en) * | 1988-06-27 | 1992-03-24 | Nec Corporation | Semiconductor memory including reduced capacitive coupling between adjacent bit lines |
US5717638A (en) * | 1996-11-18 | 1998-02-10 | Samsung Electronics Co., Ltd. | Multi-port memory cells and memory with parallel data initialization |
US6385122B1 (en) * | 2001-01-31 | 2002-05-07 | Virage Logic Corp. | Row and column accessible memory with a built-in multiplex |
US20020083292A1 (en) * | 2000-11-22 | 2002-06-27 | Seiko Epson Corporation | Method of using memory, two dimensional data access memory and operation processing apparatus |
Family Cites Families (37)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4616347A (en) | 1983-05-31 | 1986-10-07 | International Business Machines Corporation | Multi-port system |
US4745582A (en) * | 1984-10-19 | 1988-05-17 | Fujitsu Limited | Bipolar-transistor type random access memory device having redundancy configuration |
US4845668A (en) * | 1987-12-10 | 1989-07-04 | Raytheon Company | Variable field content addressable memory |
US5121354A (en) * | 1990-03-12 | 1992-06-09 | International Business Machines Corp. | Random access memory with access on bit boundaries |
US5245583A (en) * | 1991-04-02 | 1993-09-14 | Vitelic Corporation | Integrated circuit memory with decoded address sustain circuitry for multiplexed address architecture and method |
US5365480A (en) * | 1992-05-28 | 1994-11-15 | Nec Corporation | Memory cells and a memory apparatus using them |
JPH08171799A (en) | 1994-12-16 | 1996-07-02 | Sanyo Electric Co Ltd | Semiconductor memory device |
US5692147A (en) * | 1995-06-07 | 1997-11-25 | International Business Machines Corporation | Memory mapping method and apparatus to fold sparsely populated structures into densely populated memory columns or rows by selectively transposing X and Y address portions, and programmable gate array applications thereof |
US5768196A (en) * | 1996-03-01 | 1998-06-16 | Cypress Semiconductor Corp. | Shift-register based row select circuit with redundancy for a FIFO memory |
US5968190A (en) * | 1996-10-31 | 1999-10-19 | Cypress Semiconductor Corp. | Redundancy method and circuit for self-repairing memory arrays |
US5812469A (en) * | 1996-12-31 | 1998-09-22 | Logic Vision, Inc. | Method and apparatus for testing multi-port memory |
US5828597A (en) * | 1997-04-02 | 1998-10-27 | Texas Instruments Incorporated | Low voltage, low power static random access memory cell |
JPH11145420A (en) * | 1997-11-07 | 1999-05-28 | Mitsubishi Electric Corp | Semiconductor storage device |
US5940332A (en) * | 1997-11-13 | 1999-08-17 | Stmicroelectronics, Inc. | Programmed memory with improved speed and power consumption |
US6629190B2 (en) * | 1998-03-05 | 2003-09-30 | Intel Corporation | Non-redundant nonvolatile memory and method for sequentially accessing the nonvolatile memory using shift registers to selectively bypass individual word lines |
US6005793A (en) * | 1998-03-31 | 1999-12-21 | Tran; Thang Minh | Multiple-bit random-access memory array |
US6430666B1 (en) * | 1998-08-24 | 2002-08-06 | Motorola, Inc. | Linked list memory and method therefor |
CA2298919C (en) * | 1999-02-19 | 2006-04-18 | Ntt Mobile Communications Network Inc. | Interleaving and turbo encoding using prime number permutations |
JP2000244335A (en) * | 1999-02-19 | 2000-09-08 | Fujitsu Ltd | Bit interleave circuit and bit de-interleave circuit |
US6523145B1 (en) * | 1999-11-08 | 2003-02-18 | International Business Machines Corporation | Method and apparatus for testing a contents-addressable-memory-type structure using a simultaneous write-thru mode |
US6198681B1 (en) * | 2000-02-28 | 2001-03-06 | Micron | Sense amplifier for low voltage memory arrays |
US6931580B1 (en) * | 2000-03-13 | 2005-08-16 | International Business Machines Corporation | Rapid fail analysis of embedded objects |
US6418044B1 (en) * | 2000-12-28 | 2002-07-09 | Stmicroelectronics, Inc. | Method and circuit for determining sense amplifier sensitivity |
US6678198B2 (en) * | 2001-03-16 | 2004-01-13 | Broadcom Corporation | Pseudo differential sensing method and apparatus for DRAM cell |
JP2004234809A (en) * | 2003-02-03 | 2004-08-19 | Ricoh Co Ltd | Semiconductor memory |
US6980462B1 (en) * | 2003-11-18 | 2005-12-27 | Lsi Logic Corporation | Memory cell architecture for reduced routing congestion |
US7126837B1 (en) * | 2004-03-26 | 2006-10-24 | Netlogic Microsystems, Inc. | Interlocking memory/logic cell layout and method of manufacture |
JP4731152B2 (en) * | 2004-10-29 | 2011-07-20 | ルネサスエレクトロニクス株式会社 | Semiconductor memory device |
US7403426B2 (en) * | 2005-05-25 | 2008-07-22 | Intel Corporation | Memory with dynamically adjustable supply |
US7483332B2 (en) * | 2005-08-11 | 2009-01-27 | Texas Instruments Incorporated | SRAM cell using separate read and write circuitry |
JP2007200963A (en) * | 2006-01-24 | 2007-08-09 | Hitachi Ltd | Semiconductor storage device |
US7424691B2 (en) * | 2006-04-11 | 2008-09-09 | International Business Machines Corporation | Method for verifying performance of an array by simulating operation of edge cells in a full array model |
JP2007305227A (en) | 2006-05-11 | 2007-11-22 | Sony Corp | Storage device and data conversion method |
US7471544B2 (en) * | 2006-05-31 | 2008-12-30 | Kabushiki Kaisha Toshiba | Method and apparatus for avoiding cell data destruction caused by SRAM cell instability |
US8046660B2 (en) * | 2006-08-07 | 2011-10-25 | Marvell World Trade Ltd. | System and method for correcting errors in non-volatile memory using product codes |
JP4191217B2 (en) * | 2006-09-20 | 2008-12-03 | エルピーダメモリ株式会社 | Semiconductor device |
US8120989B2 (en) * | 2007-06-25 | 2012-02-21 | Qualcomm Incorporated | Concurrent multiple-dimension word-addressable memory architecture |
-
2007
- 2007-06-25 US US11/767,639 patent/US8120989B2/en active Active
-
2008
- 2008-06-25 TW TW097123750A patent/TW200910375A/en unknown
- 2008-06-26 EP EP12168085.4A patent/EP2523352B1/en not_active Not-in-force
- 2008-06-26 WO PCT/US2008/068388 patent/WO2009003115A1/en active Application Filing
- 2008-06-26 CN CN201610627204.7A patent/CN106294196B/en active Active
- 2008-06-26 EP EP08772064.5A patent/EP2165334B1/en active Active
- 2008-06-26 CN CN200880022161.3A patent/CN101689396B/en active Active
- 2008-06-26 KR KR1020107001695A patent/KR101114695B1/en active IP Right Grant
- 2008-06-26 JP JP2010515129A patent/JP2010537351A/en not_active Withdrawn
-
2012
- 2012-02-08 US US13/368,752 patent/US8773944B2/en active Active
Patent Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5099452A (en) * | 1988-06-27 | 1992-03-24 | Nec Corporation | Semiconductor memory including reduced capacitive coupling between adjacent bit lines |
US5717638A (en) * | 1996-11-18 | 1998-02-10 | Samsung Electronics Co., Ltd. | Multi-port memory cells and memory with parallel data initialization |
US20020083292A1 (en) * | 2000-11-22 | 2002-06-27 | Seiko Epson Corporation | Method of using memory, two dimensional data access memory and operation processing apparatus |
US6385122B1 (en) * | 2001-01-31 | 2002-05-07 | Virage Logic Corp. | Row and column accessible memory with a built-in multiplex |
Cited By (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20170329702A1 (en) * | 2014-11-05 | 2017-11-16 | Renesas Electronics Europe Gmbh | Memory access unit |
US10592406B2 (en) * | 2014-11-05 | 2020-03-17 | Renesas Electronics Europe Gmbh | Memory access unit and method including generating memory selects to concurrently access a plurality of memories in a multi-dimensional array |
KR102504906B1 (en) | 2022-04-20 | 2023-03-02 | 주식회사 덴탈스튜디오 | Drill for elevation a mucous membrane of maxillary sinus |
Also Published As
Publication number | Publication date |
---|---|
US20120134229A1 (en) | 2012-05-31 |
EP2165334A1 (en) | 2010-03-24 |
CN101689396B (en) | 2016-08-31 |
EP2523352A1 (en) | 2012-11-14 |
KR101114695B1 (en) | 2012-04-17 |
CN106294196A (en) | 2017-01-04 |
US8120989B2 (en) | 2012-02-21 |
EP2523352B1 (en) | 2018-10-10 |
JP2010537351A (en) | 2010-12-02 |
CN106294196B (en) | 2019-09-27 |
TW200910375A (en) | 2009-03-01 |
EP2165334B1 (en) | 2014-04-23 |
US20080316835A1 (en) | 2008-12-25 |
KR20100101558A (en) | 2010-09-17 |
US8773944B2 (en) | 2014-07-08 |
CN101689396A (en) | 2010-03-31 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US8773944B2 (en) | Concurrent multiple-dimension word-addressable memory architecture | |
US6532556B1 (en) | Data management for multi-bit-per-cell memories | |
US20110264723A1 (en) | System and method for successive matrix transposes | |
EP1175679A1 (en) | Data balancing scheme in solid state storage devices | |
US8724423B1 (en) | Synchronous two-port read, two-port write memory emulator | |
JP5379164B2 (en) | NAND flash memory access with relaxed timing constraints | |
WO2004063906A2 (en) | Coded write masking | |
US7426675B2 (en) | Dynamic random access memory having at least two buffer registers and method for controlling such a memory | |
CN1762027A (en) | Two-dimensional data memory | |
US7451267B1 (en) | Method and apparatus for learn and related operations in network search engine | |
KR930007185B1 (en) | Register bank circuit | |
US8139428B2 (en) | Method for reading and writing a block interleaver and the reading circuit thereof | |
JP2013152778A (en) | Concurrent multiple-dimension word-addressable memory architecture | |
JP5859605B2 (en) | Parallel multidimensional word addressable memory architecture | |
US9715343B2 (en) | Multidimensional partitioned storage array and method utilizing input shifters to allow multiple entire columns or rows to be accessed in a single clock cycle | |
US9442661B2 (en) | Multidimensional storage array and method utilizing an input shifter to allow an entire column or row to be accessed in a single clock cycle | |
KR100414067B1 (en) | Interleave memory control apparatus and method | |
CN112735493B (en) | Static random access memory system and data read-write method thereof | |
JP2950427B2 (en) | Register bank circuit | |
US7457937B1 (en) | Method and system for implementing low overhead memory access in transpose operations | |
US7707363B2 (en) | Multi-port memory architecture for storing multi-dimensional arrays II | |
US20060050678A1 (en) | Block de-interleaving system | |
US20040267968A1 (en) | Implementation of a column interleaving function with a limited amount of columns | |
KR100925429B1 (en) | Turbo coder | |
Wellig et al. | Energy-and area-efficient deinterleaving architecture for high-throughput wireless applications |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
WWE | Wipo information: entry into national phase |
Ref document number: 200880022161.3 Country of ref document: CN |
|
121 | Ep: the epo has been informed by wipo that ep was designated in this application |
Ref document number: 08772064 Country of ref document: EP Kind code of ref document: A1 |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2010515129 Country of ref document: JP |
|
NENP | Non-entry into the national phase |
Ref country code: DE |
|
WWE | Wipo information: entry into national phase |
Ref document number: 112/MUMNP/2010 Country of ref document: IN |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2008772064 Country of ref document: EP |
|
ENP | Entry into the national phase |
Ref document number: 20107001695 Country of ref document: KR Kind code of ref document: A |