1998
DOI: 10.1109/18.661535
|View full text |Cite
|
Sign up to set email alerts
|

Asymptotic eigenvalue distribution of block-Toeplitz matrices

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
14
0

Year Published

2000
2000
2024
2024

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 21 publications
(14 citation statements)
references
References 5 publications
0
14
0
Order By: Relevance
“…Moreover, the sequences of TBT and CBC matrices of increasing size are asymptotically equivalent in the same sense as a Toeplitz matrix and its circulant matrix approximation in [25]. Such equivalence implies that the eigenvalues behave similarly as the size of the matrices increases [27]. Similar to the circulant matrix, the CBC matrix structure also has some very interesting properties, among which is the fact that the eigenvalues of a CBC matrix correspond to the 2-D DFT transform of its first row (or column) [29].…”
Section: Appendixmentioning
confidence: 95%
“…Moreover, the sequences of TBT and CBC matrices of increasing size are asymptotically equivalent in the same sense as a Toeplitz matrix and its circulant matrix approximation in [25]. Such equivalence implies that the eigenvalues behave similarly as the size of the matrices increases [27]. Similar to the circulant matrix, the CBC matrix structure also has some very interesting properties, among which is the fact that the eigenvalues of a CBC matrix correspond to the 2-D DFT transform of its first row (or column) [29].…”
Section: Appendixmentioning
confidence: 95%
“…Here, we shall admit that Gray's result extends to TBT matrices, not necessarily Hermitian. which allows to deduce from (18) and (19) that When , the latter inequality drastically simplifies according to which proves the assertion.…”
Section: Proof Of Theoremmentioning
confidence: 71%
“…( is the trace of a square matrix, i.e., the sum of its diagonal elements, which is also the sum of its eigenvalues). Specifically, important results establish the asymptotical equivalence between Toeplitz and circulant matrices [18], and between TBT and CBC matrices [15], [19].…”
Section: Asymptotic Behavior Of the Jls Solutionmentioning
confidence: 99%
See 1 more Smart Citation
“…It is demonstrated that the optimal linear preprocessor for classification can substantially outperform the optimal linear preprocessor for estimation especially at low SNRs. Other signal estimation preprocessors that adaptively estimate the clean signals from the noisy signals are often used but will not be considered here [17].…”
Section: On Preprocessing For Mismatched Classification Of Gaussian Smentioning
confidence: 99%