You are here

AKTİF FİLTRELER İÇİN DEVRE ELEMANI DEĞERLERİNİN KARINCA KOLONİ ALGORİTMASI KULLANARAK SEÇİMİ

COMPONENT VALUE SELECTION FOR ACTIVE FILTERS USING ANT COLONY ALGORİTHM

Journal Name:

Publication Year:

Author NameUniversity of AuthorFaculty of Author
Abstract (2. Language): 
In the realization of analogue electronic circuits, it is common practice to specify discrete passive component values from a range of manufactured preferred values because of costs. The original design typically results in values that do not all coincide with preferred value and conventionally the designer selects the nearest preferred value thus causing a design deviation. In general a better set of preferred values will exist in the discrete domain of preferred component values. This set will be in a solution space of all possible component-value combinations that is a highly-complex combinatorial search problem. The heuristic algorithms are able to find the global minima in a error surface. They seems to be as a promising for designing analogue circuits. This paper shows that Ant colony optimization algorithm which is based on the behavior of real ant colonies can be successfully used to search this space. The application chosen is a second order state variable active filter. Fully-discrete and semi-integrated forms are considered. The designs produced are much superior to those achieved using the conventional method.
Abstract (Original Language): 
Analog elektronik devrelerin tasarımında, maliyetler nedeniyle, ayrık pasif eleman değerlerini belirli değerlerde üretilmiş standart serilerdeki elemanlardan belirlemek yaygın uygulamadır. Orijinal tasarımda ortaya çıkan değerler çoğunlukla, standart seri değerleri ile tam olarak örtüşmemektedir ve geleneksel tasarımcılar en yakın değerli elemanları seçmektedir. Bu durum bir tasarım sapmasına neden olmaktadır. Genelde standart seri elemanlarının oluşturduğu tüm uzayda daha iyi bir çözüm seti var olacaktır. Mümkün olan bütün eleman değerlerinden en uygun setin seçilmesi oldukça kompleks bir ayrık araştırma problemidir. Hata yüzeyinin küresel minimasını uygun süre içerisinde bulma kabiliyetine sahip sezgisel algoritmalar, analog devre tasarımı için ümit verici yaklaşımlar olarak görülmektedir. Bu çalışmada, gerçek karıncaların yiyecek ve yön bulma kabiliyetlerinden esinlenerek ortaya çıkmış karınca koloni optimizasyon algoritmasının, bu araştırma uzayında başarıyla kullanılabileceği gösterilmiştir. Uygulama tümüyle ayrık ve yarı tümdevre formunda seçilen ikinci derece durum değişkenli aktif filtre üzerinde yapılarak, geleneksel tasarım yöntemlerine göre çok daha iyi tasarımlar sağlanmıştır.
41-53

REFERENCES

References: 

