Abstract
The widely popular famous fast Cooley–Tukey algorithms for the discrete Fourier transform of mixed radix are presented in two forms: classical and with a constant structure. A matrix representation of these algorithms is proposed in terms of two types of tensor product of matrices: the Kronecker product and the b-product. This matrix representation shows that the structure of these algorithms is identical to two fast Good algorithms for a Kronecker power of a matrix. A technique for constructing matrix-form fast algorithms for the discrete Fourier and Chrestenson transforms with mixed radix and for the discrete Vilenkin transform is demonstrated. It is shown that the constant-structured algorithm is preferable in the case of more sophisticated constructions
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Журнал вычислительной математики и математической физики
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
