• DocumentCode
    779804
  • Title

    Strict identifiability of multiple FIR channels driven by an unknown arbitrary sequence

  • Author

    Hua, Yingbo ; Wax, Mati

  • Author_Institution
    Dept. of Electr. & Electron. Eng., Melbourne Univ., Parkville, Vic., Australia
  • Volume
    44
  • Issue
    3
  • fYear
    1996
  • fDate
    3/1/1996 12:00:00 AM
  • Firstpage
    756
  • Lastpage
    759
  • Abstract
    The problem of blind identification of multiple finite impulse response (FIR) channels driven by a common input arises in a wide range of applications. It has received increasing attention in the signal processing community. A system of multiple FIR channels driven by an unknown input is said to be strictly identifiable if, in the absence of noise, the given channel outputs can only be realized by a unique (up to a constant) system impulse response and a unique input sequence. We show necessary and sufficient conditions for strict identifiability, and establish a connection among strict identifiability, a cross-relation-based (CR-based) identifiability and a Fisher information-based (FI-based) identifiability
  • Keywords
    identification; information theory; sequences; signal processing; telecommunication channels; transient analysis; transient response; Fisher information based identifiability; channel outputs; cross relation based identifiability; multiple FIR channels; multiple finite impulse response; necessary conditions; signal processing; strict identifiability; sufficient conditions; unique input sequence; unique system impulse response; unknown arbitrary sequence; unknown input; Australia Council; Chromium; Equations; Finite impulse response filter; Information analysis; Information processing; Signal processing; Stacking; Statistics; Sufficient conditions;
  • fLanguage
    English
  • Journal_Title
    Signal Processing, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    1053-587X
  • Type

    jour

  • DOI
    10.1109/78.489057
  • Filename
    489057