From b1f5c3f8d6671b4331cef1dcebdf63b7a43a3a2b Mon Sep 17 00:00:00 2001
From: priyanka
Date: Wed, 24 Jun 2015 15:03:17 +0530
Subject: initial commit / add all books

---
 830/CH6/EX6.11/FFT_Exercise2.sce      | 11 +++++++++++
 830/CH6/EX6.4.1/SNR_DFT.sce           | 14 ++++++++++++++
 830/CH6/EX6.4.2/SNR_FFT_ALGORITHM.sce | 14 ++++++++++++++
 830/CH6/EX6.8/FFT_Exercise1.sce       | 11 +++++++++++
 4 files changed, 50 insertions(+)
 create mode 100755 830/CH6/EX6.11/FFT_Exercise2.sce
 create mode 100755 830/CH6/EX6.4.1/SNR_DFT.sce
 create mode 100755 830/CH6/EX6.4.2/SNR_FFT_ALGORITHM.sce
 create mode 100755 830/CH6/EX6.8/FFT_Exercise1.sce

(limited to '830/CH6')

diff --git a/830/CH6/EX6.11/FFT_Exercise2.sce b/830/CH6/EX6.11/FFT_Exercise2.sce
new file mode 100755
index 000000000..2c91dc443
--- /dev/null
+++ b/830/CH6/EX6.11/FFT_Exercise2.sce
@@ -0,0 +1,11 @@
+//Graphical//
+//Exercise 6.11
+//Program to Calculate DFT using DIF-FFT algorithm
+//x[n]= [1/2,1/2,1/2,1/2,0,0,0,0]
+clear;
+clc;
+close;
+x = [1/2,1/2,1/2,1/2,0,0,0,0];
+X = fft(x,-1)
+//Inverse FFT
+x_inv = real(fft(X,1))
diff --git a/830/CH6/EX6.4.1/SNR_DFT.sce b/830/CH6/EX6.4.1/SNR_DFT.sce
new file mode 100755
index 000000000..e48aba672
--- /dev/null
+++ b/830/CH6/EX6.4.1/SNR_DFT.sce
@@ -0,0 +1,14 @@
+//Graphical//
+//Example 6.4.1
+//Program to Calculate No.of bits required for given
+//Signal to Quantization Noise Ratio
+//in computing DFT
+clear;
+clc;
+close;
+N = 1024;
+SQNR = 30;  //SQNR = 30 dB
+v = log2(N); //number of stages
+b = (log2(10^(SQNR/10))+2*v)/2;
+b = ceil(b)
+disp(b,'The number of bits required rounded to:')
diff --git a/830/CH6/EX6.4.2/SNR_FFT_ALGORITHM.sce b/830/CH6/EX6.4.2/SNR_FFT_ALGORITHM.sce
new file mode 100755
index 000000000..2fbdf5563
--- /dev/null
+++ b/830/CH6/EX6.4.2/SNR_FFT_ALGORITHM.sce
@@ -0,0 +1,14 @@
+//Graphical//
+//Example 6.4.2
+//Program to Calculate No.of bits required for given
+//Signal to Quantization Noise Ratio
+//in FFT algorithm
+clear;
+clc;
+close;
+N = 1024;
+SQNR = 30;  //SQNR = 30 dB
+v = log2(N); //number of stages
+b = (log2(10^(SQNR/10))+v+1)/2;
+b = ceil(b)
+disp(b,'The number of bits required rounded to:')
diff --git a/830/CH6/EX6.8/FFT_Exercise1.sce b/830/CH6/EX6.8/FFT_Exercise1.sce
new file mode 100755
index 000000000..54ed73fe4
--- /dev/null
+++ b/830/CH6/EX6.8/FFT_Exercise1.sce
@@ -0,0 +1,11 @@
+//Graphical//
+//Exercise 6.8
+//Program to Calculate DFT using DIF-FFT algorithm
+//x[n]= 1, 0<=n<=7
+clear;
+clc;
+close;
+x = [1,1,1,1,1,1,1,1];
+X = fft(x,-1)
+//Inverse FFT
+x_inv = real(fft(X,1))
-- 
cgit