×

Finite state-machine employing a content-addressable memory

  • US 5,125,098 A
  • Filed: 10/06/1989
  • Issued: 06/23/1992
  • Est. Priority Date: 10/06/1989
  • Status: Expired due to Fees
First Claim
Patent Images

1. A finite-state machine, operable in cycles, comprising:

  • A. a content-addressable memory, including a key-word port comprising a feedback port and machine input port, at least one output port, and a plurality of storage locations having respective output words associated therewith, for (i) operating in one mode to receive key-word and location-identification signals and to store the key words represented by the key-word signals in the locations identified by the location-identification signals and (ii) operating in another mode to generate at its output port, in response to reception at its key-word port of an input representing a key word, a memory output representing the output word associated with the storage location that contains the key word represented by the input signals at the key-word port;

    B. feedback means for applying to the feedback port during a current cycle a feedback signal determined by the memory output of the previous cycle; and

    C. output means for generating a machine output determined by the memory output,whereby the finite-state machine generates a machine output determined by the previous memory output and a machine input received at the machine input port.

View all claims
  • 4 Assignments
Timeline View
Assignment View
    ×
    ×