Optimization of multidigit multiplication based on discrete (Fourier, cosine, sine) transforms in the parallel computing model

DOI10.1007/S10559-022-00495-6OpenAlexW4306691483MaRDI QIDQ2103805FDOQ2103805

Authors: V. K. Zadiraka, A. M. Tereshchenko 

Publication date: 9 December 2022

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-022-00495-6

Recommendations

• Research on large integer multiplication Schönhage-Strassen algorithm's multi-core parallelization
• scientific article; zbMATH DE number 4104356
• Multiplication
• scientific article; zbMATH DE number 2118995
• Rapid multiplication modulo the sum and difference of highly composite numbers

zbMATH Keywords

discrete Fourier transformdiscrete cosine transformdiscrete sine transformfast Fourier algorithmasymmetric cryptographymultidigit arithmeticmultidigit multiplication

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Harmonic analysis in one variable (42Axx) Numerical methods in Fourier analysis (65Txx)

Cites Work

• An Algorithm for the Machine Calculation of Complex Fourier Series
• Fast multiplication of large numbers
• Modular Multiplication Without Trial Division
• Discrete Cosine Transform
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Fast Karhunen-Loeve Transform for a Class of Random Processes
• Integer modified sine-cosine transforms type VII. A construction method and separable directional adaptive transforms for intra prediction with \(8 \times 8\) chroma blocks in image/video coding

This page was built for publication: Optimization of multidigit multiplication based on discrete (Fourier, cosine, sine) transforms in the parallel computing model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2103805)