SwePub
Sök i SwePub databas

  Utökad sökning

Träfflista för sökning "WFRF:(Oelmann Bengt) srt2:(1995-1999)"

Sökning: WFRF:(Oelmann Bengt) > (1995-1999)

  • Resultat 11-13 av 13
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
11.
  • Oelmann, Bengt, et al. (författare)
  • LIFS: A Tool for Low-Power Implementation of FSMs
  • 1999
  • Ingår i: Proceedings of the 17th IEEE Norchip Conference.
  • Konferensbidrag (refereegranskat)abstract
    • We present a tool (LIFS) for low-power implementation of finite state machines (FSMs). The tool decomposes a FSM into several small communicating sub state machines (partitions). Low-power operation is achieved since only one partition is active (clocked) at a time, thus fewer registers need to be clocked. The hand-over mechanism between different partitions in the final state machine is controlled by asynchronous controllers. By using an asynchronous hand-over mechanism our approach has up to five times less power overhead than comparable approaches. To show the effectiveness of the LIFS tool, we present experimental results from standard benchmark examples.
  •  
12.
  •  
13.
  • Pasanen, Jari, et al. (författare)
  • Locally clocked AFSMs using dynamic latch implementation
  • 1999
  • Ingår i: Electronics, Circuits and Systems, 1999. Proceedings of ICECS '99. The 6th IEEE International Conference on. - 0780356829 ; , s. 1643-1646
  • Konferensbidrag (refereegranskat)abstract
    • Asynchronous Finite State Machines (AFSMs) have been proposed to be used in designs where the demands on high speed or low power consumption are high. In this paper we present a synthesis procedure for a type of AFSMs called locally clocked state machines with dynamic latch implementation. The use of dynamic latches makes it possible to reduce input capacitances and the number of transistors. It also enables efficient implementation of gates with monotonic output transitions which is important in AFSM design. We (1) show what implications the use of dynamic gates have on the synthesis procedure, (2) define state constraints and requirements on these circuits, and (3) present a complete procedure for implementing AFSMs through an example
  •  
Skapa referenser, mejla, bekava och länka
  • Resultat 11-13 av 13

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy