On Time- and Frequency-domain equivalence for compliant EMI measurements

Time-frequency domain relationships are analyzed for electromagnetic interference (EMI) measurements, with application to the realization of a real-time time-domain EMI receiver. Computational complexity and possible hardware implementation are considered for the examined classes of algorithms and preliminary implementation issues are discussed.

[1]  Dulal C. Kar,et al.  A new systolic realization for the discrete Fourier transform , 1993, IEEE Trans. Signal Process..

[2]  G. Goertzel.  An Algorithm for the Evaluation of Finite Trigonometric Series , 1958 .

[3]  Richard J. Kozick,et al.  Computation of discrete cosine transform using Clenshaw's recurrence formula , 1995, IEEE Signal Processing Letters.

[4]  Graham A. Jullien,et al.  Recursive algorithms for the forward and inverse discrete cosine transform with arbitrary length , 1994, IEEE Signal Processing Letters.

[5]  Chein-Wei Jen,et al.  On the design of VLSI arrays for discrete Fourier transform , 1992 .

[6]  N. Rama Murthy,et al.  On the real-time computation of DFT and DCT through systolic architectures , 1994, IEEE Trans. Signal Process..

[7]  Pramod Kumar Meher,et al.  Efficient Systolic Implementation of DFT Using a Low-Complexity Convolution-Like Formulation , 2006, IEEE Transactions on Circuits and Systems II: Express Briefs.

[8]  A. Nuttall.  Some windows with very good sidelobe behavior , 1981 .

[9]  J. Bendat,et al.  Random Data: Analysis and Measurement Procedures , 1987 .

[10]  P. Russer,et al.  Quasi-peak detector model for a time-domain measurement system , 2005, IEEE Transactions on Electromagnetic Compatibility.

[11]  Douglas L. Jones,et al.  Corrections to "Real-valued fast Fourier transform algorithms" , 1987, IEEE Trans. Acoust. Speech Signal Process..

[12]  S.A. White,et al.  Applications of distributed arithmetic to digital signal processing: a tutorial review , 1989, IEEE ASSP Magazine.

[13]  J. Tukey,et al.  An algorithm for the machine calculation of complex Fourier series , 1965 .

[14]  M.B.E. Abdelrazik,et al.  Systolic arrays for DFT computation-design and evaluation , 1990, Proceedings of the 33rd Midwest Symposium on Circuits and Systems.

[15]  E. Jacobsen,et al.  The sliding DFT , 2003, IEEE Signal Process. Mag..

[16]  Steven G. Johnson,et al.  The Design and Implementation of FFTW3 , 2005, Proceedings of the IEEE.

[17]  Y. Lim,et al.  A comment on the computational complexity of sliding FFT , 1992 .

[18]  F. Harris.  On the use of windows for harmonic analysis with the discrete Fourier transform , 1978, Proceedings of the IEEE.

[19]  Pramod Kumar Meher.  Systolic Designs for DCT Using a Low-Complexity Concurrent Convolutional Formulation , 2006, IEEE Transactions on Circuits and Systems for Video Technology.