Sciweavers

160 search results - page 21 / 32
» On the diagonalization of the discrete Fourier transform
Sort
View
ICASSP
2010
IEEE
13 years 7 months ago
Learning sparse systems at sub-Nyquist rates: A frequency-domain approach
We propose a novel algorithm for sparse system identification in the frequency domain. Key to our result is the observation that the Fourier transform of the sparse impulse respo...
Martin McCormick, Yue M. Lu, Martin Vetterli
CEE
2010
64views more  CEE 2010»
13 years 7 months ago
Iterative decision feedback equalizer with cyclic detection for DFT-S OFDM system
This paper proposes a simple and efficient decision feedback equalizer (DFE) for Discrete Fourier Transform-Spread Orthogonal Frequency Division Multiplex (DFT-S OFDM) system in Ev...
Yafeng Wang, Hao Yang, Dacheng Yang, Wei Xiang
FOCM
2008
156views more  FOCM 2008»
13 years 7 months ago
Random Sampling of Sparse Trigonometric Polynomials, II. Orthogonal Matching Pursuit versus Basis Pursuit
We investigate the problem of reconstructing sparse multivariate trigonometric polynomials from few randomly taken samples by Basis Pursuit and greedy algorithms such as Orthogona...
Stefan Kunis, Holger Rauhut
JISE
2006
85views more  JISE 2006»
13 years 7 months ago
A Programming Methodology for Designing Block Recursive Algorithms
In this paper, we use the tensor product notation as the framework of a programming methodology for designing block recursive algorithms. We first express a computational problem ...
Min-Hsuan Fan, Chua-Huang Huang, Yeh-Ching Chung, ...
CORR
2011
Springer
151views Education» more  CORR 2011»
13 years 1 months ago
Generating and Searching Families of FFT Algorithms
A fundamental question of longstanding theoretical interest is to prove the lowest exact count of real additions and multiplications required to compute a power-of-two discrete Fo...
Steve Haynal, Heidi Haynal