Abstract
In this paper we introduce fast paraunitary matrix obtaining approaches to be used for the blind deconvolution of all blindly equalizable, frequency selective MIMO (Multiple-Input Multiple-Output) systems. The main purpose for offering these approaches is to extend various instantaneous blind source separation (BSS) approaches to handle the convolutive BSS case. It was aimed that the offered algorithms have fast convergence properties and low computational complexities so that they can be realized real-time in the communication systems having high sampling rates. These adaptive algorithms which were developed according to the gradient search on specific sets, were compared to the afore introduced alternating projections algorithm in terms of speed and computational complexity.
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 callDisclaimer: 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.
