• DocumentCode
    2920674
  • Title

    Heterogeneously encoded dual-bit self-timed adder

  • Author

    Balasubramanian, P. ; Edwards, D.A.

  • Author_Institution
    Sch. of Comput. Sci., Univ. of Manchester, Manchester, UK
  • fYear
    2009
  • fDate
    12-17 July 2009
  • Firstpage
    120
  • Lastpage
    123
  • Abstract
    A novel heterogeneously encoded dual-bit self-timed adder design is presented in this paper. Heterogeneous encoding refers to a combination of at least two different delay-insensitive encoding schemes, adopted for the inputs and outputs. The primary motivation being that higher order 1-of-n encoding protocols facilitate reduction in terms of the circuit switching power dissipation compared to the basic dual-rail (1-of-2, which is the simplest 1-of-n code) encoding scheme. Here, n specifies the number of physical lines. The number of transitions gets reduced by O(k) over a dual-rail code, with k being the number of primary inputs and equals log2n. The design of a dual-bit adder is considered to illustrate the advantage of the heterogeneous encoding scheme. The proposed adder design satisfies Seitz´s weak-indication timing constraints. In comparison with dual-bit adders realized using other approaches, employing dual-rail encoding or heterogeneous encoding, the proposed design is found to be efficient in terms of delay, power consumption and area parameters.
  • Keywords
    adders; circuit switching; encoding; Seitz weak-indication timing constraints; circuit switching power dissipation; delay-insensitive encoding schemes; dual-bit adder; dual-bit self-timed adder; dual-rail code; encoding protocols; heterogeneous encoding; heterogeneous encoding scheme; power consumption; Adders; Circuits; Delay; Electronic design automation and methodology; Encoding; Logic design; Protocols; Robustness; Timing; Wires;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Research in Microelectronics and Electronics, 2009. PRIME 2009. Ph.D.
  • Conference_Location
    Cork
  • Print_ISBN
    978-1-4244-3733-7
  • Electronic_ISBN
    978-1-4244-3734-4
  • Type

    conf

  • DOI
    10.1109/RME.2009.5201301
  • Filename
    5201301