PEI YUN TSAILin, Chung-YiChung-YiLin2024-09-182024-09-182011https://www.scopus.com/record/display.uri?eid=2-s2.0-80455125761&origin=resultslisthttps://scholars.lib.ntu.edu.tw/handle/123456789/721289This paper presents a generalized conflict-free memory addressing scheme for memory-based fast Fourier transform (FFT) processors with parallel arithmetic processing units made up of radix-$2q multi-path delay commutator (MDC). The proposed addressing scheme considers the continuous-flow operation with minimum shared memory requirements. To improve throughput, parallel high-radix processing units are employed. We prove that the solution to non-conflict memory access satisfying the constraints of the continuous-flow, variable-size, higher-radix, and parallel-processing operations indeed exists. In addition, a rescheduling technique for twiddle-factor multiplication is developed to reduce hardware complexity and to enhance hardware efficiency. From the results, we can see that the proposed processor has high utilization and efficiency to support flexible configurability for various FFT sizes with fewer computation cycles than the conventional radix-2/radix-4 memory-based FFT processors. © 2006 IEEE.Continuous-flowfast Fourier transformmemory architecturemixed-radixparallel processingreschedulingjournal article10.1109/TVLSI.2010.20773142-s2.0-80455125761