The decoding order has a deep impact in the complexity of sphere detection. A new ordering scheme for sphere detection is presented in this paper, which is based on SIC (serial interference canceling) and the gradient defined by the accumulated probability of the absolute difference between symbol element and the zero-forcing solution. The simulation results show that the proposed ordering scheme can achieve a significant complexity reduction, especially for high numbers of antennas and large constellation sizes in the low SNR region. Compared with sphere detection complexity under BSQR (balanced sorted QR) decomposition and GB (gradient-based) orderings at SNR = 5 dB, the average number of visited nodes under our proposed ordering is reduced by almost 30% and 33% in 4×4 16QAM system and by almost 30% and 50% reduction in 6×6 16QAM system, respectively. For 4×4 64QAM system, almost 75% and 80% reduction at SNR = 0 dB and more than 40% and 50% reduction at SNR = 5 dB can be achieved, respectively.
{"title":"A new efficient ordering scheme for sphere detection","authors":"Cao Haiyan, Li Jun","doi":"10.1155/2011/821407","DOIUrl":"https://doi.org/10.1155/2011/821407","url":null,"abstract":"The decoding order has a deep impact in the complexity of sphere detection. A new ordering scheme for sphere detection is presented in this paper, which is based on SIC (serial interference canceling) and the gradient defined by the accumulated probability of the absolute difference between symbol element and the zero-forcing solution. The simulation results show that the proposed ordering scheme can achieve a significant complexity reduction, especially for high numbers of antennas and large constellation sizes in the low SNR region. Compared with sphere detection complexity under BSQR (balanced sorted QR) decomposition and GB (gradient-based) orderings at SNR = 5 dB, the average number of visited nodes under our proposed ordering is reduced by almost 30% and 33% in 4×4 16QAM system and by almost 30% and 50% reduction in 6×6 16QAM system, respectively. For 4×4 64QAM system, almost 75% and 80% reduction at SNR = 0 dB and more than 40% and 50% reduction at SNR = 5 dB can be achieved, respectively.","PeriodicalId":46573,"journal":{"name":"Journal of Electrical and Computer Engineering","volume":null,"pages":null},"PeriodicalIF":2.4,"publicationDate":"2011-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1155/2011/821407","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"64284601","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
We propose a subspace-tracking-based space-time adaptive processing technique for airborne radar applications. By applying a modified approximated power iteration subspace tracing algorithm, the principal subspace in which the clutter-plus-interference reside is estimated. Therefore, the moving targets are detected by projecting the data on the minor subspace which is orthogonal to the principal subspace. The proposed approach overcomes the shortcomings of the existing methods and has satisfactory performance. Simulation results confirm that the performance improvement is achieved at very small secondary sample support, a feature that is particularly attractive for applications in heterogeneous environments.
{"title":"A modified fast approximated power iteration subspace tracking method for space-time adaptive processing","authors":"Yang Zhiwei, He Shun, Liao Guisheng, Ouyang Shan","doi":"10.1155/2010/973718","DOIUrl":"https://doi.org/10.1155/2010/973718","url":null,"abstract":"We propose a subspace-tracking-based space-time adaptive processing technique for airborne radar applications. By applying a modified approximated power iteration subspace tracing algorithm, the principal subspace in which the clutter-plus-interference reside is estimated. Therefore, the moving targets are detected by projecting the data on the minor subspace which is orthogonal to the principal subspace. The proposed approach overcomes the shortcomings of the existing methods and has satisfactory performance. Simulation results confirm that the performance improvement is achieved at very small secondary sample support, a feature that is particularly attractive for applications in heterogeneous environments.","PeriodicalId":46573,"journal":{"name":"Journal of Electrical and Computer Engineering","volume":null,"pages":null},"PeriodicalIF":2.4,"publicationDate":"2010-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1155/2010/973718","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"64255289","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1992-01-01DOI: 10.1007/978-1-4615-3636-9
D. Gajski, N. Dutt, A. Wu
{"title":"Youn-Long Steve Lin","authors":"D. Gajski, N. Dutt, A. Wu","doi":"10.1007/978-1-4615-3636-9","DOIUrl":"https://doi.org/10.1007/978-1-4615-3636-9","url":null,"abstract":"","PeriodicalId":46573,"journal":{"name":"Journal of Electrical and Computer Engineering","volume":null,"pages":null},"PeriodicalIF":2.4,"publicationDate":"1992-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/978-1-4615-3636-9","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"51002085","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：