The Open UniversitySkip to content
 

Pseudo-Boolean Matrix Techniques for State Minimisation of Finite State Machine Realisations of DSP Systems

Knoll, A. C.; Dooley, L. S. and Hetzheim, H. (1992). Pseudo-Boolean Matrix Techniques for State Minimisation of Finite State Machine Realisations of DSP Systems. In: Third IMA Conference on Mathematics in Signal Processing, 15-17 Dec 1992, Warwick, UK.

URL: http://www.ima.org.uk/Conferences/signal_processin...
Google Scholar: Look up in Google Scholar

Abstract

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: Mathematics, Computing and Technology > Computing & Communications
Interdisciplinary Research Centre: Centre for Research in Computing (CRC)
Item ID: 18638
Depositing User: Laurence Dooley
Date Deposited: 19 Mar 2010 09:50
Last Modified: 02 Dec 2010 20:39
URI: http://oro.open.ac.uk/id/eprint/18638
Share this page:

Actions (login may be required)

View Item
Report issue / request change

Policies | Disclaimer

© The Open University   + 44 (0)870 333 4340   general-enquiries@open.ac.uk