2014 IEEE International Symposium on Information Theory最新文献

Degrees of freedom of uplink-downlink multiantenna cellular networks 上行-下行多天线蜂窝网络的自由度

2014 IEEE International Symposium on Information Theory Pub Date : 2016-02-12 DOI: 10.1109/TIT.2016.2529839

Sang-Woon Jeon, Changho Suh

引用次数: 16

Optimal simultaneous detection and signal and noise power estimation 最佳同时检测和信号和噪声功率估计

2014 IEEE International Symposium on Information Theory Pub Date : 2014-10-15 DOI: 10.1109/ISIT.2014.6874897

Long N. Le, Douglas L. Jones

引用次数: 1

Multi-version coding in distributed storage 分布式存储中的多版本编码

2014 IEEE International Symposium on Information Theory Pub Date : 2014-09-01 DOI: 10.1109/ALLERTON.2014.7028506

Zhiying Wang, V. Cadambe

{"title":"Multi-version coding in distributed storage","authors":"Zhiying Wang, V. Cadambe","doi":"10.1109/ALLERTON.2014.7028506","DOIUrl":"https://doi.org/10.1109/ALLERTON.2014.7028506","url":null,"abstract":"We investigate an information theoretic problem motivated by storing multiple versions of a data object in distributed storage systems. Specifically, in a storage system with n server nodes, where there are v independent message versions, each server receives message values corresponding to some arbitrary subset of the versions. The versions are assumed to be totally ordered. Each server is unaware of the set of versions at the other servers, and aims to encode the values corresponding to the versions it has. We investigate codes where, from any set of c nodes (c <; n), the value corresponding to the highest common version, as per the version ordering, available at this set of c nodes is decodable. We aim to design codes that minimize the storage cost. We present two main results in this paper. First, we show that the storage cost is lower bounded by 1 - (1 - 1/c)υ, measured in terms of the bits of the values. Second, for the cases of υ = 2 and υ = 3, we provide new code constructions that respectively achieve storage costs of (2c-1)/c2 and (3c-2)/c2, measured in terms of the bits of the values. Our code constructions are simple in that we do not code across versions. We argue that when the number of versions υ is much larger than c, then replication is close to optimal.","PeriodicalId":127191,"journal":{"name":"2014 IEEE International Symposium on Information Theory","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124778693","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}

引用次数: 4

On topological properties of wireless sensor networks under the q-composite key predistribution scheme with on/off channels 带开/关信道的q-复合密钥预分配方案下无线传感器网络拓扑特性研究

2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-20 DOI: 10.1109/ISIT.2014.6875009

Jun Zhao, Osman Yağan, V. Gligor

引用次数: 31

LDPC convolutional codes versus QC LDPC block codes in communication standard scenarios LDPC卷积码与QC LDPC分组码在通信标准场景

2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-11 DOI: 10.1109/ISIT.2014.6875339

I. Bocharova, B. Kudryashov, R. Johannesson

{"title":"LDPC convolutional codes versus QC LDPC block codes in communication standard scenarios","authors":"I. Bocharova, B. Kudryashov, R. Johannesson","doi":"10.1109/ISIT.2014.6875339","DOIUrl":"https://doi.org/10.1109/ISIT.2014.6875339","url":null,"abstract":"Outstanding asymptotical performance demonstrated by low-density parity-check (LDPC) convolutional codes (CC) makes them strong competitors with respect to quasi-cyclic (QC) LDPC block codes (BC) currently used in a variety of communication standards. However, typically communication standards, for example, DVB-S2 or WIMax standards impose rather serious restrictions on the structure of the employed codes. These restrictions are related to different implementation issues such as existence of low-complexity encoding and decoding, short decoding delay etc. Two scenarios are considered. In one scenario, short-delay and low-complexity constraints are taken into account. In the other scenario, the complexity requirement is relaxed. Both LDPC CCs and QC LDPC BCs with optimized degree distribution and girth profile, which enable low-complexity encoding, are constructed for these scenarios. Having both delay and complexity constraints yields QC LDPC BCs that outperform the LDPC CCs. In this scenario LDPC CCs play an important role mostly for constructing tailbiting QC LDPC BCs. On the other hand, assuming only a decoding delay constraint the LDPC CCs can be superior compared to the QC LDPC BCs at the relatively low signal-to-noise ratio region. Moreover, under practically acceptable decoding delays also the LDPC CCs with low-complexity encoding structure beat records in approaching the Shannon limit. A new LDPC CC is presented achieving the BER 10-7 with decoding delay 96000 bits at 0.62 dB, that is, performing only about 0.43 dB from the Shannon limit.","PeriodicalId":127191,"journal":{"name":"2014 IEEE International Symposium on Information Theory","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125210668","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

Dispersion of quasi-static MIMO fading channels via Stokes' theorem 基于Stokes定理的准静态MIMO衰落信道色散研究

2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-11 DOI: 10.1109/ISIT.2014.6875198

Wei Yang, G. Durisi, T. Koch, Yury Polyanskiy

引用次数: 2

Absorbing set characterization of array-based spatially coupled LDPC codes 基于阵列的空间耦合LDPC码的吸收集表征

2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-11 DOI: 10.1109/ISIT.2014.6874960

David G. M. Mitchell, L. Dolecek, D. Costello

{"title":"Absorbing set characterization of array-based spatially coupled LDPC codes","authors":"David G. M. Mitchell, L. Dolecek, D. Costello","doi":"10.1109/ISIT.2014.6874960","DOIUrl":"https://doi.org/10.1109/ISIT.2014.6874960","url":null,"abstract":"Absorbing sets are combinatorially defined objects existing in the Tanner graph of a low-density parity-check (LDPC) code that have been shown to cause failures in the iterative message-passing decoder when transmission occurs over the additive white Gaussian noise channel. In this paper, we study the absorbing set properties of a class of high-rate array-based spatially coupled LDPC (SC-LDPC) codes that are constructed by coupling together L array-based LDPC block codes. We prove that the smallest absorbing sets existing in the Tanner graph of the SC-LDPC code have the same size as those in the corresponding uncoupled LDPC codes, and the number of such sets grow linearly with L. We show that spatial coupling greatly reduces the average number (per symbol) of minimal sets compared to the uncoupled codes, and we explain that this reduction is due to many absorbing sets and small cycles being `broken' by the coupling process. The large reduction in the number of minimal absorbing sets suggests that array-based SC-LDPC codes will have significantly improved decoding performance in the high signal-to-noise ratio regime compared to the corresponding uncoupled LDPC codes.","PeriodicalId":127191,"journal":{"name":"2014 IEEE International Symposium on Information Theory","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127119414","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}

引用次数: 41

On the upper bound on undetected error probability for LDPC code LDPC码的未检测错误概率上界

2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-11 DOI: 10.1109/ISIT.2014.6875417

P. Rybin, V. Zyablov

引用次数: 1

List decoding of crisscross error patterns 列出交叉错误模式的解码

2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-11 DOI: 10.1109/ISIT.2014.6875030

A. Wachter-Zeh

引用次数: 5

The induced correlations of Zadoff-Chu sequences Zadoff-Chu序列的诱导相关性

2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-11 DOI: 10.1109/ISIT.2014.6875113

Tae-Kyo Lee, Kyeongcheol Yang

引用次数: 2