Factorization method and its physical justification in frequency-difference electrical impedance tomography

Bastian Harrach1, Jin Keun Seo, Eung Je Woo

  • 1Fakultät für Mathematik, Technische Universität München, 85748 Garching, Germany. harrach@ma.tum.de

Related Concept Videos

Relation of DFT to z-Transform01:20

Relation of DFT to z-Transform

The Discrete Fourier Transform (DFT) is a crucial tool for analyzing the frequency content of discrete-time signals. It converts a sequence of N samples from the time domain into its corresponding sequence in the frequency domain, where each sample represents a specific frequency component.
To understand how the DFT works, it's helpful to consider the z-transform, which is a method for representing discrete sequences in the complex frequency domain. The z-transform involves summing the terms of...
Inverse z-Transform by Partial Fraction Expansion01:20

Inverse z-Transform by Partial Fraction Expansion

The inverse z-transform is a crucial technique for converting a function from its z-domain representation back to the time domain. One effective method for finding the inverse z-transform is the Partial Fraction Method, which involves decomposing a function into simpler fractions with distinct coefficients. These fractions correspond to known z-transform pairs, facilitating the inverse transformation process.
To begin the process, the poles of the function are identified and the function is...
Difference Equation Solution using z-Transform01:24

Difference Equation Solution using z-Transform

The z-transform is a powerful tool for analyzing practical discrete-time systems, often represented by linear difference equations. Solving a higher-order difference equation requires knowledge of the input signal and the initial conditions up to one term less than the order of the equation.
The z-transform facilitates handling delayed signals by shifting the signal in the z-domain, which corresponds to delaying the signal in the time domain, and advancing signals by similarly shifting in the...
Fast Fourier Transform01:10

Fast Fourier Transform

The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log⁡2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
Discrete Fourier Transform01:15

Discrete Fourier Transform

The Discrete Fourier Transform (DFT) is a fundamental tool in signal processing, extending the discrete-time Fourier transform by evaluating discrete signals at uniformly spaced frequency intervals. This transformation converts a finite sequence of time-domain samples into frequency components, each representing complex sinusoids ordered by frequency. The DFT translates these sequences into the frequency domain, effectively indicating the magnitude and phase of each frequency component present...
Properties of the z-Transform I01:17

Properties of the z-Transform I

The z-transform is a fundamental tool in digital signal processing, enabling the analysis of discrete-time systems through its various properties. It is an invaluable tool for analyzing discrete-time systems, offering a range of properties that simplify complex signal manipulations. One fundamental property is linearity. For any two discrete-time signals, the z-transform of their linear combination equals the same linear combination of their individual z-transforms. This property is essential...