In November of 1979, there appeared a paper in the Bulletin of the AMS by L. Auslander and R. Tolimieri with the delightful title of “Is Computing with the Finite Fourier Transform Pure or Applied Mathematics?” The question was of course rhetorical and one of the main goals of the paper was to show that the finite Fourier transform, and the family of efficient algorithms used to compute it, the...

The stability of a linear transfer function is fundamental in its real time realisation. Several tests have been developed in the past to test whether a given transfer function is stable. Invariably these tests rely on either a direct use of a Hurwitz test or some convenient modification of it such as the Schur-Cohen test or the Jury-Marden test. A new test is proposed in this contribution whic...

Convolution y(t) = ∫ a(t− s) ·x(s) ds is one of the main techniques in digital signal processing. A straightforward computation of the convolution y(t) requires O(n2) steps, where n is the number of observations x(t0), . . . , x(tn−1). It is well known that by using the Fast Fourier Transform (FFT) algorithm, we can compute convolution much faster, with computation time O(n · log(n)). In practi...

The fast evolution of technology has led to a growing demand for video data, increasing the amount of research into efficient systems to manage video material. Most of existing systems for video retrieval rely on algorithms and methods which are computationally expensive, in terms of both time and space, limiting their application to the academic world or big companies. Contrary to this trend, ...

CORDIC algorithm is very widely used in the digital signal processing systems. This article presents a CORDIC-based reconfigurable FPGA architecture that can be changed to perform different algorithms of signal processing. Two examples of CORDIC-based signal processing, such as FFT and SVD algorithms are surveyed in this paper. The fact that the common operator CORDIC is exploited in these algo...

The design of complex Digital Signal Processing systems implies to minimize architectural cost and to maximize timing performances while taking into account communication and memory accesses constraints for the integration of dedicated hardware accelerator. Unfortunately, the traditional Matlab/ Simulink design flows gather not very flexible hardware blocs. In this paper, we present a methodolo...

Convolution is one of the most widely used digital signal processing operations. It can be implemented using the fast Fourier transform (FFT), with a computational complexity ofO(N logN). The undecimated discrete wavelet transform (UDWT) is linear and shift invariant, so it can also be used to implement convolution. In this paper, we propose a scheme to implement the convolution using the UDWT,...

This paper proposes a novel robust audio watermarking algorithm to embed data and extract it in a bitexact manner based on changing the magnitudes of the FFT spectrum. The key point is selecting a frequency band for embedding based on the comparison between the original and the MP3 compressed/decompressed signal and on a suitable scaling factor. The experimental results show that the method has...

Digital total variation (DTV) filtering techniques, that originated in the field of image processing, are adapted to postprocess Radial Basis Function approximations of piecewise continuous functions. Through numerical examples, we show that DTV filtering is a fast, robust, postprocessing method that can be used to remove Gibbs oscillations while sharply resolving discontinuities. The method is...