mastcode.txt

FFT FFT FFT FFT FFT FFT FFT FFT FFT FFT FFT FFT FFT FFT FFT FFT FFT FFT FFT FFT FFT FFT FFT FFT FFT

Dim funct(32)
Dim functI(32)
Dim n



Private Sub about_Click()
msg$ = "This tutorial is programmed by ENGINEER SHERIF OMRAN "
msg$ = msg$ + "in the first term of master degree of biomedical"
msg$ = msg$ + " electronis, It is presented to everyone who studies "
msg$ = msg$ + "introduction and fast algorithms to Digital Signal Processing" + Chr$(13)
msg$ = msg$ + "Please email me for details: [e-mail] or call [phone] EGYPT-Alexandria UNI- Faculty of engineering-2000"
Title$ = "Author"
a = MsgBox(msg$)

End Sub

Private Sub bitreversal_Click()
a: binarycode = InputBox$("Please enter the value in decimal form <64 ", "Converter from binary to gray")
Dim r(6)
b = Val(binarycode)
If b > 64 Then GoTo a

e = b
hj = (Log(b) / Log(2))
hu = Int(hj) - hj
If hu = 0 Then n1 = 2 ^ (hj + 1) Else n1 = 2 ^ (hj + 1)
hh = Log(n1) / Log(2) - 1:
For i = hh To 0 Step -1
u = 2 ^ i:
If e >= u Then r(i) = 1: e = e - u Else r(i) = 0
Next
Dim xb(6), db(6)
'producing the gray code for the binary code
For i = hh To 0 Step -1: db(i) = r(hh - i)
Next:
Text1.Text = "the binary form of this no is"
Text2.Text = "the bit reversed no is"
For ii = hh To 0 Step -1
Text1.Text = Text1.Text + Str$(r(ii)) + " "
Text2.Text = Text2.Text + Str$(db(ii)) + " "
Next ii
'reply = MsgBox(mss$ + msg2$, vbInformation, "code converted")


End Sub

Private Sub BTG_Click()
a: binarycode = InputBox$("Please enter the value in decimal form <64 ", "Converter from binary to gray")
Dim r(6)
b = Val(binarycode)
If b > 64 Then GoTo a

e = b
hj = (Log(b) / Log(2))
hu = Int(hj) - hj
If hu = 0 Then n1 = 2 ^ (hj + 1) Else n1 = 2 ^ (hj + 1)
hh = Log(n1) / Log(2) - 1:
For i = hh To 0 Step -1
u = 2 ^ i:
If e >= u Then r(i) = 1: e = e - u Else r(i) = 0
Next
Dim xb(6)
'producing the gray code for the binary code
For i = hh To 0 Step -1: xb(i) = r(i + 1) Xor r(i)
If i = hh Then xb(i) = r(i)
'PRINT B(I);
'Form1.Print r(i)
Next:
Text1.Text = "the binary form of this no is"
Text2.Text = "the gray code of this no is "
For ii = hh To 0 Step -1
Text1.Text = Text1.Text + Str$(r(ii)) + " "
Text2.Text = Text2.Text + Str$(xb(ii)) + " "
Next ii
'reply = MsgBox(mss$ + msg2$, vbInformation, "code converted")






'PRINT :

End Sub

Private Sub DFT_Click()
'n1 is the number of readings
n1 = 30
w = 2 * 3.14 / n1
'readings in f(k)
Dim f(200), d(256)
For i = 1 To n - 1: f(i) = funct(i): Next
p = 1
For p = 1 To n
For i = 0 To n - 1
Real = Cos(w * i * p)
imaginary = Sin(-1 * w * p * i)
modulus = (Real ^ 2 + imaginary ^ 2) ^ 0.5
Value = f(i) * modulus
outputd = outputd + Value
Next i
d(p) = outputd ' where d(p) is the discrete fourier transform
Next p

Text1.Text = ""
Text2.Text = ""
Text1.Text = "DATA OUTPUT ---- The wave Signal present in memory" + String$(55, " ")
Text1.Text = Text1.Text + "X(n) REAL" + String$(126, " ")
For i = 0 To n - 1: Text1.Text = Text1.Text + Str$(funct(i)) + "   "
Next:

End Sub

Private Sub eightpoints_Click()
eightpoints.Checked = True
sixteenpoints.Checked = False
n = 8
End Sub

Private Sub EXIT_Click()
End
End Sub

Private Sub FFT_Click()
Text1.Text = "": Text2.Text = ""
c = Log(n) / Log(2):
Dim inputR(16), inputI(16), outputR(16), outputI(16), bitrevinputR(16 * 2), bitrevinputI(2 * 16)
Dim a(2 * 16): Dim ax(2 * 16): Dim taken(2 * 16): Dim aI(2 * 16)
Dim r(5), b(5), expon(8, 8), m(4), erf(4), noftwf(4), twfexp(8, 8)


