LDPC码在加性非高斯噪声信道上的快速仿真

T. Sakai, K. Shibata
{"title":"LDPC码在加性非高斯噪声信道上的快速仿真","authors":"T. Sakai, K. Shibata","doi":"10.1109/ISTC.2010.5613994","DOIUrl":null,"url":null,"abstract":"This paper shows a fast simulation method of low-density parity-check (LDPC) codes over an additive non-Gaussian noise channel. The evaluation of an error performance of LDPC codes is usually executed by using a Monte-Carlo simulation since the theoretical calculation method has not been reported. It is very difficult to evaluate an error performance of LDPC codes with finite block length when the error probability is very low. To solve this problem, some fast simulation methods by using importance sampling (IS) are proposed. However, the conventional methods can not reduce the simulation time of LDPC codes over an additive non-Gaussian noise channel because the simulation probability density function (PDF) used in IS is designed for an additive white Gaussian noise. We propose a new simulation PDF design related to the Chernoff bound to estimate an error performance of LDPC codes over an additive non-Gaussian noise channel. In addition, we show some numerical examples to demonstrate the effectiveness of the proposed simulation method. The simulation time of the proposed method is reduced to about 1/2000 of that of the conventional method when we estimate the frame error rate of 10−10.","PeriodicalId":330858,"journal":{"name":"2010 6th International Symposium on Turbo Codes & Iterative Information Processing","volume":"33 1-2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Fast simulation of LDPC codes over additive non-Gaussian noise channel\",\"authors\":\"T. Sakai, K. Shibata\",\"doi\":\"10.1109/ISTC.2010.5613994\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper shows a fast simulation method of low-density parity-check (LDPC) codes over an additive non-Gaussian noise channel. The evaluation of an error performance of LDPC codes is usually executed by using a Monte-Carlo simulation since the theoretical calculation method has not been reported. It is very difficult to evaluate an error performance of LDPC codes with finite block length when the error probability is very low. To solve this problem, some fast simulation methods by using importance sampling (IS) are proposed. However, the conventional methods can not reduce the simulation time of LDPC codes over an additive non-Gaussian noise channel because the simulation probability density function (PDF) used in IS is designed for an additive white Gaussian noise. We propose a new simulation PDF design related to the Chernoff bound to estimate an error performance of LDPC codes over an additive non-Gaussian noise channel. In addition, we show some numerical examples to demonstrate the effectiveness of the proposed simulation method. The simulation time of the proposed method is reduced to about 1/2000 of that of the conventional method when we estimate the frame error rate of 10−10.\",\"PeriodicalId\":330858,\"journal\":{\"name\":\"2010 6th International Symposium on Turbo Codes & Iterative Information Processing\",\"volume\":\"33 1-2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 6th International Symposium on Turbo Codes & Iterative Information Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISTC.2010.5613994\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 6th International Symposium on Turbo Codes & Iterative Information Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISTC.2010.5613994","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

给出了一种低密度奇偶校验码在加性非高斯噪声信道上的快速仿真方法。由于理论计算方法尚未见报道,对LDPC码误差性能的评估通常采用蒙特卡罗模拟方法。在错误概率很低的情况下,有限块长LDPC码的错误性能评价是非常困难的。为了解决这一问题,提出了一些利用重要性采样(IS)的快速仿真方法。然而,传统方法不能减少LDPC码在加性非高斯噪声信道上的模拟时间,因为IS中使用的模拟概率密度函数(PDF)是针对加性高斯白噪声信道设计的。我们提出了一种新的与Chernoff界相关的仿真PDF设计,用于估计LDPC码在加性非高斯噪声信道上的误差性能。最后,通过数值算例验证了所提仿真方法的有效性。当估计帧错误率为10−10时,该方法的仿真时间约为传统方法的1/2000。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Fast simulation of LDPC codes over additive non-Gaussian noise channel
This paper shows a fast simulation method of low-density parity-check (LDPC) codes over an additive non-Gaussian noise channel. The evaluation of an error performance of LDPC codes is usually executed by using a Monte-Carlo simulation since the theoretical calculation method has not been reported. It is very difficult to evaluate an error performance of LDPC codes with finite block length when the error probability is very low. To solve this problem, some fast simulation methods by using importance sampling (IS) are proposed. However, the conventional methods can not reduce the simulation time of LDPC codes over an additive non-Gaussian noise channel because the simulation probability density function (PDF) used in IS is designed for an additive white Gaussian noise. We propose a new simulation PDF design related to the Chernoff bound to estimate an error performance of LDPC codes over an additive non-Gaussian noise channel. In addition, we show some numerical examples to demonstrate the effectiveness of the proposed simulation method. The simulation time of the proposed method is reduced to about 1/2000 of that of the conventional method when we estimate the frame error rate of 10−10.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信