2013
DOI: 10.1109/tsp.2013.2282271
|View full text |Cite
|
Sign up to set email alerts
|

Vandermonde Factorization of Toeplitz Matrices and Applications in Filtering and Warping

Abstract: By deriving a factorization of Toeplitz matrices into the product of Vandermonde matrices, we demonstrate that the Euclidean norm of a filtered signal is equivalent with the Euclidean norm of the appropriately frequency-warped and scaled signal. In effect, we obtain an equivalence between the energy of frequencywarped and filtered signals. While the result does not provide tools for warping per se, it does show that the energy of the warped signal can be evaluated efficiently, without explicit and complex comp… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
10
0

Year Published

2016
2016
2020
2020

Publication Types

Select...
4
3
2

Relationship

0
9

Authors

Journals

citations
Cited by 26 publications
(10 citation statements)
references
References 9 publications
0
10
0
Order By: Relevance
“…It should be noted that, for Constrained Tyler, the Algorithm 3 in [12] derived for real-valued PSD Toeplitz matrices can not be directly applied. However, the Vandermonde factorization of PSD Toeplitz matrices [44] allows us to use the Algorithm 2 of [12]. In this algorithm, the set of PSD Toeplitz Finally, we compare to the empirical estimate µ obtained by averaging the real and imaginary parts of diagonals of the unstructured ML estimator, which corresponds to the Euclidean projection onto the Toeplitz set.…”
Section: On Implementationsmentioning
confidence: 99%
“…It should be noted that, for Constrained Tyler, the Algorithm 3 in [12] derived for real-valued PSD Toeplitz matrices can not be directly applied. However, the Vandermonde factorization of PSD Toeplitz matrices [44] allows us to use the Algorithm 2 of [12]. In this algorithm, the set of PSD Toeplitz Finally, we compare to the empirical estimate µ obtained by averaging the real and imaginary parts of diagonals of the unstructured ML estimator, which corresponds to the Euclidean projection onto the Toeplitz set.…”
Section: On Implementationsmentioning
confidence: 99%
“…Hence, the decomposition (36) is unique. This lemma shows that Theorem IV.1 holds if and only if we can construct a dual polynomial which satisfies (38) and (39). Next, our goal is to find one specific dual polynomial satisfying such conditions.…”
Section: A Dual Certificatementioning
confidence: 93%
“…For vectorized ANM, a 2-level Toeplitz decomposition [28] is required which has computational complexity O(P 2 L), where P is the size of 2-level Toeplitz matrix and L is its rank. For our proposed D-ANM method, only two separate 1-level Toeplitz matrix Vandermonde decompositions are required at complexity O(P 2 ) [38].…”
Section: Computational Complexitymentioning
confidence: 99%
“…and N sym is the size of an OFDM symbol. In (45), T l is a Hermitian Toeplitz matrix [57], and fast algorithms to solve (45) with O(M N tr N sym + M 2 ) multiplications and additions exist [58].…”
Section: Channel Estimationmentioning
confidence: 99%