中大學術數位典藏-NCU Institutional Repository-提供博碩士論文、考古題、期刊論文、研究計畫等下載:Item 987654321/104758
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 94201/94201 (100%)
Visitors : 81643404      Online Users : 6562
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version


    Please use this identifier to cite or link to this item: https://ir.lib.ncu.edu.tw/handle/987654321/104758


    Title: ILP-based bitwidth-aware subexpression sharing for area minimization in multiple constant multiplication
    Authors: 周景揚;JOU, Jing-Yang;HUANG, Juinn-Dar;LIN, Bu-Ching
    Contributors: 秘書室
    Keywords: Algorithms;bitwidth;Cost engineering;Counting;Digital signal processing;Estimates;finite impulse response (FIR) filter;integer linear programming (ILP);Minimization;multiple constant multiplication (MCM);Multiplication;Optimization
    Date: 2014-01-01
    Issue Date: 2026-04-23 11:57:26 (UTC+8)
    Publisher: Maruzen Co., Ltd/Maruzen Kabushikikaisha;The Institute of Electronics, Information and Communication Engineers
    Abstract: 摘要: The notion of multiple constant multiplication (MCM) is extensively adopted in digital signal processing (DSP) applications such as finite impulse filter (FIR) designs. A set of adders is utilized to replace regular multipliers for the multiplications between input data and constant filter coefficients. Though many algorithms have been proposed to reduce the total number of adders in an MCM block for area minimization, they do not consider the actual bitwidth of each adder, which may not estimate the hardware cost well enough. Therefore, in this article we propose a bitwidth-aware MCM optimization algorithm that focuses on minimizing the total number of adder bits rather than the adder count. It first builds a subexpression graph based on the given coefficients, derives a set of constraints for adder bitwidth minimization, and then optimally solves the problem through integer linear programming (ILP). Experimental results show that the proposed algorithm can effectively reduce the required adder bit count and outperforms the existing state-of-the-art techniques.
    其他題名: IEICE Trans. Fundamentals
    出版者: The Institute of Electronics, Information and Communication Engineers
    出版日期: 2014
    出處: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2014/04/01, Vol.E97.A(4), pp.931-939
    資源來源: J-STAGE Free
    版權: 2014 The Institute of Electronics, Information and Communication Engineers
    識別號: ISSN: 1745-1337
    識別號: ISSN: 0916-8508
    識別號: EISSN: 1745-1337
    識別號: DOI: 10.1587/transfun.E97.A.931
    Appears in Collections:[Office of Secretariat] journal & Dissertation

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML35View/Open


    All items in NCUIR are protected by copyright, with all rights reserved.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 隱私權政策聲明