A one-to-two-dimensional mapping using a partial Fast Fourier Transform
نویسندگان
چکیده
منابع مشابه
The Partial Fast Fourier Transform
An efficient algorithm for computing the one-dimensional partial fast Fourier transform fj = ∑c(j) k=0 e Fk is presented. Naive computation of the partial fast Fourier transform requires O(N) arithmetic operations for input data of length N . Unlike the standard fast Fourier transform, the partial fast Fourier transform imposes on the frequency variable k a cutoff function c(j) that depends on ...
متن کاملDigital image Watermarking using Two Dimensional Discrete Wavelet Transform, Discrete Cosine Transform and Fast Fourier Transform
Abstract—In digital watermarking, a watermark is embedded into a cover text in such a way that the resulting watermarked signal is robust to certain distortion caused by either standard data processing in a friendly environment or malicious attacks in an unfriendly environment. This paper presents a digital image watermarking based on two dimensional discrete cosines transform (DCT2), two dimen...
متن کاملOptimal Padding for the Two-Dimensional Fast Fourier Transform
One-dimensional Fast Fourier Transform (FFT) operations work fastest on grids whose size is divisible by a power of two. Because of this, padding grids (that are not already sized to a power of two) so that their size is the next highest power of two can speed up operations. While this works well for one-dimensional grids, it does not work well for two-dimensional grids. For a two-dimensional g...
متن کاملUsing a Fast Fourier Transform Algorithm
The symmetry and periodicity properties of the discrete Fourier transform (DFT) allow a variety of useful and interesting decompositions. In particular, by clever grouping and reordering of the complex exponential multiplications it is possible to achieve substantial computational savings while still obtaining the exact DFT solution (no approximation required). Many “fast” algorithms have been ...
متن کاملEngineering a Fast Fourier Transform
Computing the discrete Fourier transform is one of the most important in applied computer science, with applications in fields as diverse as seismology, signal analysis, and various branches of engineering. A great many algorithms exist for quickly computing different variations of the transform – fast Fourier transforms, or FFTs. Because of their practical importance, even small improvements t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physica A: Statistical Mechanics and its Applications
سال: 2010
ISSN: 0378-4371
DOI: 10.1016/j.physa.2010.03.017