• DocumentCode
    309912
  • Title

    A reduced sufficient statistics-based algorithm for joint timing/channel estimation in blind equalization

  • Author

    Iltis, Ronald A.

  • Author_Institution
    Dept. of Electr. & Comput. Eng., California Univ., Santa Barbara, CA, USA
  • fYear
    1996
  • fDate
    18-22 Nov 1996
  • Firstpage
    57
  • Lastpage
    61
  • Abstract
    In blind equalization, both the symbol timing and channel coefficients are unknown a priori. Previous algorithms for joint estimation of these parameters have used the extended Kalman filter, which is subject to divergence at low SNRs. Here, we present a new joint estimation algorithm which is based on the reduced sufficient statistics (RSS) method of Kulhavy (1990). The resulting channel and timing estimator is shown to use a modified recursive least-squares algorithm for the channel coefficients, and a joint nonlinear multiple-model type estimation for the timing. The application of the RSS estimator to blind symbol-by-symbol detection (SBSD) is illustrated
  • Keywords
    adaptive equalisers; least squares approximations; recursive estimation; statistical analysis; telecommunication channels; timing; blind equalization; blind symbol-by-symbol detection; channel coefficients; channel estimation; joint estimation algorithm; joint nonlinear multiple-model type estimation; modified recursive least-squares algorithm; reduced sufficient statistics; symbol timing; timing estimation; Bandwidth; Blind equalizers; Channel estimation; Communication networks; Delay; Detectors; Electronic mail; Intelligent networks; Iterative algorithms; Timing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Global Telecommunications Conference, 1996. GLOBECOM '96. 'Communications: The Key to Global Prosperity
  • Conference_Location
    London
  • Print_ISBN
    0-7803-3336-5
  • Type

    conf

  • DOI
    10.1109/GLOCOM.1996.586763
  • Filename
    586763