Have a personal or library account? Click to login
Algorithms for a Small–Sized Type II Discrete Fourier Transform Cover
Open Access
|Mar 2026

References

  1. Akkaş, M.A. (2017). Channel modeling of wireless sensor networks in oil, Wireless Personal Communications 95(4): 4337–4355.
  2. Almenar, V., Girona, A., Flores, S. and Marin-Roig, J. (2011). Transmit diversity scheme for OFDM systems using the odd DFT, IEICE Transactions on Communications 94(8): 2411–2413.
  3. Belega, D., Petri, D. and Dallet, D. (2016). Influence of wideband noise on sinusoid parameter estimation provided by the two-point interpolated odd-DFT algorithm, 2016 12th IEEE International Symposium on Electronics and Telecommunications (ISETC), Timisoara, Romania, pp. 293–297.
  4. Bhatti, J., Noels, N. and Moeneclaey, M. (2010). Phase noise estimation and compensation for OFDM systems: A DCT-based approach, 2010 IEEE 11th International Symposium on Spread Spectrum Techniques and Applications, Taichung, Taiwan, pp. 93–97.
  5. Bi, G. and Chen, Y. (1998). Fast generalized DFT and DHT algorithms, Signal Processing 65(3): 383–390.
  6. Bi, G. and Zeng, Y. (2012). Transforms and Fast Algorithms for Signal Analysis and Representations, Birkhäuser, Boston.
  7. Britanak, V. and Rao, K.R. (1999). The fast generalized discrete Fourier transforms: A unified approach to the discrete sinusoidal transforms computation, Signal Processing 79(2): 135–150.
  8. Cariow, A. (2014). Strategies for the synthesis of fast algorithms for the computation of the matrix-vector products, Journal of Signal Processing Theory and Applications 3(1): 1–19.
  9. Cariow, A. and Paplinski, J.P. (2021). Algorithmic structures for realizing short-length circular convolutions with reduced complexity, Electronics 10(22): 2800.
  10. Dai, Y., Yi, H. and Tao, Y. (2019). An algorithm for linear convolution based on generalized discrete Fourier transform, Chinese Journal of Engineering Mathematics 36(1): 106–114.
  11. Dattoli, G., Palma, E.D., Nguyen, F. and Sabia, E. (2017). Generalized trigonometric functions and elementary applications, International Journal of Applied and Computational Mathematics 3(2): 445–458.
  12. Dun, Y. and Liu, G. (2015). A fine-resolution frequency estimator in the odd-DFT domain, IEEE Signal Processing Letters 22(12): 2489–2493.
  13. Elshirkasi, A.M., Siddiqi, M.U. and Habaebi, M.H. (2014). Generalized discrete Fourier transform based minimization of PAPR in OFDM systems, 2014 International Conference on Computer and Communication Engineering, Kuala Lumpur, Malaysia, pp. 205–208.
  14. Halawa, K. (2008). Determining the weights of a Fourier series neural network on the basis of the multidimensional discrete Fourier transform, International Journal of Applied Mathematics and Computer Science 18(3): 369–375, DOI: 10.2478/v10006-008-0033-8.
  15. Khosla, D., Singh, S., Singh, R. and Goyal, S. (2017). OFDM modulation technique & its applications: A review, International Conference on Innovations in Computing (ICIC 2017), Liverpool, UK, pp. 101–105.
  16. Li, G., Jing, X., Sun, S. and Huang, H. (2014). An improved channel estimation based on generalized DFT for OFDM system, 2014 14th International Symposium on Communications and Information Technologies (ISCIT), Incheon, South Korea, pp. 341–345.
  17. Li, Y., Kummert, A., Boschen, F. and Herzog, H. (2008). Interpolation-based reconstruction methods for tomographic imaging in 3D positron emission tomography, International Journal of Applied Mathematics and Computer Science 18(1): 63–73, DOI: 10.2478/v10006-008-0006-y.
  18. Mansour, M.F. (2006). On the odd-DFT and its applications to DCT/IDCT computation, IEEE Transactions on Signal Processing 54(7): 2819–2822.
  19. Mazrooei, M., Rahimi, L. and Sahami, N. (2018). Two-dimensional generalized discrete Fourier transform and related quasi-cyclic Reed–Solomon codes, Turkish Journal of Mathematics 42(1): 349–359.
  20. Oraintara, S. (2002). The unified discrete Fourier–Hartley transforms: Theory and structure, 2002 IEEE International Symposium on Circuits and Systems: Proceedings, Phoenix–Scottsdale, USA, Vol. 3, pp. III–III.
  21. Otunniyi, T.O. and Myburgh, H.C. (2021). Improving generalized discrete Fourier transform (GDFT) filter banks with low-complexity and reconfigurable hybrid algorithm, Digital 1(1): 1–17.
  22. Patil, V., Singh, J. and Tiwari, M. (2012). Optimization of generalized discrete Fourier transform for CDMA, International Journal of Engineering Research & Technology 1(3): 1–7.
  23. Pei, S.-C. and Luo, T.-L. (1996). Split-radix generalized fast Fourier transform, Signal Processing 54(2): 137–151.
  24. Perera, S.M. (2018). Signal flow graph approach to efficient and forward stable DST algorithms, Linear Algebra and Its Applications 542: 360–390.
  25. Polyakova, M. and Cariow, A. (2024). Fast type-II Hartley transform algorithms for short-length input sequences, Applied Sciences 14(22): 10719.
  26. Polyakova, M., Witenberg, A. and Cariow, A. (2024). The design of fast type-V discrete cosine transform algorithms for short-length input sequences, Electronics 13(21): 2079–9292.
  27. Potipantong, P., Sirisuk, P., Oraintara, S. and Worapishet, A. (2009). FPGA implementation of highly modular fast universal discrete transforms, IEICE Transactions on Electronics 92(4): 576–586.
  28. Regalia, P.A. and Sanjit, M.K. (1989). Kronecker products, unitary matrices and signal processing applications, SIAM Review 31(4): 586–613.
  29. Sadinov, S. (2017). Simulation study of M-ary QAM modulation techniques using Matlab/Simulink, 2017 40th International Convention on Information and Communication Technology, Electronics and Microelectronics (MIPRO), Opatija, Croatia, pp. 547–554.
  30. Saleh, H.I., Ashour, M. and Salama, A.E. (2003). GDFT types mapping algorithms and structured regular FPGA implementation, Proceedings of the 2003 International Symposium on Circuits and Systems, ISCAS’03, Bangkok, Thailand, Vol. 4, pp. IV–IV.
  31. Silva-García, V.M., Flores-Carapia, R., Rentería-Márquez, C., Luna-Benoso, B. and Chimal-Eguía, J.C. (2020). Image cipher applications using the elliptical curve and chaos, International Journal of Applied Mathematics and Computer Science 30(2): 377–391, DOI: 10.34768/amcs-2020-0029.
  32. Spałek, D. (2018). Two relations for generalized discrete Fourier transform coefficients, Bulletin of the Polish Academy of Sciences: Technical Sciences 66(3): 275–281.
  33. Syrjala, V., Valkama, M., Tchamov, N.N. and Rinne, J. (2009). Phase noise modelling and mitigation techniques in OFDM communications systems, 2009 Wireless Telecommunications Symposium, Prague, Czech Republic, pp. 1–7.
  34. Tsitsas, N.L. (2010). On block matrices associated with discrete trigonometric transforms and their use in the theory of wave propagation, Journal of Computational Mathematics 28(6): 864–878.
  35. Wilbur, M.R., Davidson, T.N. and Reilly, J.P. (2004). Efficient design of oversampled NPR GDFT filterbanks, IEEE Transactions on Signal Processing 52(7): 1947–1963.
  36. Yaroslavsky, L.P. (2014). Fast transforms in image processing: compression, restoration, and resampling, Advances in Electrical Engineering 2014(1): 276241.
  37. Zhang, X., Yu, F.X., Guo, R., Kumar, S., Wang, S. and Chang, S.-F. (2015). Fast orthogonal projection based on Kronecker product, Proceedings of the IEEE International Conference on Computer Vision, Santiago, Chile, pp. 2929–2937.
  38. Zheng, B. (1996). A unified algorithm for sinusoid-class orthogonal transforms, Proceedings of the 3rd International Conference on Signal Processing (ICSP’96), Beijing, China, Vol. 1, pp. 36–39.
DOI: https://doi.org/10.61822/amcs-2026-0008 | Journal eISSN: 2083-8492 | Journal ISSN: 1641-876X
Language: English
Page range: 91 - 112
Submitted on: May 9, 2025
|
Accepted on: Oct 22, 2025
|
Published on: Mar 21, 2026
In partnership with: Paradigm Publishing Services
Publication frequency: 4 issues per year

© 2026 Janusz Papliński, Marina Polyakova, Aleksandr Cariow, published by University of Zielona Góra
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.