skip to main content
research-article

Resource sharing among mutually exclusive sum-of-product blocks for area reduction

Published: 25 July 2008 Publication History

Abstract

In state-of-the-art digital designs, arithmetic blocks consume a major portion of the total area of the IC. The arithmetic sum-of-product (SOP) is the most widely used arithmetic block. Some of the examples of SOP are adder, subtractor, multiplier, multiply-accumulator (MAC), squarer, chain-of-adders, incrementor, decrementor, etc. In this article, we introduce a novel, area-efficient architecture to share different SOP blocks which are used in a mutually exclusive manner. We implement the core functions of the largest SOP only once and reuse different parts of the core subblocks for all other SOP operations with the help of multiplexers. This architecture can be used in the nontiming-critical paths of the design, to save significant amounts of area. Our experimental data shows that the proposed sharing-based architecture results in about 37% area savings compared to the results obtained from a commercially available best-in-class datapath synthesis tool. In addition, our proposed shared implementation consumes about 18% less power. These improvements were verified on placed-and-routed designs as well.

References

[1]
Dempster, A. G. and Macleod, M. 2004. Using all signed-digit representations to design single integer multipliers using subexpression elimination. In Proceedings of the (ISCAS), 165--168.
[2]
Devadas, S. A. R. N. 1989. Algorithms for hardware allocation in data path synthesis. IEEE Trans. Comput.-Aided Des. Integr. Circ. Syst. 8, 7, 768--781.
[3]
Flores, P., Monteiro, J., and Costa, E. 2005. An exact algorithm for the maximal sharing of partial terms in multiple constant multiplications. In Proceedings of the International Conference on Computer-Aided Design (ICCAD), 13--16.
[4]
Knowles, S. 1999. A family of adders. In Proceedings of the IEEE Symposium on Computer Arithmetic, 30--34.
[5]
Mathur, A. S. S. 2001. Improved merging of datapath operators using information content and required precision analysis. In Proceedings of the 38th Conference on Design Automation (DAC), 462--467.
[6]
Peiro, M., Boemo, M., and Wanhammar, E. 2002. Design of high-speed multiplierless filters using a nonrecursivesigned common subexpression algorithm. IEEE TADSP 49, 3, 196--203.
[7]
Rabaey, J. M., Chu, C., Hoang, P., and Potkonjak, M. 1991. Fast prototyping of datapath-intensive architectures. Des. Test Comput. 8, 2, 40--51.
[8]
Whitney, T. S. and Earl, A. J. 2003. A comparison of Dadda and Wallace multiplier delays. Adv. Signal Process. Algor. Arch. Implement. XIII 5205, 552--560.
[9]
Xu, F. C. C. and Jong, C. 2004. Efficient algorithms for common subexpression elimination in digital filter design. In Proceedings of the IEEE Conference on Acoustics, Speech, and Signal Processing, 137--140.
[10]
Yoon, S., Chong, J., and Lin, C. 2004. An area optimization method for digital filter design. The ETRI J. 26, 6, 545--554.

Cited By

View all

Index Terms

  1. Resource sharing among mutually exclusive sum-of-product blocks for area reduction

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Transactions on Design Automation of Electronic Systems
    ACM Transactions on Design Automation of Electronic Systems  Volume 13, Issue 3
    July 2008
    370 pages
    ISSN:1084-4309
    EISSN:1557-7309
    DOI:10.1145/1367045
    Issue’s Table of Contents
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Journal Family

    Publication History

    Published: 25 July 2008
    Accepted: 01 December 2007
    Revised: 01 August 2007
    Received: 01 March 2007
    Published in TODAES Volume 13, Issue 3

    Permissions

    Request permissions for this article.

    Check for updates

    Qualifiers

    • Research-article
    • Research
    • Refereed

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)1
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 03 Jan 2025

    Other Metrics

    Citations

    Cited By

    View all

    View Options

    Login options

    Full Access

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media