UNIT I

SIGNAL
Signal is a physical quantity that varies with
respect to time , space or any other
independent variable
Eg x(t)= sin t.
the major classifications of the signal
are:
(i) Discrete time signal
(ii) Continuous time signal
Unit Step &Unit Impulse

Discrete time Unit impulse is defined as
[n]= {0, n 0
{1, n=0
Unit impulse is also known as unit sample.
Discrete time unit step signal is defined by
U[n]={0,n=0
{1,n>= 0
Continuous time unit impulse is defined as
(t)={1, t=0
{0, t 0
Continuous time Unit step signal is defined as
U(t)={0, t<0
{1, t0



Periodic Signal & Aperiodic Signal
A signal is said to be periodic ,if it exhibits periodicity.i.e.,
X(t +T)=x(t), for all values of t. Periodic signal has the
property that it is unchanged by a time shift of T. A signal
that does not satisfy the above periodicity property is
called an aperiodic signal
even and odd signal ?
A discrete time signal is said to be even when, x[-n]=x[n].
The continuous time signal is said to be even when, x(-
t)= x(t) For example,Cosn is an even signal.
SIGNAL
Energy and power signal

A signal is said to be energy signal if it
have finite energy and zero power.
A signal is said to be power signal if it
have infinite energy and finite power.
If the above two conditions are not
satisfied then the signal is said to be
neigther energy nor power signal
Fourier Series
The Fourier series represents a periodic signal in terms of
frequency components:


We get the Fourier series coefficients as follows:


The complex exponential Fourier coefficients are a sequence of
complex numbers representing the frequency component
0
k.
}
e
=
p
0
t ik
k
dt e ) t ( x
p
1
X
0

=
e
=
1 p
0 n
n ik
k
0
e ) n ( x
p
1
X

=
e
=
1 p
0 k
n ik
k
0
e X ) n ( x

=
e
=
k
t ik
k
0
e X ) t ( x
Fourier series
Fourier series: a complicated waveform analyzed into a
number of harmonically related sine and cosine functions

A continuous periodic signal x(t) with a period T0 may be
represented by:
X(t)=

k=1
(A
k
cos k t + B
k
sin k t)+ A
0

Dirichlet conditions must be placed on x(t) for the series
to be valid: the integral of the magnitude of x(t) over a
complete period must be finite, and the signal can only
have a finite number of discontinuities in any finite
interval
Trigonometric form for Fourier series
If the two fundamental components of a
periodic signal areB1cos0t and C1sin0t,
then their sum is expressed by trigonometric
identities:
X(t)= A
0
+

k=1
(

B
k
2
+

A
k
2
)
1/2
(C
k
cos k t-

k
) or
X(t)= A
0
+

k=1
(

B
k
2
+

A
k
2
)
1/2
(C
k
sin k t+

k
)

UNIT II
Fourier Transform

Viewed periodic functions in terms of frequency components (Fourier
series) as well as ordinary functions of time
Viewed LTI systems in terms of what they do to frequency
components (frequency response)
Viewed LTI systems in terms of what they do to time-domain signals
(convolution with impulse response)
View aperiodic functions in terms of frequency components via
Fourier transform
Define (continuous-time) Fourier transform and DTFT
Gain insight into the meaning of Fourier transform through
comparison with Fourier series


The Fourier Transform
A transform takes one function (or signal)
and turns it into another function (or signal)
Continuous Fourier Transform:
( ) ( )
( ) ( )
}
}

=
=
df e f H t h
dt e t h f H
ift
ift
t
t
2
2
Continuous Time Fourier Transform
We can extend the formula for continuous-time Fourier series
coefficients for a periodic signal



to aperiodic signals as well. The continuous-time Fourier
series is not defined for aperiodic signals, but we call the
formula

the (continuous time)
Fourier transform.

} }

e e
= =
2 / p
2 / p
t ik
p
0
t ik
k
dt e ) t ( x
p
1
dt e ) t ( x
p
1
X
0 0
}

e
= e dt e ) t ( x ) ( X
t i
Inverse Transforms
If we have the full sequence of Fourier coefficients for a periodic
signal, we can reconstruct it by multiplying the complex
sinusoids of frequency
0
k by the weights X
k
and summing:



We can perform a similar reconstruction for aperiodic signals


These are called the inverse transforms.

=
e
=
1 p
0 k
n ik
k
0
e X ) n ( x

=
e
=
k
t ik
k
0
e X ) t ( x
}

e
e e
t
= d e ) ( X
2
1
) t ( x
t i
}
t
t
e
e e
t
= d e ) ( X
2
1
) n ( x
n i
Fourier Transform of Impulse Functions
Find the Fourier transform of the Dirac delta function:



Find the DTFT of the Kronecker delta function:



The delta functions contain all frequencies at equal amplitudes.
Roughly speaking, thats why the system response to an impulse
input is important: it tests the system at all frequencies.

1 e dt e ) t ( dt e ) t ( x ) ( X
0 i t i t i
= = o = = e
e

e
} }
1 e e ) n ( e ) n ( x ) ( X
0 i
n
n i
n
n i
= = o = = e
e

=
e

=
e

Laplace Transform
Lapalce transform is a generalization of the Fourier transform in the sense
that it allows complex frequency whereas Fourier analysis can only
handle real frequency. Like Fourier transform, Lapalce transform allows
us to analyze a linear circuit problem, no matter how complicated the
circuit is, in the frequency domain in stead of in he time domain.
Mathematically, it produces the benefit of converting a set of differential
equations into a corresponding set of algebraic equations, which are much
easier to solve. Physically, it produces more insight of the circuit and
allows us to know the bandwidth, phase, and transfer characteristics
important for circuit analysis and design.
Most importantly, Laplace transform lifts the limit of Fourier analysis to
allow us to find both the steady-state and transient responses of a linear
circuit. Using Fourier transform, one can only deal with he steady state
behavior (i.e. circuit response under indefinite sinusoidal excitation).
Using Laplace transform, one can find the response under any types of
excitation (e.g. switching on and off at any given time(s), sinusoidal,
impulse, square wave excitations, etc.

Laplace Transform
Application of Laplace Transform to
Circuit Analysis
system

A system is an operation that transforms
input signal x into output signal y.
LTI Digital Systems
Linear Time Invariant
Linearity/Superposition:
If a system has an input that can be
expressed as a sum of signals, then the
response of the system can be expressed as
a sum of the individual responses to the
respective systems.
LTI
Time-Invariance &Causality

If you delay the input, response is just a delayed
version of original response.

X(n-k) y(n-k)

Causality could also be loosely defined by there is
no output signal as long as there is no input
signal or output at current time does not depend
on future values of the input.

Convolution
The input and output signals for LTI
systems have special relationship in terms
of convolution sum and integrals.

Y(t)=x(t)*h(t) Y[n]=x[n]*h[n]


UNIT III
Sampling theory

The theory of taking discrete sample values (grid of color
pixels) from functions defined over continuous domains
(incident radiance defined over the film plane) and then
using those samples to reconstruct new functions that are
similar to the original (reconstruction).
Sampler: selects sample points on the image plane
Filter: blends multiple samples together
Sampling theory
For band limited function, we can just
increase the sampling rate
However, few of interesting functions in
computer graphics are band limited, in
particular, functions with discontinuities.
It is because the discontinuity always falls
between two samples and the samples
provides no information of the discontinuity.
Sampling theory
Aliasing
Z-transforms
For discrete-time systems, z-transforms play
the same role of Laplace transforms do in
continuous-time systems


As with the Laplace transform, we compute
forward and inverse z-transforms by use of
transforms pairs and properties
| |

=
n
n
z n h z H ] [
Bilateral Forward z-transform
}
+
=
R
n
dz z z H
j
n h
1
] [
2
1
] [
t
Bilateral Inverse z-transform
Region of Convergence
Region of the complex
z-plane for which
forward z-transform
converges

Im{z}
Re{z}
Entire
plane
Im{z}
Re{z}
Complement
of a disk
Im{z}
Re{z}
Disk
Im{z}
Re{z}
Intersection
of a disk and
complement
of a disk
Four possibilities (z=0
is a special case and
may or may not be
included)
Z-transform Pairs
h[n] = o[n]

Region of convergence:
entire z-plane
h[n] = o[n-1]

Region of convergence:
entire z-plane
h[n-1] z
-1
H[z]
| | | | 1 ] [
0
0
= = =

=

n
n
n
n
z n z n z H o o
| | | |
1
1
1
1 1 ] [

=

= = =

z z n z n z H
n
n
n
n
o o
| |
1 if
1
1
] [
0 0
<

=
|
.
|

\
|
= =
=

z
a
z
a
z
a
z a
z n u a z H
n
n
n
n n
n
n n
h[n] = a
n
u[n]






Region of
convergence: |z|
> |a| which is
the complement
of a disk
| | a z
z a
n u a
Z
n
>

for
1
1
1
Stability
Rule #1: For a causal sequence, poles are
inside the unit circle (applies to z-transform
functions that are ratios of two polynomials)
Rule #2: More generally, unit circle is
included in region of convergence. (In
continuous-time, the imaginary axis would
be in the region of convergence of the
Laplace transform.)

This is stable if |a| < 1 by rule #1.
It is stable if |z| > |a| and |a| < 1 by rule #2.
Inverse z-transform
Yuk! Using the definition requires a contour
integration in the complex z-plane.
Fortunately, we tend to be interested in only
a few basic signals (pulse, step, etc.)
Virtually all of the signals well see can be built
up from these basic signals.
For these common signals, the z-transform pairs
have been tabulated (see Lathi, Table 5.1)
| | | | dz z z F
j
n f
n
j c
j c
1
2
1

+

}
=
t
Example
Ratio of polynomial z-
domain functions
Divide through by the
highest power of z
Factor denominator into
first-order factors
Use partial fraction
decomposition to get
first-order terms
2
1
2
3
1 2
] [
2
2
+
+ +
=
z z
z z
z X
2 1
2 1
2
1
2
3
1
2 1
] [


+
+ +
=
z z
z z
z X
( )
1 1
2 1
1
2
1
1
2 1
] [

|
.
|

\
|

+ +
=
z z
z z
z X
1
2
1
1
0
1
2
1
1
] [


+

+ =
z
A
z
A
B z X
Example (cont)
Find B
0
by
polynomial division

Express in terms of
B
0


Solve for A
1
and A
2

1 5
2 3
2
1 2 1
2
3
2
1
1
1 2
1 2 1 2

+
+ + +

z
z z
z z z z
( )
1 1
1
1
2
1
1
5 1
2 ] [

|
.
|

\
|

+
+ =
z z
z
z X
8
2
1
1 2 1
2
1
1
2 1
9
2 1
4 4 1
1
2 1
1
1
2 1
2
2
1
2 1
1
1
1
=
+ +
=

+ +
=
=

+ +
=

+ +
=
=

z
z
z
z z
A
z
z z
A
Example (cont)
Express X[z] in terms of B
0
, A
1
, and A
2



Use table to obtain inverse z-transform

With the unilateral z-transform, or the
bilateral z-transform with region of
convergence, the inverse z-transform is
unique
1
1 1
8
2
1
1
9
2 ] [


+

=
z
z
z X
| | | | | | | | n u n u n n x
n
8
2
1
9 2 +
|
.
|

\
|
= o
Z-transform Properties
Linearity


Right shift (delay)
| | | | | | | | z F a z F a n f a n f a
2 2 1 1 2 2 1 1
+ +
| | | | | | z F z m n u m n f
m

| | | | | | | | |
.
|

\
|
+

=

m
n
n m m
z n f z z F z n u m n f
1
Z-transform Properties
| | | | | | | |
| | | | { } | | | |
| | | |
| | | |
| | | |
( )
| | | |
| | | | z F z F
z r f z m f
z r f m f
z m n f m f
z m n f m f
m n f m f Z n f n f Z
m n f m f n f n f
r
r m
m
m r
m r
m n
n
n
n
m
m
m
2 1
2 1
2 1
2 1
2 1
2 1 2 1
2 1 2 1
=
|
.
|

\
|
|
.
|

\
|
=
=
=
|
.
|

\
|
=
)
`

= -
= -

=
+

=
Convolution definition
Take z-transform
Z-transform definition
Interchange summation
Substitute r = n - m
Z-transform definition
UNIT IV
Introduction
Impulse response h[n] can fully characterize a LTI
system, and we can have the output of LTI system as


The z-transform of impulse response is called transfer or
system function H(z).

Frequency response at is valid if
ROC includes and

| | | | | | n h n x n y - =
( ) ( ) ( ). z H z X z Y =
( ) ( )
1 =
=
z
j
z H e H
e
, 1 = z
( ) ( ) ( )
e e e j j j
e H e X e Y =
5.1 Frequency Response of LIT
System
Consider and
, then
magnitude


phase



We will model and analyze LTI systems based on the
magnitude and phase responses.
) (
) ( ) (
e
e e
j
e X j j j
e e X e X
Z
=
) (
) ( ) (
e
e e
j
e H j j j
e e H e H
Z
=
) ( ) ( ) (
e e e j j j
e H e X e Y =
) ( ) ( ) (
e e e j j j
e H e X e Y Z + Z = Z
System Function
General form of LCCDE



Compute the z-transform




| | | | k n x b k n y a
M
k
k
N
k
k
=

= = 0 0
( ) z X z b z Y z a
k
M
k
k
N
k
k
k

= =

=
0 0
) (
( )
( )
( )

=
= =
N
k
k
k
k
M
k
k
z a
z b
z X
z Y
z H
0
0
System Function: Pole/zero
Factorization
Stability requirement can be verified.
Choice of ROC determines causality.
Location of zeros and poles determines the
frequency response and phase
( )
( )
( )
[
[
=

=
N
k
k
M
k
k
z d
z c
a
b
z H
1
1
1
1
0
0
1
1
. ,..., , : zeros
2 1 M
c c c
. ,..., , : poles
2 1 N
d d d
Second-order System
Suppose the system function of a LTI system is


To find the difference equation that is satisfied by
the input and out of this system



Can we know the impulse response?
.
)
4
3
1 )(
2
1
1 (
) 1 (
) (
1 1
2 1

+
+
=
z z
z
z H
) (
) (
8
3
4
1
1
2 1
)
4
3
1 )(
2
1
1 (
) 1 (
) (
2 1
2 1
1 1
2 1
z X
z Y
z z
z z
z z
z
z H =
+
+ +
=
+
+
=

] 2 [ 2 ] 1 [ 2 ] [ ] 2 [
8
3
] 1 [
4
1
] [ + + = + n x n x n x n y n y n y
System Function: Stability
Stability of LTI system:


This condition is identical to the condition
that


The stability condition is equivalent to the
condition that the ROC of H(z) includes the unit
circle.

=
<
n
n h ] [
. 1 when ] [ = <

z z n h
n
n
System Function: Causality
If the system is causal, it follows that h[n] must be a right-
sided sequence. The ROC of H(z) must be outside the
outermost pole.
If the system is anti-causal, it follows that h[n] must be a
left-sided sequence. The ROC of H(z) must be inside the
innermost pole.
1
a
Im
Re
1
a
Im
Re
b a
Im
Re
Right-sided
(causal)
Left-sided
(anti-causal)
Two-sided
(non-causal)
Determining the ROC
Consider the LTI system


The system function is obtained as
] [ ] 2 [ ] 1 [
2
5
] [ n x n y n y n y = +
) 2 1 )(
2
1
1 (
1

2
5
1
1
) (
1 1
2 1



=
+
=
z z
z z
z H
System Function: Inverse Systems
is an inverse system for , if






The ROCs of must overlap.
Useful for canceling the effects of another system
See the discussion in Sec.5.2.2 regarding ROC
( ) z H
i
( ) z H
1 ) ( ) ( ) ( = = z H z H z G
i
) (
1
) (
z H
z H
i
=
) (
1
) (
e
e
j
j
i
e H
e H =
| | | | | | | | n n h n h n g
i
o = - =
) ( and ) ( z H z H
i
All-pass System
A system of the form (or cascade of these)
( )
1
1
1

-

=
az
a z
Z H
Ap
( ) 1 =
e j
Ap
e H
( )
e
e
e
e
e
e
j
j
j
j
j
j
Ap
ae
e a
e
ae
a e
e H

=
1
* 1
1
u
u
j
j
e r a
re a
1
* / 1 : zero
: pole

=
=
All-pass System: General Form
In general, all pass systems have form





( )
[ [
=


=

=
c r
M
k
k k
k k
M
k
k
k
Ap
z e z e
e z e z
z d
d z
z H
1
1 * 1
1 * 1
1
1
1
) 1 )( 1 (
) )( (
1
Causal/stable:
1 , <
k k
d e
real poles complex poles
All-Pass System Example
0.8
0.5
z-plane
Unit
circle
4
3

3
4

2
Re
Im
1 and 2 = =
c r
M M
zeros. and poles 4 2 has system pass - all This = + = =
r c
M M N M
u u j j
e r re
1 conj ugate & reciprocal
: zero : pole


Minimum-Phase System
Minimum-phase system: all zeros and all poles are
inside the unit circle.
The name minimum-phase comes from a property of the
phase response (minimum phase-lag/group-delay).
Minimum-phase systems have some special properties.
When we design a filter, we may have multiple choices to
satisfy the certain requirements. Usually, we prefer the
minimum phase which is unique.
All systems can be represented as a minimum-phase
system and an all-pass system.
UNIT V
Example
Block diagram representation of
| | | | | | | | n x b 2 n y a 1 n y a n y
0 2 1
+ + =
Block Diagram Representation
LTI systems with
rational system
function can be
represented as
constant-coefficient
difference equation
The implementation of
difference equations
requires delayed
values of the
input
output
intermediate results
The requirement of
delayed elements
implies need for
storage
We also need means
of
addition
multiplication

Direct Form I
General form of difference equation


Alternative equivalent form


| | | |

= =
=
M
0 k
k
N
0 k
k
k n x b

k n y a
| | | | | |

= =
=
M
0 k
k
N
1 k
k
k n x b k n y a n y
Direct Form I
Transfer function can be written as



Direct Form I Represents
( )

=
N
1 k
k
k
M
0 k
k
k
z a 1
z b
z H
( ) ( ) ( )
( ) ( ) ( ) ( )
( ) ( ) ( ) ( ) z V
z a 1
1
z V z H z Y
z X z b z X z H z V
z b
z a 1
1
z H z H z H
N
1 k
k
k
2
M
0 k
k
k 1
M
0 k
k
k
N
1 k
k
k
1 2
|
|
|
|
.
|

\
|

= =
|
|
.
|

\
|
= =
|
|
.
|

\
|
|
|
|
|
.
|

\
|

= =

| | | |
| | | | | | n v k n y a n y
k n x b n v
N
1 k
k
M
0 k
k
+ =
=

=
=
Alternative Representation
Replace order of cascade LTI systems




( ) ( ) ( )
( ) ( ) ( ) ( )
( ) ( ) ( ) ( ) z W z b z W z H z Y
z X
z a 1
1
z X z H z W
z a 1
1
z b z H z H z H
M
0 k
k
k 1
N
1 k
k
k
2
N
1 k
k
k
M
0 k
k
k 2 1
|
|
.
|

\
|
= =
|
|
|
|
.
|

\
|

= =
|
|
|
|
.
|

\
|

|
|
.
|

\
|
= =

=
=

| | | | | |
| | | |

=
=
=
+ =
M
0 k
k
N
1 k
k
k n w b n y
n x k n w a n w
Alternative Block Diagram
We can change the order of the cascade
systems
| | | | | |
| | | |

=
=
=
+ =
M
0 k
k
N
1 k
k
k n w b n y
n x k n w a n w
Direct Form II
No need to store the same data
twice in previous system
So we can collapse the delay
elements into one chain
This is called Direct Form II or
the Canonical Form
Theoretically no difference
between Direct Form I and II
Implementation wise
Less memory in Direct II
Difference when using
finite-precision arithmetic
Signal Flow Graph Representation
Similar to block diagram representation
Notational differences
A network of directed branches connected
at nodes






Example representation of a difference
equation

Example
Representation of Direct Form II with signal
flow graphs
| | | | | |
| | | |
| | | | | |
| | | |
| | | | n w n y
1 n w n w
n w b n w b n w
n w n w
n x n aw n w
3
2 4
4 1 2 0 3
1 2
4 1
=
=
+ =
=
+ =
| | | | | |
| | | | | | 1 n w b n w b n y
n x 1 n aw n w
1 1 1 0
1 1
+ =
+ =
Determination of System
Function from Flow Graph
| | | | | |
| | | |
| | | | | |
| | | |
| | | | | | n w n w n y
1 n w n w
n x n w n w
n w n w
n x n w n w
4 2
3 4
2 3
1 2
4 1
+ =
=
+ =
o =
=
( ) ( ) ( )
( ) ( )
( ) ( ) ( )
( ) ( )
( ) ( ) ( ) z W z W z Y
z z W z W
z X z W z W
z W z W
z X z W z W
4 2
1
3 4
2 3
1 2
4 1
+ =
=
+ =
o =
=

( )
( )( )
( )
( ) ( )
( ) ( ) ( ) z W z W z Y
z 1
1 z z X
z W
z 1
1 z z X
z W
4 2
1
1
4
1
1
2
+ =
o
o
=
o
o
=

( )
( )
( )
| | | | | | n u 1 n u n h
z 1
z
z X
z Y
z H
1 n 1 n
1
1
+

o o =
o
o
= =
Basic Structures for IIR Systems:
Direct Form I

Basic Structures for IIR Systems:
Direct Form II

Basic Structures for IIR Systems:
Cascade Form
General form for cascade implementation




More practical form in 2
nd
order systems
( )
( ) ( )( )
( ) ( )( )
[ [
[ [
=
-
=

=
-
=

=
2 1
2 1
N
1 k
1
k
1
k
N
1 k
1
k
M
1 k
1
k
1
k
M
1 k
1
k
z d 1 z d 1 z c 1
z g 1 z g 1 z f 1
A z H
( )
[
=



+
=
1
M
1 k
2
k 2
1
k 1
2
k 2
1
k 1 k 0
z a z a 1
z b z b b
z H
Example




Cascade of Direct Form I subsections




Cascade of Direct Form II subsections
( )
( )( )
( )( )
( )
( )
( )
( )
1
1
1
1
1 1
1 1
2 1
2 1
z 25 . 0 1
z 1
z 5 . 0 1
z 1

z 25 . 0 1 z 5 . 0 1
z 1 z 1
z 125 . 0 z 75 . 0 1
z z 2 1
z H

+
=

+ +
=
+
+ +
=
Basic Structures for IIR Systems:
Parallel Form
Represent system function using partial fraction expansion



Or by pairingthe real poles
( )
( )
( )( )

= =
-

+ =
P P P
N
1 k
N
1 k
1
k
1
k
1
k k
1
k
k
N
0 k
k
k
z d 1 z d 1
z e 1 B
z c 1
A
z C z H
( )

=

+
+ =
S P
N
1 k
2
k 2
1
k 1
1
k 1 k 0
N
0 k
k
k
z a z a 1
z e e
z C z H
Example
Partial Fraction Expansion





Combine poles to get
( )
( ) ( )
1 1 2 1
2 1
z 25 . 0 1
25
z 5 . 0 1
18
8
z 125 . 0 z 75 . 0 1
z z 2 1
z H

+ =
+
+ +
=
( )
2 1
1
z 125 . 0 z 75 . 0 1
z 8 7
8 z H

+
+
+ =
Transposed Forms
Linear signal flow graph property:
Transposing doesnt change the input-output
relation
Transposing:
Reverse directions of all branches
Interchange input and output nodes
Example:



Reverse directions of branches and interchange
input and output

( )
1
az 1
1
z H

=
Example
Transpose






Both have the same system function or
difference equation
| | | | | | | | | | | | 2 n x b 1 n x b n x b 2 n y a 1 n y a n y
2 1 0 2 1
+ + + + =
Basic Structures for FIR Systems: Direct Form
Special cases of IIR direct form structures








Transpose of direct form I gives direct form II
Both forms are equal for FIR systems
Tapped delay line
Basic Structures for FIR Systems:
Cascade Form
Obtained by factoring the polynomial
system function
( ) | | ( )
[
= =

+ + = =
M
0 n
M
1 k
2
k 2
1
k 1 k 0
n
S
z b z b b z n h z H
Structures for Linear-Phase FIR
Systems
Causal FIR system with generalized linear phase are
symmetric:

Symmetry means we can half the number of multiplications
Example: For even M and type I or type III systems:
| | | |
| | | | IV) or II (type M 0,1,..., n n h n M h
III) or I (type M 0,1,..., n n h n M h
= =
= =
| | | | | | | | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | ( ) | | | | 2 / M n x 2 / M h k M n x k n x k h
k M n x k M h 2 / M n x 2 / M h k n x k h
k n x k h 2 / M n x 2 / M h k n x k h k n x k h n y
1 2 / M
0 k
1 2 / M
0 k
1 2 / M
0 k
M
1 2 / M k
1 2 / M
0 k
M
0 k
+ + + =
+ + + =
+ + = =

=
+ =

= =
Structures for Linear-Phase FIR
Systems
Structure for even M


Structure for odd M