块衰落信道低密度奇偶校验码的设计与分析

2007 Information Theory and Applications Workshop Pub Date : 1900-01-01 DOI:10.1109/ITA.2007.4357562

J. Boutros, A. G. Fàbregas, E. Biglieri, Gilles Zémor

{"title":"块衰落信道低密度奇偶校验码的设计与分析","authors":"J. Boutros, A. G. Fàbregas, E. Biglieri, Gilles Zémor","doi":"10.1109/ITA.2007.4357562","DOIUrl":null,"url":null,"abstract":"We solve the problem of designing powerful low-density parity-check (LDPC) codes with iterative decoding for the block-fading channel. We present a new family of full-diversity LDPC codes that exhibit near outage limit performance. This family competes with multiplexed parallel turbo codes suitable for non-ergodic channels and recently reported in the literature.","PeriodicalId":439952,"journal":{"name":"2007 Information Theory and Applications Workshop","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"28","resultStr":"{\"title\":\"Design and Analysis of Low-Density Parity-Check Codes for Block-Fading Channels\",\"authors\":\"J. Boutros, A. G. Fàbregas, E. Biglieri, Gilles Zémor\",\"doi\":\"10.1109/ITA.2007.4357562\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We solve the problem of designing powerful low-density parity-check (LDPC) codes with iterative decoding for the block-fading channel. We present a new family of full-diversity LDPC codes that exhibit near outage limit performance. This family competes with multiplexed parallel turbo codes suitable for non-ergodic channels and recently reported in the literature.\",\"PeriodicalId\":439952,\"journal\":{\"name\":\"2007 Information Theory and Applications Workshop\",\"volume\":\"34 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"28\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 Information Theory and Applications Workshop\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITA.2007.4357562\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 Information Theory and Applications Workshop","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITA.2007.4357562","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 28

摘要

我们解决了在分组衰落信道中设计具有迭代译码功能的低密度奇偶校验码的问题。我们提出了一种新的全分集LDPC码，它具有接近中断极限的性能。该家族与适用于非遍历信道的多路并行turbo码竞争，最近在文献中报道。

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

查看原文本刊更多论文

Design and Analysis of Low-Density Parity-Check Codes for Block-Fading Channels

We solve the problem of designing powerful low-density parity-check (LDPC) codes with iterative decoding for the block-fading channel. We present a new family of full-diversity LDPC codes that exhibit near outage limit performance. This family competes with multiplexed parallel turbo codes suitable for non-ergodic channels and recently reported in the literature.

求助全文

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

来源期刊

2007 Information Theory and Applications Workshop

自引率

0.00%

发文量