'detect twiddle factor
GoSub 200
'input
Text3.Text = ""
For i = 0 To n - 1: inputR(i) = funct(i):
inputI(i) = functI(i):

Text3.Text = Text3.Text + Str$(inputR(i))
Next

'Bit reversal arrangment
For t = 0 To n - 1
e = t
hh = Log(n) / Log(2) - 1

For i = hh To 0 Step -1
u = 2 ^ i
If e >= u Then r(i) = 1: e = e - u Else r(i) = 0
'bitreversing the binary sequence
b(hh - i) = r(i)
Next

ax1 = 0
For isf = hh To 0 Step -1
ax1 = ax1 + b(isf) * 2 ^ (isf)
Next
ax(t) = ax1
Next t
stages = Log(n) / Log(2)

'arranging the output values into bitreversal sort
For dd = 0 To n - 1
bitrevinputR(dd) = inputR(ax(dd)): bitrevinputI(ax(dd)) = inputI(dd)
Next dd
'the input is bit reversed and found in bitrevinputR(x)
For y = 0 To n - 1: taken(y) = 0:
Next: x = 0: t = 0: y = 0: i = 0

c = Log(n) / Log(2)
'CLS:  Print "stage 0"
'imaginary input data=0
For xx = 0 To n - 1: bitrevinputI(xx) = 0: Next
For i = 0 To n - 1
'Print bitrevinputr(i)
Next: ' CLS
jump = 1: half = n / 2
'CLS:
st = 0
bitrevinputR(n) = 0: bitrevinputR(n + 1) = 0
bitrevinputI(n) = 0: bitrevinputI(n + 1) = 0
For u = 1 To Log(n) / Log(2): st = 0
For i = 0 To n - 1
10
For t = 0 To x - 1
If i = taken(t) Then t = x - 1: GoTo 12
Next t
st = st + 1
twfr = Cos(-1 * 2 * 3.14 * expon(st, u) / n):
twfi = Sin(-1 * 2 * 3.14 * expon(st, u) / n):
a(i) = bitrevinputR(i) + bitrevinputR(i + jump) * (twfr) - bitrevinputI(i + jump) * twfi
aI(i) = bitrevinputI(i) + bitrevinputR(i + jump) * (twfi) + bitrevinputI(i + jump) * (twfr)
a(i + jump) = bitrevinputR(i) - bitrevinputR(i + jump) * (twfr) + bitrevinputI(i + jump) * twfi
aI(i + jump) = bitrevinputI(i) - bitrevinputR(i + jump) * (twfi) - bitrevinputI(i + jump) * (twfr)
'PRINT a(i + jump); aI(i + jump)
taken(x) = i + jump: x = x + 1
12
Next
'For d = 0 To n - 1: Print a(d); aI(d): Next
jump = 2 ^ (u)
For y = 0 To n - 1: taken(y) = 0:
bitrevinputR(y) = a(y): bitrevinputI(y) = aI(y)
'Print a(y)
Next: x = 0: t = 0
'CLS:
i = 0
Next u

For y = 0 To n - 1
'Print bitrevinputr(y)
funct(y) = bitrevinputR(y)
functI(y) = bitrevinputI(y)
'Form1.Print bitrevinputr(y); bitrevinputI(y)
Next

'Text1.CLS
Text1.Text = "DATA OUTPUT ---- The wave Signal present in memory" + String$(55, " ")
Text1.Text = Text1.Text + "X(n) REAL" + String$(128, " ")
For i = 0 To n - 1: Text1.Text = Text1.Text + Str$(funct(i)) + "   "
Next:
Text1.Text = Text1.Text
Text2.Text = Text2.Text + "X(n) Imaginary" + String$(122, " ") + kbkeyreturn
For i = 0 To n - 1
Text2.Text = Text2.Text + Str$(functI(i)) + "    "
Next

GoTo 300
200
''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''
'twiddle factor exponent generation part
'c represents the number of states
For i = 1 To c: m(i) = i: erf(i) = 2 ^ ((c) - i)
noftwf(i) = 2 ^ (m(i) - 1)
'PRINT i; erf(i)'noftwf(i)
Next
'rem defining the twf exponent in a square array of
'inputs equal to the last no of twfs which is noftwf(c) will be in sq
sq = noftwf(c)
'Dim twfexp(sq, c):
twfexp(0, 0) = 0
'initializing the square matrix by equaling it to zero
For t = 1 To c: For x = 1 To sq: twfexp(x, t) = 0: Next: Next
'finished initializing the matrix
For t = 1 To c
For x = 1 To noftwf(t)
If x = 1 Then twfexp(x, t) = 0: GoTo nn
twfexp(x, t) = twfexp(x - 1, t) + erf(t)
nn:
'PRINT twfexp(x, t);
Next: Next
'now we are going to define a new matrix representing the exponent
'value of the Twf which will be used in the multiplication of two
'terms
Height1 = noftwf(t - 1) 'this is the height of the matrix
wide = c 'this is the width of the matrix
'DIM expon(height, wide)

