hi,
the problem is:
there are 700 discrete numbers. but only 70 in those numbers are given, and the other are not. the 70 numbers lie in the 1st, 11th, 21st, 31st, ..., 691st of the number sequence. then I try to get the other 690 discrete numbers.

my steps are:
(begin)
step 1.
add zero to the positions of the unknown numbers.

step 2.
apply iFFT to the sequence(the iFFT size is 1024), and fill the iFFT array, for example Data[1024], with the 700 numbers from Data[0] to Data[699]. then set zero to Data[700]~Data[1023].

step3.
after iFFT, we get an array, for example iFFT_Result[1024]. set the higher half of iFFT_Result[1024] to zero.

step4.
apply FFT to the array of iFFT_Result[1024]. the size of FFT is also 1024.
(end)

then we get the result of Sinc/FFT Integration. unfortunately, the result of experiment shows we make a mistake on it.

the steps for Sinc/FFT Integration are right?
thanks