2016•Unpublished venueRequires access

Synchronous Finite State Machines

Tertulien Ndjountche

Open publisher page 0 citations

Abstract

Digital circuits composed of combinational and sequential logic sections are generally described as finite state machines. A machine is synchronous when the state transitions are controlled or synchronized by a clock signal. A machine whose operation is not dependent on a clock signal is said to be asynchronous. The present state (PS) of a state machine is determined by the variables stored in the flip-flops of the sequential section. The next state (NS) of the state machine is defined by the circuit of the combinational logic section. Among finite state machines, one can differentiate between the Moore model and the Mealy model. It must be noted that there are also hybrid machines with some outputs being of Moore type and others of Mealy type. The process of designing finite state machines can, in general, be optimized for certain applications that require minimizing the area occupied by the circuit or the number of components.

About this research paper

What this paper is about

Digital circuits composed of combinational and sequential logic sections are generally described as finite state machines. A machine is synchronous when the state transitions are controlled or synchronized by a clock signal. A machine whose operation is not dependent on a clock signal is said to be asynchronous. The present state (PS) of a state machine is determined by the variables stored in the flip-flops of the sequential section. The next state (NS) of the state machine is defined by the circuit of the combinational logic section. Among finite state machines, one can differentiate between the Moore model and the Mealy model. It must be noted that there are also hybrid machines with some outputs being of Moore type and others of Mealy type. The process of designing finite state machines can, in general, be optimized for certain applications that require minimizing the area occupied by the circuit or the number of components.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Digital circuits composed of combinational and sequential logic sections are generally described as finite state machines. A machine is synchronous when the state transitions are controlled or synchronized by a clock signal. A machine whose operation is not dependent on a clock signal is said to be asynchronous. The present state (PS) of a state machine is determined by the variables stored in the flip-flops of the sequential section. The next state (NS) of the state machine is defined by the circuit of the combinational logic section. Among finite state machines, one can differentiate between the Moore model and the Mealy model. It must be noted that there are also hybrid machines with some outputs being of Moore type and others of Mealy type. The process of designing finite state machines can, in general, be optimized for certain applications that require minimizing the area occupied by the circuit or the number of components.

Key concepts: Finite-state machine, Sequential logic, Asynchronous circuit, Asynchronous communication, State (computer science), Computer science, Synchronous circuit, Clock signal

Related papers

Back to paper searchBrowse research topicsOriginal source
Synchronous Finite State Machines — Research Paper | ScholarLens