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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
N.A. Sherwani, Algorithms for VLSI Physical Design Automation (Kluwer Academic Publishers, Boston, 1993)
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)
T. Yoshimura, E.S. Kuh, Efficient algorithms for channel routing. IEEE Trans. CAD Integr. Circ. Syst. 1, 25–35 (1982)
T. Gao, C.L. Liu, Minimum crosstalk channel routing, in Proceedings of IEEE International Conference on Computer Aided Design (1993), pp. 692–696
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
M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs (Academic Press, New York, 1980)
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
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)
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
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
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)
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)
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)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Singapore Pte Ltd.
About this paper
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)