## Circular convolution

Circular convolution using DFT in scilab

```
//Performing Circular COnvolution
//Using DFT
clear all;
clc;
close;
L = 4; //Length of the Sequence
N = 4; // N -point DFT
x1 = [2,1,2,1];
x2 = [1,2,3,4];
//Computing DFT
X1 = dft(x1,-1)
X2 = dft(x2,-1)
//Multiplication of 2 DFTs
X3 = X1.*X2
//Circular Convolution Result
x3 =abs(dft(X3,1))
disp(x3,'x3=')
```

## Comments:

machohafiz

Said:

bro if I have question like this. enter a n-point & m-point -->discrete sequence
which is n=2^p, m=2^q where p>q
function :- y[n]= x[n] N h[m]..
how to do

5 years ago

0

Sorry, you need javascript enabled to post any comments.

Sorry, you need javascript enabled to post any comments.