Aguirre M.M.A., Torralba A., Ch´avez J., Franquelo L.G. (1994): “Sizing of Analog Cells by
means of a Tabu Search Approach”, In Proceedings IEEE International Symposium on
Circuits and Systems, C.1, s. 375-378.
Corne D., Dorigo M., Glover F. (1999): “New Ideas In Optimization”, McGraw-Hill.
Di Caro G., Dorigo M. (1998): “Mobile Agents for Adaptive Routing”, Proc. of 31 st Hawaii
Conf. On Systems Sciences(HICSS-31), Hawaii.
Dorigo M., Maniezzo V., Colorni A. (1991): “Positive Feedback as A Search Strategy”,
Technical Report N. 91-016, Politecnico di Milano.
Gambardella L.M., Dorigo M. (1997): “HAS-SOP: Hybrid Ant System for the Sequential
Ordering Problem”, Technical Report No.IDSIA97-11, IDSIA, Lugano, Switzerland.
Gambardella L.M., Taillard E., Agazzi G. (1999): “MACS-VRPTW: A Multiple Ant Colony
System for Vehicle Routing Problems with Time Windows”, Technical Report IDSIA-06,
Switzerland.
Grimbleby J.B. (2000): “Automatic Analogue Circuit Synthesis using Genetic Algorithms”,
IEE Proc. Circuits Devices Syst., C.147, No. 6, s. 319-323.
Gupta R., Ballweber B.M., Allstot D.J. (2001): “Design and Optimization of CMOS FR
Power Amplifiers”, IEEE Journal of Solid-State Circuits, C.36, s. 166-175.
Hiroyasu T., Miki M., Ono Y., Minami Y. (2000): “Ant Colony for Continuous Functions”,
The Science and Engineering Doshisha University, C:XX, No.Y.
Horrocks D.H., Khalifa Y.M.A. (1994): “Genetically Derived Filters Circuits using Preferred
Value Components”, Proc. of IEE colloq. On Linear Analogue Circuits and Systems,
Oxford UK.
Horrocks D.H., Spittle M.C. (1995): “Component Value Selection for Active Filters using
Genetic Algorithms”, C.2, s. 553-556.
Horrocks D.H., Khalifa Y.M.A. (1995): “Genetically Evolved FDNR and Leap-Frog Active
Filters using Preferred Components Values”, Proc. European Conference on Circuit
Theory and Design, Istanbul, Türkiye, s. 359-362.
Horrocks D.H., Khalifa Y.M.A. (1996): “Genetic Algorithm Design of Electronic Analogue
Circuits Including Parasitic Effects”, Proc. First On-line Workshop on Soft Computing
(WSC1), Nagoya University, Japan, s. 71-78.
Jayaraman R., Rutenbar R.A. (1987): “Floorplanning by Annealing on A Hypercube
Multiprocessor”, Proc. IEEE International Conference on CAD, s. 346-349.
Kalınlı A., Karaboğa N., Karaboğa D. (2001): “A Modified Touring Ant Colony Optimisation
Algorithm for Contounous Functions”, The Sixteenth International Symposium on
Computer and Information Sciences (ISCIS XVI), Işık University, Antalya, s. 437-444.
Karaboğa D., Kalınlı A., Karaboğa N. (2001): “Touring Ant Colony Algorithm with
Frequency Based Memory for Contounous Optimisation”, 10th Turkish Symposium on
Artificial Intelligence and Neural Networks (TAINN 2001), Doğu Akdeniz Üniversitesi,
KKTC, s. 94-102.
Kerwin W.J., Huelsman L.P., Newcomb R.W. (1967): “State-Variable Synthesis for
Insensitive Integrated Circuit Transfer Functions”, IEEE J. Solid State Circuits, C.SC-2, s.
87-92.
Kruiskamp W., Leenaerts D. (1995): “DARWIN: CMOS Opamp Synthesis by means of A
Genetic Algorithm”, Proceedings of the 32nd Design Automation Conference, New York,
Association for Computing Machinary, s. 433-438.
Koza J.R., Bennett III F.H., Andre D., Keane M.A. (1996): “Automated Design of both the
Topology and Sizing of Analog Electrical Circuits using Genetic Programming”, In Gero,
John S. and Sudweeks, Fay (editors), Artificial Intelligence in Design’96, Dordrecht:
Kluwer Academic Publishers, s. 151-170.
Kuntz P., Layzell P., Snyers D. (1997): “A Colony of Ant-like Agents for Partitioning in
VLSI Technology”, In: Proc. 4th Int. Conf. on Artificial Life (ECAL97), Husbands, P. and
Harvey, I. (eds.), MIT Press.
Lodha S.K., Bhatia D. (1998): “Bipartitioning Circuits using Tabu Search”, Proceedings of
Eleventh Annual IEEE International Conference ASIC, s. 223-227.
National Semiconductor Corp. (1993): “Data Aquisition Data Book”, National
Semiconductors Corp., Santa Clara, CA, USA, s. 7.5-7.31.
Ning Z., Kole M., Mouthaan T., Wallings H. (1992): “Analog Circuits Design Automation for
Performance”, Proceedings of the 14th CICC, New York, I1 Press, s. 8.2.1.-8.2.4.
Paulino N.F., Goes J.C., Steiger A. (2001): “Design Methodology for Optimization of Analog
Building Blocks using Genetic Algorithms”, The 2001 IEEE International Symposium on
Circuits and Systems, C.5, s. 435-438.
Sadiq S.M., Youssef H. (1998): “CMOS/BiCMOS Mixed Design using Tabu Search”,
Electronics Letters, C.34, No.14, s. 1395-1396.
Sadiq S.M., Youssef H., Zahra M.M. (1998): “Tabu Search Based Circuit Optimization”,
Proceedings of the 8th Great Lakes Symposium on VLSI, s. 338-343.
Sadiq S.M., Youssef H., Barada H.R., Al-Yamani A. (2000): “A Parallel Tabu Search
Algorithm for VLSI Standard-Cell Placement”, Proceedings of the IEEE International
Symposium on Circuits and Systems ISCAS 2000, C.2, s. 581-584, Switzerland.
Stützle T., Dorigo M. (1999): “ACO Algorithms for Quadratic Assignment Problem”, In D.
Corne, M. Dorigo and F. Glover, editors, New Ideas in Optimizations, McGraw-Hill.
Tao L., Zhao Y.C. (1993): “Effective Heuristic Algorithms for VLSI-Circuit Partition”, IEE
Proceedings G: Circuits, Devices and Systems, C.140, No.2, s.127-134.
Wodrich M. (1996): “Ant Colony Optimization”, Under Graduate Thesis, Department of
Electrical and Electronic Engineering, University of Cape Town, South Africa, 1996.
Wong D.F., Liu C.L. (1986): “A New Algorithm for Floorplan Design”, Proceedings of the
23rd ACM/IEEE Design Automation Cenference, s. 101-107.

Thank you for copying data from http://www.arastirmax.com