State assignment for finite state machines using T flip-flops

Abstract

Considerable progress in the area of state assignment for PLA and multi-level finite state machine realizations was made in the last ten years. Although many finite state machines can be more efficiently implemented if T flip-flops are used as memory elements, research has concentrated on finite state machines using D flip-flop memory. A state assignment algorithm for finite state machines using T flip-flops is presented. For realistic benchmarks, the area requirements of the finite state machine realization are up to 50% smaller if T flip-flops are used as memory elements.<>