Fast algorithms for fractional Fourier transforms / Creutzburg R,Rundblad E,Labunets VG // . - 1999. - V. , l. . - P. 383-387.

ISSN/EISSN:

нет данных / нет данных

Type:

Proceedings Paper

Abstract:

The fractional Fourier transform (FRFT) is a one-parametric generalization of the classical Fourier transform. The FRFT was introduced in the 80th and has found a lot of applications and is now used widely in signal processing. Both the space and the spatial frequency domains, respectively, are special cases of the fractional Fourier domains. They correspond to the 0th and 1st fractional Fourier domains, respectively. In this paper, we briefly introduce the multi-parametrical FRFT and its fast algorithms.

Author keywords:

нет данных

DOI:

нет данных

Web of Science ID:

ISI:000181075400081

Соавторы в МНС:

—

Другие поля

Поле	Значение
Editor	Cetin, AE and Akarun, L and Ertuzun, A and Gurcan, MN and Yardimci, Y
Booktitle	PROCEEDINGS OF THE IEEE-EURASIP WORKSHOP ON NONLINEAR SIGNAL AND IMAGE PROCESSING (NSIP'99)
Note	IEEE-EURASIP Workshop on Nonlinear Signal and Image Prcessing (NSIP 99), ANTALYA, TURKEY, JUN 20-23, 1999
Organization	European Assoc Signal Proc; IEEE Circuits \& Syst Soc; IEEE Signal Proc Soc
Publisher	BOGAZICI UNIVERSITY BEBEK
Address	FACULTY ENGINEERING DEPT CIVIL ENGINEERING, 80815 ISTANBUL, TURKEY
Language	English
ISBN	975-518-133-4
Research-Areas	Computer Science; Engineering; Imaging Science \& Photographic Technology
Web-of-Science-Categories	Computer Science, Artificial Intelligence; Engineering, Electrical \& Electronic; Imaging Science \& Photographic Technology
Number-of-Cited-References	10
Doc-Delivery-Number	BW17S