This paper addresses an algebraic approach for wideband frequency estimation with sub-Nyquist temporal sampling. Firstly, an algorithm based on double polynomial root finding procedure to estimate aliasing frequencies...This paper addresses an algebraic approach for wideband frequency estimation with sub-Nyquist temporal sampling. Firstly, an algorithm based on double polynomial root finding procedure to estimate aliasing frequencies and joint aliasing frequencies-time delay phases in multi-signal situation is presentcd. Since the sum of time delay phases determined from the least squares estimation shows the characteristics of the corre- sponding parameters pairs, then the pairmatching method is conducted by combining it with estimated parameters mentioned above. Although the proposed method is computationally simpler than the conventional schemes, simulation results show that it can approach optimum estimation performance.展开更多
A distribution theory of the roots of a polynomial and a parallel algorithm for finding roots of a complex polynomial based on that theory are developed in this paper. With high parallelism, the algorithm is an im- pr...A distribution theory of the roots of a polynomial and a parallel algorithm for finding roots of a complex polynomial based on that theory are developed in this paper. With high parallelism, the algorithm is an im- provement over the Wilf algorithm.展开更多
文摘This paper addresses an algebraic approach for wideband frequency estimation with sub-Nyquist temporal sampling. Firstly, an algorithm based on double polynomial root finding procedure to estimate aliasing frequencies and joint aliasing frequencies-time delay phases in multi-signal situation is presentcd. Since the sum of time delay phases determined from the least squares estimation shows the characteristics of the corre- sponding parameters pairs, then the pairmatching method is conducted by combining it with estimated parameters mentioned above. Although the proposed method is computationally simpler than the conventional schemes, simulation results show that it can approach optimum estimation performance.
文摘A distribution theory of the roots of a polynomial and a parallel algorithm for finding roots of a complex polynomial based on that theory are developed in this paper. With high parallelism, the algorithm is an im- provement over the Wilf algorithm.
