Blind algebraic identification of communication channels: symbolic solution algorithms

DOI10.1007/s00200-006-0021-xzbMath1144.94373OpenAlexW1977786140MaRDI QIDQ857886

Pierre Comon, Jérôme Lebrun

Publication date: 5 January 2007

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00200-006-0021-x

zbMATH Keywords

Blind identificationDigital modulationsMatrix of tracesParametric normal forms

Mathematics Subject Classification ID

Detection theory in information and communication theory (94A13) Computational aspects in algebraic geometry (14Q99) Modulation and demodulation in information and communication theory (94A14)

Uses Software

• Kronecker
• ISOLATE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Gröbner bases and wavelet design
• Generalised characteristic polynomials
• On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals
• Computing the isolated roots by matrix methods
• Solving zero-dimensional systems through the rational univariate representation
• Computing parametric geometric resolutions
• Unbiased blind adaptive channel identification and equalization
• Approximate radical of ideals with clusters of roots
• Blind identification of FIR systems excited by discrete-alphabet inputs
• Channel identification for high speed digital communications
• Generalized normal forms and polynomial system solving
• Analytical blind channel identification
• A Gröbner free alternative for polynomial system solving

This page was built for publication: Blind algebraic identification of communication channels: symbolic solution algorithms