2009 IEEE International Symposium on Information Theory最新文献_第8页

Stopping set analysis of repeat multiple-accumulate codes 重复多重累积码的停集分析

2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205334

E. Rosnes, A. G. Amat

{"title":"Stopping set analysis of repeat multiple-accumulate codes","authors":"E. Rosnes, A. G. Amat","doi":"10.1109/ISIT.2009.5205334","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205334","url":null,"abstract":"In this work, we consider a stopping set analysis of repeat multiple-accumulate (RMA) code ensembles formed by the serial concatenation of a repetition code with multiple accumulators. The RMA codes are assumed to be iteratively decoded in a constituent code oriented fashion using maximum a posteriori erasure correction in the constituent codes. We give stopping set enumerators for RMA code ensembles and show that their stopping distance hmin, defined as the size of the smallest nonempty stopping set, asymptotically grows linearly with the block length. Thus, the RMA code ensembles are good for the binary erasure channel. Furthermore, it is shown that, contrary to the asymptotic minimum distance dmin, whose growth rate coefficient increases with the number of accumulate codes, the hmin growth rate coefficient diminishes with the number of accumulators. We also consider random puncturing and show that for sufficiently high code rates, the asymptotic hmin does not grow linearly with the block length, contrary to the asymptotic dmin, whose growth rate coefficient approaches the Gilbert-Varshamov bound as the rate increases. Finally, we give iterative decoding thresholds to show the convergence properties.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133997720","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Searching for high-rate convolutional codes via binary syndrome trellises 利用二进制综合征格架搜索高速率卷积码

2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205916

F. Hug, I. Bocharova, R. Johannesson, B. Kudryashov

引用次数: 17

Binary erasure multiple descriptions: Worst-case distortion 二进制擦除多重描述:最坏情况失真

2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205730

E. Ahmed, A. Wagner

引用次数: 6

Demultiplexer design for multi-edge type LDPC coded modulation 多边型LDPC编码调制的解复用器设计

2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205587

J. Lei, Wen Gao, P. Spasojevic, R. Yates

{"title":"Demultiplexer design for multi-edge type LDPC coded modulation","authors":"J. Lei, Wen Gao, P. Spasojevic, R. Yates","doi":"10.1109/ISIT.2009.5205587","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205587","url":null,"abstract":"Generally, the capacity-achieving signaling design for a specific channel should consider the joint optimization of channel coding and modulation. Nevertheless, coding theorists and practitioners have recognized that a well-designed LDPC code can achieve capacity-approaching performance universally across a range of data transmission and storage channels. A pronounced example is the forward error correction scheme adopted recently by the second generation standards for digital video broadcasting (DVB), wherein the same LDPC codes are expected to be reused over satellite, terrestrial and cable channels. However, to accommodate the spectral efficiency of different channel type, the coded bits should be mapped to the modulator judiciously. The well-known BICM strategy employs a large random bit interleaver, which typically yields good performance for an arbitrary choice of constellation mapper. However, it is problematic for high-speed coding and modulation due to the large amount of memory and circuits routing required. This motivates us to impose structural simplicity on the bit interleaver configuration so that the coded bits are de-multiplexed systematically into parallel groups to feed the constellation mapper. In this paper, we focus on the design of bit demultiplexers for multi-level modulations by applying the framework of multi-edge type (MET) LDPC. Since the channel-dependence of a given code ensemble is dominated by the mutual information between the input and output of the effective channel, we propose to simplify the analysis of the decoding behavior by using a set of surrogate binary erasure channels (BEC). Simulation results indicate that the proposed bit demultiplexer surpasses the performance of the heuristic interleaving strategy specified in second generation DVB standard for terrestrial channels (DVB-T2).","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134393047","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 13

Optimized rate allocation for state estimation over noisy channels 噪声信道上状态估计的优化速率分配

2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205891

Lei Bao, M. Skoglund, C. Fischione, K. Johansson

引用次数: 3

Opportunistic interference management 机会干扰管理

2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205335

Nilesh Khude, V. Prabhakaran, P. Viswanath

引用次数: 18

On networks with side information 在有附带信息的网络上

2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205925

A. Cohen, A. Avestimehr, M. Effros

引用次数: 12

On the convergence of iterative belief propagation 关于迭代信念传播的收敛性

2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205780

A. Heim, U. Sorger

引用次数: 0

Signal combining for relay transmission with rateless codes 用无速率码中继传输的信号合并

2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205721

Azad Ravanshid, L. Lampe, J. Huber

引用次数: 21

Distance-increasing mappings from binary vectors to constant composition vectors 从二进制向量到常量组合向量的距离递增映射

2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5206023

Jen-Chun Chang, H. Wu

引用次数: 1