{"title":"Adaptive Paraunitary Filter Methods For The Blind Equalization of Frequency Selective Multiple-Input Multiple-Output Channels","authors":"T. Oktem, A. Erdogan","doi":"10.1109/SIU.2006.1659870","DOIUrl":null,"url":null,"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","PeriodicalId":415037,"journal":{"name":"2006 IEEE 14th Signal Processing and Communications Applications","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 IEEE 14th Signal Processing and Communications Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SIU.2006.1659870","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
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