Skip to main content

Algorithms for Minimizing Bottleneck Crosstalk in Two-Layer Channel Routing

  • Conference paper
  • First Online:
Book cover Computational Advancement in Communication Circuits and Systems

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 575))

Abstract

Channel routing and crosstalk minimization are important issues while we talk about high-performance circuits for VLSI physical design automation. Interconnection among the net terminals satisfying constraints in an intelligent way is a necessity to realize a circuit in a minimum possible area, as this is a primary requirement to reduce cost as well as to increase yield. In this paper, along with area minimization, the performance of the computed circuits has also been enhanced by computing routing solutions with a specified amount of bottleneck crosstalk in two-layer channel routing. Usually, crosstalk is measured by the amount of overlapping of a pair of nets assigned to adjacent tracks. The crosstalk minimization problem in the reserved two-layer Manhattan channel routing model is NP-hard. Thus, in this paper, heuristic algorithms have been devised to optimize bottleneck crosstalk in order to augment circuit performance in two-layer channel routing. Experimental results obtained are highly encouraging.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. N.A. Sherwani, Algorithms for VLSI Physical Design Automation (Kluwer Academic Publishers, Boston, 1993)

    Book  Google Scholar 

  2. R.K. Pal, 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. T. Yoshimura, E.S. Kuh, Efficient algorithms for channel routing. IEEE Trans. CAD Integr. Circ. Syst. 1, 25–35 (1982)

    Article  Google Scholar 

  4. T. Gao, C.L. Liu, Minimum crosstalk channel routing, in Proceedings of IEEE International Conference on Computer Aided Design (1993), pp. 692–696

    Google Scholar 

  5. A. Pal, A. Chaudhuri, R.K. Pal, A.K. Datta, Hardness of crosstalk minimisation in two-layer channel routing. Integr. VLSI J. 56, 139–147 (2017). ISSN: 0167-9260

    Article  Google Scholar 

  6. M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs (Academic Press, New York, 1980)

    MATH  Google Scholar 

  7. A. Hashimoto, J. Stevens, Wire Routing by Optimizing Channel Assignment within Large Apertures, in Proceedings of the 8th ACM Design Automation Workshop (1971), pp. 155–169

    Google Scholar 

  8. R.K. Pal, A.K. Datta, S.P. Pal, A. Pal, Resolving horizontal constraints and minimizing net wire length for VHV channel routing, in Technical Report, no.: TR/IIT/CSE/92/01, Department of Computer Science and Engineering, IIT, Kharagpur (1992)

    Google Scholar 

  9. R.K. Pal, A.K. Datta, S.P. Pal, A. Pal, 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 (1993), pp. 569–573

    Google Scholar 

  10. R.K. Pal, A.K. Datta, S.P. Pal, M.M. Das, A. Pal, General graph theoretic framework for multi-layer channel routing, in Proceedings of the Eighth VSI/IEEE International Conference on VLSI Design, (Jan. 4–7, 1995), pp. 202–207

    Google Scholar 

  11. A. Pal, D. Kundu, A.K. Datta, T.N. Mandal, R.K. Pal, Algorithms for reducing crosstalk in two-layer channel routing. J. Phys. Sci. 10, 167–177 (2006). (ISSN: 0972-8791)

    Google Scholar 

  12. A. Pal, D. Kundu, A.K. Datta, T.N. Mandal, R.K. Pal, A.K. Datta, A. Chaudhuri, Two algorithms for minimizing crosstalk in two-layer channel routing. Int. J. Emerg. Trends Technol. Comput. Sci. 3(6), 194–204 (2006). (ISSN: 2278-6856)

    Google Scholar 

  13. A.S. LaPaugh, Algorithms for Integrated Circuit Layout: An Analytic Approach, Ph.D. Thesis, Laboratory for Computer Science (Massachusetts Institute of Technology (MIT), Cambridge, 1980)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Tarak Nath Mandal .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Mandal, T.N., Banik, A.D., Dey, K., Mehera, R., Pal, R.K. (2020). Algorithms for Minimizing Bottleneck Crosstalk in Two-Layer Channel Routing. In: Maharatna, K., Kanjilal, M., Konar, S., Nandi, S., Das, K. (eds) Computational Advancement in Communication Circuits and Systems. Lecture Notes in Electrical Engineering, vol 575. Springer, Singapore. https://doi.org/10.1007/978-981-13-8687-9_29

Download citation

  • DOI: https://doi.org/10.1007/978-981-13-8687-9_29

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-13-8686-2

  • Online ISBN: 978-981-13-8687-9

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics