5 research outputs found
Superfast Line Spectral Estimation
A number of recent works have proposed to solve the line spectral estimation
problem by applying off-the-grid extensions of sparse estimation techniques.
These methods are preferable over classical line spectral estimation algorithms
because they inherently estimate the model order. However, they all have
computation times which grow at least cubically in the problem size, thus
limiting their practical applicability in cases with large dimensions. To
alleviate this issue, we propose a low-complexity method for line spectral
estimation, which also draws on ideas from sparse estimation. Our method is
based on a Bayesian view of the problem. The signal covariance matrix is shown
to have Toeplitz structure, allowing superfast Toeplitz inversion to be used.
We demonstrate that our method achieves estimation accuracy at least as good as
current methods and that it does so while being orders of magnitudes faster.Comment: 16 pages, 7 figures, accepted for IEEE Transactions on Signal
Processin
A novel method for computation of the discrete Fourier transform over characteristic two finite field of even extension degree
A novel method for computation of the discrete Fourier transform over a
finite field with reduced multiplicative complexity is described. If the number
of multiplications is to be minimized, then the novel method for the finite
field of even extension degree is the best known method of the discrete Fourier
transform computation. A constructive method of constructing for a cyclic
convolution over a finite field is introduced.Comment: 35 pages. Submitted to IEEE Transactions on Information Theor