Ibing, A.A.IbingJungnickel, V.V.Jungnickel2022-03-102022-03-102007https://publica.fraunhofer.de/handle/publica/35624410.1109/VETECF.2007.432A simple algorithmic scheme is proposed which calculates multiple variable-length FFTs/IFFTs at once by a single fixed-length one. The algorithm exploits the fact that the transform of a periodic signal is a line spectrum, the linearity property of FFT/IFFT and the shift theorem. The overall algorithm complexity is higher than calculating separate variable- length transforms, but the ease of implementation makes the scheme well-suited for FPGA based rapid prototyping systems. Because in SC-FDMA systems multiple variable-length transforms are needed for different users, the algorithm can be used to implement multiuser multiplexing. The scheme can be applied to DFT/IDFT as well as FFT/IFFT implementations.enfast fourier transformsfield programmable gate arrayfrequency division multiple accessHardware-Software-Codesign621conference paper