Efficient Recursive IDFT Scheme for Complex-valued Signals in Tap-selective Maximum-likelihood Channel Estimation

Authors:
Jeng-Kuang Hwang;Yuan-Ping Li
Affiliations:
Department of Communication Engineering, Yuan-Ze University, Chungli, Taiwan 32026;Department of Electrical Engineering, Yuan-Ze University, Chungli, Taiwan 32026
Venue:
Journal of Signal Processing Systems
Year:
2010

Citing 3
Cited 1

Digital signal processing (3rd ed.): principles, algorithms, and applications

Digital signal processing (3rd ed.): principles, algorithms, and applications
Digital Signal Processing Handbook

Digital Signal Processing Handbook
Digital Signal Processing with Field Programmable Gate Arrays with Cdrom

Digital Signal Processing with Field Programmable Gate Arrays with Cdrom

System-on-Chip Subband Decomposition Architectures for Ultrasonic Detection Applications

Journal of Signal Processing Systems

Quantified Score

Hi-index	0.00

Visualization

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.