DOI: 10.17587/prin.15.296-307

Synthesis of Weight-Based Code Encoders with Summation in the Ring of Residues for a Given Modulus

D. V. Efanov^1,2,3,4, D. Sc. (Engineering), Professor, TrES-4b@yandex.ru, Y. I. Yelina¹, Postgraduate Student, eseniya-elina@mail.ru 1 Peter the Great St. Petersburg Polytechnic University, St. Petersburg, 195251, Russian Federation 2 Russian University of Transport, Moscow, 127994, Russian Federation 3 Tashkent State Transport University, Tashkent, 100167, Uzbekistan 4 Scientific Research and Design Institute "Transport and Construction Safety" LLC, St. Petersburg, 192102, Russian Federation

Corresponding author:Dmitry V. Efanov, D. Sc. (Engineering), Professor, Peter the Great St. Petersburg Polytechnic University, St. Petersburg, 195251, Russian Federation, E-mail: TrES-4b@yandex.ru

To ensure one of the key principles of the development of the state, namely, the achievement of technological sovereignty, it is necessary to build all spheres of life at a qualitatively new technological level, own their own innova¬tive technologies. In modern sanctions realities, the development of enterprises in the Russian Federation cannot be carried out without coordination with partners from Russia, as well as from China, India and other friendly countries. The selection of potential partners can be carried out on the basis of the identified importance of their patented technological solutions. Further ranking of potential partners can be carried out on the basis of the identified importance of their patented technologies. At the same time, in this study it is proposed to use three criteria: the mass nature of the subject of the patented invention in the current period; the predicted mass nature of the subject (technology) in the future period; the popularity of the patent in the information field. The authors have developed a method for predicting the importance of patented technologies and its software implementation..

Keywords: patent, parsing, forecast, clustering, enterprise, information, data, Python

pp. 296—307

For citation:
Efanov D. V., Yelina Y. I. Synthesis of Weight-Based Code Encoders with Summation in the Ring of Residues for a Given Modulus, Programmnaya Ingeneria, 2024, vol. 15, no. 6, pp. 296—307. DOI: 10.17587/ prin.15.296-307.

References:

