Totally blind channel identification by exploiting guard intervals

DOI10.1016/S0167-6911(02)00278-5zbMath1134.94303OpenAlexW2027206149MaRDI QIDQ2503451

Jonathan H. Manton, Walter D. Neumann

Publication date: 21 September 2006

Published in: Systems \& Control Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-6911(02)00278-5

zbMATH Keywords

Communication systemsWireless communicationsPolynomial systemsAlgebraic channel identificationInvertibility of polynomial equationsPartially coupled polynomial equations

Mathematics Subject Classification ID

Control/observation systems involving computers (process control, etc.) (93C83) Communication theory (94A05)

Cites Work

• Unnamed Item
• Unnamed Item
• Recent developments in blind channel equalization: From cyclostationarity to subspaces
• Finite alphabet source recovery in polynomial systems.
• An OFDM interpretation of zero padded block transmissions.
• On the algebraic identifiability of finite impulse response channels driven by linearly precoded signals
• New criteria for blind deconvolution of nonminimum phase systems (channels)
• Robust identification of a nonminimum phase system: Blind adjustment of a linear equalizer in data communications
• Indeterminacy and identifiability of blind identification
• Discrete multiple tone modulation with coset coding for the spectrally shaped channel
• On discrete-time polynomial systems
• On the Observability of Polynomial Systems, I: Finite-Time Problems
• A subspace algorithm for certain blind identification problems

This page was built for publication: Totally blind channel identification by exploiting guard intervals