Patents Assigned to Mosaid Technologies, Inc.
  • Patent number: 6539369
    Abstract: We present a lookup table which allows sparse subtree descriptors and dense subtree descriptors to be stored in the same memory. A subtree entry in the memory stores a dense subtree descriptor for a dense subtree or a plurality of sparse subtree descriptors for sparse subtrees. The subtree entry is indexed by a leaf in the previous subtree. The sparse subtree descriptor stores at least one node descriptor. The node descriptor describes a set of leaves in the sparse subtree having a common value. The common value is encoded in the node descriptor using run length encoding.
    Type: Grant
    Filed: December 8, 2000
    Date of Patent: March 25, 2003
    Assignee: Mosaid Technologies, Inc.
    Inventor: David A. Brown
  • Patent number: 6529397
    Abstract: The semiconductor device has a plurality of basic units, each including a memory element and a logic element and having the same or bilateral symmetry structure. Each basic unit has a DRAM cell formed in a first active region, serially connected transistors of a logic element having second and third gate electrodes, first and second signal lines connected to the source/drain regions of the transistor pair, a third signal line connected to the second gate electrode, and a conductive connection terminal formed under the storage electrode of a DRAM capacitor and the third gate electrode. A semiconductor device having a plurality of basic units each including a memory cell and a logic cell formed on the same semiconductor substrate, the device being easy to manufacture and capable of high integration is provided.
    Type: Grant
    Filed: December 29, 2000
    Date of Patent: March 4, 2003
    Assignees: Fujitsu Limited, Mosaid Technologies Inc.
    Inventors: Shigetoshi Takeda, Taiji Ema, Peter Bruce Gillingham
  • Publication number: 20030026259
    Abstract: A number of hash tables are accessed concurrently with a different computed index based on a single search key for each hash table. Each index identifies a location in one of the hash tables capable of storing at least one entry. If all indexed locations are used, the entries stored in the lookup table can be reordered so that the new entry can be inserted in one of the locations identified by the computed indexes.
    Type: Application
    Filed: June 28, 2002
    Publication date: February 6, 2003
    Applicant: MOSAID Technologies, Inc.
    Inventor: David A. Brown
  • Publication number: 20020184221
    Abstract: A load balancing mechanism maps a binary tree representation of a routing table into a set of fixed size memories. The mechanism efficiently utilizes the memory in the routing table without violating the tree precedence constraints and the memory access requirements of a pipelined system. The mechanism stores a subtree associated with a densely populated level of the binary tree in memory associated with lower levels.
    Type: Application
    Filed: April 24, 2002
    Publication date: December 5, 2002
    Applicant: MOSAID Technologies, Inc.
    Inventors: Imtiaz Ahmad, David A. Brown
  • Publication number: 20020175698
    Abstract: A method and circuit for preventing external access to secure data of an integrated circuit while supporting DFT is disclosed. In accordance with the method the integrated circuit is automatically placed into the test mode at integrated circuit power-up from a power-down state. At power up, secure data is other than present within a secure data-path of the integrated circuit. Access is provided to the secure data path via a second data path coupled with the first secure data-path. Via the access path, data other than secure data is provided to the integrated circuit, the data for performing test functions of the integrated circuit operating in the test mode. Once data other than secure data is provided to first secure data path, the test mode is terminated and access via other than the secure ports is disabled. The test mode is only re-entered by powering down the integrated circuit and re-initialising it.
    Type: Application
    Filed: June 20, 2002
    Publication date: November 28, 2002
    Applicant: MOSAID Technologies, Inc.
    Inventor: James Goodman
  • Patent number: 6484170
    Abstract: New techniques for generating entries in a content addressable memory (CAM) capable of comparison operations such as “greater than” and “less than” decisions are described. The techniques can be used with binary or ternary CAMs. The number of CAM entries needed to implement such decisions is drastically reduced for both binary and ternary CAMs. In the case of binary CAMs, one or multiple searches are needed to perform the comparisons, while in the case of ternary CAMs a tradeoff between the number of CAM entries and the number of searches can be found. As an example, a method of classifying data networking packets is implemented using the new techniques. A packet classifier based on subfields of a packet header is also described.
    Type: Grant
    Filed: November 30, 2000
    Date of Patent: November 19, 2002
    Assignee: Mosaid Technologies, Inc.
    Inventor: Mourad Abdat
  • Patent number: 6466048
    Abstract: A method and circuit for preventing external access to secure data of an integrated circuit while supporting DFT is disclosed. In accordance with the method the integrated circuit is automatically placed into the test mode at integrated circuit power-up from a power-down state. At power up, secure data is other than present within a secure data-path of the integrated circuit. Access is provided to the secure data path via a second data path coupled with the first secure data-path. Via the access path, data other than secure data is provided to the integrated circuit, the data for performing test functions of the integrated circuit operating in the test mode. Once data other than secure data is provided to first secure data path, the test mode is terminated and access via other than the secure ports is disabled. The test mode is only re-entered by powering down the integrated circuit and re-initializing it.
    Type: Grant
    Filed: May 23, 2001
    Date of Patent: October 15, 2002
    Assignee: Mosaid Technologies, Inc.
    Inventor: James Goodman
  • Patent number: 6442090
    Abstract: A differential sensing amplifier for content addressable memory is disclosed. In the differential sensing amplifier there is a detection circuit for detecting at an input node a change in an input signal comprising, a differential amplifier having a sense node and a reference node, a means for alternating the differential amplifier between a precharge phase and a sense phase, a precharge means for providing an input signal precharge voltage to the input signal via an input device, said input device selectively coupling the sense node to the input signal upon a change in the input signal, and a reference means for providing the reference node with a reference signal that continuously tracks the input precharge voltage during the precharge phase and actively maintains the input signal precharge voltage during the sense phase.
    Type: Grant
    Filed: April 24, 2000
    Date of Patent: August 27, 2002
    Assignee: Mosaid Technologies Inc.
    Inventors: Abdullah Ahmed, Jin Ki Kim
  • Publication number: 20020116526
    Abstract: We present a lookup table for providing a longest prefix match for a key provided in a search request. The search key is provided in a single search request issued to the lookup table. The lookup table performs a multi-level search for the result value based on successive portions of the key.
    Type: Application
    Filed: December 8, 2000
    Publication date: August 22, 2002
    Applicant: Mosaid Technologies, Inc.
    Inventor: David A. Brown
  • Publication number: 20020109615
    Abstract: We present a method and apparatus for performing adaptive data compression. An alphabet and vocabulary in the encoder and decoder is built adaptively and stored in a dictionary as symbols are to be encoded and decoded. Each time an unknown symbol is to be encoded by the encoder, the encoder adds the symbol to the dictionary and transmits it in plain in the encoded string. The code words transmitted by the encoder include symbols and indexes. The state of a prefix bit preceding the code word indicates whether the code word is a plain symbol or an index of a symbol or string of symbols stored in the dictionary. The decoder examines the prefix bit of each code word as it is received to determine if the code word stores a symbol in plain or in index. If the code word stores a symbol in plain, the decoder learns the symbol by adding a sequence of symbols resulting from the concatenation of previously decoded symbols and the first symbol of the currently decoded symbol and by adding the symbol to its dictionary.
    Type: Application
    Filed: February 13, 2001
    Publication date: August 15, 2002
    Applicant: MOSAID Technologies, Inc.
    Inventor: Mourad Abdat
  • Patent number: 6434699
    Abstract: An encryption chip is programmable to process a variety of secret key and public key encryption algorithms. The chip includes a pipeline of processing elements, each of which can process a round within a secret key algorithm. Data is transferred between the processing elements through dual port memories. A central processing unit allows for processing of very wide data words from global memory in single cycle operations. An adder circuit is simplified by using plural relatively small adder circuits with sums and carries looped back in plural cycles. Multiplier circuitry can be shared between the processing elements and the central processor by adapting the smaller processing element multipliers for concatenation as a very wide central processor multiplier.
    Type: Grant
    Filed: June 1, 2000
    Date of Patent: August 13, 2002
    Assignee: MOSAID Technologies Inc.
    Inventors: David E. Jones, Cormac M. O'Connell
  • Patent number: 6434077
    Abstract: A semiconductor device including an embedded memory and an Application Specific Integrated Circuit logic which is configured before the semiconductor device is packaged is presented. The Application Specific Integrated Circuit logic implements a plurality of functions. A fusible link in the embedded memory connected to one of the plurality of functions enables the function in the Application Specific Integrated Circuit. The function can be permanently disabled in the Application Specific Integrated Circuit by blowing the fusible link in the embedded memory while testing the embedded memory or after testing the embedded memory.
    Type: Grant
    Filed: March 13, 2001
    Date of Patent: August 13, 2002
    Assignee: Mosaid Technologies, Inc.
    Inventor: Christopher M. Holmes
  • Patent number: 6420982
    Abstract: A method and apparatus is provided for translating an L-bit put signal to a W-bit output signal such as a virtual network identification signal to an internal virtual network signal. The translation is performed using a multi-stage lookup. The input signal is portioned into a plurality of subsets of bits. A first index to a first stage is provided by combining a portion of bits and a first delta subset of bits. A second index to a second stage is provided by combining data stored at the first index in the first stage and the a second delta subset of bits. The corresponding output signal is stored at the last index in the last stage. The use of the multi-stage lookup instead of a single-stage lookup reduces the memory required to perform the translation.
    Type: Grant
    Filed: December 18, 2001
    Date of Patent: July 16, 2002
    Assignee: MOSAID Technologies, Inc.
    Inventor: David A. Brown
  • Publication number: 20020067296
    Abstract: A method and apparatus is provided for translating an L-bit input signal to a W-bit output signal such as a virtual network identification signal to an internal virtual network signal. The translation is performed using a multi-stage lookup. The input signal is portioned into a plurality of subsets of bits. A first index to a first stage is provided by combining a portion of bits and a first delta subset of bits. A second index to a second stage is provided by combining data stored at the first index in the first stage and the a second delta subset of bits. The corresponding output signal is stored at the last index in the last stage. The use of the multi-stage lookup instead of a single-stage lookup reduces the memory required to perform the translation.
    Type: Application
    Filed: December 18, 2001
    Publication date: June 6, 2002
    Applicant: MOSAID Technologies, Inc.
    Inventor: David A. Brown
  • Patent number: 6384750
    Abstract: A method and apparatus is provided for translating an L-bit input signal to a W-bit output signal such as a virtual network identification signal to an internal virtual network signal. The translation is performed using a multi-stage lookup. The input signal is portioned into a plurality of subsets of bits. A first index to a first stage is provided by combining a portion of bits and a first delta subset of bits. A second index to a second stage is provided by combining data stored at the first index in the first stage and the a second delta subset of bits. The corresponding output signal is stored at the last index in the last stage. The use of the multi-stage lookup instead of a single-stage lookup reduces the memory required to perform the translation.
    Type: Grant
    Filed: March 23, 2000
    Date of Patent: May 7, 2002
    Assignee: Mosaid Technologies, Inc.
    Inventor: David A. Brown
  • Publication number: 20010044876
    Abstract: We present a lookup table which allows sparse subtree descriptors and dense subtree descriptors to be stored in the same memory. A subtree entry in the memory stores a dense subtree descriptor for a dense subtree or a plurality of sparse subtree descriptors for sparse subtrees. The subtree entry is indexed by a leaf in the previous subtree. The sparse subtree descriptor stores at least one node descriptor. The node descriptor describes a set of leaves in the sparse subtree having a common value. The common value is encoded in the node descriptor using run length encoding.
    Type: Application
    Filed: December 8, 2000
    Publication date: November 22, 2001
    Applicant: Mosaid Technologies, Inc.
    Inventor: David A. Brown
  • Publication number: 20010043602
    Abstract: A method and apparatus for performing an incremental update of a lookup table while the lookup table is available for searching is presented. To add or delete a route, a second set of routes is stored in a second memory space in the lookup table, while access is provided to the first set of routes stored in a first memory space in the lookup table. Access is provided to the first memory space through a first pointer stored in a subtree entry. After storing the second set of routes in the second memory space, access is switched to the first set of routes in the first memory space by replacing the first pointer stored in the subtree entry with a second pointer to the second memory space.
    Type: Application
    Filed: December 8, 2000
    Publication date: November 22, 2001
    Applicant: Mosaid Technologies, Inc.
    Inventor: David A. Brown
  • Patent number: 6320437
    Abstract: A duty cycle regulator derives from an input clock of arbitrary duty cycle an output clock having an adjustable duty cycle of similar frequency. The duty cycle regulator includes a bistable circuit for receiving an input clock pulse and providing the output clock, coupled through a feedback loop to an adjustable delay unit having a delay interval equal to an adjustable fraction of the input clock period. When an input clock pulse is received, the bistable circuit is set giving high signal to the delay unit, which after the delay interval resets the bistable circuit to give a low signal. The delay unit includes two charge pumps alternately feeding and draining electric charges into and from a low-pass filter. The delay interval can be adjusted to a desired duty cycle independent of the input clock frequency, by setting the ratio of electric currents through the two charge pumps.
    Type: Grant
    Filed: October 29, 1999
    Date of Patent: November 20, 2001
    Assignee: Mosaid Technologies, Inc.
    Inventor: Stanley Jeh-Chun Ma
  • Publication number: 20010042130
    Abstract: We present a method and apparatus for increasing the depth of a lookup table. The lookup table includes at least two lookup units. A search request for a final result value corresponding to the key is issued to each of the lookup units in parallel. Each of the lookup units performs a multi-level search in parallel for the final result value. The final result value stored in only one of the lookup units is provided by one of the lookup units.
    Type: Application
    Filed: December 8, 2000
    Publication date: November 15, 2001
    Applicant: Mosaid Technologies, Inc.
    Inventor: David A. Brown
  • Patent number: RE37072
    Abstract: A method of processing data having one of four voltage levels stored in a DRAM cell is comprised of sensing whether or not the data voltage is above or below a voltage level midway between a highest and a lowest of the four levels, setting the voltage on a reference line higher than the lowest and lower than the next highest of the four levels in the event the data voltage is below the midway voltage level, and setting the voltage on the reference line higher than the second highest and lower than the highest of the four levels in the event the data voltage is above the midway point, and sensing whether the data voltage is higher or lower than the reference line, whereby which of the four levels the data occupies is read.
    Type: Grant
    Filed: January 31, 1996
    Date of Patent: February 27, 2001
    Assignee: Mosaid Technologies, Inc.
    Inventor: Peter B. Gillingham