块衰落信道的低复杂度联合信道估计与LDPC译码

2006 Asia-Pacific Conference on Communications Pub Date : 2006-12-11 DOI:10.1109/APCC.2006.255801

Zhichu Lin, Zhixing Yang, Changyong Pan

{"title":"块衰落信道的低复杂度联合信道估计与LDPC译码","authors":"Zhichu Lin, Zhixing Yang, Changyong Pan","doi":"10.1109/APCC.2006.255801","DOIUrl":null,"url":null,"abstract":"This paper presents a low-complexity iterative joint channel estimation and LDPC decoding algorithm for block-fading channel. Normalized min-sum algorithm, which has a much lower complexity than sum-product algorithm, is used as LDPC decoding algorithm. By choosing an optimal normalization factor, the performance of our algorithm can be as good as its counterpart using sum-product algorithm, and only 0.3-0.5 dB away from the case where perfect CSI is known","PeriodicalId":205758,"journal":{"name":"2006 Asia-Pacific Conference on Communications","volume":"232 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Low-Complexity Joint Channel Estimation and LDPC Decoding for Block Fading Channel\",\"authors\":\"Zhichu Lin, Zhixing Yang, Changyong Pan\",\"doi\":\"10.1109/APCC.2006.255801\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a low-complexity iterative joint channel estimation and LDPC decoding algorithm for block-fading channel. Normalized min-sum algorithm, which has a much lower complexity than sum-product algorithm, is used as LDPC decoding algorithm. By choosing an optimal normalization factor, the performance of our algorithm can be as good as its counterpart using sum-product algorithm, and only 0.3-0.5 dB away from the case where perfect CSI is known\",\"PeriodicalId\":205758,\"journal\":{\"name\":\"2006 Asia-Pacific Conference on Communications\",\"volume\":\"232 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-12-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 Asia-Pacific Conference on Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/APCC.2006.255801\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 Asia-Pacific Conference on Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APCC.2006.255801","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 4

摘要

针对分组衰落信道，提出了一种低复杂度迭代联合信道估计和LDPC译码算法。LDPC译码算法采用归一化最小和算法，其复杂度远低于和积算法。通过选择最优的归一化因子，我们的算法的性能可以与使用和积算法的算法一样好，并且距离已知完美CSI的情况只有0.3-0.5 dB

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

查看原文本刊更多论文

Low-Complexity Joint Channel Estimation and LDPC Decoding for Block Fading Channel

This paper presents a low-complexity iterative joint channel estimation and LDPC decoding algorithm for block-fading channel. Normalized min-sum algorithm, which has a much lower complexity than sum-product algorithm, is used as LDPC decoding algorithm. By choosing an optimal normalization factor, the performance of our algorithm can be as good as its counterpart using sum-product algorithm, and only 0.3-0.5 dB away from the case where perfect CSI is known

求助全文

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

来源期刊

2006 Asia-Pacific Conference on Communications

自引率

0.00%

发文量