| 摘要 |
Method of a N-point discrete Fourier transform. The original set, consisting of N input signal values {a(k)}k=0,1,2, . . . N-1 is converted into two sets of signal values {b1(q)}q=1,2, . . . M and {b2(q)}q=1,2, . . . M, which each comprise M=(N-1)/2 signal values, each value being a linear combination of two of the original input signal values a(k). These sequences are circularly convolved with the impulse response h1(v)= alpha cos((2 pi /N) gV) and h2(v)=j beta sin ((2 pi /N) gV), respectively, for generating a set of third data elements y1(p) and a set of fourth signal values y2(p). Herein N is a prime and alpha , beta and g represent constants and it holds that p, v=1,2, . . . M, whereas j= 2ROOT -1. The desired output signal value can be obtained by means of a linear combination of the signal values y1(p), y2(p) and a(0). |
