• DocumentCode
    1072446
  • Title

    On the convergence of the inverses of Toeplitz matrices and its applications

  • Author

    Sun, Feng-Wen ; Jiang, Yimin ; Baras, John S.

  • Author_Institution
    Hughes Network Syst. Inc., Germantown, MD, USA
  • Volume
    49
  • Issue
    1
  • fYear
    2003
  • fDate
    1/1/2003 12:00:00 AM
  • Firstpage
    180
  • Lastpage
    190
  • Abstract
    Many issues in signal processing involve the inverses of Toeplitz matrices. One widely used technique is to replace Toeplitz matrices with their associated circulant matrices, based on the well-known fact that Toeplitz matrices asymptotically converge to their associated circulant matrices in the weak sense. This often leads to considerable simplification. However, it is well known that such a weak convergence cannot be strengthened into strong convergence. It is this fact that severely limits the usefulness of the close relation between Toeplitz matrices and circulant matrices. Observing that communication receiver design often needs to seek optimality in regard to a data sequence transmitted within finite duration, we define the finite-term strong convergence regarding two families of matrices. We present a condition under which the inverses of a Toeplitz matrix converges in the strong sense to a circulant matrix for finite-term quadratic forms. This builds a critical link in the application of the convergence theorems for the inverses of Toeplitz matrices since the weak convergence generally finds its usefulness in issues associated with minimum mean squared error and the finite-term strong convergence is useful in issues associated with the maximum-likelihood or maximum a posteriori principles.
  • Keywords
    Toeplitz matrices; convergence of numerical methods; least mean squares methods; matrix inversion; maximum likelihood estimation; phase estimation; radio receivers; signal processing; timing; DFT; Toeplitz inverse matrix convergence; circulant matrices; communication receiver design; convergence theorems; data sequence; finite-term quadratic forms; finite-term strong convergence; frequency-domain approach; high-speed modem design; maximum a posteriori principle; maximum-likelihood principle; minimum mean squared error; signal processing; timing/phase estimator; weak convergence; Autocorrelation; Convergence; Discrete Fourier transforms; Matrices; Matrix decomposition; Maximum likelihood detection; Maximum likelihood estimation; Random processes; Signal processing; Sun;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/TIT.2002.806157
  • Filename
    1159770