{"title":"基于检测排序的单载波传输2步QRM-MLBD","authors":"K. Temma, Tetsuya Yamamoto, F. Adachi","doi":"10.1109/VETECS.2012.6240210","DOIUrl":null,"url":null,"abstract":"2-step maximum likelihood block signal detection employing QR decomposition and M-algorithm (QRM-MLBD) can significantly improve the bit error rate (BER) performance of single-carrier (SC) transmission while reducing the computational complexity compared to maximum likelihood detection (MLD). In 2-step QRM-MLBD, unreliable symbol candidates are removed by performing minimum mean square error based frequency-domain equalization (MMSE-FDE) prior to QRM-MLBD. However, a large number M of surviving paths is still required in the M-algorithm to achieve a BER performance close to the matched filter (MF) bound. In this paper, to remedy this problem, we introduce a detection ordering to 2-step QRM-MLBD. We will show by computer simulation that the use of detection ordering can achieve the same BER performance as 2-step QRM-MLBD while reducing the computational complexity.","PeriodicalId":333610,"journal":{"name":"2012 IEEE 75th Vehicular Technology Conference (VTC Spring)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"2-Step QRM-MLBD Using Detection Ordering for Single-Carrier Transmission\",\"authors\":\"K. Temma, Tetsuya Yamamoto, F. Adachi\",\"doi\":\"10.1109/VETECS.2012.6240210\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"2-step maximum likelihood block signal detection employing QR decomposition and M-algorithm (QRM-MLBD) can significantly improve the bit error rate (BER) performance of single-carrier (SC) transmission while reducing the computational complexity compared to maximum likelihood detection (MLD). In 2-step QRM-MLBD, unreliable symbol candidates are removed by performing minimum mean square error based frequency-domain equalization (MMSE-FDE) prior to QRM-MLBD. However, a large number M of surviving paths is still required in the M-algorithm to achieve a BER performance close to the matched filter (MF) bound. In this paper, to remedy this problem, we introduce a detection ordering to 2-step QRM-MLBD. We will show by computer simulation that the use of detection ordering can achieve the same BER performance as 2-step QRM-MLBD while reducing the computational complexity.\",\"PeriodicalId\":333610,\"journal\":{\"name\":\"2012 IEEE 75th Vehicular Technology Conference (VTC Spring)\",\"volume\":\"16 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-05-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 IEEE 75th Vehicular Technology Conference (VTC Spring)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/VETECS.2012.6240210\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE 75th Vehicular Technology Conference (VTC Spring)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/VETECS.2012.6240210","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
2-Step QRM-MLBD Using Detection Ordering for Single-Carrier Transmission
2-step maximum likelihood block signal detection employing QR decomposition and M-algorithm (QRM-MLBD) can significantly improve the bit error rate (BER) performance of single-carrier (SC) transmission while reducing the computational complexity compared to maximum likelihood detection (MLD). In 2-step QRM-MLBD, unreliable symbol candidates are removed by performing minimum mean square error based frequency-domain equalization (MMSE-FDE) prior to QRM-MLBD. However, a large number M of surviving paths is still required in the M-algorithm to achieve a BER performance close to the matched filter (MF) bound. In this paper, to remedy this problem, we introduce a detection ordering to 2-step QRM-MLBD. We will show by computer simulation that the use of detection ordering can achieve the same BER performance as 2-step QRM-MLBD while reducing the computational complexity.