Abstract
In the blind equalization problem, one can recently observe that the sought unknown filter can be performed from the sole knowledge of second order statistics of the received signal. According to this fact, a powerful algorithm which is the so-called subspace method has been developed. The subspace method was previously described in rational spaces framework which seemed to be unappropriated. Indeed, the filter to identify is polynomial. In this paper, we show how the module theory over the polynomial ring C[z] and, in particular, the duality of modules can highlight the previous proof of the subspace method and lead to generalize its results.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.