Article

Efficient and Effective Redundancy Removal for Million-Gate Circuits

Authors:

M. Berkelaar,

K. Van EijkAuthors Info & Claims

DATE '02: Proceedings of the conference on Design, automation and test in Europe

Page 1088

Published: 04 March 2002 Publication History

Get Access

Abstract

No abstract available.

Cited By

View all

Cabodi GMurciano MNocco SQuer S(2008)Boosting interpolation with dynamic localized abstraction and redundancy removalACM Transactions on Design Automation of Electronic Systems10.1145/1297666.129766913:1(1-20)Online publication date: 6-Feb-2008
https://dl.acm.org/doi/10.1145/1297666.1297669
Cabodi GMurciano MNocco SQuer SHassoun S(2006)Stepping forward with interpolants in unbounded model checkingProceedings of the 2006 IEEE/ACM international conference on Computer-aided design10.1145/1233501.1233661(772-778)Online publication date: 5-Nov-2006
https://dl.acm.org/doi/10.1145/1233501.1233661
Dubrova ETeslenko MMartinelli A(2005)Kauffman networksProceedings of the 2005 IEEE/ACM International conference on Computer-aided design10.5555/1129601.1129670(479-484)Online publication date: 31-May-2005
https://dl.acm.org/doi/10.5555/1129601.1129670

Efficient and Effective Redundancy Removal for Million-Gate Circuits
1. Hardware

Recommendations

Synthesis of Sequential Circuits by Redundancy Removal and Retiming
Special issue on test synthesis

In this paper we propose a method for synthesizing sequential circuits to reduce the number of gates and flip-flops by removing both combinationally and sequentially redundant faults. In order to remove sequentially redundant faults these faults are ...
Combinational and sequential logic optimization by redundancy addition and removal

This paper presents a method for multilevel logic optimization for combinational and synchronous sequential circuits. The circuits are optimized through iterative addition and removal of redundancies. Adding redundant wires to a circuit may cause one or ...
Redundancy identification and removal in combinational circuits

Identification and removal of redundancy in digital circuits is important for improving their testability as well as reducing their area. This paper presents a method of identifying and removing redundancy in combinational circuits by analyzing circuit ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

DATE '02: Proceedings of the conference on Design, automation and test in Europe

March 2002

1072 pages

ISBN:0769514715

Publisher

IEEE Computer Society

United States

Publication History

Published: 04 March 2002

Check for updates

Qualifiers

Article

Conference

DATE02

Sponsor:

SIGDA

DATE02: Design, Automation and Test in Europe

March 4 - 8, 2002

Acceptance Rates

Overall Acceptance Rate 518 of 1,794 submissions, 29%

Upcoming Conference

DATE '25

Sponsor:
sigda

Design, Automation and Test in Europe

March 31 - April 2, 2025

Lyon , France

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
82
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 13 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Cabodi GMurciano MNocco SQuer S(2008)Boosting interpolation with dynamic localized abstraction and redundancy removalACM Transactions on Design Automation of Electronic Systems10.1145/1297666.129766913:1(1-20)Online publication date: 6-Feb-2008
https://dl.acm.org/doi/10.1145/1297666.1297669
Cabodi GMurciano MNocco SQuer SHassoun S(2006)Stepping forward with interpolants in unbounded model checkingProceedings of the 2006 IEEE/ACM international conference on Computer-aided design10.1145/1233501.1233661(772-778)Online publication date: 5-Nov-2006
https://dl.acm.org/doi/10.1145/1233501.1233661
Dubrova ETeslenko MMartinelli A(2005)Kauffman networksProceedings of the 2005 IEEE/ACM International conference on Computer-aided design10.5555/1129601.1129670(479-484)Online publication date: 31-May-2005
https://dl.acm.org/doi/10.5555/1129601.1129670

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Recommendations

Synthesis of Sequential Circuits by Redundancy Removal and Retiming

Combinational and sequential logic optimization by redundancy addition and removal

Redundancy identification and removal in combinational circuits

Comments

Published In

Sponsors

Publisher

Publication History

Check for updates

Qualifiers

Conference

Acceptance Rates

Upcoming Conference

Other Metrics

Article Metrics

Other Metrics

Cited By

Login options

Full Access

PDF

eReader

Abstract

Cited By

Recommendations

Synthesis of Sequential Circuits by Redundancy Removal and Retiming

Combinational and sequential logic optimization by redundancy addition and removal

Redundancy identification and removal in combinational circuits

Comments

Information

Published In

Sponsors

Publisher

Publication History

Check for updates

Qualifiers

Conference

Acceptance Rates

Upcoming Conference

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Get Access

Login options

Full Access

View options

PDF

eReader

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations