Procedure:-
1. Enter the sequence x
2. Enter the sequence y
3. Find the lengths of x and y,ie;Nx and Ny respectively
4. Check Nx=Ny:proceed if equal
5. Initialize a loop variable number of output points
6. For each out sample , access the samples of y in the cyclic order
7. Find the sum of products of x and cyclically folded and shifted y
Description:-
Steps for Cyclic Convolution
Steps for cyclic convolution are the same as the usual convolution, except all index calculations are done mod N = on ....etc

[:=Read Full Message Here=:]

#include
#include
int m,n,x,h,y,i,j,temp,k,x2,a;
void main()
{
printf( enter the length of the first sequence\n);
scanf(%d,&m);
printf( enter the length of the second sequence\n);
scanf(%d,&n);
printf( enter the first sequence\n);
for(i=0;i scanf(%d,&x);
printf( enter the second sequence\n);
for(j=0;j scanf(%d,&h);
if(m-n!=0) /*If length of both sequences are not equal*/
{
if(m>n) /* Pad the smalle ....etc

[:=Read Full Message Here=:]

Circular convolution using vedic methode ....etc

[:=Read Full Message Here=:]

Abstract
Information hiding for covert communication is rapidlygaining momentum. With sophisticated techniques beingdeveloped in steganography, steganalysis needs to beuniversal. In this paper we propose Universal Steganalysisusing Histogram, Discrete Fourier Transform and SVM(SHDFT). The stego image has irregular statisticalcharacteristics as compare to cover image. Using Histogramand DFT, the statistical features are generated to train One-Class SVM to discriminate the cover and stego image.SHDFT algorithm is found to be efficient an ....etc

[:=Read Full Message Here=:]

Procedure:-
1) Find the length of the first sequence x=x_length
2) Find the length of the first sequence h=h_length
3) Take the circular convolution order as N
4) If x_length < N, pad enough number of zeros to x, so that the number of samples in the modified x=N
5) If h_length < N ,pad enough number of zeros to h, so that the number of samples in the modified h=N
6) Take DFT for modified x=x(k)
7) Take DFT for modified h=H(k)
8) Compute Y(K)=X(K)*H(K)
9) Compute y(n)=IDFT(Y(k))
10) Verify if y=conv(x, ....etc

[:=Read Full Message Here=:]

circular convolution of different length sequences ....etc

[:=Read Full Message Here=:]

I need code for circular convolution in verilog ....etc

[:=Read Full Message Here=:]

2-D DFT of two dimensional finite extent sequences.

2-D DFT and Convolution
The DFT can be computed with a fast algorithm and it is sometimes beneficial to do the convolution of two sequences A (M1 £ N1) and B (M2 £ N2) via point DFTs. Speed improvements are only possible if both sequences have large dimensions. Otherwise convolutions are better implemented via the convolution sum.

2-D Low-Pass Filtering of Images We will be intere ....etc

[:=Read Full Message Here=:]

Procedure:-
1) Find the length of the first sequence x=x_length
2) Find the length of the second sequence h=h_length
3) Estimate the number of samples in the result of linear convolution of x &h=Y_length
4) If X_length 5) If h_length 6) Take DFT for modified x=x(k)
7) Take DFT for modified h=H(k)
8) ....etc

[:=Read Full Message Here=:]

I need source code of Image Steganography in frequency domain using DFT .
plz email me at [email protected]
....etc

[:=Read Full Message Here=:]