Application of modular computing technique for high speed implementation of cyclic convolution

MaRDI QIDQ5040669zbMATH OpenFDO

Authors Mikhail Selyaninov

Publication date 17 October 2022

zbMATH Keywords

cyclic convolution of discrete signalsminimal redundant polynomial-scalar modular number systemmodular computing structures

Mathematics Subject Classification ID

General commutative ring theory and combinatorics (zero-divisor graphs, annihilating-ideal graphs, etc.) (13A70) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Recommendations

• Modular technique of high-speed parallel computing on the sets of polynomials
• Algorithms and structures for convolutions over Galois fields
• On fast algorithms for one-dimensional digital signal processing in finite integer and complex integer rings
• Tabular minimal redundant modular structures for fast and high-precision computations using general-purpose computers
• Fast algorithms for computing one- and two-dimensional convolution in integer polynomial rings

Cited in

(2)

• Hardware Efficient Fast DCT Based on Novel Cyclic Convolution Structures
• Modular technique of high-speed parallel computing on the sets of polynomials

This page was built for publication: Application of modular computing technique for high speed implementation of cyclic convolution

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