{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T15:49:56Z","timestamp":1759333796266,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783032067500"},{"type":"electronic","value":"9783032067517"}],"license":[{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-06751-7_6","type":"book-chapter","created":{"date-parts":[[2025,9,30]],"date-time":"2025-09-30T04:29:02Z","timestamp":1759206542000},"page":"76-90","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Convolution Computation Automatic Acceleration"],"prefix":"10.1007","author":[{"given":"Boris Ya.","family":"Steinberg","sequence":"first","affiliation":[]},{"given":"Anton P.","family":"Bagliy","sequence":"additional","affiliation":[]},{"given":"Ilya E.","family":"Bochkov","sequence":"additional","affiliation":[]},{"given":"Andrey N.","family":"Sushko","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,10,1]]},"reference":[{"key":"6_CR1","volume-title":"Teoretiko-chislovye preobrazovaniya v zadachakh cifrovoj obrabotki signalov","author":"VM Chernov","year":"2006","unstructured":"Chernov, V.M., Korepanov, A.O.: Teoretiko-chislovye preobrazovaniya v zadachakh cifrovoj obrabotki signalov. Samara State Aerospace University Publishing, Samara (2006). (in Russian)"},{"key":"6_CR2","unstructured":"Bleikhut, R.: Bystrye algoritmy tsifrovoy obrabotki signalov (in Russian). Mir, Moscow (1989)"},{"key":"6_CR3","unstructured":"Ermolaev, I.: Svertochnyj sloj: bystraya svyortka po metodu Shmuehlya Vinograda (in Russian). In: Habr (2019). https:\/\/habr.com\/ru\/articles\/477718\/. Last accessed 05 August 2025"},{"key":"6_CR4","doi-asserted-by":"publisher","unstructured":"Tomlinson, M., Tjhai, C.J., Ambroze, M.A., Ahmed, M., Jibril, M.: LDPC Codes. In: Ahmed, M. (ed.) Error-Correction Coding and Decoding: Bounds, Codes, Decoders, Analysis and Applications, pp. 315\u2013354. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-51103-0_12","DOI":"10.1007\/978-3-319-51103-0_12"},{"key":"6_CR5","doi-asserted-by":"publisher","unstructured":"Baldi, M., Cancellieri, G., Chiaraluce, F., Persichetti, E., Santini, P.: Using Non-Binary LDPC and MDPC Codes in the McEliece Cryptosystem. In: 2019 AEIT International Annual Conference (AEIT), pp. 1\u20136 (2019). https:\/\/doi.org\/10.23919\/AEIT.2019.8893339","DOI":"10.23919\/AEIT.2019.8893339"},{"key":"6_CR6","doi-asserted-by":"publisher","unstructured":"Sushko, A.N., et al.: Fast computation of cyclic convolutions and their applications in code-based asymmetric encryption schemes. Model. Analy. Info. Sys. 30(4), 354\u2013365 (2023). https:\/\/doi.org\/10.18255\/1818-1015-2023-4-354-365","DOI":"10.18255\/1818-1015-2023-4-354-365"},{"key":"6_CR7","unstructured":"Kulyas, M.E.: O programmnoj realizacii algoritma umnozheniya Karacuby (in Russian). Informatika, vychislitel'naya tekhnika i upravlenie. Vestnik MEHI, no. 1 (2016)"},{"key":"6_CR8","doi-asserted-by":"publisher","unstructured":"Kronenburg, M.J.: Toom-Cook Multiplication: Some Theoretical and Practical Aspects (2016). https:\/\/doi.org\/10.48550\/arXiv.1602.02740","DOI":"10.48550\/arXiv.1602.02740"},{"key":"6_CR9","unstructured":"Kruppa, A.: Fast Integer Multiplication with Sch\u00f6nhage-Strassen's Algorithm. https:\/\/algo.inria.fr\/seminars\/sem08-09\/kruppa-slides.pdf. Last accessed 04 August 2025"},{"issue":"2","key":"6_CR10","doi-asserted-by":"publisher","first-page":"563","DOI":"10.4007\/annals.2021.193.2.4","volume":"193","author":"D Harvey","year":"2021","unstructured":"Harvey, D., van der Hoeven, J.: Integer multiplication in time O(n log n). Annals of Mathematics 193(2), 563\u2013617 (2021). https:\/\/doi.org\/10.4007\/annals.2021.193.2.4","journal-title":"Annals of Mathematics"},{"key":"6_CR11","unstructured":"Seminar \u00abMatematicheskie zadachi v industriI\u00bb Algoritmy bystrykh svertok i svyazannye s nimi zadachi v prilozhenii k obrabotke signalov v volokonno-opticheskikh sistemakh svyazi (in Russian), https:\/\/www.mathnet.ru\/php\/seminars.phtml?presentid=32985. Last accessed 09 May 2024"},{"key":"6_CR12","unstructured":"Quantization online course: https:\/\/www.deeplearning.ai\/short-courses\/quantization-in-depth\/. Last accessed 05 August 2025"},{"key":"6_CR13","doi-asserted-by":"publisher","unstructured":"Jacob, B., et al.: Quantization and Training of Neural Networks for Efficient Integer-Arithmetic-Only Inference. In: 2018 IEEE\/CVF Conference on Computer Vision and Pattern Recognition (CVPR), pp. 2704\u20132713. IEEE (2018). https:\/\/doi.org\/10.1109\/CVPR.2018.00286","DOI":"10.1109\/CVPR.2018.00286"},{"key":"6_CR14","unstructured":"Optimizing Parallelizing System, www.ops.rsu.ru. Last accessed 05 August 2025"},{"key":"6_CR15","doi-asserted-by":"publisher","unstructured":"Golyandina, N., Korobeynikov, A., Zhigljavsky, A.: Singular Spectrum Analysis with R. Use R! Springer, Berlin (2018). https:\/\/doi.org\/10.1007\/978-3-662-57380-8","DOI":"10.1007\/978-3-662-57380-8"},{"issue":"90","key":"6_CR16","doi-asserted-by":"publisher","first-page":"297","DOI":"10.2307\/2003354","volume":"19","author":"JW Cooley","year":"1965","unstructured":"Cooley, J.W., Tukey, J.W.: An algorithm for the machine calculation of complex Fourier series. Mathematics of Computation 19(90), 297\u2013301 (1965). https:\/\/doi.org\/10.2307\/2003354","journal-title":"Mathematics of Computation"},{"key":"6_CR17","unstructured":"OpenCV library. matchTemplate method, https:\/\/docs.opencv.org\/4.x\/df\/dfb\/group__imgproc__object.html#ga586ebfb0a7fb604b35a23d85391329be. Last accessed 26 April 2025"},{"issue":"4","key":"6_CR18","doi-asserted-by":"publisher","first-page":"47","DOI":"10.5121\/ijcsit.2014.6404","volume":"6","author":"YM Fouda","year":"2014","unstructured":"Fouda, Y.M.: One-dimensional vector based pattern matching. Int. J. Comp. Sci. Info. Technol. 6(4), 47\u201358 (2014). https:\/\/doi.org\/10.5121\/ijcsit.2014.6404","journal-title":"Int. J. Comp. Sci. Info. Technol."},{"issue":"2","key":"6_CR19","doi-asserted-by":"publisher","first-page":"109","DOI":"10.4236\/jsip.2015.62011","volume":"6","author":"YM Fouda","year":"2015","unstructured":"Fouda, Y.M.: A robust template matching algorithm based on reducing dimensions. J. Sign. Info. Proc. 6(2), 109\u2013122 (2015). https:\/\/doi.org\/10.4236\/jsip.2015.62011","journal-title":"J. Sign. Info. Proc."}],"container-title":["Lecture Notes in Computer Science","Parallel Computing Technologies"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-06751-7_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,30]],"date-time":"2025-09-30T04:29:05Z","timestamp":1759206545000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-06751-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,1]]},"ISBN":["9783032067500","9783032067517"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-06751-7_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025,10,1]]},"assertion":[{"value":"1 October 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PaCT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel Computing Technologies","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Almaty","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kazakhstan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 October 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 October 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pact2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ssd.sscc.ru\/conference\/pact2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}