Institutional Repository
Technical University of Crete
Technical University of Crete
EN
|
EL
| URI: | http://purl.tuc.gr/dl/dias/A35861DE-3D72-4F98-AB7C-08B54B679544 | ||
| Year | 1998 | ||
| Type of Item | Conference Full Paper | ||
| License |
|
||
| Bibliographic Citation | A. P. Liavas, P. A. Regalia and J-P. Delmas.(1998).Robustness of least-squares and subspace methods for blind channel identification/equalization algorithms with respect to channel undermodeling.Presented at European Signal Processing Conference.[online].Available:http://faculty.cua.edu/regalia/regalia-perso_files/eusipco-98a.pdf | ||
| Appears in Collections |
The least-squares and the subspace methods arewell known approaches for blind channel identification/equalization.When the order of the channel isknown, the algorithms are able to identify the channel,under the so-called length and zero conditions. Furthermore,in the noiseless case, the channel can be perfectlyequalized. Less is known about the performance ofthese algorithms in the cases in which the channel orderis underestimated. We partition the true impulse responseinto the significant part and the tails. We showthat the m-th order least-squares or subspace methodsestimate an impulse response which is “close” to them-th order significant part of the true impulse response.The closeness depends on the diversity of the m-th ordersignificant part and the size of the “unmodeled” part
Copyright © DIAS 2013
