Page 1 |
Save page Remove page | Previous | 1 of 146 | Next |
|
small (250x250 max)
medium (500x500 max)
large ( > 500x500)
Full Resolution
All (PDF)
|
This page
All
Subset |
FLOATING-POINT UNIT DESIGN USING
TAYLOR-SERIES EXPANSION ALGORITHMS
by
Taek-Jun Kwon
______________________________________________________________
A Dissertation Presented to the
FACULTY OF THE USC GRADUATE SCHOOL
UNIVERSITY OF SOUTHERN CALIFORNIA
In Partial Fulfillment of the
Requirements for the Degree
DOCTOR OF PHILOSOPHY
(ELECTRICAL ENGINEERING)
December 2009
Copyright 2009 Taek-Jun Kwon
Object Description
| Title | Floating-point unit design using Taylor-series expansion algorithms |
| Author | Kwon, Taek-Jun |
| Author email | taekjunk@usc.edu; techzoon@gmail.com |
| Degree | Doctor of Philosophy |
| Document type | Dissertation |
| Degree program | Electrical Engineering |
| School | Viterbi School of Engineering |
| Date defended/completed | 2009-04-16 |
| Date submitted | 2009 |
| Restricted until | Unrestricted |
| Date published | 2009-11-10 |
| Advisor (committee chair) | Draper, Jeffrey |
| Advisor (committee member) |
Gupta, Sandeep K. Nakano, Aiichiro |
| Abstract | Due to the constant advances in VLSI technology and the prevalence of many applications that require floating-point operations, hardware support for floating-point arithmetic is an essential feature in high-performance computer systems, embedded systems as well as mobile applications. Over the past years, while addition and multiplication implementations have become increasingly efficient, support for division and other elementary functions such as square root has remained uneven. Although division and square root are relatively infrequent operations in traditional general-purpose applications, they are indispensable and becoming increasingly important, particularly in many modern applications. Furthermore, as the latency gap between addition/multiplication and division/square root grows, the latter operations increasingly become performance bottlenecks. Therefore, poor implementations of floating-point division and square root can result in severe performance degradation.; This dissertation presents various techniques for designing an area-efficient yet high-performance floating-point arithmetic unit using a high-order Taylor-series expansion algorithm with truncated powering units. First, we propose a floating-point divider unit based on a 3rd-order Taylor-series expansion algorithm with truncated powering units. This algorithm achieves fast computation by using truncated powering units, which compute the higher-order terms in the Taylor-series polynomial significantly faster than traditional multipliers with a relatively small hardware overhead. Through careful pipeline design, all multiply operations required by the division algorithm and floating-point multiply operations are executed by one multiplier to maximize area efficiency while achieving high performance. Second, we expand the algorithm and present a generalized floating-point divider design procedure using high-order Taylor-series expansion algorithms by exploring the trade-off space of design constraints for a given precision, which is necessary for an efficient implementation of a divider. Third, we extend the proposed floating-point divider to incorporate square root. Since Taylor’s theorem enables us to compute approximations for many well-known functions, we can extend the proposed divider unit to incorporate a square root function. And due to the similarity between the Taylor-series approximations of these functions extending the existing divider to incorporate square root can be achieved with little area and latency overhead. Finally, this dissertation provides insight into trade-offs involving overall FPU organization alternatives using the proposed floating-point divider. Several design considerations and trade-off factors in floating-point unit implementation are evaluated for two types of FPU architectures optimized under different design goals.; The proposed arithmetic unit exhibits area efficiency as well as high performance required by many modern floating-point intensive applications such as scientific computing, CAD tools and 3D graphics rendering, which have a high percentage of division and square root operations. |
| Keyword | computer architecture; computer arithmetic; floating-point unit; division; square root |
| Language | English |
| Part of collection | University of Southern California dissertations and theses |
| Publisher (of the original version) | University of Southern California |
| Place of publication (of the original version) | Los Angeles, California |
| Publisher (of the digital version) | University of Southern California. Libraries |
| Provenance | Electronically uploaded by the author |
| Type | texts |
| Legacy record ID | usctheses-m2724 |
| Rights | Kwon, Taek-Jun |
| Repository name | Libraries, University of Southern California |
| Repository address | Los Angeles, California |
| Repository email | http://www.usc.edu/isd/libraries/services/ask_a_librarian/email/ |
| Filename | etd-Kwon-3375 |
| Archival file | uscthesesreloadpub_Volume23/etd-Kwon-3375.pdf |
Description
| Title | Page 1 |
| Full text | FLOATING-POINT UNIT DESIGN USING TAYLOR-SERIES EXPANSION ALGORITHMS by Taek-Jun Kwon ______________________________________________________________ A Dissertation Presented to the FACULTY OF THE USC GRADUATE SCHOOL UNIVERSITY OF SOUTHERN CALIFORNIA In Partial Fulfillment of the Requirements for the Degree DOCTOR OF PHILOSOPHY (ELECTRICAL ENGINEERING) December 2009 Copyright 2009 Taek-Jun Kwon |
Comments
Post a Comment for Page 1
