Advertisement

Bottleneck Crosstalk Minimization in Three-Layer Channel Routing

  • Tarak Nath Mandal
  • Kaushik Dey
  • Ankita Dutta Banik
  • Ranjan Mehera
  • Rajat Kumar PalEmail author
Chapter
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 995)

Abstract

Channel routing and crosstalk minimization are important concerns while we talk about high-performance circuits for two-, three-, and multilayer VLSI physical design automation. Interconnection among the net terminals satisfying constraints in an intelligent way is a necessity to realize a circuit within a minimum possible area, as this is a principal requirement to diminish cost as well as to augment yield. Introduction of a layer of interconnects may increase the cost of routing; however, as the area is minimized, cost is reduced as well. Eventually, the total wire length is also reduced. Therefore, there are several trade-offs. Besides, in high-performance routing, a designer is supposed to lessen the amount of electrical hazards, viz., crosstalk as much as possible. In this paper, we particularly work on minimizing bottleneck crosstalk in the three-layer HVH routing model. Here, along with area minimization, computed circuits’ performance has also been enhanced by computing precise bottleneck crosstalk HVH channel routing solutions. By the way, the specified crosstalk minimization problem is NP-hard. Thus, in this paper, heuristic algorithms have been devised for computing optimized bottleneck crosstalk channel routing solutions. Computed results of our proposed algorithms are greatly encouraging.

Keywords

Bottleneck crosstalk Channel routing problem Crosstalk minimization Manhattan routing model NP-hard Three-layer routing 

References

  1. 1.
    Sherwani, N.A.: Algorithms for VLSI Physical Design Automation. Kluwer Academic Publishers, Boston (1993)CrossRefGoogle Scholar
  2. 2.
    Pal, R.K.: Multi-Layer Channel Routing: Complexity and Algorithms, Narosa Publishing House, New Delhi (Also published from CRC Press, Boca Raton. USA and Alpha Science International Ltd., UK) (2000)Google Scholar
  3. 3.
    Yoshimura, T., Kuh, E.S.: Efficient algorithms for channel routing. IEEE Trans. CAD of Integr. Circuits Syst. 1, 25–35 (1982)CrossRefGoogle Scholar
  4. 4.
    Gao, T., Liu, C.L.: Minimum crosstalk channel routing. In: Proceedings of IEEE International Conference on Computer-Aided Design, pp. 692–696 (1993)Google Scholar
  5. 5.
    Pal, A., Chaudhuri, A., Pal, R.K., Datta, A.K.: Hardness of crosstalk minimisation in two-layer channel routing. Integr. VLSI J. (Elsevier) (ISSN: 0167-9260), 56, 139–147 (2017)Google Scholar
  6. 6.
    Mandal, T.N., Mehera, R., Datta, A.K., Pal, R.K.: Hardness of crosstalk minimisation in three-layer channel routing. Manuscript (2019)Google Scholar
  7. 7.
    Mandal, T.N., Dutta Banik, A., Dey, K., Mehera, R., Pal, R.K.: Algorithms for minimizing bottleneck crosstalk in two-layer channel routing. In: Presented in the 2nd International Conference on Computational Advancement in Communication Circuit and System (ICCACCS 2018) held in Kolkata, India during November 23–24 (2018)Google Scholar
  8. 8.
    Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York (1980)zbMATHGoogle Scholar
  9. 9.
    Pal, R.K., Datta, A.K., Pal, S.P., Pal, A.: Resolving horizontal constraints and minimizing net wire length for VHV channel routing. Technical Report: TR/IIT/CSE/92/01, Department of Computer Science and Engineering, IIT, Kharagpur (1992)Google Scholar
  10. 10.
    Hashimoto, A., Stevens, J.: Wire routing by optimizing channel assignment within large apertures. In: Proceedings of the 8th ACM Design Automation Workshop, pp. 155–169 (1971)Google Scholar
  11. 11.
    Pal, R.K., Datta, A.K., Pal, S.P., Pal, A.: Resolving horizontal constraints and minimizing net wire length for multi-layer channel routing. In: Proceedings of IEEE Region 10’s Eighth Annual International Conference on Computer, Communication, Control and Engineering (TENCON 1993), vol. 1, pp. 569–573 (1993)Google Scholar
  12. 12.
    Pal, R.K., Datta, A.K., Pal, S.P., Das, M.M., Pal, A.: A general graph theoretic framework for multi-layer channel routing. In: Proceedings of the Eighth VSI/IEEE International Conference on VLSI Design, pp. 202–207, Jan. 4–7, 1995Google Scholar
  13. 13.
    Pal, A., Kundu, D., Datta, A.K., Mandal, T.N., Pal, R.K.: Algorithms for reducing crosstalk in two-layer channel routing. J. Phys. Sci. 10, 167–177, Dec. 2006 (ISSN: 0972-8791)Google Scholar
  14. 14.
    Pal, A., Mandal, T.N., Khan, A., Pal, R.K., Datta, A.K., Chaudhuri, A.: Two algorithms for minimizing crosstalk in two-layer channel routing. Int. J. Emer. Trends Technol. Comput. Sci. (IJETTCS) 3(6), 194–204 (2014) (ISSN: 2278-6856)Google Scholar
  15. 15.
    Schaper, G.A.: Multi-layer channel routing, Ph.D. Thesis, Department of Computer Science, University of Central Florida, Orlando (1989)Google Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2020

Authors and Affiliations

  • Tarak Nath Mandal
    • 1
  • Kaushik Dey
    • 1
  • Ankita Dutta Banik
    • 1
  • Ranjan Mehera
    • 2
  • Rajat Kumar Pal
    • 1
    Email author
  1. 1.Department of Computer Science and EngineeringUniversity of CalcuttaSaltlake, KolkataIndia
  2. 2.Subex IncBroomfieldUSA

Personalised recommendations