Pseudo-Boolean Matrix Techniques for State Minimisation of Finite State Machine Realisations of DSP Systems.
Knoll, A.C. and Dooley, L.S. and Hetzheim, H. (1992) Pseudo-Boolean Matrix Techniques for State Minimisation of Finite State Machine Realisations of DSP Systems. Third IMA Conference on Mathematics in Signal Processing, University of Warwick, GB, 15-17 December 1992.
Full text not available from this repository.
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 BooleanDifference factors are then calculated to provide a measure of dependancy of state transitions for different arities. Rules are beinbeing developed for the connection of Pseudo-Boolean Matrices for different nodes and loops.
|Document Type:||Conference or Workshop Item (Speech)|
|Title:||Pseudo-Boolean Matrix Techniques for State Minimisation of Finite State Machine Realisations of DSP Systems.|
|Keywords:||state reduction techniques, digital signal processing, finite state machines, pseudoboolean matrix|
|Event Title:||Third IMA Conference on Mathematics in Signal Processing, University of Warwick, GB, 15-17 December 1992|
|HGF - Research field:||UNSPECIFIED|
|HGF - Program:||no assignment|
|HGF - Program Themes:||no assignment|
|DLR - Research area:||UNSPECIFIED|
|DLR - Program:||no assignment|
|DLR - Research theme (Project):||UNSPECIFIED|
|Institutes and Institutions:||Institute of Planetary Research > Institut für Weltraumsensorik|
|Deposited By:||elib DLR-Beauftragter|
|Deposited On:||02 Apr 2006|
|Last Modified:||27 Apr 2009 09:55|
Repository Staff Only: item control page