Hi George - I'm presuming the enclosed example.py script is what you're
trying calculate - and that the input data is complex.
I invented my own data.
If true, it should be easy to adapt it to your problem by combining the
2 loops for any value of n.
-- Cinaed
On 1/22/21 10:49 AM, George Edwards wrote:
Hello,
I am working with the OOT Interpolator template and I set the
interpolation factor to 2. In the QA file I input 5-complex samples
and based on my simple code below in the work() method, I expect the
QA test to return 1+j1, 10-times (5x2). The QA returns ((1+1j),
(1+1j), 0j, 0j, 0j, 0j, 0j, 0j, (1+1j) , (1+1j)). I have tried a
lot of different coding permutations and this is the closest I come to
a solution, but it is wrong!!! Any help is greatly appreciated!
defwork(self, input_items, output_items):
in0 = input_items[0]
out = output_items[0]
for ii inrange(0,len(in0)):
for k inrange(0,2):
out[k] = 1.0+1.0*1j
returnlen(output_items[0])
Thanks,
George
#!/bin/env python3
import cmath
n=4
m=2*n-1
print ("(n,m)=",[n,m])
u=[complex(0, 0) for k in range(n) ]
u[0]=complex(-1,2)
u[1]=complex(3,-3)
u[2]=complex(-4,4)
u[3]=complex(5,-6)
v=[complex(0, 0) for k in range(m) ]
v[0]=u[0]
v[1]=(u[0]+u[1])/2
v[2]=u[1]
v[3]=(u[1]+u[2])/2
v[4]=u[2]
v[5]=(u[2]+u[3])/2
v[6]=u[3]
print ("u=",u)
print ("v=",v)
