一种用于HARQ的LDPC码组合解码方法

Future Generation Communication and Networking (FGCN 2007) Pub Date : 2007-12-06 DOI:10.1109/FGCN.2007.4

Zhiping Shi, Liang Zhou

{"title":"一种用于HARQ的LDPC码组合解码方法","authors":"Zhiping Shi, Liang Zhou","doi":"10.1109/FGCN.2007.4","DOIUrl":null,"url":null,"abstract":"This paper proposes a new combining decoding method for low density parity check codes in the multiple received packets combining used in HARQ, which is based on the minimum distance criterion. Simulation results show that the new combining methods outperform the conventional chase combining over fading channel in terms of throughput.","PeriodicalId":254368,"journal":{"name":"Future Generation Communication and Networking (FGCN 2007)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Combining Decoding Method of LDPC Codes for HARQ\",\"authors\":\"Zhiping Shi, Liang Zhou\",\"doi\":\"10.1109/FGCN.2007.4\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes a new combining decoding method for low density parity check codes in the multiple received packets combining used in HARQ, which is based on the minimum distance criterion. Simulation results show that the new combining methods outperform the conventional chase combining over fading channel in terms of throughput.\",\"PeriodicalId\":254368,\"journal\":{\"name\":\"Future Generation Communication and Networking (FGCN 2007)\",\"volume\":\"25 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-12-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Future Generation Communication and Networking (FGCN 2007)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/FGCN.2007.4\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Future Generation Communication and Networking (FGCN 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FGCN.2007.4","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

提出了一种新的基于最小距离准则的组合解码方法，用于HARQ中多接收包组合中的低密度奇偶校验码。仿真结果表明，该组合方法在吞吐量方面优于传统的衰落信道跟踪组合方法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A Combining Decoding Method of LDPC Codes for HARQ

This paper proposes a new combining decoding method for low density parity check codes in the multiple received packets combining used in HARQ, which is based on the minimum distance criterion. Simulation results show that the new combining methods outperform the conventional chase combining over fading channel in terms of throughput.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Future Generation Communication and Networking (FGCN 2007)

自引率

0.00%

发文量