Scribd
Upload
55 views

Hitdsp - Transform - Tables 2012 PDF

This document provides information about digital signal processing concepts including: - Common transforms like the discrete-time Fourier transform (DTFT), discrete Fourier transform (DFT), and Z-transform along with their properties and notations. - Tables summarizing properties of signals and transforms including linearity, time/frequency shifting, and convolution. - Information about common filters like Butterworth and Chebyshev filters. - Details on window functions such as Bartlett, Hamming, and Blackman windows.

Uploaded by

Vadim Pelts
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
55 views

Hitdsp - Transform - Tables 2012 PDF

This document provides information about digital signal processing concepts including: - Common transforms like the discrete-time Fourier transform (DTFT), discrete Fourier transform (DFT), and Z-transform along with their properties and notations. - Tables summarizing properties of signals and transforms including linearity, time/frequency shifting, and convolution. - Information about common filters like Butterworth and Chebyshev filters. - Details on window functions such as Bartlett, Hamming, and Blackman windows.

Uploaded by

Vadim Pelts
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Digital Signal Processing

50060

Transform tables

General
Equation 1 |x| < 2 1 1 1 |x| = 2 Rectangular pulse in continuous-parameter (x) = 2 0 elsewhere 1 |n| N Rectangular pulse in discrete-time N [n] = 0 elsewhere 1 n0 Unit step in discrete-time u[n] = 0 elsewhere Sinc in discrete-time sinc[n] = sin(n) n Cosine of sum of angles cos(a + b) = cos(a) cos(b) sin(a) sin(b) Sine of sum of angles sin(a + b) = sin(a) cos(b) + cos(a) sin(b) 2fL 2fH k = 0, 1, . . . , K where K = Sampling of bandpass signals k+1 < f s < k , N Radix-2 time decimation FFT 2 log2 (N ) 1 |n| N 1 |x| 1 2 (x) = (n) = 0 elsewhere 0 elsewhere Description

fL fH fL

Discrete-time Fourier transform (DTFT)


x[n] = Property/signal Notation Linearity Time shifting Frequency Shift Time reversal Conjugation Symmetry Convolution Multiplication Dierentiation Delta One Exponent Cosine Sine Decaying step Rectangular pulse Sinc (normalized) Parseval 1 2

X(ej )ejn d
2

X(ej ) =
n=

x[n]ejn

Time domain x[n], y[n] ax[n] + by[n] x[n n0 ] x[n]ej0 n x[n] x [n] x[n] real m= x[m]y[n m] x[n]y[n] x[n] x[n 1] [n] 1 ej0 n cos[0 n] sin[0 t] u[n]an , |a| < 1 N [n]
sin[W n] n n=

Transform domain X(ej ), Y (ej ) aX(ej ) + bY (ej ) ejn0 X(ej ) X(ej(0 ) ) X(ej ) X (ej ) X(ej ) = X (ej ) X(ej )Y (ej ) 1 j j() )d 2 2 X(e )Y (e j j (1 e )X(e ) 1 2 m= ( 2m) 2 m= ( 0 2m) m= [( 0 2m) + ( + 0 2m)] m= [( 0 2m) ( + 0 2m)] j
1 1aej sin[(N + 1 )] 2 sin(/2) 2m m= ( 2W ) 1 j 2 2 2 |X(e )|

|x[n]|2

Discrete Fourier transform (DFT)


x[n] = 1 N
N 1 N 1

X(k)ej N nk
k=0

X(k) =
n=0

x[n]ej N nk

01 December 2011

Digital Signal Processing

50060

Transform tables

Property/signal Notation Linearity Periodicity Conjugation Symmetry Circular Time Shift Circular Frequency Shift Circular Convolution Circular Correlation Multiplication Parseval Theorm

Time domain x[n], y[n] ax[n] + by[n] x[n] = x[n + N ] x [n] x[n] real x[(n l)N ] x[n]ej2kl/N x[n] N y[n] x[n] N y [n] x[n]y[n] N 1 n=0 x[n]y [n]

Transform domain X(k), Y (k) aX(k) + bY (k) X(k) = X(k + N ) X (N k) X(k) = X ((k)N ) X(k)ej2kl/N X((k l)N ) X(k)Y (k) X(k)Y (k) 1 N N X(k) Y (k) N 1 1 k=0 X(k)Y (k) N

Z transform
x[n] = Property/signal Linearity Time shifting time reversal Conjugation Convolution Delta Unit step Decaying step Decaying step 1 2j X(z)z n1 dz X(z) =

x[n]z n
n=

Time domain ax[n] + by[n] x[n n0 ] x[n] x [n] m= x[m]y[n m] [n] u[n] an u[n] an u[n 1]

Transform domain aX(z) + bY (z) z n0 X(z) X(z 1 ) X (z ) X(z)Y (z) 1 1 1z 1 (|z| > 1) 1 1az 1 (|z| > a) 1 1az 1 (|z| < a)

Filters
Bilinear transform Bilinear transform Bilinear transform Butterworth 2nd -order Butterworth Butterworth Butterworth Chebyshev I Bartlett window Hamming window Blackman window s= z=

T 2 1 2N 1+( c ) 2 c H(s) = s2 +2 s+2 c c sk = c exp j 1 + 1+2k k = 0, 1, . . . , N 1 2 2N 2 1 log10 A 2 1 N2 s log10 p 2 |H()| = 1+ 2 T12 ( ) TN +1 (x) = 2xTN (x) TN 1 (x), T0 (x) N c w[n] = 1 |n| , m n m m w[n] = 0.54 0.46cos( n ), m n m m w[n] = 0.42 0.5cos( n ) + 0.08cos( 2n ), m n m m m

= 2tan 2 |H()| =

2 z1 T z+1 1+ sT 2 1 sT 2 1

= 1, T1 (x) = x, T2 (x) = 2x2 1

01 December 2011

You might also like