The realization of finite state machines by decomposition and the principal lattice of partitions of a submodular function
暂无分享,去创建一个
[1] H. Narayanan,et al. The principal lattice of partitions of a submodular function , 1991 .
[2] Sying-Jyan Wang,et al. State assignment of finite state machines for low power applications , 1996 .
[3] Madhav P. Desai,et al. A state assignment scheme targeting performance and area , 1999, Proceedings Twelfth International Conference on VLSI Design. (Cat. No.PR00013).
[4] Sachin B. Patkar,et al. Approximation Algorithms for Min-k-Overlap Problems Using the Principal Lattice of Partitions Approach , 1994, J. Algorithms.
[5] Luca Benini,et al. State assignment for low power dissipation , 1995 .
[6] Madhav P. Desai,et al. Decomposition of finite state machines for area, delay minimization , 1999, Proceedings 1999 IEEE International Conference on Computer Design: VLSI in Computers and Processors (Cat. No.99CB37040).
[7] G. De Micheli,et al. Finite-state machine partitioning for low power , 1998, ISCAS '98. Proceedings of the 1998 IEEE International Symposium on Circuits and Systems (Cat. No.98CH36187).
[8] H. Narayanan. Submodular functions and electrical networks , 1997 .
[9] José C. Monteiro,et al. Finite state machine decomposition for low power , 1998, Proceedings 1998 Design and Automation Conference. 35th DAC. (Cat. No.98CH36175).
[10] Madhav P. Desai,et al. Orthogonal partitioning and gated clock architecture for low power realization of FSMs , 2000, Proceedings of 13th Annual IEEE International ASIC/SOC Conference (Cat. No.00TH8541).
[11] TingTing Hwang,et al. Low power realization of finite state machines—a decomposition approach , 1996, TODE.