Open navigation menu
Close suggestions
Search
Search
en
Change Language
Upload
Sign in
Sign in
Download free for days
0 ratings
0% found this document useful (0 votes)
30 views
8 pages
4
Signal Process_4
Uploaded by
Şems TANRIVERDi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content,
claim it here
.
Available Formats
Download as PDF or read online on Scribd
Download
Save
Save 4 For Later
Share
0%
0% found this document useful, undefined
0%
, undefined
Print
Embed
Report
0 ratings
0% found this document useful (0 votes)
30 views
8 pages
4
Signal Process_4
Uploaded by
Şems TANRIVERDi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content,
claim it here
.
Available Formats
Download as PDF or read online on Scribd
Carousel Previous
Carousel Next
Download
Save
Save 4 For Later
Share
0%
0% found this document useful, undefined
0%
, undefined
Print
Embed
Report
Download
Save 4 For Later
You are on page 1
/ 8
Search
Fullscreen
10 CIRCULAR CONVOLUTION 1. Lecture 10 - 43 minutes Circular Convolution x3(n) = x4(n) @ xa(n) Circular convolution expressed in terms of periodic and [Eom % con nto linear convolution. ee wt [Esco xo ((n-m)y Bunn) Net {% xm) xp((n-m))y} Byln) =[ x(n) * x2((ny] Ryln) a xy(m) xe((t-m))y Wl W Example of cizcular "i convolution of tw HUM Uris semresssson oF to xem) xo((2-m))y " In tt 0 m ils m x2-m))y x3(n) Whee: IT 0 mi 0 7 b. Ruin) An interpretation of BOLT nf en 8 at circular convolution. on x9{n) it Helm) ln “ 10.2Ayln) aif at ln) [ate bb-atn xin) x sah op eulnn oe) a "Circular Convolution = Linear Convolution+ Aliasing” xy(n) = Sgn) = xy(n) #x9(n) x3(n)= xy(n) © xoln) xg(n) = [ xa(n) +2, . ERs (n-+rN)] yn) xy(n)*xp(n) * py(n) Hl ° x4(n) *x9(n) x4(n)® xoln) _llil lin $ Rearrangement of the operations in forming the circular con- volution. Interpretation of circular convolution as linear convolution followed by aliasing. Example of a circular convolution formed by Linear convolution followed by aliasing.y(n) = xa{n) xy(n) *x9(n)*pay(n) ul toatl lll own 0 Nn X4(n) # xaln) x4(n) G9) xp(n) wll lilt 0 2N : ay h(n) ny Oo Mt n x(n) t a ° ae a ; 2 Obtaining a linear convolution through the use of circular convolution. A finite length unit sample response and a sequence of indefinite length. Sectioning of the se- quence x(n). 10.3xo(n)*h(n) Linear convolution of h(n) with the sections of x(n). Note the i overlap in the re= Suiting output sections. xy(n)* h(n) lll xe(n)* h(n) a Connents In the last lecture we introduced the property of circular convolution for the Discrete Fourier Transform. ‘The fact that multiplication of DPT's corresponds to a circular convolution rather than a linear convolution of the original sequences stems essentially from the implied periodicity in the use of the DFT, i.e. the fact that it essentially corresponds to the Discrete Fourier series of a periodic sequence. In this lecture we focus entirely on the properties of circular convolution and its relation to linear convolution. An interpretation of circular convolution as linear convolution followed by aliasing is developed. As we will see in a later lecture, there is a highly efficient algorithm for the computation of the DFT and consequently it is often useful in practice to implement a convolution (for implementing a filter, for example) by computing the Discrete Fourier Transforms, multiplying, and then inverse transforming. This leads, of course, to a circular convolu- tion, whereas it is generally a linear convolution that is desired. Consequently an important consideration is the use of circular convolu- tion to implement a linear convolution. This can be accomplished by extending the lengths of the sequences to be convolved by "padding" with zeros. An additional consideration is the fact that a signal to be filtered may be arbitrarily long. Filtering can still be accomplished in this case using the DPT by first sectioning the input into finite length segments and implementing the convolution for each of these. The filtered segments can then be added with the appropriate synchronization 10.4to produce the desired output. ‘There are two basic procedures which are commonly used, referred to as the “overlap-add" and “overlap-save” methods. Although only the first of these is presented in the lecture, both are discussed in the text. Reading Text: Sections 8.7.5. (page 542) and 8.9. Problens Problem 10 Let x(n) and h(n) denote two finite length sequences, both of length N. (a) What is the maximum possible length of the linear convolution of x(n) with h(n)? (b) What is the maximum possible length of the N-point circular convolution of x(n) with h(n)? Problem 10.2 In the figure below is shown a four-point sequence x(n). (a) Sketch the linear convolution of x(n) with x(n). (b) Sketch the four point circular convolution of x(n) with x(n). (c) Sketch the ten-point circular convolution of x(n) with x(n). (a) What is the smallest value of N for which an N-point circular convolution of x(n) with x(n) will be identical to the linear convolution? ute cod Figure P10.2-1 Problem 10.3 Consider two finite-duration sequences x(n) and y(n) where both are zero for n < 0 and with x(n) = 0, n>8 y(n) = 0, n> 20 10.5‘The 20-point DFTs of each of the sequences are multiplied and the invers: DPT computed. Let r(n) denote the inverse DFT. Specify which points in x(n) correspond to points that would be obtained in a linear convolution of x(n) and y(n). Problem 10.4" We want to filter a very long string of data with a FIR filter whose unit-sample response is 50 samples long. We wish to implement this filter with an FFT using the overlap-save technique. To do this: (1) ‘The input sections must be overlapped by V samples; and (2) from the output due to each section we must extract M samples such that when these samples from each section are butted together, the resulting sequence is the desired filtered output. Assume that the input segments are 100 samples long and that the size of the DFT is 128 (=27) points. Further assume that the output sequence from the circular convolution is indexed from point 0 to point 127. (a) Determine v. (b) Determine M. (c) Determine the index of the beginning and the end of the M points extracted; i.e., determine which of the 128 points from the circular convolution is extracted to be abutted with the result from the previous section. Problem 10.5* ‘The problem often arises in which a signal x(n) has been filtered by a linear time-invariant system that results in a distorted signal y(n) and we wish to recover the original signal. This can often be done by processing y(n) with a linear time-invariant system whose impulse response is such that the overall impulse response of the two systems in cascade is a unit sample. This is generally referred to as inverse filtering. We have discussed the procedure for implementing an PIR filter using the DPT. The procedure involves, in part, multiplying the DFT of the input, x(k) (or input sections), by H(k), the DFT of the system unit sample response to produce ¥(k), the DPT of the output. It is often suggested, incorrectly, that the sequence h,(n) whose DFT is 1/H#(k), is the impulse response of the inverse filter. The purpose of this problem is to indicate why that suggestion is incorrect. Consider a linear time-invariant system with impulse response h(n) given by 10.6hin) = 8(n) ~ 38(n - n4) 0 This system is an idealized example of a system that would introduce reverberation. Assume that N= 4 no. (a) Determine the N-point DPT H(k) of h(n). (b) Now consider the N-point DFT Hj (k) of a sequence h(n) specified by wy) = k= O10, N= 2 #00) Determine h(n). Hint: If you have trouble evaluating, the IDPT summation directly, express H,(k) as a polynomial in Wy 0 and observe that the h(n) are coefficients of w,™*. (c) By evaluating the linear convolution of h(n) and h,(n), show that h(n) * hy(n) is not a unit sample 6(n) and, consequently, hy (n) is not ‘the unit sample response for the inverse system. (a) Compute the N-point circular convolution of h(n) and hy (n). (e) Determine the unit-sample response h, (n) of the inverse sytem for h(n). This can be done in a number of ways. One is to note that with H(z) and H,(z) denoting the z-transforms of h(n) and h,(n), H, (2) = 1/H(2). ‘The inverse z-transforms of H,(z) can then be evaluated by long division. (£) Determine and verify numerically the relationship between hj (n) and hy (n). 10.7MIT OpenCourseWare http:locw.mit.edu Resource: Digital Signal Processing Prof, Alan V, Oppenheim The following may not correspond to a particular course on MIT OpenCourseWare, but has been provided by the author as an individual learning resource. For information about citing these materials or our Terms of Use, visit: htip:/ocw.mitedu/terms.
You might also like
Digital Signal Processing Lab Manual ECE 5th Sem 14092023
PDF
No ratings yet
Digital Signal Processing Lab Manual ECE 5th Sem 14092023
91 pages
Linear Filtering Via DFT
PDF
100% (1)
Linear Filtering Via DFT
17 pages
Unit Iii - Discrete Fourier Series & Fourier Transforms Syllabus
PDF
No ratings yet
Unit Iii - Discrete Fourier Series & Fourier Transforms Syllabus
17 pages
Lecture 6 Convolution Using DFT
PDF
No ratings yet
Lecture 6 Convolution Using DFT
38 pages
Scilab Programs
PDF
100% (1)
Scilab Programs
47 pages
Manual
PDF
No ratings yet
Manual
38 pages
DFT (Discrete-Fourier Transform)
PDF
No ratings yet
DFT (Discrete-Fourier Transform)
40 pages
DSP Manual Exp1 9
PDF
No ratings yet
DSP Manual Exp1 9
34 pages
DSP5-Discrete Fourier Transform
PDF
No ratings yet
DSP5-Discrete Fourier Transform
51 pages
DSP Module 3
PDF
No ratings yet
DSP Module 3
40 pages
Chapter 2 Part 2
PDF
No ratings yet
Chapter 2 Part 2
45 pages
Digital Signal Processing
PDF
No ratings yet
Digital Signal Processing
53 pages
DSP-Manual - R19
PDF
No ratings yet
DSP-Manual - R19
74 pages
Advanced Digital Signal Processing Part 4: DFT and FFT: Gerhard Schmidt
PDF
No ratings yet
Advanced Digital Signal Processing Part 4: DFT and FFT: Gerhard Schmidt
73 pages
DSP 9
PDF
No ratings yet
DSP 9
31 pages
DSP Question Bank With Solutions
PDF
No ratings yet
DSP Question Bank With Solutions
52 pages
3F3 2a More On DFT
PDF
No ratings yet
3F3 2a More On DFT
16 pages
DSP Lab Report # 04
PDF
No ratings yet
DSP Lab Report # 04
23 pages
Digital Signal Processing
PDF
No ratings yet
Digital Signal Processing
34 pages
Adsp 04 DFT and FFT
PDF
No ratings yet
Adsp 04 DFT and FFT
73 pages
ECT303 - Module 1 - Part - 3
PDF
No ratings yet
ECT303 - Module 1 - Part - 3
24 pages
Digital Signal Processing Digital Signal Processing: Course Instructor Dr. Deepa Sharma ECE Department IIIT Bhopal
PDF
No ratings yet
Digital Signal Processing Digital Signal Processing: Course Instructor Dr. Deepa Sharma ECE Department IIIT Bhopal
48 pages
DSP BEC502 Module-3
PDF
No ratings yet
DSP BEC502 Module-3
29 pages
Course 11-1 - Circular Conv. Revisited
PDF
No ratings yet
Course 11-1 - Circular Conv. Revisited
10 pages
Questions On DSP
PDF
No ratings yet
Questions On DSP
10 pages
Lab 6
PDF
No ratings yet
Lab 6
12 pages
DFT Notes
PDF
No ratings yet
DFT Notes
32 pages
Chapter5 PDF
PDF
No ratings yet
Chapter5 PDF
50 pages
COE4TL4 Lecture17
PDF
No ratings yet
COE4TL4 Lecture17
13 pages
Eee 22059
PDF
No ratings yet
Eee 22059
8 pages
Unit-4 - Kec503 DSP - 2023-24
PDF
No ratings yet
Unit-4 - Kec503 DSP - 2023-24
34 pages
Digital Signal Processing
PDF
No ratings yet
Digital Signal Processing
101 pages
Lab Report#08 DSP
PDF
No ratings yet
Lab Report#08 DSP
11 pages
Exp 4
PDF
No ratings yet
Exp 4
3 pages
Ece Odd9
PDF
No ratings yet
Ece Odd9
17 pages
Review of Discrete Fourier Transform: Cwliu@twins - Ee.nctu - Edu.tw
PDF
No ratings yet
Review of Discrete Fourier Transform: Cwliu@twins - Ee.nctu - Edu.tw
46 pages
Chapter 4 - The DFT and FFT
PDF
No ratings yet
Chapter 4 - The DFT and FFT
50 pages
05 DFT
PDF
No ratings yet
05 DFT
20 pages
Advanced Training Course On FPGA Design and VHDL For Hardware Simulation and Synthesis
PDF
No ratings yet
Advanced Training Course On FPGA Design and VHDL For Hardware Simulation and Synthesis
20 pages
Presentation A Nu
PDF
No ratings yet
Presentation A Nu
45 pages
Ec 2302 - DSP
PDF
No ratings yet
Ec 2302 - DSP
49 pages
Digital Signal Processing (Lecture2) : Dr. Anumoy Ghosh Assistant Professor ECE Dept
PDF
No ratings yet
Digital Signal Processing (Lecture2) : Dr. Anumoy Ghosh Assistant Professor ECE Dept
20 pages
DSP-DFT Properties-Overlapaddsaveassignment
PDF
No ratings yet
DSP-DFT Properties-Overlapaddsaveassignment
2 pages
Linear Filtering Using DFT
PDF
No ratings yet
Linear Filtering Using DFT
18 pages
2
PDF
No ratings yet
2
9 pages
Bharathi Education Trust G. Madegowda Institute of Technology (Gmit)
PDF
No ratings yet
Bharathi Education Trust G. Madegowda Institute of Technology (Gmit)
11 pages
Bharathi Education Trust G. Madegowda Institute of Technology (Gmit)
PDF
No ratings yet
Bharathi Education Trust G. Madegowda Institute of Technology (Gmit)
10 pages
Department of Electronics & Communication Engineering: Amrapali Institute OF Technology and Sciences
PDF
No ratings yet
Department of Electronics & Communication Engineering: Amrapali Institute OF Technology and Sciences
42 pages
DSP Circular Convolution
PDF
No ratings yet
DSP Circular Convolution
5 pages
Linear Cicruclar Convolution - Practice Problems
PDF
No ratings yet
Linear Cicruclar Convolution - Practice Problems
2 pages
DSP Note
PDF
No ratings yet
DSP Note
7 pages
Name: Madhankumar.S REG NO: 15BEE0305 Roll No: Title of The Assignment: Subject: Digital Signal Processing Faculty: Mahalakshmi.P
PDF
No ratings yet
Name: Madhankumar.S REG NO: 15BEE0305 Roll No: Title of The Assignment: Subject: Digital Signal Processing Faculty: Mahalakshmi.P
7 pages
Assignment 10 Linear and Circular Convolution: April 3, 2019
PDF
No ratings yet
Assignment 10 Linear and Circular Convolution: April 3, 2019
5 pages
1
PDF
No ratings yet
1
8 pages
3
PDF
No ratings yet
3
6 pages
Linear Convolution Vs Circular Convolution in The DFT
PDF
100% (3)
Linear Convolution Vs Circular Convolution in The DFT
4 pages
5
PDF
No ratings yet
5
4 pages