图上的非相干LDPC解码

2006 IEEE Information Theory Workshop - ITW '06 Chengdu Pub Date : 2006-10-01 DOI:10.1109/ITW2.2006.323770

A. Scherb, K. Kammeyer

{"title":"图上的非相干LDPC解码","authors":"A. Scherb, K. Kammeyer","doi":"10.1109/ITW2.2006.323770","DOIUrl":null,"url":null,"abstract":"Within this paper graph based non-coherent decoding algorithms for LDPC encoded systems are proposed. We study a class of LDPC codes suitable for non-coherent detection. On the basis of the related graphs a non-coherent decoding algorithm with variable trade-off between computational complexity and BER performance is derived. The proposed scheme is also capable to deal with pilot symbols if available. Finally, the excellent performance of the proposed methods is verified by simulations","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Non-Coherent LDPC Decoding on Graphs\",\"authors\":\"A. Scherb, K. Kammeyer\",\"doi\":\"10.1109/ITW2.2006.323770\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Within this paper graph based non-coherent decoding algorithms for LDPC encoded systems are proposed. We study a class of LDPC codes suitable for non-coherent detection. On the basis of the related graphs a non-coherent decoding algorithm with variable trade-off between computational complexity and BER performance is derived. The proposed scheme is also capable to deal with pilot symbols if available. Finally, the excellent performance of the proposed methods is verified by simulations\",\"PeriodicalId\":299513,\"journal\":{\"name\":\"2006 IEEE Information Theory Workshop - ITW '06 Chengdu\",\"volume\":\"34 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 IEEE Information Theory Workshop - ITW '06 Chengdu\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITW2.2006.323770\",\"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 IEEE Information Theory Workshop - ITW '06 Chengdu","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITW2.2006.323770","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

摘要

本文提出了LDPC编码系统的基于图的非相干译码算法。研究了一类适用于非相干检测的LDPC码。在相关图的基础上，提出了一种计算复杂度与误码率之间具有可变权衡关系的非相干译码算法。如果可用，所提出的方案也能够处理导频符号。最后，通过仿真验证了所提方法的优良性能

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

查看原文本刊更多论文

Non-Coherent LDPC Decoding on Graphs

Within this paper graph based non-coherent decoding algorithms for LDPC encoded systems are proposed. We study a class of LDPC codes suitable for non-coherent detection. On the basis of the related graphs a non-coherent decoding algorithm with variable trade-off between computational complexity and BER performance is derived. The proposed scheme is also capable to deal with pilot symbols if available. Finally, the excellent performance of the proposed methods is verified by simulations

求助全文

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

来源期刊

2006 IEEE Information Theory Workshop - ITW '06 Chengdu

自引率

0.00%

发文量