Abstract

For multiuser systems, several direct blind identification algorithms require that the linear multiple-input multiple-output (MIMO) system have a full rank convolution matrix. This condition requires that the system transfer function be irreducible and column reduced. We show that this restrictive identification condition can be relaxed for some direct blind identification methods to accommodate more practical scenarios. Algorithms such as the outer-product decomposition algorithm only require minor length adjustment to its processing window without the column-reduced condition. This result allows direct blind identification methods to be applicable to MIMO without requiring a full-rank channel convolution matrix.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.