Skip to Main Content
This paper presents an alternate approach to the problem of delayed-input circuit realization of any fundamental mode asynchronous flow table. This approach is based on partition theory. It is shown that an equivalent normal primitive flow table of any reduced flow table has n binary partitions with substitutioh property such that their product is a 2nblock partition with substitution property, where n is the number of binary inputs. Such a property leads directly to a circuit which realizes the flow table and is a serial connection of two smaller subcircuits. The first subcircuit is again decomposable into n smaller circuits connected in parallel. It is shown that these n circuits always correspond to trivial delays in the input lines, thus leading to the delayed-input circuit realization of the fundamental mode flow table.