Abstract/Details

Contemporary data path design optimization


2006 2006

Other formats: Order a copy

Abstract (summary)

As the core of most digital computing systems, data-path design is essential to determine the whole system performance. In the past decades many advanced methodologies and technologies have been proposed to optimize data-path designs. Nowadays new design requirements are emerging with the technology development: (1) Low power design. Power consumption becomes more critical issue than performance in modern data-path designs, especially for mobile device applications. (2) Extremely high performance design for micro processors. With the shrink of feature size and the increase of clock frequency, extremely high performance data-path components operated on multiple giga-hertz clock are required in micro processor designs. (3) High performance low cost design for ASIC. Application-specific design constraints, such as area/power budget and non-uniform signal required times, must be satisfied.

Inspired by these requirements, we propose two optimization techniques to efficiently minimize power consumption and achieve timing/area/power tradeoff for specific applications.

1. Binary addition is the most widely used fundamental operations. Various applications require different adder designs for high speed, small area or low power consumption. Since parallel prefix adders provide great flexibility to satisfy a specific application, we propose an integer linear programming method to build optimal prefix adders, which counts gate and wire capacitances in the timing and power models. Furthermore the proposed method can handle nonuniform arrival time and required time on each bit position. Therefore, a realistic minimal-power prefix adder can be found with arbitrary timing and area constraints.

2. Division is a fundamental but expensive arithmetic operation. We analyze the computation efforts from memory, arithmetic functions and iterations in division operation and propose a hybrid algorithm which employs Prescaling, Series expansion and Taylor expansion (PST) algorithms together. The proposed algorithm boosts very-high radix division by efficiently estimating the reciprocal of divisor, and achieves outstanding performance-cost tradeoff. Optimizations of the basic PST algorithm are also developed to improve the performance further. The proposed algorithm is suitable for both ASIC and FPGA applications with high-performance division units.

These research works optimize data-path designs in different levels from algorithm to logical/physical synthesis. Unlike the previous works, both approaches proposed in the dissertation explore the design space in terms of timing, area and power consumption.

Indexing (details)


Subject
Computer science
Classification
0984: Computer science
Identifier / keyword
Applied sciences; Data path; Design optimization; Digital computing; FPGA; Prescaling
Title
Contemporary data path design optimization
Author
Liu, Jianhua
Number of pages
94
Publication year
2006
Degree date
2006
School code
0033
Source
DAI-B 67/04, Dissertation Abstracts International
Place of publication
Ann Arbor
Country of publication
United States
ISBN
9780542639784, 0542639785
Advisor
Cheng, Chung-Kuan
University/institution
University of California, San Diego
University location
United States -- California
Degree
Ph.D.
Source type
Dissertations & Theses
Language
English
Document type
Dissertation/Thesis
Dissertation/thesis number
3214712
ProQuest document ID
305347782
Copyright
Database copyright ProQuest LLC; ProQuest does not claim copyright in the individual underlying works.
Document URL
http://search.proquest.com/docview/305347782
Access the complete full text

You can get the full text of this document if it is part of your institution's ProQuest subscription.

Try one of the following:

  • Connect to ProQuest through your library network and search for the document from there.
  • Request the document from your library.
  • Go to the ProQuest login page and enter a ProQuest or My Research username / password.