Abstract
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 2 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</sup> block 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
