Karim Badawi, C. Benkeser, C. Roth, Qiuting Huang, A. Burg
{"title":"一种具有线性均衡和分组辅助的约束viterbi算法","authors":"Karim Badawi, C. Benkeser, C. Roth, Qiuting Huang, A. Burg","doi":"10.1109/ISWCS.2012.6328364","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a novel linear equalization and progressive grouping-assisted constrained Viterbi algorithm (LEG-CVA) as a near-maximum likelihood sequence estimation (MLSE) approach for the downlink. The simulation results show that the reduced-complexity algorithm is highly attractive with large system dimensions such as those in the time-duplexing high speed packet access (TD-HSPA) system, where the proposed algorithm outperforms traditional detection techniques.","PeriodicalId":167119,"journal":{"name":"2012 International Symposium on Wireless Communication Systems (ISWCS)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A novel constrained-Viterbi algorithm with linear equalization and grouping assistance\",\"authors\":\"Karim Badawi, C. Benkeser, C. Roth, Qiuting Huang, A. Burg\",\"doi\":\"10.1109/ISWCS.2012.6328364\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we propose a novel linear equalization and progressive grouping-assisted constrained Viterbi algorithm (LEG-CVA) as a near-maximum likelihood sequence estimation (MLSE) approach for the downlink. The simulation results show that the reduced-complexity algorithm is highly attractive with large system dimensions such as those in the time-duplexing high speed packet access (TD-HSPA) system, where the proposed algorithm outperforms traditional detection techniques.\",\"PeriodicalId\":167119,\"journal\":{\"name\":\"2012 International Symposium on Wireless Communication Systems (ISWCS)\",\"volume\":\"26 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-10-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 International Symposium on Wireless Communication Systems (ISWCS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISWCS.2012.6328364\",\"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 International Symposium on Wireless Communication Systems (ISWCS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISWCS.2012.6328364","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A novel constrained-Viterbi algorithm with linear equalization and grouping assistance
In this paper, we propose a novel linear equalization and progressive grouping-assisted constrained Viterbi algorithm (LEG-CVA) as a near-maximum likelihood sequence estimation (MLSE) approach for the downlink. The simulation results show that the reduced-complexity algorithm is highly attractive with large system dimensions such as those in the time-duplexing high speed packet access (TD-HSPA) system, where the proposed algorithm outperforms traditional detection techniques.