Matched Z-transform method
- Matched Z-transform method
-
The
z-plane poles and zeros of the discrete-time Chebyshev filter, as mapped into the z-plane using the matched Z-transform method with
T = 0.1 second. The labeled frequency points and band-edge dotted lines have also been mapped through the function exp(
sT), to show how frequencies along the
iω axis in the
s-plane map onto the unit circle in the
z-plane.
The matched Z-transform method, also called the pole–zero mapping[1][2] or pole–zero matching method,[3] is a technique for converting a continuous-time filter design to a discrete-time filter (digital filter) design.
The method works by mapping all poles and zeros of the s-plane design to z-plane locations z = exp(sT), for a sample interval T.[4]
Alternative methods include the bilinear transform and impulse invariance methods.
Responses of the filter (dashed), and its discrete-time approximation (solid), for nominal cutoff frequency of 1 Hz, sample rate 10 Hz. The discrete-time filter does not reproduce the Chebyshev equiripple property in the stopband due to the interference from cyclic copies of the response.
References
Wikimedia Foundation.
2010.
Look at other dictionaries:
Matched filter — In telecommunications, a matched filter (originally known as a North filter[1]) is obtained by correlating a known signal, or template, with an unknown signal to detect the presence of the template in the unknown signal. This is equivalent to… … Wikipedia
Scale-invariant feature transform — Feature detection Output of a typical corner detection algorithm … Wikipedia
Discrete Fourier transform — Fourier transforms Continuous Fourier transform Fourier series Discrete Fourier transform Discrete time Fourier transform Related transforms In mathematics, the discrete Fourier transform (DFT) is a specific kind of discrete transform, used in… … Wikipedia
Scientific method — … Wikipedia
Finite-difference time-domain method — Finite difference time domain (FDTD) is a popular computational electrodynamics modeling technique. It is considered easy to understand and easy to implement in software. Since it is a time domain method, solutions can cover a wide frequency… … Wikipedia
Laplace transform — In mathematics, the Laplace transform is one of the best known and most widely used integral transforms. It is commonly used to produce an easily soluble algebraic equation from an ordinary differential equation. It has many important… … Wikipedia
Discrete-time Fourier transform — In mathematics, the discrete time Fourier transform (DTFT) is one of the specific forms of Fourier analysis. As such, it transforms one function into another, which is called the frequency domain representation, or simply the DTFT , of the… … Wikipedia
Цифровая обработка сигналов — (ЦОС, DSP англ. digital signal processing) преобразование сигналов, представленных в цифровой форме. Любой непрерывный (аналоговый) сигнал может быть подвергнут дискретизации по времени и квантованию по уровню (оцифровке), то… … Википедия
Chebyshev filter — Linear analog electronic filters Network synthesis filters Butterworth filter Chebyshev filter Elliptic (Cauer) filter Bessel filter Gaussian filter Optimum L (Legendre) filter Linkwitz Riley filter … Wikipedia
List of mathematics articles (M) — NOTOC M M estimator M group M matrix M separation M set M. C. Escher s legacy M. Riesz extension theorem M/M/1 model Maass wave form Mac Lane s planarity criterion Macaulay brackets Macbeath surface MacCormack method Macdonald polynomial Machin… … Wikipedia