National Tsing Hua University Institutional Repository:State assignment for power and area minimization
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 54367/62174 (87%)
Visitors : 13541077      Online Users : 48
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTHU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version

    Please use this identifier to cite or link to this item:

    Title: State assignment for power and area minimization
    Authors: Wang,Kuo-Hua
    Wu,Allen C. H.
    Teacher: 黃婷婷
    Date: 1994
    Publisher: Institute of Electrical and Electronics Engineers Inc
    Relation: VLSI in Computers and Processors,1994.ICCD'94.Proceedings.,IEEE International Conference on 10-12 Oct.1994, Page(s):250-254
    Keywords: State assignment
    Minimization of switching nets
    Finite automata
    Sequential machines
    CMOS integrated circuits
    Formal logic
    Mathematical models
    Abstract: In this paper, we address the problem of state assignment to minimize both area and power dissipation for Finite State Machine designs. We propose a new matching-based state-assignment algorithm which considers area and state transitions simultaneously. Experimental results on a set of benchmarks demonstrate that our approach is indeed very effective in minimizing both area and power dissipation.
    Relation Link:
    Appears in Collections:[Department of Computer Science] CS Conference Papers
    [Design Technology Center ] DTC Conference Papers

    Files in This Item:

    File Description SizeFormat
    2030202030012.pdf464KbAdobe PDF586View/Open


    SFX Query


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback