Content addressable memory having selectively interconnected...

Static information storage and retrieval – Associative memories – Compare/search/match circuit

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C365S049100

Reexamination Certificate

active

07876590

ABSTRACT:
A content addressable memory (CAM) device includes a plurality of CAM rows, a number of sequencing logic circuits, and a programmable interconnect structure. Each CAM row includes a number of CAM cells to generate a match signal on a match line and includes an enable input. Each sequencing logic circuit includes an input and an output, and is configured to count sequences of match signals from the CAM rows. The programmable interconnect structure selectively connects the match line of any CAM row to the input of any sequencing logic circuit, and selectively connects the output of any sequencing logic circuit to the enable input of any CAM row.

REFERENCES:
patent: 5278981 (1994-01-01), Kawaguchi et al.
patent: 5440715 (1995-08-01), Wyland
patent: 5452451 (1995-09-01), Akizawa et al.
patent: 5497488 (1996-03-01), Akizawa et al.
patent: 5712971 (1998-01-01), Stanfill et al.
patent: 6246601 (2001-06-01), Pereira
patent: 6249467 (2001-06-01), Pereira et al.
patent: 6252789 (2001-06-01), Pereira et al.
patent: 6275426 (2001-08-01), Srinivasan et al.
patent: 6521994 (2003-02-01), Huse et al.
patent: 6560670 (2003-05-01), Ichiriu
patent: 6751755 (2004-06-01), Sywyk et al.
patent: 6785677 (2004-08-01), Fritchman
patent: 6865098 (2005-03-01), Ichiriu et al.
patent: 6892237 (2005-05-01), Gai et al.
patent: 7069386 (2006-06-01), Stefan et al.
patent: 7134143 (2006-11-01), Stellenberg et al.
patent: 7225188 (2007-05-01), Gai et al.
patent: 7353332 (2008-04-01), Miller et al.
patent: 7643353 (2010-01-01), Srinivasan et al.
patent: 7656716 (2010-02-01), Srinivasan et al.
patent: 7660140 (2010-02-01), Joshi et al.
patent: 2004/0177319 (2004-09-01), Horn
patent: 2006/0215432 (2006-09-01), Wickeraad et al.
U.S. Appl. No. 12/832,862, filed Jul. 8, 2010, Alexei Starovoitov.
U.S. Appl. No. 12/873,122, filed Aug. 31, 2010, Maheshwaran Srinivasan et al.
“Efficient String Matching: An Aid to Bibliographic Search; Programming Techniques”; A. Aho and M. Corasick; Bell Laboratories; 1975, 8 pgs.
“Fast Routing Table Lookup Using CAMs”; McAuley et al.; Morristown, NJ, USA; 1993; 10 pgs.
“Gigabit Rate Packet Pattern-Matching Using TCAM”; Fang Yu, Randy Katcz EECS Dept. UC Berkeley, T.V. Lakshman, Bell Laboratories; date at least earlier than Jun. 3, 2008; 10 pgs.
“Small Forwarding Tables for Fast Routing Lookups”; Degermark et al.; Lulea University of Technology; Lulea, Sweden; 1997; 12 pgs.
A versatile Data String-Search VLSI; Hirata et al.; IEEE Journal of Solid-State Circuits, vol. 23, No. 2, Apr. 1988, 7 pgs.
High Speed Pattern Matching for Network IDS/IPS; Alicherry et al.; Lucent Bell Laboratories; IEEE, 2006, 10 pgs.
Non-Final Office Action Sep. 10, 2010 for U.S. Appl. No. 12/352,528, 17 pages.
Notice of Allowance Sep. 8, 2010 for U.S. Appl. No. 12/619,607, 14 pages.
Notice of Allowance Sep. 7, 2010 for U.S. Appl. No. 12/617,607, 13 pages.
Notice of Allowance Nov. 19, 2009 for U.S. Appl. No. 12/341,754, 15 pages.
Notice of Allowance Nov. 3, 2009 for U.S. Appl. No. 12/131,992, 12 pages.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Content addressable memory having selectively interconnected... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Content addressable memory having selectively interconnected..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Content addressable memory having selectively interconnected... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2722976

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.