CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

Soft Computing Approach for digital Circuit Layout based on Graph Partitioning

by Maninder Kaur, Kawaljeet Singh
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 15 - Number 1
Year of Publication: 2011
Authors: Maninder Kaur, Kawaljeet Singh
10.5120/1911-2546

Maninder Kaur, Kawaljeet Singh . Soft Computing Approach for digital Circuit Layout based on Graph Partitioning. International Journal of Computer Applications. 15, 1 ( February 2011), 35-39. DOI=10.5120/1911-2546

@article{ 10.5120/1911-2546,
author = { Maninder Kaur, Kawaljeet Singh },
title = { Soft Computing Approach for digital Circuit Layout based on Graph Partitioning },
journal = { International Journal of Computer Applications },
issue_date = { February 2011 },
volume = { 15 },
number = { 1 },
month = { February },
year = { 2011 },
issn = { 0975-8887 },
pages = { 35-39 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume15/number1/1911-2546/ },
doi = { 10.5120/1911-2546 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:03:03.592559+05:30
%A Maninder Kaur
%A Kawaljeet Singh
%T Soft Computing Approach for digital Circuit Layout based on Graph Partitioning
%J International Journal of Computer Applications
%@ 0975-8887
%V 15
%N 1
%P 35-39
%D 2011
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Soft computing based approaches are increasingly being used to solve different NP complete problems, the development of efficient parallel algorithms for digital circuit partitioning, circuit testing, logic minimization and simulation etc. is currently a field of increasing research activity. This paper describes evolutionary based approach for solving circuit-partitioning problem. That implies dividing a circuit into non-overlapping sub circuits while minimizing the number of cuts after the division and balancing the load associated to each one. The paper shows the effective partitioning for achieving peak chip performance and reducing the cost and time of the design and manufacturing process.

References
  1. Alpert, C.J., Kahng, A., (1995). “Recent Developments in Netlist Partitioning: A survey”, in Integration: the VLSI Journal, 19, 1-18.
  2. Kernighan, B.W., Lin S., (1970), “An Efficient Heuristic Procedure for Partitioning Graphs", the Bell Sys. Tech. Journal, 291-307.
  3. Holland, J., (1975), “Adaptation in Natural and Artificial Systems”, Ann Arbor: University of Michigan Press.
  4. Cohoon, J., Paris, W., (1987). “Genetic Placement,” IEEE Transactions on Computer-Aided Design, 6, 956-964.
  5. Louis, S., Rawlins, G., (1991), “Using genetic algorithms to design structures. Technical Report”, Indiana University, Bloomington, IN 47405.
  6. Vemuri, R. M., Vemuri, R.R.,(1990), “Genetic-synthesis: Performance-driven logic synthesis using genetic evolution”, Proc. First Great Lakes Symposium on VLSI, Kalamazoo, MI, 312-317.
  7. Shahookar, K., Mazumdar, P., (1990), “A Genetic Approach to Standard Cell Placement Using Meta-Genetic Parameter Optimization”, IEEE Transactions on Computer-Aided Design, 9, 500-511.
  8. Goldberg, D., (1989), “Genetic Algorithms in Search, Optimization, and Machine Learning. Reading”, MA, Addison-Wesley.
  9. Vignaux, G.A., Michalewicz, Z., (1991), “A genetic algorithm for the linear transportation problem”, IEEE Trans. SMC, 21(2), 445-452.
  10. Kirkpatrick, S., Gelatt, C.D., Jr, Vecchi, M.P., (1983). “Optimization by Simulated Annealing”, Science, 220, 671-680.
  11. Adleman, L., (1994), “Molecular computation of solutions to combinatorial problems”, Science New series, 266,1021-1024.
  12. Lipton, R., (1995), “DNA solution of hard computational problems”, Science, 268, 542-545.
  13. Adleman, L., Rothemund, P., Roweis, S., Winfree, E., (1996), “On Applying Molecular Computation to the Data Encryption Standard”, 2nd DIMACS workshop on SCA based computers, Princeton. 28-48.
  14. Lipton, R., (1996), “Speeding up Computations via Molecular Biology”, 1st DIMACS workshop on SCA based computers. Princeton, 27, 67-74
  15. Shin, H., Kim, C., (1993), “A simple yet effective technique for Partitioning", IEEE Trans. VLSI Systems, 1/3.
  16. Fiducia, C.M., and Mattheyses, R.M., (1982),”A linear time heuristic for improving network partitioning”, in Proc ACM/IEEE Design Automation, 175-181.
  17. Roweis, S., Winfree, E., Burgoyne, R., Chelyapov, N., Goodman, M., Rothemund, P., Adleman, L., (1998), “A Sticker-Based Model for SCA Computation”, Journal of Computational Biology, 4, 615-629.
  18. Zhang, Y. J., Shi, Y. B. , Zhou, S. Q,(2008), “Partitioning algorithm for innovation graph state estimation”, Journal of Harbin Engineering University 29(11), 1166-1171.
  19. Garey, M.R., Johnson, D.S., (1979), “Computers and Interactability: A Guide to the Theory of NP-Completeness”, W.H. Freeman & Company, San Francisco.
  20. Adleman, L., (1996), “On Constructing a Molecular Computer. 1st DIMACS workshop on SCA based computers”, Princeton, In DIMACS series, 27, 1-21.
  21. Robertson, M., Ellington, A., (1997), “New directions in nucleic acid computing: Selected ribosome’s that can implement re-write values”, 3rd DIMACS workshop on DNA based computers,69-73.
Index Terms

Computer Science
Information Sciences

Keywords

Soft computing VLSI circuits Circuit partitioning Genetic algorithms simulated annealing

Powered by PhDFocusTM