On the algebraic identifiability of finite impulse response channels driven by linearly precoded signals

It is common in wireless communications to perform some form of linear precodingoperation on the source signal prior to transmission over a channel. Although the traditional reason for precoding is to improve the performance of the communication system, this paper draws attention to the fact that the receiver can identify the impulse response of the channel without any prior knowledge of the transmitted signal simply by solving a system of polynomial equations. Since different precoders lead to different systems of equations, this paper addresses the fundamental issue of determiningwhich classes of linear precoders lead to a system of equations havinga unique solution. In doingso, basic properties of polynomial equations which are useful for studyingother identifiability issues commonly encountered in eng ineeringand the applied sciences are presented. © 2004 Elsevier B.V. All rights reserved.

[1]  A. Blumberg BASIC TOPOLOGY , 2002 .

[2]  Jonathan H. Manton,et al.  ON PROPERTIES OF THE SOLUTIONS OF SYSTEMS OF POLYNOMIAL EQUATIONS , 2005 .

[3]  Jie-Tai Yu,et al.  The Jacobian Conjecture , 2004 .

[4]  Eduardo Sontag On the Observability of Polynomial Systems, I: Finite-Time Problems , 1979 .

[5]  Jonathan H. Manton Design and analysis of linear precoders under a mean square error criterion, Part I: foundations and worst case designs , 2003, Syst. Control. Lett..

[6]  J.H. Manton An improved least squares blind channel identification algorithm for linearly and affinely precoded communication systems , 2002, IEEE Signal Processing Letters.

[7]  L. Tong,et al.  Multichannel blind identification: from subspace to maximum likelihood methods , 1998, Proc. IEEE.

[8]  Hui Liu,et al.  Recent developments in blind channel equalization: From cyclostationarity to subspaces , 1996, Signal Process..

[9]  Jonathan H. Manton An OFDM interpretation of zero padded block transmissions , 2002, Syst. Control. Lett..

[10]  Eduardo Sontag On the Observability of Polynomial Systems. , 1977 .

[11]  Jonathan H. Manton Dissecting OFDM: the independent roles of the cyclic prefix and the IDFT operation , 2001, IEEE Communications Letters.

[12]  Joe W. Harris,et al.  Principles of Algebraic Geometry , 1978 .

[13]  Jonathan H. Manton,et al.  Finite alphabet source recovery in polynomial systems , 2002, Syst. Control. Lett..

[14]  I. Shafarevich Basic algebraic geometry , 1974 .

[15]  Bo Wahlberg,et al.  Blind equalization by direct examination of the input sequences , 1995, IEEE Trans. Commun..

[16]  Jonathan H. Manton Design and analysis of linear precoders under a mean square error criterion, Part II: MMSE designs and conclusions , 2003, Syst. Control. Lett..

[17]  Yingbo Hua,et al.  A frequency domain deterministic approach to channel identification , 1999, IEEE Signal Processing Letters.

[18]  Joe W. Harris,et al.  Algebraic Geometry: A First Course , 1995 .

[19]  Arogyaswami Paulraj,et al.  A subspace approach to blind space-time signal processing for wireless communication systems , 1997, IEEE Trans. Signal Process..

[20]  Xiang-Gen Xia,et al.  Ambiguity resistant polynomial matrices , 1999 .

[21]  David A. Cox,et al.  Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, 3/e (Undergraduate Texts in Mathematics) , 2007 .

[22]  H. Bass,et al.  The Jacobian conjecture: Reduction of degree and formal expansion of the inverse , 1982 .