For stage = 1 To Log(n) / Log(2)
Item = 1
For y = 1 To Height1
x = twfexp(Item, stage)
expon(y, stage) = x
'? x
Item = Item + 1
If Item = noftwf(stage) + 1 Then Item = 1
Next: Next
'PRINT expon(0, 0); expon(0, 1)
'the twiddle factors exponent is in expon(height,width)

''''''''''''''''''''''''''''''''''''''''
Return
300

End Sub

Private Sub Form_Load()
n = 8
For i = 0 To 16: functI(i) = 0: Next
For i = 0 To n / 2: funct(i) = 1: Next
For i = n / 2 To n - 1: funct(i) = 0: Next

End Sub

Private Sub FWT_Click()
c = Log(n) / Log(2): Dim outbit(16)
Dim inputR(16), outputR(16), bitrevinputR(16 * 2)
Dim a(2 * 16): Dim ax(2 * 16): Dim taken(2 * 16):
Dim had(16), wal(16): Dim r(8), b(8)

For i = 0 To n - 1: inputR(i) = funct(i): Next
For t = 0 To n - 1
e = t
hh = Log(n) / Log(2) - 1

For i = hh To 0 Step -1: u = 2 ^ i
If e >= u Then r(i) = 1: e = e - u Else r(i) = 0
'bitreversing the binary sequence
b(hh - i) = r(i): Next
a1x = 0: For isf = hh To 0 Step -1
a1x = a1x + b(isf) * 2 ^ (isf): Next
ax(t) = a1x: Next t
stages = Log(n) / Log(2)

'arranging the output values into bitreversal sort
For dd = 0 To n - 1: bitrevinputR(dd) = inputR(ax(dd)): Next dd
'the input is bit reversed and found in bitrevinputR(x)
For y = 0 To n - 1: taken(y) = 0: Next: x = 0: t = 0: y = 0:
'CLS :
i = 0
c = Log(n) / Log(2)
'FOR i = 0 TO n - 1:PRINT bitrevinputR(i):NEXT: i$ = INPUT$(1): CLS
jump = 1: half = n / 2
st = 0
bitrevinputR(n) = 0: bitrevinputR(n + 1) = 0
For u = 1 To Log(n) / Log(2): st = 0
For i = 0 To n - 1
110
For t = 0 To x - 1
If i = taken(t) Then t = x - 1: GoTo 112
Next t
st = st + 1
a(i) = bitrevinputR(i) + bitrevinputR(i + jump)
a(i + jump) = bitrevinputR(i) - bitrevinputR(i + jump)
taken(x) = i + jump: x = x + 1
112
Next
'FOR d = 0 TO n - 1: 'PRINT a(d); aI(d):NEXT
jump = 2 ^ (u)
For y = 0 To n - 1: taken(y) = 0:
bitrevinputR(y) = a(y):
'PRINT bitrevinputR(y)
Next: x = 0: t = 0
i = 0
Next u
For dd = 0 To n - 1
outbit(dd) = bitrevinputR(ax(dd)) / n:
Next dd
'For dd = 0 To n - 1:'PRINT outbit(dd):Next

For ge = 0 To n - 1
e = ge
hh = Log(n) / Log(2) - 1: For i = hh To 0 Step -1
u = 2 ^ i: If e >= u Then r(i) = 1: e = e - u Else r(i) = 0
Next
'producing the gray code for the binary code
Dim xb(16)
For i = hh To 0 Step -1: xb(i) = r(i + 1) Xor r(i)
If i = hh Then xb(i) = r(i)
'bitreversing the binary sequence
xb(hh - i) = r(i): 'PRINT B(I);
Next: 'PRINT :
'bitreversed output
For p = 0 To hh Step 1
u = u + xb(p) * 2 ^ (hh - p)
'PRINT B(p);
Next
'PRINT u - 1
wal(ge) = ge: had(ge) = u - 1
'PRINT wal(ge); had(ge)
Next ge
'arranging output value to transform from hadamart to walch
Dim pq(16)
For i = 0 To n - 1:
pq(i) = outbit(i):
Next i
For io = 0 To n - 1
funct(io) = pq(had(io))
'PRINT "walch function"
'Print funct(io)
Next

Text1.Text = ""
Text2.Text = ""
Text1.Text = "DATA OUTPUT ---- The wave Signal present in memory" + String$(55, " ")

Text1.Text = Text1.Text + "X(n) REAL" + String$(126, " ")