Zobrazeno 1 - 6
of 6
pro vyhledávání: '"N R Latha"'
Autor:
G R Prasad, N R Latha
Publikováno v:
International Journal of Electronics, Communications, and Measurement Engineering. 9:46-59
As the size of devices are scaling down at rapid pace, the interconnect delay play a major part in performance of IC chips. Therefore minimizing delay and wire length is the most desired objective. FLUTE (Fast Look-Up table) presented a fast and accu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a3bed6108d226736f077f8809174dcbe
https://doi.org/10.4018/ijecme.2020010104
https://doi.org/10.4018/ijecme.2020010104
Autor:
S. N., Sagar Reddy, N. Y., Manu, M., Shreyas, S., Mohammad Tanwir, G. B., Pallavi, N. R., Latha
Publikováno v:
Grenze International Journal of Engineering & Technology (GIJET); 2022 Special Issue, Vol. 8, p38-42, 5p
Autor:
G. R. Prasad, N. R. Latha
Publikováno v:
Advances in Intelligent Systems and Computing ISBN: 9789811524134
Constructing fast and efficient Rectilinear Steiner Minimal Tree (RSMT) for modern VLSI circuit is a major issue in VLSI physical design (PD). Further, minimizing runtime and wire length is the most desired objective. The existing FLUTE-based VLSI ro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a759691d1017eacabaecaaf0f5432cd7
https://doi.org/10.1007/978-981-15-2414-1_37
https://doi.org/10.1007/978-981-15-2414-1_37
Autor:
G Shyamala, N R Latha
Publikováno v:
International Journal of Computer Applications. 148:7-12
e present a survey of the different approaches that can be parallelized and also the parallel algorithms available today with special concern to Rectilinear steiner tree for VLSI Design and their appropriateness for high-performance computing. Thus,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::839c9a53dd96f441d5ffe6c8230cc99b
https://doi.org/10.5120/ijca2016911006
https://doi.org/10.5120/ijca2016911006
Publikováno v:
2017 International Conference on Inventive Communication and Computational Technologies (ICICCT).
Minimum spanning tree (MST) is one among the most studied combinatorial problems with practical applications in VLSI layout and routing, wireless communication and distributed networks, current problems in biology and medicine such as cancer detectio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::07cc3f8f8ba66b39b52bfd953c2a4d38
https://doi.org/10.1109/icicct.2017.7975216
https://doi.org/10.1109/icicct.2017.7975216
Autor:
N. R., Latha, Prasad, G. R.
Publikováno v:
International Journal of Electrical & Computer Engineering (2088-8708); Jun2020 (Part II), Vol. 10 Issue 3, p2959-2968, 10p