Immittance Data Validation using Fast Fourier Transformation (FFT) Computation – Synthetic and Experimental Examples
نویسندگان
چکیده
Exact data of an electric circuit (EC) model of RLC (resistor, inductor, capacitor) elements representing rational immittance of LTI (linear, time invariant) systems are numerically Fourier transformed to demonstrate within error bounds applicability of the Hilbert integral tranform (HT) and Kramers-Kronig (KK) integral tranform (KKT) method. Immittance spectroscopy (IS) data are validated for their HT (KKT) compliance using non-equispaced fast Fourier transformation (NFFT) computations. Failing of HT (KKT) testing may not only stem from non-compliance with causality, stability and linearity which are readily distinguished using anti HT (KKT) relations. It could also indicate violation of uniform boundedness to be overcome either by using singly or multiply subtracted KK transform (SSKK or MSKK) or by seeking KKT of the same set of data at a complementary immit- tance level. Experimental IS data of a fuel cell (FC) are also numerically HT (KKT) validated by NFFT assessing whether LTI principles are met. Figures of merit are suggested to measure success in numerical validation of IS data.
منابع مشابه
Determination of Riboflavin by Nanocomposite Modified Carbon Paste Electrode in Biological Fluids Using Fast Fourier Transform Square Wave Voltammetry
Herein, fast Fourier transformation square-wave voltammetry (FFT-SWV) as a novel electrochemical determination technique was used to investigate the electrochemical behavior and determination of Riboflavin at the surface of a nanocomposite modified carbon paste electrode. The carbon paste electrode was modified by nanocomposite containing Samarium oxide (Sm2O3)/reduced gra...
متن کاملFast Computation of Mutual Information in a Variational Image Registration Approach
In this paper we present a novel method for computing the Mutual Information of images using recently developed non-equidistant fast Fourier-transform (NFFT) techniques. Standard approaches suffer from the problem that some sort of quantization is needed in order to apply a fast equidistant FFT-technique. For the new method no quantization is necessary which on one hand leads to an improved reg...
متن کاملAn efficient algorithm for the calculation of a constant Q transform
An efficient method of transforming a discrete Fourier transform (DFT) into a constant Q transform, where Q is the ratio of center frequency to bandwidth, has been devised. This method involves the calculation of kernels that are then applied to each subsequent DFT. Only a few multiples are involved in the calculation of each component of the constant Q transform, so this transformation adds a ...
متن کاملEfficient FFT mapping on GPU for radar processing application: modeling and implementation
General-purpose multiprocessors (as, in our case, Intel IvyBridge and Intel Haswell) increasingly add GPU computing power to the former multicore architectures. When used for embedded applications (for us, Synthetic aperture radar) with intensive signal processing requirements, they must constantly compute convolution algorithms, such as the famous Fast Fourier Transform. Due to its ”fractal” n...
متن کاملPathologies cardiac discrimination using the Fast Fourir Transform (FFT) The short time Fourier transforms (STFT) and the Wigner distribution (WD)
This paper is concerned with a synthesis study of the fast Fourier transform (FFT), the short time Fourier transform (STFT and the Wigner distribution (WD) in analysing the phonocardiogram signal (PCG) or heart cardiac sounds. The FFT (Fast Fourier Transform) can provide a basic understanding of the frequency contents of the heart sounds. The STFT is obtained by calculating the Fourier tran...
متن کامل