| 摘要 |
The present invention relates to an arrangement for a discrete Fourier transform (DFT) computation including m radix-r, r = 2, 4, 8, ..., butterfly operators (11.1-11.4), data memory sets (12, 12') comprising memory units (90-93) and switching means (14, 15). The butterfly operators (11.1-11.4, 11.1', 11.2') are arranged in parallel and connected to m memory units (m = 1, 2, ...) allowing 2r accesses per memory unit during each calculation. |
