The realization of finite state machines by decomposition and the principal lattice of partitions of a submodular function

Authors:
M. P. Desai;H. Narayanan;Sachin B. Patkar
Affiliations:
Department of Electrical Engineering, Indian Institute of Technology-Bombay, Mumbai 400 076, India;Department of Electrical Engineering, Indian Institute of Technology-Bombay, Mumbai 400 076, India;Department of Mathematics, Indian Institute of Technology-Bombay, Mumbai 400 076 India
Venue:
Discrete Applied Mathematics - Submodularity
Year:
2003

Citing 5
Cited 1

Low power realization of finite state machines—a decomposition approach

ACM Transactions on Design Automation of Electronic Systems (TODAES)
Approximation algorithms for Min-k-overlap problems using the principal lattice of partitions approach

Journal of Algorithms
Finite state machine decomposition for low power

DAC '98 Proceedings of the 35th annual Design Automation Conference
A State Assignment Scheme Targeting Performance and Area

VLSID '99 Proceedings of the 12th International Conference on VLSI Design - 'VLSI for the Information Appliance'
Decomposition of Finite State Machines for Area, Delay Minimization

ICCD '99 Proceedings of the 1999 IEEE International Conference on Computer Design

Modeling the energy cost of applications on portable wireless devices

Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, some problems that arise in the realization of finite state machines (FSM) are shown to be strongly related to the theory of submodular functions. Specifically, we use the idea of the principal lattice of partitions of a submodular function to develop approximation algorithms for minimizing the "cost" of realization of an FSM through a decomposition strategy.