Parallel Partitioning Techniques for Logic Minimization Using Redundancy Identification

  • B. Jayaram
  • A. Manoj Kumar
  • V. Kamakoti
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2913)


Redundancy identification is a challenging open problem in logic optimization of Boolean circuits. Partitioning techniques are employed successfully to solve the redundancy identification problem with less time and higher scalability. Any heuristic/algorithm for the Logic optimization problem, and hence the redundancy identification problem is compute-intensive, especially when very high approximation to the optimal solution is demanded. This is because the problems are NP-complete. This necessitates parallel heuristics/algorithms to speed-up the computation process. In this paper, we present a parallel partitioning approach for the logic optimization problem using the concept of redundancy identification. This result finds extensive applications in the area of VLSI CAD tool design.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Chakradhar, S.T., Agrawal, V.D., Rothweiler, S.G.: A Transitive Closure Algorithm for Test Generation. IEEE Trans. Computer Aided Design 12, 1015–1028 (1993)CrossRefGoogle Scholar
  2. 2.
    Cox, H., Rajski, J.: On Necessary and Nonconflicting Assignments in Algorithmic Test Pattern Generation. IEEE Trans. on Computer Aided Design 13, 515–530 (1994)CrossRefGoogle Scholar
  3. 3.
    Kunz, W., Pradhan, D.K.: Recursive Learning: An Attractive Alternative to the Decision Tree for Test Generation in Digital Circuits. In: Proceedings of the IEEE International Test Conference, September 1992, pp. 816–825 (1992)Google Scholar
  4. 4.
    Menon, P.R., Ahuja, H.: Redundancy Removal and Simplification of Combinational Circuits. In: Proceedings of the 10th IEEE VLSI Test Symposium, April 1992, pp. 268–273 (1992)Google Scholar
  5. 5.
    Iyer, M.A., Abramovici, M.: FIRE: A Fault Independent Combinational Redundancy Identification Algorithm. IEEE Trans. on Very Large Scale Integration(VLSI) Systems 4(2) (June 1996)Google Scholar
  6. 6.
    Berkelaar, M., van Eijk, K.: Efficient and Effective Redundancy Removal for Million-Gate Circuits. In: Proc. International Workshop on Logic Synthesis 2001, p. 249 (2001)Google Scholar
  7. 7.
    Hayes, J.P.: On the properties of Irredundant Logic Networks. IEEE Trans. on Computer C-25(9), 884–892 (1976)CrossRefMathSciNetGoogle Scholar
  8. 8.
    Abramovici, M., Breuer, M.A., Friedman, A.D.: Digital Systems Testing and Testable Design. IEEE press, Los Alamitos (2000)Google Scholar
  9. 9.
    Dey, S., Brglez, F., Kedem, G.: Corolla-based circuit partitioning and resynthesis. In: ACM/IEEE 27th Design Automation Conference, June 1990, pp. 607–612 (1990)Google Scholar
  10. 10.
    Maamari, F., Rajski, J.: A Reconvergent Fanout Analysis for Efficient Exact Fault Simulation of Combinational Circuits. In: 18th International Symposium on Fault Tolerant Computing (June 1988)Google Scholar
  11. 11.
    Jayaram, B., Vijuraj, E.V., Manimegalai, R., Joseph, J.P., Kamakoti, V.: Corollas Based Partitioning for Logic Minimization Using Redundancy Identification. Technical Report, IIT Madras (April 2003)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • B. Jayaram
    • 1
  • A. Manoj Kumar
    • 1
  • V. Kamakoti
    • 1
  1. 1.Indian Institute of Technology 

Personalised recommendations