又不对了困难了,啊啊!
输入:Text1 =80607000,Text2=20403000,结果:
/29/65/34/24/10/2/11/16
与正确值比较:0, 0, 0, 0, 24, 46, 65, 38, 16也是不对。
Private Sub Command1_Click()
Dim xr() As Double, a As String
a = Trim(Text1)
b = Trim(Text3)
sb1 = Len(a) + Len(b)
sb2 = Log(sb1) / Log(2)
If InStr(sb2, ".") = 0 Then
sb2 = sb2
Else
sb2 = Int(sb2) + 1
End If
sb = 2 ^ sb2
Print sb
ReDim xr(0 To Len(a) - 1): ReDim yr(0 To Len(b) - 1): ReDim zr(0 To Len(b) - 1)
For i1 = 0 To Len(a) - 1
xr(i1) = Mid(a, i1 + 1, 1)
yr(i1) = Mid(b, i1 + 1, 1)
Next
Dim l As Long, le As Long, le1 As Long, n As Long, r As Long, p As Long, q As Long, m As Byte
Dim wr As Double, w1 As Double, wlr As Double, wl1 As Double, tr As Double, t1 As Double
Dim pi As Double, t As Double, tr1 As Double
Dim xi(): Dim yi(): Dim zi()
n = Len(a) '求数组大小,其值必须是2的幂
m = 0
l = 2
pi = 3.14159265358979
Do
l = l + l
m = m + 1
Loop Until l > n
n = l / 2
ReDim xi(n - 1): ReDim yi(n - 1): ReDim zi(n - 1)
l = 1
Do
le = 2 ^ l
le1 = le / 2
r = 0
Do
p = r
Do
q = p + le1
tr = xr(q) * Cos((-2 * pi / 2 ^ l) * r)
ti = xr(q) * Sin((-2 * pi / 2 ^ l) * r)
tr1 = yr(q) * Cos((-2 * pi / 2 ^ l) * r)
ti1 = yr(q) * Sin((-2 * pi / 2 ^ l) * r)
xr(q) = xr(p) - tr
xi(q) = xi(p) - ti
xr(p) = xr(p) + tr
xi(p) = xi(p) + ti
yr(q) = yr(p) - tr1
yi(q) = yi(p) - ti1
yr(p) = yr(p) + tr1
yi(p) = yi(p) + ti1
p = p + le
Loop Until p > n - 1
r = r + 1
Loop Until r > le1 - 1
l = l + 1
Loop Until l > m
For i = 0 To n - 1 '仅输出模
zr(i) = xr(i) * yr(i) - xi(i) * yi(i): zi(i) = xr(i) * yi(i) + xi(i) * yr(i)
If InStr(zr(i), ".") = 0 Then
zr(i) = zr(i)
Else
a1 = Left(zr(i), InStr(zr(i), ".") - 1)
b1 = Mid(zr(i), InStr(zr(i), "."), 3)
zr(i) = a1 & b1
End If
If InStr(zi(i), ".") = 0 Then
zi(i) = zi(i)
Else
a2 = Left(zi(i), InStr(zi(i), ".") - 1)
b2 = Mid(zi(i), InStr(zi(i), "."), 3)
zi(i) = a2 & b2
End If
s = s & "/" & zr(i)
s1 = s1 & "/" & zi(i)
Next
s2 = nifft(dxcx1(Trim(s)), dxcx1(Trim(s1)))
Text2 = s2
End Sub
Private Sub Command2_Click()
Text1 = ""
Text2 = ""
Text3 = ""
Form1.Cls
End Sub
Private Function dxcx0(sa As String, sb As String) As String
Dim x_() As Double, a As String
a = Trim(sa)
ReDim x_(1 To sb)
For i1 = 1 To sb
x_(i1) = Mid(a, sb - i1 + 1, 1)
Next
Dim n As Integer, i As Long, j As Long, mn As Long, lh As Long, t As Double, k As Long
'位序倒置
n = sb '求数组大小,其值必须是2的幂
lh = n / 2
j = n / 2
For i = 1 To n - 2
Debug.Print i, j
k = lh '下面是向右进位算法
Do
If k > j Then Exit Do '高位是1吗
j = j - k '是的,高位置0
k = k / 2 '准备次高位的权
Loop Until k = 0 '次高位的权若非0,则检查新的次高位
j = j + k '非则若最高位是0,则置1
s = s & x_(j + 1)
Next
dxcx0 = x_(1) & x_(1 + sb / 2) & s
End Function
Private Function nifft(sa As String, sb As String) As String
Dim l As Long, le As Long, le1 As Long, j As Long, r As Long, p As Long, q As Long, m As Byte
Dim wr As Double, w1 As Double, wlr As Double, wl1 As Double, tr As Double, t1 As Double
Dim pi As Double, t As Double, tr1 As Double
Dim xi(): Dim yi(): Dim zi()
Dim xr(), yr(), zr()
s2 = Split(sa, "/")
s3 = Split(sb, "/")
j = UBound(s2)
n = j
For k = 1 To j
n1 = n1 + 1
ReDim Preserve xr(0 To n1 - 1)
ReDim Preserve yr(0 To n1 - 1)
xr(n1 - 1) = s2(n1): yr(n1 - 1) = s3(n1)
Next
ReDim zr(0 To n - 1)
m = 0
l = 2
pi = 3.14159265358979
Do
l = l + l
m = m + 1
Loop Until l > n
n = l / 2
ReDim xi(n - 1): ReDim yi(n - 1): ReDim zi(n - 1)
l = 1
Do
le = 2 ^ l
le1 = le / 2
r = 0
Do
p = r
Do
q = p + le1
tr = xr(q) * Cos((-2 * pi / 2 ^ l) * r)
ti = xr(q) * Sin((-2 * pi / 2 ^ l) * r)
tr1 = yr(q) * Cos((-2 * pi / 2 ^ l) * r)
ti1 = yr(q) * Sin((-2 * pi / 2 ^ l) * r)
xr(q) = xr(p) - tr
xi(q) = xi(p) - ti
xr(p) = xr(p) + tr
xi(p) = xi(p) + ti
yr(q) = yr(p) - tr1
yi(q) = yi(p) - ti1
yr(p) = yr(p) + tr1
yi(p) = yi(p) + ti1
p = p + le
Loop Until p > n - 1
r = r + 1
Loop Until r > le1 - 1
l = l + 1
Loop Until l > m
For i = 0 To n - 1 '仅输出模
zr(i) = (xr(i) - yi(i)) / n
If InStr(zr(i), ".") = 0 Then
zr(i) = zr(i)
Else
a1 = Left(zr(i), InStr(zr(i), ".") - 1)
b1 = Mid(zr(i), InStr(zr(i), "."), 3)
zr(i) = a1 & b1
End If
s1 = Int(Val(zr(i) + 0.5))
s = "/" & s1 & s
Next
nifft = s
End Function
Private Function dxcx1(sa As String) As String
Dim x_() As Double, a As String
a = Trim(sa)
s2 = Split(sa, "/")
j = UBound(s2)
sb = j
ReDim x_(1 To sb)
For k = 1 To j
n1 = n1 + 1
ReDim Preserve x_(1 To n1)
x_(n1) = s2(n1)
Next
Dim n As Integer, i As Long, mn As Long, lh As Long, t As Double
'位序倒置
n = sb '求数组大小,其值必须是2的幂
lh = n / 2
j = n / 2
For i = 1 To n - 2
Debug.Print i, j
k = lh '下面是向右进位算法
Do
If k > j Then Exit Do '高位是1吗
j = j - k '是的,高位置0
k = k / 2 '准备次高位的权
Loop Until k = 0 '次高位的权若非0,则检查新的次高位
j = j + k '非则若最高位是0,则置1
s = s & "/" & x_(j + 1)
Next
dxcx1 = "/" & x_(1) & "/" & x_(1 + sb / 2) & s
End Function