{"title":"Novel Distributed Turbo Coding Scheme in Two-Hop Relay Networks","authors":"Defeng Ren, J. Ge, Xiaoye Shi","doi":"10.1109/iNCoS.2012.17","DOIUrl":null,"url":null,"abstract":"The distributed turbo coding (DTC) with the combined diversity and coding gain has been proven to be an effective coding strategy to approach the capacity of relay networks. In this paper, a novel DTC scheme is proposed to further improve the diversity and coding gain, which can be applied to two-hop relay networks. At the relay, this scheme first computes the log-likelihood ratios (LLRs) of bits punctured at the source. Then, the relay forwards the hard-decided bits (-1 or 1) with the reliability larger than a threshold to the destination, otherwise it forwards the analog values between-1 and 1. Moreover, by using union bound techniques, we derive the upper bound on the end-to-end bit error rate (BER) of proposed DTC scheme under the quasi-static scenario. Finally, simulation results show the performance improvement of our scheme.","PeriodicalId":287478,"journal":{"name":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/iNCoS.2012.17","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
The distributed turbo coding (DTC) with the combined diversity and coding gain has been proven to be an effective coding strategy to approach the capacity of relay networks. In this paper, a novel DTC scheme is proposed to further improve the diversity and coding gain, which can be applied to two-hop relay networks. At the relay, this scheme first computes the log-likelihood ratios (LLRs) of bits punctured at the source. Then, the relay forwards the hard-decided bits (-1 or 1) with the reliability larger than a threshold to the destination, otherwise it forwards the analog values between-1 and 1. Moreover, by using union bound techniques, we derive the upper bound on the end-to-end bit error rate (BER) of proposed DTC scheme under the quasi-static scenario. Finally, simulation results show the performance improvement of our scheme.