{"title":"Efficient approximate-ML detection for MIMO spatial multiplexing systems by using a 1-D nearest neighbor search","authors":"D. Seethaler, H. Artés, F. Hlawatsch","doi":"10.1109/ISSPIT.2003.1341117","DOIUrl":null,"url":null,"abstract":"It is known that suboptimal (equalization-based and nulling-and-cancelling) detectors for MIMO spatial multiplexing systems cannot exploit all of the available diversity. Motivated by the insight that this behavior is mainly caused by poorly conditioned channel realizations, we propose the line-search detector (LSD) that is robust to poorly conditioned channels. The LSD uses a 1-D nearest neighbor search along the least significant singular vector of the channel matrix. It exhibits near-ML performance and has significantly lower complexity than the sphere-decoding algorithm for ML detection.","PeriodicalId":332887,"journal":{"name":"Proceedings of the 3rd IEEE International Symposium on Signal Processing and Information Technology (IEEE Cat. No.03EX795)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 3rd IEEE International Symposium on Signal Processing and Information Technology (IEEE Cat. No.03EX795)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISSPIT.2003.1341117","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
It is known that suboptimal (equalization-based and nulling-and-cancelling) detectors for MIMO spatial multiplexing systems cannot exploit all of the available diversity. Motivated by the insight that this behavior is mainly caused by poorly conditioned channel realizations, we propose the line-search detector (LSD) that is robust to poorly conditioned channels. The LSD uses a 1-D nearest neighbor search along the least significant singular vector of the channel matrix. It exhibits near-ML performance and has significantly lower complexity than the sphere-decoding algorithm for ML detection.