Revised 2D fast Fourier transform

Pupeikis, Rimantas

doi:10.1109/eStream.2015.7119497

Use this URL to cite this publication: https://hdl.handle.net/20.500.14911/151725

Revised 2D fast Fourier transform

Details

Publication Type (CRIS)

Straipsnis konferencijos medžiagoje Web of Science duomenų bazėje / Article in conference proceedings in Web of Science database (P1a1)

Publication Type (eLABa)

Straipsnis konferencijos darbų leidinyje Web of Science DB / Article in conference proceedings Web of Science DB (P1a)

VILNIUS TECH Research Priorities and Topics

Skaitmeninės signalų apdorojimo technologijos / Digital signal processing technologies (IK04)

Lithuanian Intelligent Specialization

Transportas, logistika ir informacinės ir ryšių technologijos (IRT) / Transport, logistic and information and communication technologies (L106)

Author(s)

Title

Revised 2D fast Fourier transform

[en]

Rimantas Pupeikis

Is part of

Electrical, electronic and information sciences (eStream): 2015 open conference : proceedings of the conference, April 21, 2015, Vilnius, Lithuania

Published In

Year	Start Page	End Page
2015	1	4

Publisher

New York : IEEE, 2015

Referenced in Database(s)(DBs)

IEEE Xplore

Conference Proceedings Citation Index - Science (Web of Science)

Extent

p. 1-4

URI

URI	Access Rights
https://hdl.handle.net/20.500.14911/151725
http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=7119497	Viso teksto dokumentas (atviroji prieiga) / Full Text Document (Open Access)

DOI

10.1109/eStream.2015.7119497

Cited references

Science / Art Area

Gamtos mokslai / Natural Sciences (N)

Field of Science / Art

Informatika / Informatics (N009)

Keywords (en)

Abstract (en)

It is assumed here, that some signal samples in the respective period, available for processing digitally by the fast Fourier transform (FFT) procedure for determining spectra of two-dimensional (2D) signals, are updated by a sensor in real time. It is urgent for each new sample that emerges to have a new 2D spectrum. The idea is that the 2D FFT procedure should not be repeated for each new sample. It is needed just to modify the procedure when the new sample emerges and replaces the previous one. The recursive formulas for FFT algorithms that refer to the modification and on-line calculation of 2D spectrum samples are obtained. Simulation results are presented here, too (see table, Figures 1 – 3).