Standard

Parametric versions of the fast Fourier transform. / Malozemov, V. N.; Prosekov, O. V.

в: Doklady Mathematics, Том 78, № 1, 08.2008, стр. 576-578.

Результаты исследований: Научные публикации в периодических изданиях › статья › Рецензирование

Harvard

Malozemov, VN & Prosekov, OV 2008, 'Parametric versions of the fast Fourier transform', Doklady Mathematics, Том. 78, № 1, стр. 576-578. https://doi.org/10.1134/S1064562408040285

APA

Malozemov, V. N., & Prosekov, O. V. (2008). Parametric versions of the fast Fourier transform. Doklady Mathematics, 78(1), 576-578. https://doi.org/10.1134/S1064562408040285

Vancouver

Malozemov VN, Prosekov OV. Parametric versions of the fast Fourier transform. Doklady Mathematics. 2008 Авг.;78(1):576-578. https://doi.org/10.1134/S1064562408040285

Author

Malozemov, V. N. ; Prosekov, O. V. / Parametric versions of the fast Fourier transform. в: Doklady Mathematics. 2008 ; Том 78, № 1. стр. 576-578.

BibTeX

@article{8f9c8193e657415494065c22cd5b5e72,
title = "Parametric versions of the fast Fourier transform",
abstract = "The parametric coding of indices of the Fourier matrix have been used to obtain the most efficient parametric decomposition of the Fourier matrix. Fast Fourier transform (FFT) is the most popular algorithm for processing discrete periodic signals. The general approach to constructing FFTs involves the decomposition of the Fourier matrix into a product of sparse matrices. Various versions of such decomposition depend on the arithmetic properties of the order of the Fourier matrix and on representations of its indices. A parametric version of the prime factor method with successive permutations was suggested. It was concluded that the corresponding FFT algorithm involves no complicated permutations of data before or after the transform, and computations can be performed simultaneously with permutations.",
author = "Malozemov, {V. N.} and Prosekov, {O. V.}",
year = "2008",
month = aug,
doi = "10.1134/S1064562408040285",
language = "English",
volume = "78",
pages = "576--578",
journal = "Doklady Mathematics",
issn = "1064-5624",
publisher = "МАИК {"}Наука/Интерпериодика{"}",
number = "1",

}

RIS

TY - JOUR

T1 - Parametric versions of the fast Fourier transform

AU - Malozemov, V. N.

AU - Prosekov, O. V.

PY - 2008/8

Y1 - 2008/8

N2 - The parametric coding of indices of the Fourier matrix have been used to obtain the most efficient parametric decomposition of the Fourier matrix. Fast Fourier transform (FFT) is the most popular algorithm for processing discrete periodic signals. The general approach to constructing FFTs involves the decomposition of the Fourier matrix into a product of sparse matrices. Various versions of such decomposition depend on the arithmetic properties of the order of the Fourier matrix and on representations of its indices. A parametric version of the prime factor method with successive permutations was suggested. It was concluded that the corresponding FFT algorithm involves no complicated permutations of data before or after the transform, and computations can be performed simultaneously with permutations.

AB - The parametric coding of indices of the Fourier matrix have been used to obtain the most efficient parametric decomposition of the Fourier matrix. Fast Fourier transform (FFT) is the most popular algorithm for processing discrete periodic signals. The general approach to constructing FFTs involves the decomposition of the Fourier matrix into a product of sparse matrices. Various versions of such decomposition depend on the arithmetic properties of the order of the Fourier matrix and on representations of its indices. A parametric version of the prime factor method with successive permutations was suggested. It was concluded that the corresponding FFT algorithm involves no complicated permutations of data before or after the transform, and computations can be performed simultaneously with permutations.

UR - http://www.scopus.com/inward/record.url?scp=50849115761&partnerID=8YFLogxK

U2 - 10.1134/S1064562408040285

DO - 10.1134/S1064562408040285

M3 - Article

AN - SCOPUS:50849115761

VL - 78

SP - 576

EP - 578

JO - Doklady Mathematics

JF - Doklady Mathematics

SN - 1064-5624

IS - 1

ER -

ID: 61742466