Automata, Bitstream functions, and Circuits

We present a general and constructive method that for a well-behaved function on bitstreams: f: (2^omega)^n --> (2^omega)^m constructs a digital circuit (with n inputs and m outputs) that implements f. More precisely, the method will produce for such f a Mealy automaton that implements f. From this automaton, a circuit can be obtained using various existing methods.  

hosted by