{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T11:45:40Z","timestamp":1759146340406,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540441083"},{"type":"electronic","value":"9783540461173"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-46117-5_37","type":"book-chapter","created":{"date-parts":[[2010,3,29]],"date-time":"2010-03-29T21:14:23Z","timestamp":1269897263000},"page":"350-359","source":"Crossref","is-referenced-by-count":3,"title":["FSM Decomposition for Low Power in FPGA"],"prefix":"10.1007","author":[{"given":"Gustavo","family":"Sutter","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elias","family":"Todorovich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergio","family":"Lopez-Buedo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eduardo","family":"Boemo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,8,16]]},"reference":[{"key":"37_CR1","doi-asserted-by":"crossref","unstructured":"M. Alidina, J. Monteiro, S. Devadas, A. Gosh, M. Papaefthymiou, Precomputation-Based sequential logic optimization for Low-Power, IEEE VLSI, V.2,n\u00b04, pp.426\u2013435, Dec 1994.","DOI":"10.1109\/92.335011"},{"issue":"3","key":"37_CR2","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1109\/43.67784","volume":"10","author":"P. Ashar","year":"1991","unstructured":"P. Ashar, S. Devadas, and A. Newton. Optimum and heuristic algorithms for an approach to fsm decomposition. IEEE Trans.Computer-Aided Design, 10(3):296\u2013310, March 1991.","journal-title":"IEEE Trans.Computer-Aided Design"},{"issue":"6","key":"37_CR3","doi-asserted-by":"crossref","first-page":"630","DOI":"10.1109\/43.503933","volume":"15","author":"L. Benini","year":"1996","unstructured":"L. Benini P. Siegel and G. De Micheli. Automatic synthesis of low-power gated-clock finite-state machines. IEEE Trans.on CAD of IC, vol.15, Issue6, June 1996, pp. 630\u2013643.","journal-title":"IEEE Trans.on CAD of IC"},{"key":"37_CR4","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1109\/4.364440","volume":"30","author":"L. Benini","year":"1995","unstructured":"L. Benini and G. De Micheli. State Assignment for Low Power Dissipation. IEEE Journ. of Solid State Circuits, Vol. 30, No. 3, pp. 258\u2013268, March 1995.","journal-title":"IEEE Journ. of Solid State Circuits"},{"key":"37_CR5","doi-asserted-by":"crossref","unstructured":"L. Benini, and G. De Micheli, Transformation and Synthesis of FSMs for Low Power Gated Clock Implementation, ISLP\u201995 International Symposium on Low Power Design, ACM-SIGDA and IEEE-CAS, April 23\u201326, 1995.","DOI":"10.1145\/224081.224086"},{"key":"37_CR6","doi-asserted-by":"crossref","unstructured":"L. Benini, G. De Micheli, and F. Vermeulen, Finite-state machine partitioning for low power. In Proc. IEEE Int\u2019l Symposium on Circuits and Systems (ISCAS\u2019 98), volume 2, pages 5\u20138, Monterey, California, May31\u2013June3, 1998.","DOI":"10.1109\/ISCAS.1998.706780"},{"key":"37_CR7","doi-asserted-by":"crossref","unstructured":"S-H. Chow, Y-C. Ho, and T. Hwang. Low Power Realization of Finite State Machines Decomposition Approach. ACM Trans on Design Aut. Elec. Systems, 315\u2013340, July 1996.","DOI":"10.1145\/234860.234862"},{"key":"37_CR8","unstructured":"J. Dunoyer, F. P\u00e9trot, L. Jacomme. Intrinsic limitations of logarithmic encodings for low power finite state machines. Mixed Des of VLSI Circ Conf, p 613\u2013618, Pologne, 1997."},{"key":"37_CR9","unstructured":"FPGA Express home page. Synopsis, inc.; http:\/\/www.synopsys.com\/products\/ fpga\/fpga_express.htm"},{"key":"37_CR10","doi-asserted-by":"crossref","unstructured":"M. Geiger T. M\u00fcller-Wipperf\u00fcrth, FSM Decomposition Revisited: Algebraic Structure Theory Applied to MCNC Benchmark FSMs. 28th ACM\/IEEE DAC Conference, 1991","DOI":"10.1145\/127601.127661"},{"key":"37_CR11","doi-asserted-by":"crossref","unstructured":"G. Hachtel, J. Rho, F. Somenzi, R. Jacoby. Exact and Heuristic Alg. for the Minimization of Incompletely Specified State Machines. Europ. DAC, pp 184\u2013191, Amsterdam, feb 1991.","DOI":"10.1109\/EDAC.1991.206387"},{"key":"37_CR12","unstructured":"Bob Lisanke. \u201cLogic synthesis and optimization benchmarks\u201d. Technical report, MCNC, Research Triangle Park, North Carolina, December 1988."},{"key":"37_CR13","unstructured":"M. Mart\u00ednez, M. J. Avedillo, J. M. Quintana, M. Koegst, ST. Rulke, and H. Susse: Low Power State Assignment Algorithm, DCIS\u201900 conf, pp. 181\u2013187, 2000."},{"key":"37_CR14","doi-asserted-by":"crossref","unstructured":"J. Monteiro, A. Oliviera, Finite State Machine Decomposition for Low Power, Proceedings 35th Design Automation Conference, San Franscisco, 1998, pp. 758\u2013763.","DOI":"10.1145\/277044.277235"},{"key":"37_CR15","doi-asserted-by":"crossref","unstructured":"Winfried N\u00f6th and Reiner Kolla. \u201cSpanning Tree Based State Encoding for Low Power Dissipation\u201d. In Proc of Date99, pp 168\u2013174, Munich, Germany, March 1999.","DOI":"10.1145\/307418.307482"},{"key":"37_CR16","unstructured":"PREP Benchmarks (Programmable Elect. Performance Company), http:\/\/www.prep.org ."},{"key":"37_CR17","series-title":"Tech. Report","volume-title":"SIS: A System for Seq. Circuit Synthesis","author":"E. Sentovich","year":"1992","unstructured":"E. Sentovich, K. Singh, L. Lavagno, C. Moon, R. Murgai, A. Saldanha, P. Stephan, R. Brayton, and A. Sangiovanni-Vincentelli. SIS: A System for Seq. Circuit Synthesis. Tech. Report Mem. No. UCB\/ ERL M92\/41, Univ. of California, Berkeley, 1992."},{"key":"37_CR18","doi-asserted-by":"crossref","unstructured":"R. Shelar, H. Narayanan, M. Desai, Orthogonal Partitioning and Gated Clock Architecture for Low Power Realization of FSMs, IEEE Int ASIC\/SOC conf, Sep 2000, pp. 266\u2013270.","DOI":"10.1109\/ASIC.2000.880713"},{"key":"37_CR19","doi-asserted-by":"crossref","unstructured":"R. Shelar, M.P. Desai, H. Narayanan, \u201cDecomposition of Finite State Machines for Area, Delay Minimization\u201d, IEEE ICCD99 Austin, 10\u201313 Oct. 1999, pp. 620\u2013625.","DOI":"10.1109\/ICCD.1999.808606"},{"key":"37_CR20","unstructured":"G. Sutter and E. Boemo Low Power Finite state machines in FPGA: Bynary vs One hot encoding. VIII Workshop Iberchip, Guadalajara, Mexico, April 2002."},{"key":"37_CR21","unstructured":"Tektronix inc., \u201cTLA 700 Series Logic Analyzer User Manual\u201d, http:\/\/www.tektronix.com ."},{"key":"37_CR22","unstructured":"E. Todorovich, G. Sutter, N. Acosta, E. Boemo and S. L\u00f3pez-Buedo, \u201cEnd-user low-power alternatives at topological and physical levels. Some examples on FPGAs\u201d, Proc. DCIS\u20192000, Montpellier, France, November 2000."},{"key":"37_CR23","doi-asserted-by":"crossref","unstructured":"C-Y Tsui, M. Pedram, A. Despain, Exact and Approximate Methods for Calculating Signal and Transition Probabilities in FSMs, 31st Design Autom. Conf., pp. 18\u201323, 1994.","DOI":"10.1145\/196244.196255"},{"key":"37_CR24","unstructured":"Xilinx Foundation Tools F3.1i, http:\/\/www.xilinx.com\/ support\/library.htm"},{"key":"37_CR25","unstructured":"C. Tsui, M. Pedram, C. Chen, A. Despain, \u201cLow Power State Assignment Targeting Two-and Multi-level Logic Implement\u201d, ACM\/IEEE Inter.Conf. of CAD, pp. 82\u201387, Nov.1994"},{"key":"37_CR26","doi-asserted-by":"crossref","unstructured":"X. Wu, M. Pedram, and L. Wang, "Multi-code state assignment for low power design,", IEEE Proc. Circuits, Dev. and Systems, Vol. 147, No. 5, Oct. 2000, pp. 271\u2013275.","DOI":"10.1049\/ip-cds:20000671"}],"container-title":["Lecture Notes in Computer Science","Field-Programmable Logic and Applications: Reconfigurable Computing Is Going Mainstream"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46117-5_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,19]],"date-time":"2025-02-19T19:22:45Z","timestamp":1739992965000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46117-5_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441083","9783540461173"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-46117-5_37","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}