Efficient arithmetic using self-timing Public Deposited

http://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/wd376059q

Descriptions

Attribute NameValues
Creator
Abstract or Summary
  • The recent advances in VLSI technology have facilitated feature shrinking and hence a rapid increase in the levels of integration at the chip level. This increase in the level of integration has brought along with it a host of other constraints, the most crucial being timing management and increased power dissipation. Such constraints potentially prevent the full exploitation of the increased processing power made possible by technological advances. Timing in complex digital systems has traditionally been managed by using a global clock, controlled by which all the actions take place in lock-step. An alternative means of managing timing, called self-timing, simplifies the problems of timing management and results in a reduced power dissipation of complex digital systems. Systems designed using this self-timed or asynchronous protocol, work on a principle of handshaking, running at their own speed, governed by local timers and the availability of data on which to work. However, this hand-shaking introduces an overhead both in terms of hardware and computational speed. The work presented here examines the implementation of an adder, called a Parallel Half-Adder (PHA), which gains its speed by exploiting the power of asynchrony to calculate the sum. The adder has been implemented in the form of a tunable micropipeline and compared to traditional adders in terms of hardware complexity and speed. Comparable results have been obtained, implying that the overhead due to hand shaking is justified and the performance improvements due to self-timing can be fully exploited. The design of an array divider using the PHA has also been presented.
Resource Type
Date Available
Date Copyright
Date Issued
Degree Level
Degree Name
Degree Field
Degree Grantor
Commencement Year
Advisor
Committee Member
Academic Affiliation
Non-Academic Affiliation
Subject
Rights Statement
Peer Reviewed
Language
Digitization Specifications
  • File scanned at 300 ppi (Monochrome) using ScandAll PRO 1.8.1 on a Fi-6770A in PDF format. CVista PdfCompressor 4.0 was used for pdf compression and textual OCR.
Replaces
Additional Information
  • description.provenance : Approved for entry into archive by Patricia Black(patricia.black@oregonstate.edu) on 2012-11-20T22:16:49Z (GMT) No. of bitstreams: 1 RamachandranRavichandra1995.pdf: 3385998 bytes, checksum: fac289492e74ec9055374fdb03b65c26 (MD5)
  • description.provenance : Approved for entry into archive by Patricia Black(patricia.black@oregonstate.edu) on 2012-11-14T23:23:26Z (GMT) No. of bitstreams: 1 RamachandranRavichandra1995.pdf: 3385998 bytes, checksum: fac289492e74ec9055374fdb03b65c26 (MD5)
  • description.provenance : Submitted by Sergio Trujillo (jstscanner@gmail.com) on 2012-11-14T22:59:20Z No. of bitstreams: 1 RamachandranRavichandra1995.pdf: 3385998 bytes, checksum: fac289492e74ec9055374fdb03b65c26 (MD5)
  • description.provenance : Made available in DSpace on 2012-11-20T22:16:49Z (GMT). No. of bitstreams: 1 RamachandranRavichandra1995.pdf: 3385998 bytes, checksum: fac289492e74ec9055374fdb03b65c26 (MD5) Previous issue date: 1994-09-02

Relationships

In Administrative Set:
Last modified: 08/20/2017

Downloadable Content

Download PDF
Citations:

EndNote | Zotero | Mendeley

Items