16 resultados para discrete Fourier transform
em Bucknell University Digital Commons - Pensilvania - USA
Resumo:
This paper presents parallel recursive algorithms for the computation of the inverse discrete Legendre transform (DPT) and the inverse discrete Laguerre transform (IDLT). These recursive algorithms are derived using Clenshaw's recurrence formula, and they are implemented with a set of parallel digital filters with time-varying coefficients.
Resumo:
We introduce a new discrete polynomial transform constructed from the rows of Pascal’s triangle. The forward and inverse transforms are computed the same way in both the oneand two-dimensional cases, and the transform matrix can be factored into binary matrices for efficient hardware implementation. We conclude by discussing applications of the transform in
Resumo:
Clenshaw’s recurrenee formula is used to derive recursive algorithms for the discrete cosine transform @CT) and the inverse discrete cosine transform (IDCT). The recursive DCT algorithm presented here requires one fewer delay element per coefficient and one fewer multiply operation per coeflident compared with two recently proposed methods. Clenshaw’s recurrence formula provides a unified development for the recursive DCT and IDCT algorithms. The M v e al gorithms apply to arbitrary lengtb algorithms and are appropriate for VLSI implementation.
Resumo:
An alternative way is provided to define the discrete Pascal transform using difference operators to reveal the fundamental concept of the transform, in both one- and two-dimensional cases, which is extended to cover non-square two-dimensional applications. Efficient modularised implementations are proposed.
Digital signal processing and digital system design using discrete cosine transform [student course]
Resumo:
The discrete cosine transform (DCT) is an important functional block for image processing applications. The implementation of a DCT has been viewed as a specialized research task. We apply a micro-architecture based methodology to the hardware implementation of an efficient DCT algorithm in a digital design course. Several circuit optimization and design space exploration techniques at the register-transfer and logic levels are introduced in class for generating the final design. The students not only learn how the algorithm can be implemented, but also receive insights about how other signal processing algorithms can be translated into a hardware implementation. Since signal processing has very broad applications, the study and implementation of an extensively used signal processing algorithm in a digital design course significantly enhances the learning experience in both digital signal processing and digital design areas for the students.
Resumo:
Over the recent years chirped-pulse, Fourier-transform microwave (CP-FTMW) spectrometers have chan- ged the scope of rotational spectroscopy. The broad frequency and large dynamic range make possible structural determinations in molecular systems of increasingly larger size from measurements of heavy atom (13C, 15N, 18O) isotopes recorded in natural abundance in the same spectrum as that of the parent isotopic species. The design of a broadband spectrometer operating in the 2–8 GHz frequency range with further improvements in sensitivity is presented. The current CP-FTMW spectrometer performance is benchmarked in the analyses of the rotational spectrum of the water heptamer, (H2O)7, in both 2– 8 GHz and 6–18 GHz frequency ranges. Two isomers of the water heptamer have been observed in a pulsed supersonic molecular expansion. High level ab initio structural searches were performed to pro- vide plausible low-energy candidates which were directly compared with accurate structures provided from broadband rotational spectra. The full substitution structure of the most stable species has been obtained through the analysis of all possible singly-substituted isotopologues (H218O and HDO), and a least-squares rm(1) geometry of the oxygen framework determined from 16 different isotopic species compares with the calculated O–O equilibrium distances at the 0.01 Å level.
Resumo:
Over the recent years chirped-pulse, Fourier-transform microwave (CP-FTMW) spectrometers have changed the scope of rotational spectroscopy. The broad frequency and large dynamic range make possible structural determinations in molecular systems of increasingly larger size from measurements of heavy atom (C-13, N-15, O-18) isotopes recorded in natural abundance in the same spectrum as that of the parent isotopic species. The design of a broadband spectrometer operating in the 2-8 GHz frequency range with further improvements in sensitivity is presented. The current CP-FTMW spectrometer performance is benchmarked in the analyses of the rotational spectrum of the water heptamer, (H2O)(7), in both 2-8 GHz and 6-18 GHz frequency ranges. Two isomers of the water heptamer have been observed in a pulsed supersonic molecular expansion. High level ab initio structural searches were performed to provide plausible low-energy candidates which were directly compared with accurate structures provided from broadband rotational spectra. The full substitution structure of the most stable species has been obtained through the analysis of all possible singly-substituted isotopologues ((H2O)-O-18 and HDO), and a least-squares r(m)((1)) geometry of the oxygen framework determined from 16 different isotopic species compares with the calculated O-O equilibrium distances at the 0.01 angstrom level. (C) 2013 Elsevier B.V. All rights reserved.
Resumo:
Digital signal processing (DSP) techniques for biological sequence analysis continue to grow in popularity due to the inherent digital nature of these sequences. DSP methods have demonstrated early success for detection of coding regions in a gene. Recently, these methods are being used to establish DNA gene similarity. We present the inter-coefficient difference (ICD) transformation, a novel extension of the discrete Fourier transformation, which can be applied to any DNA sequence. The ICD method is a mathematical, alignment-free DNA comparison method that generates a genetic signature for any DNA sequence that is used to generate relative measures of similarity among DNA sequences. We demonstrate our method on a set of insulin genes obtained from an evolutionarily wide range of species, and on a set of avian influenza viral sequences, which represents a set of highly similar sequences. We compare phylogenetic trees generated using our technique against trees generated using traditional alignment techniques for similarity and demonstrate that the ICD method produces a highly accurate tree without requiring an alignment prior to establishing sequence similarity.
Resumo:
The performance of the parallel vector implementation of the one- and two-dimensional orthogonal transforms is evaluated. The orthogonal transforms are computed using actual or modified fast Fourier transform (FFT) kernels. The factors considered in comparing the speed-up of these vectorized digital signal processing algorithms are discussed and it is shown that the traditional way of comparing th execution speed of digital signal processing algorithms by the ratios of the number of multiplications and additions is no longer effective for vector implementation; the structure of the algorithm must also be considered as a factor when comparing the execution speed of vectorized digital signal processing algorithms. Simulation results on the Cray X/MP with the following orthogonal transforms are presented: discrete Fourier transform (DFT), discrete cosine transform (DCT), discrete sine transform (DST), discrete Hartley transform (DHT), discrete Walsh transform (DWHT), and discrete Hadamard transform (DHDT). A comparison between the DHT and the fast Hartley transform is also included.(34 refs)
Resumo:
A general approach is presented for implementing discrete transforms as a set of first-order or second-order recursive digital filters. Clenshaw's recurrence formulae are used to formulate the second-order filters. The resulting structure is suitable for efficient implementation of discrete transforms in VLSI or FPGA circuits. The general approach is applied to the discrete Legendre transform as an illustration.