Abstract
This paper presents several efficient, recursive inverse discrete Fourier transform (IDFT) schemes for complex-valued input data in tap-selective maximum-likelihood channel estimation; the results of their implementation are also presented. The proposed schemes employ only real-valued arithmetic, which reduces the number of required real multiplication operations in comparison with conventional IDFT approaches; however, the number of real additions increases significantly due to the sliding window scheme. The results show that the schemes can reduce the computational complexity and enhance flexibility when only several subsets of the IDFT output bins are required.
Similar content being viewed by others
References
Hwang, J.-K., & Chung, R.-L. (2007). Low-complexity algorithm for tap-selective maximum likelihood estimation over sparse multipath channels. In Proc. Int. Conf. on IEEE GLOBECOM 2007 (pp. 2857–2862). Washington.
Hwang, J.-K., & Li, Y.-P. (2008). Modular design and implementation of FPGA-based tap-selective maximum-likelihood channel estimator. In Proc. of the IEEE ICCSC 2008 (pp. 658–662).
Felder, M. D. Mason, J. C. & Evans, B. L. (1998). Efficient dual-tone multifrequency detection using the nonuniform discrete Fourier transform. IEEE Signal Processing Letters, 5, 160–163. doi:10.1109/97.700916.
Gay, S. L., Hartung, J., & Smith, G. L. (1989). Algorithms for multi-channel DTMF detection for the WE DSP32 family. In Proc. of International Conference on Acoustics, Speech, and Signal Processing (ICASSP-89) (Vol. 2, pp. 1134–1137).
Banks, K. (2002). The Goertzel algorithm. Embedded Syst. Programming Mag (pp. 34–42).
Jacobsen, E. & Lyons, R. (2003). The sliding DFT. IEEE Signal Processing Magazine, 20(2), 74–80. doi:10.1109/MSP.2003.1184347.
Liu, K. J. R. (1993). Novel parallel architectures for short-time Fourier transform. IEEE Transactions on Circuits and Systems Part II. Analog and Digital Signal Processing, 40(12), 786–790. doi:10.1109/82.260243.
Jacobsen, E. & Lyons, R. (2004). An update to the sliding DFT. IEEE Signal Processing Magazine, 21(1), 110–111. doi:10.1109/MSP.2004.1516381.
Goertzel, G. (1958). An algorithm for the evaluation of finite trigonometric series. American Mathematical Monthly, 65, 34–35. doi:10.2307/2310304.
Van, L.-D., & Yang, C.-C. (2004). High-speed area-efficient recursive DFT/IDFT architectures. In Proc. of the 2004 International Symposium on Circuits and Systems (ISCAS ‘04) (Vol. 3, pp. III-357–360).
Proakis, J. & Manolakis, D. (1996). Digital signal processing-principles, algorithms, and applications (3rd ed.). Upper Saddle River: Prentice Hall. ch. 5–6.
Meyer-Baese, U. (2001). Digital signal processing with field programmable gate arrays (pp. 232–233). Berlin: Springer-Verlag.
Wenzler, A., & Luder, E. (1995). New structures for complex multipliers and their noise analysis. In Proc. of the IEEE International Symposium on Circuit Systems, ISCAS-1995 (pp. 1431–1435). Seattle.
Madisetti, V. & Williams, D. (1999). Digital signal processing handbook. Boca Raton: CRC Press LLC. ch. 7.4.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Hwang, JK., Li, YP. Efficient Recursive IDFT Scheme for Complex-valued Signals in Tap-selective Maximum-likelihood Channel Estimation. J Sign Process Syst Sign Image Video Technol 60, 71–80 (2010). https://doi.org/10.1007/s11265-009-0404-x
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11265-009-0404-x