Responsive image
博碩士論文 etd-0203110-215114 詳細資訊
Title page for etd-0203110-215114
論文名稱
Title
適用於多媒體應用的低功率多重精確度重複式浮點乘器
Multiple Precision Iterative Floating-Point Multiplier for Low-Power Applications
系所名稱
Department
畢業學年期
Year, semester
語文別
Language
學位類別
Degree
頁數
Number of pages
80
研究生
Author
指導教授
Advisor
召集委員
Convenor
口試委員
Advisory Committee
口試日期
Date of Exam
2010-01-29
繳交日期
Date of Submission
2010-02-03
關鍵字
Keywords
乘法器、多重精確度、低功率、重複式
multiple precision, multiplier, iterative, Low power
統計
Statistics
本論文已被瀏覽 5699 次,被下載 15
The thesis/dissertation has been browsed 5699 times, has been downloaded 15 times.
中文摘要
在許多多媒體的應用中,其運算結果經常可以容忍些許誤差的存在,因此本論文提出一個具有多重精確度的重複式浮點乘法器,它可以提供給使用者三種選擇模式,而這三種模式是根據每一筆乘法運算所能容忍的誤差大小來減少浮點乘法器中有效位數 (mantissa)的位元長度及運算,進而達到降低功率消耗的目的。

此外,為了減少面積的大小,本論文採用重複式的架構來設計多重精確度浮點乘法器的有效位數乘法器。我們使用C++來評估多重精確度浮點乘法器每一個模式與IEEE754單精確度浮點乘法器之間的最大誤差值。當多媒體應用要求高精準度的計算時,重複式有效位數乘法器重複執行三次4-2壓縮樹,其誤差大約是在10e-5%。次高精準度則是重複執行二次4-2壓縮樹,誤差大約在10e-3%。而最低的精準度是只執行一次4-2壓縮樹,誤差大約在1%。但精準度最低的模式,其所需的週期數最少,與三級的IEEE754單精度浮點乘法器比較,我們所提出的三級浮點乘法器大約可以節省42.54%的面積。而在能量方面,IDCT應用在1%的誤差範圍內可以節省37.78%,YUV to RGB 應用在1.1%的誤差範圍內則可以省31.36%。由以上的實驗結果可以得知,使用本論文所提乘法器確實可以達到降低功率的效果。
Abstract
In many multimedia applications, a little error in the output results is allowable. Therefore, this thesis presents an iterative floating-point multiplier with multiple precision to reduce the energy consumption of floating-point multiplication operations. The multiplier can provide the users with three kinds of modes. The distinction among the three modes is the accepted output error and the achievable energy saving through reducing the length of mantissa in the multiplication operation.

