{"title":"基于干扰子空间的盲多用户检测","authors":"Junlin Zhang, Ling Nie","doi":"10.1109/ICCI-CC.2013.6622289","DOIUrl":null,"url":null,"abstract":"A new blind adaptive MMSE multi-user detection(MUD) based on subspace tracking is presented. The new detector doesn't employ interference eigenvalue estimation but the interference subspace estimation, and it avoids performance deterioration induced by eigenvalue estimation error. The proposed MUD exploits the normalized orthogonal Oja (NOOja) subspace tracking algorithm for subspace estimation, since it guarantees the orthogonality of the weight matrix spanned by the interference subspace in every iteration, which must be meet in the new detector. The numerical simulation results the proposed MMSE detector has faster convergence rate, better output SIR and BER and lower the computational complexity.","PeriodicalId":130244,"journal":{"name":"2013 IEEE 12th International Conference on Cognitive Informatics and Cognitive Computing","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Blind multi-user detection based on inerference subspace\",\"authors\":\"Junlin Zhang, Ling Nie\",\"doi\":\"10.1109/ICCI-CC.2013.6622289\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A new blind adaptive MMSE multi-user detection(MUD) based on subspace tracking is presented. The new detector doesn't employ interference eigenvalue estimation but the interference subspace estimation, and it avoids performance deterioration induced by eigenvalue estimation error. The proposed MUD exploits the normalized orthogonal Oja (NOOja) subspace tracking algorithm for subspace estimation, since it guarantees the orthogonality of the weight matrix spanned by the interference subspace in every iteration, which must be meet in the new detector. The numerical simulation results the proposed MMSE detector has faster convergence rate, better output SIR and BER and lower the computational complexity.\",\"PeriodicalId\":130244,\"journal\":{\"name\":\"2013 IEEE 12th International Conference on Cognitive Informatics and Cognitive Computing\",\"volume\":\"12 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-07-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 IEEE 12th International Conference on Cognitive Informatics and Cognitive Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCI-CC.2013.6622289\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE 12th International Conference on Cognitive Informatics and Cognitive Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCI-CC.2013.6622289","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Blind multi-user detection based on inerference subspace
A new blind adaptive MMSE multi-user detection(MUD) based on subspace tracking is presented. The new detector doesn't employ interference eigenvalue estimation but the interference subspace estimation, and it avoids performance deterioration induced by eigenvalue estimation error. The proposed MUD exploits the normalized orthogonal Oja (NOOja) subspace tracking algorithm for subspace estimation, since it guarantees the orthogonality of the weight matrix spanned by the interference subspace in every iteration, which must be meet in the new detector. The numerical simulation results the proposed MMSE detector has faster convergence rate, better output SIR and BER and lower the computational complexity.