Realization of sequential circuits by look-up table rings

The LUT ring is a new type of memory-based realization of a sequential circuit that requires much smaller memory than conventional methods. In this paper, a method to realize a sequential circuit by a look-up table (LUT) ring is presented. The sequential circuit consists of a combinational part and feedback flip-flops. The combinational part is represented by a set of LUT cascades, and they are sequentially emulated by the LUT ring. The LUT ring uses two types of clocks: one evaluates the combinational part, and the other is the clock for state transitions of the sequential circuit. We present a method to reduce the clock period for state transitions, given limited memory size.