Open Science Research Excellence

Open Science Index

Commenced in January 2007 Frequency: Monthly Edition: International Publications Count: 29526


Select areas to restrict search in scientific publication database:
4003
Comparative Study of Evolutionary Model and Clustering Methods in Circuit Partitioning Pertaining to VLSI Design
Abstract:
Partitioning is a critical area of VLSI CAD. In order to build complex digital logic circuits its often essential to sub-divide multi -million transistor design into manageable Pieces. This paper looks at the various partitioning techniques aspects of VLSI CAD, targeted at various applications. We proposed an evolutionary time-series model and a statistical glitch prediction system using a neural network with selection of global feature by making use of clustering method model, for partitioning a circuit. For evolutionary time-series model, we made use of genetic, memetic & neuro-memetic techniques. Our work focused in use of clustering methods - K-means & EM methodology. A comparative study is provided for all techniques to solve the problem of circuit partitioning pertaining to VLSI design. The performance of all approaches is compared using benchmark data provided by MCNC standard cell placement benchmark net lists. Analysis of the investigational results proved that the Neuro-memetic model achieves greater performance then other model in recognizing sub-circuits with minimum amount of interconnections between them.
Digital Object Identifier (DOI):

References:


[1] C. J. Alpert and A. B. Kahng, "Recent Directions in Net list Partitioning: A Survey,'' Integration: the VLSI Journal, 19(1-2), 1995, pp. 1 - 81.
[2] Pinaki Mazumber, Elizabeth M. Rudnick, ''Genetic Algorithms for VLSI Design, Layout &Test Automation'', Prentice Hall PTR, 1998.
[3] B. W. Kernighan and S. Lin, ''An Efficient Heuristic Procedure for Partitioning Graphs'', Bell System Tech. Journal, vol. 49, Feb.1970, pp. 291-307.
[4] C. M. Fiduccia and R. M. Mattheyses, ''A Linear-time heuristic for Improving Network partitions'', Proc. ACM/IEEE Design Automation Conf., 1982, pp 175-181.
[5] H. K. Lam, S. H. Ling, F. H. F. Leung and P. K. S. Tam, ''Tuning of the structure and parameters of neural network using an improved genetic algorithm'', in Proc. 27th Annual Conf. of the IEEE Industrial Electronics Society (IECON 01), Denver, Colorado, 29 Nov.-2 Dec. 2001, pp. 25-30.
[6] N. J. Radcliffe, and P. D. Surry, "Formal Memetic Algorithms," Evolutionary Computing, Springer- Verlag, Berlin, 1994, pp 1-16.
[7] Data Mining by Bhavani Thuraisingham
[8] Ordonez.C, Omiecinski.E ''Efficient disk-based K-Means clustering for relational databases''
[9] M. Srinivas and K. M Patnaik, ''Genetic algorithm a Survey'', IEEE comput27, 1994, 17-26.
[10] S. S. Iyehgar, L. Prasad & D. Mortan in S. S. Iyengar, ed, ''Structure of Genetic Algorithm in Biological System'' (CRC press, 1992).
[11] T.T Chow, Z. Lin, C.L song & G. Q. Zhanan Huhan, ''Applying neural network & Genetic algorithm in chiller System optimization'', IEEE Paper June1997.
[12] Prof K. A Sumithra Devi, N. P. Banashree & Dr Annamma Abraham, ''An Evolutionary time-series Model for partitiononig a Circuit pertaining to VLSI Design using Neuro-memetic Algorthim'' , in proc. 4th IASTED International Conference on Circuit, Signal & System, San Francisco, USA, 20 Nov.-22 Nov .2006, pp 325-329.

