{"title":"一种降低联合检测算法复杂度的新方法","authors":"Dong Chen, Tamio Saito","doi":"10.1109/GLOCOM.2003.1258652","DOIUrl":null,"url":null,"abstract":"Joint detection (JD) is a key technology in 3/sup rd/ generation mobile communication systems like UTRA-TDD; it can be used to eliminate the intracell multiple access interference (MAI) and intersymbol interference (ISI). However, high complexity blocks its commercial application. The bottleneck can be generalized into one problem, to calculate the matrix inversion. A new method is proposed to reduce the complexity of the joint detection algorithm, and the simulation results indicate that the performance is acceptable in practical applications. The algorithm complexity is reduced 18 times, based on simulation duration, compared with a traditional Cholesky method. Even if compared with approximate Cholesky decomposition, the complexity is reduced by 6 percent, based on the complex multiplication times.","PeriodicalId":301154,"journal":{"name":"GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A new method to reduce the complexity of joint detection algorithm\",\"authors\":\"Dong Chen, Tamio Saito\",\"doi\":\"10.1109/GLOCOM.2003.1258652\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Joint detection (JD) is a key technology in 3/sup rd/ generation mobile communication systems like UTRA-TDD; it can be used to eliminate the intracell multiple access interference (MAI) and intersymbol interference (ISI). However, high complexity blocks its commercial application. The bottleneck can be generalized into one problem, to calculate the matrix inversion. A new method is proposed to reduce the complexity of the joint detection algorithm, and the simulation results indicate that the performance is acceptable in practical applications. The algorithm complexity is reduced 18 times, based on simulation duration, compared with a traditional Cholesky method. Even if compared with approximate Cholesky decomposition, the complexity is reduced by 6 percent, based on the complex multiplication times.\",\"PeriodicalId\":301154,\"journal\":{\"name\":\"GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489)\",\"volume\":\"51 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GLOCOM.2003.1258652\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOCOM.2003.1258652","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A new method to reduce the complexity of joint detection algorithm
Joint detection (JD) is a key technology in 3/sup rd/ generation mobile communication systems like UTRA-TDD; it can be used to eliminate the intracell multiple access interference (MAI) and intersymbol interference (ISI). However, high complexity blocks its commercial application. The bottleneck can be generalized into one problem, to calculate the matrix inversion. A new method is proposed to reduce the complexity of the joint detection algorithm, and the simulation results indicate that the performance is acceptable in practical applications. The algorithm complexity is reduced 18 times, based on simulation duration, compared with a traditional Cholesky method. Even if compared with approximate Cholesky decomposition, the complexity is reduced by 6 percent, based on the complex multiplication times.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
