A packet based channel identification algorithm for wireless multimedia communications

In high speed wireless multimedia communications, it is necessary to take measures to mitigate the adverse effects of frequency selective fading channels. If the multimedia communications is packet based, and if each packet is suitably linearly or affinely precoded prior to its transmission, then it is possible to identify the channel on a packet-by-packet basis. Somewhat surprisingly though, this paper shows that the standard iterative least squares algorithm for identifying the channel often fails to converge. It then goes on to derive a novel channel identification algorithm which is guaranteed to converge.

[1]  M. Sondhi,et al.  On the evaluation of estimated impulse responses , 1998, IEEE Signal Processing Letters.

[2]  Yingbo Hua,et al.  Robust frequency-domain precoders , 2001, IEEE Communications Letters.

[3]  Iven M. Y. Mareels,et al.  Affine precoders for reliable communications , 2000, 2000 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.00CH37100).

[4]  Anna Scaglione,et al.  Redundant filterbank precoders and equalizers-part I , 1998 .

[5]  B. C. Ng,et al.  On the Cramer-Rao bound under parametric constraints , 1998, IEEE Signal Processing Letters.

[6]  Alan Edelman,et al.  The Geometry of Algorithms with Orthogonality Constraints , 1998, SIAM J. Matrix Anal. Appl..

[7]  Jonathan H. Manton,et al.  Optimization algorithms exploiting unitary constraints , 2002, IEEE Trans. Signal Process..

[8]  W. Boothby.  An introduction to differentiable manifolds and Riemannian geometry , 1975 .

[9]  Elijah Polak,et al.  Optimization: Algorithms and Consistent Approximations , 1997 .

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