Abstract:
PROBLEM TO BE SOLVED: To search a large quantity of search targets (contents) at high speed. SOLUTION: A little circuits (a distributor 12 and a controller 13 for search) are added inside the memory. For a search, the algorithm of a quick search, for example, is utilized, memory cells are repeatedly read, the read results are compared and a compare target is narrowed down on the basis of the compared (sized) result. Valid data can be obtained approximately for the middle bus time and cycle time in the conventional case of repeatedly reading the memory. Since comparison and the generation of the address of the next memory cell can be performed in the latter half of the cycle time, the search can be completed just for the bus time of 'the number of times of repeated read of memory cells' + 'one time'. As a result, a CAM function capable of having not several hundreds to several thousands of entry data like a conventional CAM but the number of entry data dividing the size of a DRAM with the number of banks, namely, several tens of thousands of or more entry data can be achieved. COPYRIGHT: (C)2003,JPO
Abstract:
PROBLEM TO BE SOLVED: To provide a memory cell capable of reducing a writing current, to provide a storage circuit block, and to provide a method for writing data. SOLUTION: Related to a memory cell 12, a second bit line 15 is provided at the position where a storage element 28 is clamped with a bit line 14. The second bit line 15 is at least parallel to the first bit line 14 near the storage element 28, while not contacting to the storage element 28. COPYRIGHT: (C)2003,JPO
Abstract:
PROBLEM TO BE SOLVED: To provide a storage circuit block in which a write-in current can be reduced, and to provide a method for accessing the storage circuit block. SOLUTION: This storage circuit block 10 comprises a means for holding data stored in a sense amplifier 24, a means holding data inputted to an input/ output pad 22, and a means for comparing data held in the means holding data stored in the sense amplifier 24 with data held in the means holding data inputted to the input/output pad 22. COPYRIGHT: (C)2003,JPO
Abstract:
PROBLEM TO BE SOLVED: To provide a storage circuit block in which a write-in current can be reduced, and to provide a method for accessing the storage circuit block. SOLUTION: This device comprises a means for detecting a data write-in current flowing in a bit line 32, and a means for generating a stop signal of a data write-in current flowing in the bit line 32 and a write-in word line 30.
Abstract:
PROBLEM TO BE SOLVED: To provide a memory cell, a storage circuit block, a data write method and data read method in which production yield is high, cost is low, reliability is high, and the chip area can be reduced by reducing the number of metal wiring layers. SOLUTION: A memory cell 12 is configured so as to include metal lines 16 intersecting with bit liens 14 in a no-contact manner therewith, and a second wiring structure 24 for connecting the lines 16 to switching elements 20. A write circuit 26 for making a current flow through the lines 16 and a ground 28 are connected to the lines 16 via a switch 30 for selecting the circuit 26 and the ground 28.
Abstract:
PROBLEM TO BE SOLVED: To perform seamless access by specifying a bank to be accessed, specifying an address of the data to be accessed in the bank to be accessed, changing the bank specified with a bank specification means in a prescribed order and changing the address specified with an address specification means in the range of the prescribed number of data. SOLUTION: Respective banks are connected to a bank register 32 through an. address register 42 and a decoder 26, and the data of the address specified by the address register 42 of the bank specified by the bank register 32 are outputted. The addresses of the data to be accessed for every bank are stored in the address register 42, and further an increment counter 44 is connected to the address register 42. The increment counter 44 rewrites the information of the address register 42 to the next address of the accessed data, when the access to the data shown by the address register 42 is executed.
Abstract:
PROBLEM TO BE SOLVED: To provide an MRAM having a sense amplifier in which hardly any sense current flows into an MTJ element and hardly any voltage is applied and a potential difference that appears on a bit line pair is amplified at a high speed. SOLUTION: A sense amplifier 18 comprises cyclically connected CMOS inverters 20 and 22; a P channel MOS transistor TP1 which shuts off power supply during standby and N channel MOS transistors TN5 and TN6 which are used to initialize the outputs of the sense amplifier during standby. A ground terminal 204 of the inverter 20 is connected to a bit line BLT through a transistor TN3 of a bit switch 4 and a ground terminal 224 of the inverter 22 is connected to a bit line BLC through a transistor TN4 of the bit switch 4. COPYRIGHT: (C)2005,JPO&NCIPI
Abstract:
PROBLEM TO BE SOLVED: To provide a communication controller in which total processing time is shortened by decreasing the number of hierarchies and the number of nodes for the number of prefixes for mask in a tree structure pertaining to search information being used for determining next forwarding destination route of a received packet from the destination address thereof, and to provide a communication control method, a communication control program and a data structure for communication control. SOLUTION: Search information is made to correspond with a tree structure. Each prefix for mask is made to correspond with at least one entry where each entry includes information of mask length of the corresponding prefix for mask and a sort key and is assigned to any one node in the tree structure according to the sorting order. Each node is linked to a different node in a lower hierarchy by a branch based on the entry thereof. An extracting means 26 extracts the destination address of a received packet, and a searching means 27 searches an entry having information of a prefix most matching the extracted address at an objective node 28 indicated by a search control means 29. After ending search of each node, a routing means 30 determines the forwarding destination route of the received packet based on the longest one of the most matching prefixes at all current search object nodes. COPYRIGHT: (C)2005,JPO&NCIPI
Abstract:
PROBLEM TO BE SOLVED: To much more efficiently achieve data registration in a data table and data retrieval from the data table. SOLUTION: Data registration in a data table (3) in which the first item data are registered with the corresponding second item data and data retrieval from the data table is executed by using a first pointer table (1) in which a pointer to a portion of registered data in the data table is registered at a storage position shown by a hash value obtained by applying a first hash function (6) to the first item data of the registered data and a second pointer table (2) in which the pointer is registered at a storage position shown by a hash value obtained by applying a second hash function (22) to the first item data of the registered data. COPYRIGHT: (C)2004,JPO&NCIPI
Abstract:
PROBLEM TO BE SOLVED: To provide a method for determining an optimum write bit line current and an optimum write word line current in an MRAM. SOLUTION: In an asteroid curve represented by a bit line magnetic field H x generated by a write bit line current I B and a word line magnetic field H y generated by a write word line current I W , manufacturing variations and a design margin are taken into consideration to assume an asteroid curve AC out outside all memory cell asteroid curves (located with a hatched area of Figure). The write bit line current and write word line current are selected so as to minimize write electric power consumed by a write current obtained by totalizing the write bit line current and the write word line current or a bit line and a write word line. In addition, a write bit line current and a write word line current are selected so as to form a synthetic magnetic field on a curve between a point H1 and a point H2 on the asteroid curve AC out in order to prevent multi-selection. COPYRIGHT: (C)2004,JPO