• Berger J. M. A Note on Error Detection Codes for Asymmetric Channels, Information and Control, 1961, vol. 4, issue 1, pp. 68—73. DOI: 10.1016/S0019-9958(61)80037-5.
• Berger J. M. A Note on Burst Detection Sum Codes, Information and Control, 1961, vol. 4, issue 2—3, pp. 297—299. DOI: 10.1016/S0019-9958(61)80024-7.
• Das D., Touba N. A. Weight-Based Codes and Their Application to Concurrent Error Detection of Multilevel Circuits, Proceedings of 17th IEEE Test Symposium, California, USA, 1999, pp. 370—376. DOI: 10.1109/VTEST.1999.766691.
• Das D., Touba N. A., Seuring M., Gossel M. Low Cost Concurrent Error Detection Based on Modulo Weight-Based Codes, Proceedings o/the IEEE 6th International On-Line Testing Workshop (IOLTW), Spain, Palma de Mallorca, July 3—5, 2000, pp. 171—176. DOI: 10.1109/OLT.2000.856633.
• Sapozhnikov V. V., Sapozhnikov Vl. V., Efanov D. V. Summation codes /or technical diagnostics systems. Vol. 1: Classical Berger codes and their modifications, Moscow, Nauka, 2020, 383 p. (in Russian).
• Sapozhnikov V. V., Sapozhnikov Vl. V., Efanov D. V. Summation codes /or technical diagnostics systems. Vol. 2: Weighted codes with summation, Moscow, Nauka, 2021, 455 p. (in Russian).
• Sapozhnikov V. V., Sapozhnikov Vl. V., Efanov D. V. Weighted codes with summation for the organization of control of logical devices, Ehlektronnoe modelirovanie, 2014, vol. 36, no. 1, pp. 59—80 (in Russian).
• Sapozhnikov V. V., Sapozhnikov Vl. V., Efanov D. V., Ni-kitin D. A. Investigation of the properties of codes with summation with one weighted information discharge in functional control systems, Ehlektronnoe modelirovanie, 2015, vol. 37, no. 1, pp. 25—48 (in Russian).
• Efanov D. V. On the issue of synthesis of generators of modified codes with summation of weighted information bits with the sequence of weight coefficients forming a natural series of numbers, Bulletin of Tomsk State University. Management, computer engineering and computer science, 2016, no. 4 (37), pp. 13—26. DOI: 10.17223/19988605/37/2 (in Russian).
• Efanov D. V., Ten T. A method for synthesizing code generators with the summation of weighted information bits, Informatika i sistemy upravleniya, 2018, no. 4, pp. 82—91. DOI: 10.22250/isu.2018.58.82-91 (in Russian).
• Efanov D. V., Sapozhnikov V. V., Sapozhnikov Vl. V. A method for constructing a family of codes with summation with the lowest total number of undetectable errors in information vectors, Informatika, 2019, vol. 16, no. 3, pp. 101—118 (in Russian).
• Kang M. A Study of Self-Checking Circuit Design Based on Berger Code (in Chinese). Master's dissertation, Harbin Engineering University, 2007.
• Harris D. M., Harris S. L. Digital Design and Computer Architecture, Morgan Kaufmann, 2012, 569 p.
• Efanov D. V. Method of synthesis of weighted code generators with summation, Izvestiya vysshikh uchebnykh zavedenii. Fizika, 2016, vol. 59, no. 8/2, pp. 33—36 (in Russian).
• Bibilo P. N. Synthesis of Modular Multipliers, Programmnaya Ingeneria, 2023, vol. 14, no. 8, pp. 377—387. DOI: 10.17587/prin.14.337-387 (in Russian).
• Sentovich E. M., Singh K. J., Moon C. et al. Sequential Circuit Design Using Synthesis and Optimization, Proceedings IEEE International Conference on Computer Design: VLSI in Computers &Processors, 11-14 October 1992, Cambridge, MA, USA, pp. 328—333. DOI: 10.1109/ICCD.1992.276282.
• Sentovich E. M., Singh K. J., Lavagno L. et al. SIS: A System for Sequential Circuit Synthesis, Electronics Research Laboratory, Department of Electrical Engineering and Computer Science, University of California, Berkeley, 4 May 1992, 45 p.
• Sapozhnikov V. V., Sapozhnikov Vl. V., Urganskov D. I. Universal structures of binary unit counters according to an arbitrary counting module, Ehlektronnoe modelirovanie, 2002, vol. 24, no. 4, pp. 65—81 (in Russian).
• Sapozhnikov V. V., Sapozhnikov Vl. V., Urganskov D. I. Block structure of a binary unit counter according to an arbitrary counting module, Ehlektronnoe modelirovanie, 2005, vol. 27, no. 4, pp. 65—81 (in Russian).
• Saposhnikov V. V., Saposhnikov Vl. V., Urganskov D. I. Composite Structure of Binary Counter of Ones Arbitrary Modulo, Proceedings o/East-West Design & Test Workshop (EWDTW'05), 15—19 September 2005, Odessa, Ukraine, 2005, pp. 102—106.
• Saposhnikov V. V., Saposhnikov Vl. V., Urganskov D. I. Multistage Regular Structure of Binary Counter of Ones Arbitrary Modulo, Proceedings of East-West Design & Test Workshop (EWDTW06), 15—19 September 2006, Sochi, Russia, 2006, pp. 287—290.
• Bibilo P. N., Gorodetskii D. A. Automated Design of Modular Arithmetic Devices: Might CAD Replace an Engineer, Automatic Control and Computer Sciences, 2009, vol. 43, issue 2, pp. 63—73. DOI: 10.3103/S0146411609020023.
• Suprun V. P., Gorodecky D. A. Realization of Addition and Multiplication Operations in Unitary Codesm, Automatic Control and Computer Sciences, 2010, vol. 44, issue 5, pp. 292—301. DOI: 10.3103/S014641161005007X.
• Bibilo P. N., Kiriyenko N. A. Schematic implementation of modular adders in custom CMOS VLSI and FPGA, Izvestiya vysshikh uchebnykh zavedenii. Ehlektronika, 2022, vol. 27, no. 4, pp. 489—505 (in Russian).
---