In addition, to reduce the area of multiple precision floating-point multiplier we use the iterative structure to implement the mantissa multiplier in a floating point multiplier. Moreover the C++ language is adopted to evaluate the product error between each mode and the IEEE754 single precision multiplier. When the multimedia applications request high precision, the multiple precision floating-point multiplier will iteratively execute the 4-2 compression tree three times and the product error is around 10e-5%. The second-mode with the middle accuracy will iteratively execute the 4-2 compression tree two times and the product error is around 10e-3%. The third mode with the lowest accuracy will execute the 4-2 compression tree once and the product error is around 1%, it requires less execution cycle number. When compared with the tree-stage IEEE754 single-precision multiplier, the proposed iterative floating-point multiplier can save 42.54% area. For IDCT application, it can save 37.78% energy under 1% error constraint, For YUV to RGB application, it can save 31.36% energy under 1.1% error constraint. The experimental results demonstrate that the proposed multiple precision iterative floating-point multiplier can
significantly reduce the energy consumption of multimedia applications that allow a little output distortion
目次 Table of Contents
Chapter 1. 概論 1
1.1研究動機 1
1.2論文大綱 1
Chapter 2. 研究背景與相關研究 2
2.1 IEEE 754規格簡介 2
2.2傳統浮點乘法器捨進(ROUNDING)的處理 3
2.3布斯乘法器簡介5
2.4壓縮樹 8
2.5傳統浮點乘法器的架構11
2.6重複式浮點乘法器簡介 13
Chapter 3. 提出的重複式浮點乘法器 15
3.1簡介15
3.2壓縮的方法15
3.3架構16
3.4取二補數的方法19
3.5控制電路和內部執行 22
Chapter 4. 實驗結果33
4.1實驗步驟和使用的設計軟體33
4.2結果35
4.3其他架構46
Chapter 5. 結論和未來工作 61
5.1結論61
5.2未來工作 61
參考文獻 62
參考文獻 References
[1] J. Tong, D. Nagle, R. Rutenbar, “Reducing Power by Optimizing the Necessary Precision/Range of Floating-Point Arithmetic,” IEEE Transactions on VLSI Systems, vol. 8, no. 3, pp. 273-286, June 2000.
[2] IEEE Standard 754 for Binary Floating-Point Arithmetic. New York:ANSI/IEEE 754-1985, 1985.
[3] R. Yu and G. Zyner, “167 MHz Radix-4 floating point multiplier,” Pro 12th Symposium on Computer Arithmetic, Vol. 12, pp. 149-154, 1995.
[4] Behrooz Parhami, Computer Arithmetic:Algorithms and Hardware Designs, Oxford University Press, Inc, 2000.
[5] M. R. Santoro, G. Bewick and M. A. Horowitz, “Rounding Algorithms for IEEE Multipliers,” Proceedings of 9th Symposium on Computer Arithmetic, pages 176-183, 1989.
[6] P. BONATTO, V. G. OKLOBDZIJA, “Evaluation of Booth's algorithm for implementation in parallel multipliers,” IEEE Proceedings of ASILOMAR-29, pp. 608-610, 1996.
[7] Zhijun Huang, “High-Level Optimization Techniques for Low-Power Multiplier Design,” PhD dissertation, Univ. of California, Los Angeles, June 2003.
[8] D. Radhakrishnan and A.P. Preethy, “Low-power CMOS pass logic 4-2 compressor for high-speed multiplication,” in Proc. 43rd IEEE Midwest Symp. Circuits & Systems, Vol. 3, pp. 1296-1298, 2000.
[9] P. Mokrian, G. Howard, G. Jullien, and M. Ahmadi, “On the use of 4:2 compressors for partial product reduction,” IEEE Canadian Conf. on Electrical and Computer Engineering, vol. 1, May 2003, pp. 121-124.
[10] D. Villeger and V. Oklobdzija, “Analysis of Booth Encoding Efficiency in Parallel Multipliers Using Compressors for Reduction of Partial Products,” Proc. 27th Ann. Asilomar Conf. Signals, Systems, and Computers, vol. 1, pp. 781-784, 1993.
[11] O. M. Lakshmanan and M. A. M. Ali, “High performance parallel multiplier using Wallace-Booth algorithm,” Proc. IEEE International Conference on Semiconductor Electronics. pp. 433-436, Dec. 2002.
[12] W. J. Townsend, E. E. Swartzlander, Jr., and J. A. Abraham, “A comparison of dadda and wallace multiplier delays,” Proc. SPIE, Advanced Signal Processing Algorithms, Architectures, and Implementations XIII, vol. 5205, pp. 552-560, Dec. 2003.
[13] M.T. Santoro and M.A. Horoeitz, “SPIM: A pipelined 64 × 64 bit iterative multiplier,” IEEE J. Solid-State Circuits, vol. 24, pp. 487-494, 1989.
[14] M.-C. Shin, S.-H. Kang, and I.-C. Park, “An area-efficient iterative modified-Booth multiplier based on self-timed clocking,” Proc. International Conf. Computer Design (ICCD), pp. 511–512, Nov. 2001.
[15] A. Efthymiou, W. Suntiamorntut, J. Garside, and L. Brackenbury, “An asynchronous, iterative implementation of the original booth multiplication algorithm,” ASYNC 2004, pp. 207-215, 2004.
[16] J.-Y. Kang and J.-L. Gaudiot, “A simple high-speed multiplier design,” IEEE Trans. On Computers, vol. 55, no. 10, pp. 1253-1258, 2006.
[17] L.R. Wang, S.J. Jou, and C.L. Lee, “A Well-structured Modified Booth Multiplier Design,” IEEE Int. Symp. On VLSI Design, Automation and Test, pp.85-88, 2008.
[18] D. Tan, C.E. Lemonds, and M.J. Schulte, “Low-Power Multiple-Precision Iterative Floating-Point Multiplier with SIMD Support,” IEEE Transactions on Computers, vol. 58, no. 3, pp. 175-187, Oct. 2008.
[19] James E. Stine and Michael J. Schulte, “A Combined Two’s Complement and Floating-Point Comparator,” IEEE Intnl. Symposium on Circuits and Systems, Vol. 1, pp. 89-92, 2005.
[20] C. Fang, T. Chen, and R. A. Rutenbar, “Floating-point error analysis based on affine arithmetic,” Proc. IEEE Int. Conf. on Acoust., Speech, and Signal Processing., vol. 2, pp. 561-564, Apr. 2003.
[21] “TSMC 0.13um (CL013G) Process 1.2-Volt SAGE-XTM Standard Cell Library Databook,” Jan. 2004.
電子全文 Fulltext
本電子全文僅授權使用者為學術研究之目的,進行個人非營利性質之檢索、閱讀、列印。請遵守中華民國著作權法之相關規定,切勿任意重製、散佈、改作、轉貼、播送,以免觸法。
論文使用權限 Thesis access permission:校內一年後公開,校外永不公開 campus withheld
開放時間 Available:
校內 Campus: 已公開 available
校外 Off-campus:永不公開 not available

您的 IP(校外) 位址是 44.222.92.134
論文開放下載的時間是 校外不公開

Your IP address is 44.222.92.134
This thesis will be available to you on Indicate off-campus access is not available.

紙本論文 Printed copies
紙本論文的公開資訊在102學年度以後相對較為完整。如果需要查詢101學年度以前的紙本論文公開資訊,請聯繫圖資處紙本論文服務櫃台。如有不便之處敬請見諒。
開放時間 available 已公開 available

QR Code