Finite alphabet source recovery in polynomial systems.

DOI10.1016/S0167-6911(02)00180-9zbMath1106.93310OpenAlexW2111015091MaRDI QIDQ1853425

Jonathan H. Manton

Publication date: 21 January 2003

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

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

zbMATH Keywords

System identificationDecidabilityInvertibilityPolynomial equations

Mathematics Subject Classification ID

System identification (93B30) Numerical solution to inverse problems in abstract spaces (65J22)

Related Items (2)

Totally blind channel identification by exploiting guard intervals ⋮ On the algebraic identifiability of finite impulse response channels driven by linearly precoded signals

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An OFDM interpretation of zero padded block transmissions.
• On the algebraic identifiability of finite impulse response channels driven by linearly precoded signals
• Discrete multiple tone modulation with coset coding for the spectrally shaped channel

This page was built for publication: Finite alphabet source recovery in polynomial systems.