Abstract
Blind channel identification and equalization have attracted much attention recently. Their potential application in wireless communication systems has been explored. For multiple user systems, several algorithms known to date require the assumption that the linear system has a full rank convolution matrix. In fact, this assumption requires that system be irreducible and column reduced. In this paper, we show that some of these algorithms can remain effective even when the rank condition is relaxed. Several algorithms, including the outer-product decomposition, can still be applied with care for irreducible (but not column reduced) multiple-input-multiple-output (MIMO) linear systems.
| Original language | English |
|---|---|
| Pages (from-to) | 4302-4307 |
| Number of pages | 6 |
| Journal | Proceedings of the IEEE Conference on Decision and Control |
| Volume | 5 |
| Publication status | Published - 2000 |
| Externally published | Yes |
| Event | 39th IEEE Confernce on Decision and Control - Sydney, NSW, Australia Duration: 12 Dec 2000 → 15 Dec 2000 |