Self-Timed Length-Adaptive Arithmetic
Access Restricted
Access to this document is restricted. Some items have been embargoed at the request of the author, but will be made publicly available after the "No Access Until" date.
During the embargo period, you may request access to the item by clicking the link to the restricted file(s) and completing the request form. If we have contact information for a Cornell author, we will contact the author and request permission to provide access. If we do not have contact information for a Cornell author, or the author denies or does not respond to our inquiry, we will not be able to provide access. For more information, review our policies for restricted content.
No Access Until
Permanent Link(s)
Collections
Other Titles
Author(s)
Abstract
Diminishing returns in technology scaling has motivated a resurgence of exploration into new computer architectures. While Coarse Grained Reconfigurable Arrays show promise in accelerating commonly used complex operations, their overall capacity remains fairly limited. While there is pressure on general purpose systems to support wide operations, the typicalworkload mostly exercises the lower 10 to 15 bits. This leaves most of the array on and unused during normal operation. This thesis presents adaptive digit-serial arithmetic as a plug-and-play method to support a variety of bitwidth requirements, showing decreased energy and area alongside increased throughput.
Journal / Series
Volume & Issue
Description
Sponsorship
Date Issued
Publisher
Keywords
Location
Effective Date
Expiration Date
Sector
Employer
Union
Union Local
NAICS
Number of Workers
Committee Chair
Committee Co-Chair
Committee Member
Zhang, Zhiru