Re-programmable finite state machine

Details Re-programmable finite state machine Re-programmable finite state machine

2007-02-06

2007-02-06

Peugh, Brian R. (Department: 2187)

Electronic digital logic circuitry

Multifunctional or programmable

Sequential or with flip-flop

C711S108000, C711S220000

Reexamination Certificate

active

10245436

ABSTRACT:
A re-programmable finite state machine comprising a content-addressable memory (“CAM”) and a read/write memory output array (“OA”). In operation, the CAM receives and periodically latches a status vector, and generates a match vector as a function of the status vector and a set of stored compare vectors. In response, the OA selects for output one of a set of a control vector as a function of the match vector. A state vector portion of the selected control vector is forwarded to the CAM as a portion of the status vector. An output vector portion of the selected control vector controls the operation of external components. Both the set of stored compare vectors and the set of control vectors are fully re-programmable.

REFERENCES:
patent: 4674089 (1987-06-01), Poret et al.
patent: 5125098 (1992-06-01), Burrows
patent: 5621337 (1997-04-01), Childs
patent: 5860085 (1999-01-01), Stormon et al.
patent: 6362990 (2002-03-01), Gibson et al.
patent: 6418042 (2002-07-01), Srinivasan et al.
patent: 7082044 (2006-07-01), Gould et al.
Design of multi-field IPv6 packet classifiers using ternary CAMs□□Nen-Fu Huang; Whai-En Chen; Jiau-Yu Luo; Jun-Min Chen; Global Telecommunications Conference, 2001. GLOBECOM '01.□□IEEE , vol. 3, Nov. 25-29, 2001; pp. 1877-1881 vol. 3.
A longest prefix match search engine for multi-gigabit IP processing□□Kobayashi, M.; Murase, T.; Kuriyama, A.;Communications, 2000. ICC 2000. 2000 IEEE International Conference on , vol. 3, Jun. 18-22, 2000; pp. 1360-1364 vol. 3.
VLSI implementation of routing tables: tries and CAMs□□Pei, T.-B.; Zukowski, C.;INFOCOM '91. Proceedings. Tenth Annual Joint Conference of the IEEE Computer and Communications Societies. Networking in the 90s. IEEE , Apr. 7-11, 1991; pp. 515-524 vol. 2.
A reconfigurable content addressable memory McAuley, A.J.; Cotton, C.J.; Custom Integrated Circuits Conference, 1990., Proceedings of the IEEE 1990, May 13-16, 1990 pp. 24.1/1-24.1/4.
Takao Matsuda et al., “A new protocol processing architechture for high-speed networks”, 1996 IEEE.
Yutai Ma et al., “A Simple State Transition Control for FSM Programmable Protocol Processors”, 2000 IEEE. Proc., 43rdMidwest Symp. on Circuits and Systems, Aug. 8-11, 2000.

Affiliated with

Also associated with

Rating

Re-programmable finite state machine does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Re-programmable finite state machine, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Re-programmable finite state machine will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3826860