Vol:13 No:04 2019Vol:13 No:03 2019Vol:13 No:02 2019Vol:13 No:01 2019
Vol:12 No:12 2018Vol:12 No:11 2018Vol:12 No:10 2018Vol:12 No:09 2018Vol:12 No:08 2018Vol:12 No:07 2018Vol:12 No:06 2018Vol:12 No:05 2018Vol:12 No:04 2018Vol:12 No:03 2018Vol:12 No:02 2018Vol:12 No:01 2018
Vol:11 No:12 2017Vol:11 No:11 2017Vol:11 No:10 2017Vol:11 No:09 2017Vol:11 No:08 2017Vol:11 No:07 2017Vol:11 No:06 2017Vol:11 No:05 2017Vol:11 No:04 2017Vol:11 No:03 2017Vol:11 No:02 2017Vol:11 No:01 2017
Vol:10 No:12 2016Vol:10 No:11 2016Vol:10 No:10 2016Vol:10 No:09 2016Vol:10 No:08 2016Vol:10 No:07 2016Vol:10 No:06 2016Vol:10 No:05 2016Vol:10 No:04 2016Vol:10 No:03 2016Vol:10 No:02 2016Vol:10 No:01 2016
Vol:9 No:12 2015Vol:9 No:11 2015Vol:9 No:10 2015Vol:9 No:09 2015Vol:9 No:08 2015Vol:9 No:07 2015Vol:9 No:06 2015Vol:9 No:05 2015Vol:9 No:04 2015Vol:9 No:03 2015Vol:9 No:02 2015Vol:9 No:01 2015
Vol:8 No:12 2014Vol:8 No:11 2014Vol:8 No:10 2014Vol:8 No:09 2014Vol:8 No:08 2014Vol:8 No:07 2014Vol:8 No:06 2014Vol:8 No:05 2014Vol:8 No:04 2014Vol:8 No:03 2014Vol:8 No:02 2014Vol:8 No:01 2014
Vol:7 No:12 2013Vol:7 No:11 2013Vol:7 No:10 2013Vol:7 No:09 2013Vol:7 No:08 2013Vol:7 No:07 2013Vol:7 No:06 2013Vol:7 No:05 2013Vol:7 No:04 2013Vol:7 No:03 2013Vol:7 No:02 2013Vol:7 No:01 2013
Vol:6 No:12 2012Vol:6 No:11 2012Vol:6 No:10 2012Vol:6 No:09 2012Vol:6 No:08 2012Vol:6 No:07 2012Vol:6 No:06 2012Vol:6 No:05 2012Vol:6 No:04 2012Vol:6 No:03 2012Vol:6 No:02 2012Vol:6 No:01 2012
Vol:5 No:12 2011Vol:5 No:11 2011Vol:5 No:10 2011Vol:5 No:09 2011Vol:5 No:08 2011Vol:5 No:07 2011Vol:5 No:06 2011Vol:5 No:05 2011Vol:5 No:04 2011Vol:5 No:03 2011Vol:5 No:02 2011Vol:5 No:01 2011
Vol:4 No:12 2010Vol:4 No:11 2010Vol:4 No:10 2010Vol:4 No:09 2010Vol:4 No:08 2010Vol:4 No:07 2010Vol:4 No:06 2010Vol:4 No:05 2010Vol:4 No:04 2010Vol:4 No:03 2010Vol:4 No:02 2010Vol:4 No:01 2010
Vol:3 No:12 2009Vol:3 No:11 2009Vol:3 No:10 2009Vol:3 No:09 2009Vol:3 No:08 2009Vol:3 No:07 2009Vol:3 No:06 2009Vol:3 No:05 2009Vol:3 No:04 2009Vol:3 No:03 2009Vol:3 No:02 2009Vol:3 No:01 2009
Vol:2 No:12 2008Vol:2 No:11 2008Vol:2 No:10 2008Vol:2 No:09 2008Vol:2 No:08 2008Vol:2 No:07 2008Vol:2 No:06 2008Vol:2 No:05 2008Vol:2 No:04 2008Vol:2 No:03 2008Vol:2 No:02 2008Vol:2 No:01 2008
Vol:1 No:12 2007Vol:1 No:11 2007Vol:1 No:10 2007Vol:1 No:09 2007Vol:1 No:08 2007Vol:1 No:07 2007Vol:1 No:06 2007Vol:1 No:05 2007Vol:1 No:04 2007Vol:1 No:03 2007Vol:1 No:02 2007Vol:1 No:01 2007