Interactive Visualization of the Printed Circuits Tracing Algorithms for Educational Purposes
https://doi.org/10.35596/1729-7648-2022-28-4-72-79
Abstract
A software module that allows interactive demonstration of maze routing algorithms for tracing printed conductors, which, during their operation, use a grid representation of a discrete working space of a printed circuit board has been developed. The main difference between the developed module and the software of similar purpose is the possibility of step-by-step annotated execution of various algorithms for tracing printed conductors with the possibility of changing the order of routing user-specified conductors. The interrelation of algorithms for finding the shortest paths on graphs and algorithms for tracing printed conductors and the influence of the order of making connections between pairs of contact pads on the length of printed electrical connections are considered. An analysis of the advantages and disadvantages of the wave algorithm (Lee algorithm) and the heuristic algorithm A* was carried out with a description of their step-by-step operation. The use of the development is justified when giving lectures and conducting laboratory research on the theoretical foundations of automation systems for the design of radio electronic equipment and contributes to solving the complex problem of digitalization of the educational process with the help of visualization programs that allow you to observe the results of the algorithms they implement on various sets of initial data.
About the Author
D. O. Petrov
Brest State Technical University
Belarus
Belarus
Petrov Dmitriy Olegovich, Cand. of Sci., Associate Professor of the Computer and Computer Sciences Department
224017, Brest, Moskovskaya St., 267
Tel. +375 29 523-87-23
References
1. Moglan D. (2019) The Didactic Potential of Using Algorithm Visualization Systems in the Process of Programming Teaching. Otkrytoe Obrazovanie [Open Education]. 23 (2), 31–41 (in Russian).
2. Tsehan O. B. (2012) Educational Visualizer Software for Directed Search Algorithm on Vector Lattice. Informatizaciya Obrazovaniya – 2012: Pedagogicheskie Osnovy Razrabotki i Ispol’zovaniya Elektronnyh Obrazovatel’nyh Resursov: Mater. Mezhdunar. Nauch. Konf. [Informatization of Education – 2012: Pedagogical Foundations for the Development and Use of Electronic Educational Resources: Materials of International Scientific Conference]. Minsk, Oct. 24–27, 2012. Minsk, Belarussian State University. 79–83 (in Russian).
3. Kazakov M. A., Korneev G. A., Shalyto A. A. (2003) Development of the Logic of Algorithms Visualizers Based on Finite State Machines. Telekommunikacii i Informatizaciya Obrazovaniya [Telecommunications and Informatization of Education]. (6), 27–58 (in Russian).
4. Verenich I. U., Lysenko U. V. (2011) Planar and Coordinate Tracers in Practice. Vestnik Uzhno-Ural’skogo Gosudarstvennogo Universiteta [Bulletin of South Ural State University]. (2), 30–33 (in Russian).
5. Bershadskij A. M., Gudkov P. A., Podmar’kova E. M. (2021) PCB Routing Improvement Algorithm. Modeli, Sistemy, Seti v Ekonomike, Tekhnike, Prirode i Obshchestve [Models, Systems, Networks in Economics, Technology, Nature and Society]. (3), 80–90 (in Russian).
6. Lee C. Y. (1961) An Algorithm for Path Connections and its Applications. IRE Transactions on Electronic Computers. (10), 346–365.
7. Rubin F. (1974) The Lee Path Connection Algorithm. IEEE Transactions on Computers. C-23 (9), 907–914.
8. Moore E. F. (1959) The Shortest Path Through a Maze. Proc. International Symposium on the Theory of Switching. USA, Harvard University Press. 285–292.
9. Hart P. E., Nilsson N. J., Raphael B. (1968) A Formal Basis for the Heuristic Determination of Minimum Cost Path. IEEE Transactions on Systems Science and Cybernetics. 4 (2), 100–107.
10. Clow G. W. (1984) A Global Routing Algorithm for General Cells. 21<sup>st</sup> Design Automation Conference Proceedings, June 25. 45–51.
11. Yuan C., Xiang J. (2018) ASA-Routing: a-Star Adaptive Routing Algorithm for Network-on-Chips. 18<sup>th</sup> International Conference, ICA3PP 2018, Proceedings, Part II, Guangzhou, China, Nov. 15–17. 187–198.
12. Chen Huang-Yu, Chang Yao-Wen (2009) Global and Detailed Routing. Electronic Design Automation. Boston, Morgan Kaufmann. Chapter 12. 687–749.
Review
For citations:
Petrov D.O. Interactive Visualization of the Printed Circuits Tracing Algorithms for Educational Purposes. Digital Transformation. 2022;28(4):72-79. (In Russ.) https://doi.org/10.35596/1729-7648-2022-28-4-72-79
Views: 375
Email this article 