Knoll, A. C.; Dooley, L. S. and Hetzheim, H.
|Google Scholar:||Look up in Google Scholar|
It is explored the mathematical basis of state reduction techniques, which have been developed in the design of Minimum Complexity Finite State Machines. The technique is based upon using first or second order Markovian Models and Pseudo-Boolean Matrices, to minimise the requisite number of states to implement IIR and FIR Digital Filters as well as DFT algorithms. The Boolean and the double Boolean Difference factors are then calculated to provide a measure of dependancy of state transitions for different arities. Rules are being developed for the connection of Pseudo-Boolean Matrices for different nodes and loops.
|Item Type:||Conference Item|
|Copyright Holders:||1992 The Authors|
|Academic Unit/Department:||Faculty of Science, Technology, Engineering and Mathematics (STEM) > Computing and Communications
Faculty of Science, Technology, Engineering and Mathematics (STEM)
|Interdisciplinary Research Centre:||Centre for Research in Computing (CRC)|
|Depositing User:||Laurence Dooley|
|Date Deposited:||19 Mar 2010 09:50|
|Last Modified:||04 Oct 2016 10:28|
|Share this page:|