Optimization of multidigit multiplication based on discrete (Fourier, cosine, sine) transforms in the parallel computing model
DOI10.1007/S10559-022-00495-6OpenAlexW4306691483MaRDI QIDQ2103805
A. M. Tereshchenko, V. K. Zadiraka
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
discrete Fourier transformdiscrete cosine transformasymmetric cryptographydiscrete sine transformfast Fourier algorithmmultidigit arithmeticmultidigit multiplication
Algorithms in computer science (68Wxx) Harmonic analysis in one variable (42Axx) Numerical methods in Fourier analysis (65Txx)
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- Fast multiplication of large numbers
- Modular Multiplication Without Trial Division
- A Fast Karhunen-Loeve Transform for a Class of Random Processes
- Discrete Cosine Transform
- An Algorithm for the Machine Calculation of Complex Fourier Series
This page was built for publication: Optimization of multidigit multiplication based on discrete (Fourier, cosine, sine) transforms in the parallel computing model
