References
- Adámek, K., Novotný, J., Thiyagalingam, J., Armour, W. (2021). Efficiency near the edge: Increasing the energy efficiency of FFTs on GPUs for real-time edge computing. IEEE Access, 9, 18167–18182.
https://ieeexplore.ieee.org/document/9330509 - Andersson, R., Garrido, M. (2020). Using rotator transformations to simplify FFT hardware architectures. IEEE Transactions on Circuits and Systems I: Regular Papers, 67 (12), 4784–4793.
https://doi.org/10.1109/TCSI.2020.3006253 - Dai, J., Yin, H. (2020). Design and realization of non-radix-2 FFT prime factor processor for 5G broadcasting in release 16. In 2020 13th International Symposium on Computational Intelligence and Design (ISCID). IEEE, 406–409.
https://doi.org/10.1109/ISCID51228.2020.00098 - Garrido, M., Malagón, P. (2021). The constant multiplier FFT. IEEE Transactions on Circuits and Systems I: Regular Papers, 68 (1), 322–335.
https://doi.org/10.1109/TCSI.2020.3031688 - Hsu, S.-C., Huang, S.-J., Chen, S.-G., Lin, S.-C., Garrido, M. (2020). A 128-point multi-path SC FFT architecture. In 2020 IEEE International Symposium on Circuits and Systems (ISCAS). IEEE.
https://doi.org/10.1109/ISCAS45731.2020.9180883 - Garrido, M., Huang, S.-J., Chen, S.-G., Gustafsson, O. (2016). The serial commutator FFT. IEEE Transactions on Circuits and Systems II: Express Briefs, 63 (10), 974–978.
https://doi.org/10.1109/TCSII.2016.2538119 - Juliano, J., Lin, J., Erdogan, A. George, K. (2020). Radar pulse on pulse identification parallel FFT and power envelope algorithm. In 2020 11th IEEE Annual Ubiquitous Computing, Electronics & Mobile Communication Conference (UEMCON). IEEE, 0609–0613.
https://doi.org/10.1109/UEMCON51285.2020.9298132 - Priya, A. L., Deepthi, V. M. (2022). Design and implementation of area efficient pipelined FFT processor. Turkish Journal of Computer and Mathematics Education (TURCOMAT), 12 (11), 7245–7251.
https://doi.org/10.17762/turcomat.v12i11.11940 - Kanders, H., Mellqvist, T., Garrido, M., Palmkvist, K., Gustafsson, O. (2019). A 1 million-point FFT on a single FPGA. IEEE Transactions on Circuits and Systems I: Regular Papers, 66 (10), 3863–3873.
https://doi.org/10.1109/TCSI.2019.2918403 - Kang, H., Lee, J., Kim, D. (2021). HI-FFT: Heterogeneous parallel in-place algorithm for large-scale 2D-FFT. IEEE Access, 9, 120261–120273.
https://doi.org/10.1109/ACCESS.2021.3108404 - Lin, C.-H., Liu, J.-C., Yang, P.-K. (2020). Performance enhancement of GPU parallel computing using memory allocation optimization. In 2020 14th International Conference on Ubiquitous Information Management and Communication (IMCOM). IEEE.
https://doi.org/10.1109/IMCOM48794.2020.9001771 - Madanayake, A., Cintra, R. J., Akram, N., Ariyarathna, V., Mandal, S., Coutinho, V. A., Bayer, F. M., Coelho, D., Rappaport, T. S. (2020). Fast radix-32 approximate DFTs for 1024-beam digital RF beamforming. IEEE Access, 8, 96613–96627.
https://doi.org/10.1109/ACCESS.2020.2994550 - Garrido, M. (2019). Multiplexer and memory-efficient circuits for parallel bit reversal. IEEE Transactions on Circuits and Systems II: Express Briefs, 66 (4), 657–661.
https://doi.org/10.1109/TCSII.2018.2880921 - Tsai, W.-L., Chen, S.-G., Huang, S.-J. (2019). Reconfigurable radix-2k×3 feedforward FFT architectures. In 2019 IEEE International Symposium on Circuits and Systems (ISCAS). IEEE.
https://doi.org/10.1109/ISCAS.2019.8702346 - Wang, J., Li, X., Fan, G., Tuo, Z. (2019). A parallel radix-2k FFT processor using single-port merged-bank memory. In 2019 IEEE International Symposium on Circuits and Systems (ISCAS). IEEE.
https://doi.org/10.1109/ISCAS.2019.8702088 - Tsai P.-Y., Lin, C.-Y. (2011). A generalized conflict-free memory addressing scheme for continuous-flow parallel-processing FFT processors with rescheduling. IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 19 (12), 2290–2302.
https://doi.org/10.1109/TVLSI.2010.2077314 - Luo, H.-F., Liu, Y.-J., Shieh, M.-D. (2015). Efficient memory-addressing algorithms for FFT processor design. IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 23 (10), 2162–2172.
https://doi.org/10.1109/TVLSI.2014.2361209