Name
Title | ||
|---|---|---|
Efficient Recursive IDFT Scheme for Complex-valued Signals in Tap-selective Maximum-likelihood Channel Estimation |
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. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1007/s11265-009-0404-x | Signal Processing Systems |
Keywords | Field | DocType |
Discrete Fourier transform,Efficient complex multiplication,Complex valued arithmetic,Sliding DFT | Mathematical optimization,Sliding window protocol,Computer science,Parallel computing,Communication channel,Algorithm,Maximum likelihood,Multiplication,Discrete Fourier transform (general),Discrete Fourier transform,Recursion,Computational complexity theory | Journal |
Volume | Issue | ISSN |
60 | 1 | 1939-8018 |
Citations | PageRank | References |
1 | 0.40 | 6 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jeng-Kuang Hwang | 1 | 71 | 16.18 |
| Yuanping Li | 2 | 48 | 6.10 |