Coarse-grain reconfigurable architectures, like the Montium TP, have proven to be a very successful approach for low-power and high-performance computation of regular digital signal processing algorithms. This paper presents the implementation of a class of non-power-of-two FFTs to discover the limitations and Flexibility of the Montium TP for less regular algorithms. A non-powerof-two FFT is l...

We consider the sparse Fourier transform problem: given a complex vector x of length n, and a parameter k, estimate the k largest (in magnitude) coefficients of the Fourier transform of x. The problem is of key interest in several areas, including signal processing, audio/image/video compression, and learning theory. We propose a new algorithm for this problem. The algorithm leverages technique...

Measuring means extracting information from acquired signals. Either in the frequency or in the time, mathematical processing tools are applied to get information from measurement signals. It is usual, when processing measurement signals in the frequency domain, the application of Fourier analysis, mainly through Fast Fourier Transform (FFT) algorithms. Nevertheless, there are other digital sig...

Periodicity search in time series is a problem that has been investigated by mathematicians in various areas, such as statistics, economics, and digital signal processing. For large databases of time series data, scalability becomes an issue that traditional techniques fail to address. In existing time series mining algorithms for detecting periodic patterns, the period length is userspecified....

The fast Fourier transform (FFT), developed in 1965, is widely considered one of the most prolific and significant algorithms of the 20th century. While the classic Fourier Transform algorithm converts data from timedomain to frequency domain in O(N), the FFT reduces the complexity to O(NlgN). This performance improvement has had a significant impact on many fields and has revolutionized the ar...

In 1965 J. Cooley and J. Tukey published an article detailing an efficient algorithm to compute the Discrete Fourier Transform, necessary for processing the newly available reams of digital time series produced by recently invented analog-to-digital converters. Since then, the Cooley– Tukey Fast Fourier Transform and its variants has been a staple of digital signal processing. Among the many ca...

For the Pre-Processor System of the ATLAS Level-1 Calorimeter Trigger we have built a fast signal-processing and readout ASIC (PPrAsic). The novel ASIC design environment incorporates algorithm development with digital hardware synthesis and verification. The purely digital ASIC was designed in Verilog HDL (hardware description language) and embedded in a system wide analog and digital simulati...