2015 IEEE Information Theory Workshop - Fall (ITW)最新文献_第6页

Analysis of spatially-coupled counter braids 空间耦合反编织分析

2015 IEEE Information Theory Workshop - Fall (ITW) Pub Date : 2015-08-11 DOI: 10.1109/ITWF.2015.7360749

E. Rosnes, A. G. Amat

{"title":"Analysis of spatially-coupled counter braids","authors":"E. Rosnes, A. G. Amat","doi":"10.1109/ITWF.2015.7360749","DOIUrl":"https://doi.org/10.1109/ITWF.2015.7360749","url":null,"abstract":"A counter braid (CB) is a novel counter architecture introduced by Lu et al. in 2007 for per-flow measurements on high-speed links. CBs achieve an asymptotic compression rate (under optimal decoding) that matches the entropy lower bound of the flow size distribution. Spatially-coupled CBs (SC-CBs) have recently been proposed. In this work, we further analyze single-layer CBs and SC-CBs using an equivalent bipartite graph representation of CBs. On this equivalent representation, we show that the potential and area thresholds are equal. We also show that the area under the extended belief propagation (BP) extrinsic information transfer curve (defined for the equivalent graph), computed for the expected residual CB graph when a peeling decoder equivalent to the BP decoder stops, is equal to zero precisely at the area threshold. This, combined with simulations and an asymptotic analysis of the Maxwell decoder, leads to the conjecture that the area threshold is in fact equal to the Maxwell decoding threshold and hence a lower bound on the maximum a posteriori (MAP) decoding threshold. Finally, we present some numerical results and give some insight into the apparent gap of the BP decoding threshold of SC-CBs to the conjectured lower bound on the MAP decoding threshold.","PeriodicalId":281890,"journal":{"name":"2015 IEEE Information Theory Workshop - Fall (ITW)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133878475","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

Threshold saturation for spatially coupled turbo-like codes over the binary erasure channel 二进制擦除信道上空间耦合涡轮式码的阈值饱和

2015 IEEE Information Theory Workshop - Fall (ITW) Pub Date : 2015-08-10 DOI: 10.1109/itwf.2015.7360750

Saeedeh Moloudi, M. Lentmaier, A. G. Amat

引用次数: 5

On massive MIMO physical layer cryptosystem 大规模MIMO物理层密码系统研究

2015 IEEE Information Theory Workshop - Fall (ITW) Pub Date : 2015-07-29 DOI: 10.1109/ITWF.2015.7360782

Ron Steinfeld, A. Sakzad

引用次数: 5

A mixed-ADC receiver architecture for massive MIMO systems 一种用于大规模MIMO系统的混合adc接收机架构

2015 IEEE Information Theory Workshop - Fall (ITW) Pub Date : 2015-07-27 DOI: 10.1109/ITWF.2015.7360769

Ning Liang, Wenyi Zhang

{"title":"A mixed-ADC receiver architecture for massive MIMO systems","authors":"Ning Liang, Wenyi Zhang","doi":"10.1109/ITWF.2015.7360769","DOIUrl":"https://doi.org/10.1109/ITWF.2015.7360769","url":null,"abstract":"Motivated by the demand for energy-efficient communication solutions in the next generation cellular network, a mixed-ADC receiver architecture for massive multiple input multiple output (MIMO) systems is proposed, which differs from previous works in that herein one-bit analog-to-digital converters (ADCs) partially replace the conventionally assumed high-resolution ADCs. The information-theoretic tool of generalized mutual information (GMI) is exploited to analyze the achievable data rates of the proposed system architecture and an array of analytical results of engineering interest are obtained. For deterministic single input multiple output (SIMO) channels, a closed-form expression of the GMI is derived, based on which the linear combiner is optimized. Then, the asymptotic behaviors of the GMI in both low and high SNR regimes are explored, and the analytical results suggest a plausible ADC assignment scheme. Finally, the analytical framework is applied to the multi-user access scenario, and the corresponding numerical results demonstrate that the mixed system architecture with a relatively small number of high-resolution ADCs is able to achieve a large fraction of the channel capacity without output quantization.","PeriodicalId":281890,"journal":{"name":"2015 IEEE Information Theory Workshop - Fall (ITW)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115455497","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}

引用次数: 18

The wiretap channel with generalized feedback: Secure communication and key generation 具有广义反馈的窃听信道:安全通信和密钥生成

2015 IEEE Information Theory Workshop - Fall (ITW) Pub Date : 2015-07-01 DOI: 10.1109/ITWF.2015.7360780

Germán Bassi, P. Piantanida, S. Shamai

引用次数: 22

Local codes with addition based repair 带有附加修复的本地代码

2015 IEEE Information Theory Workshop - Fall (ITW) Pub Date : 2015-06-08 DOI: 10.1109/ITWF.2015.7360734

H. M. Kiah, Son Hoang Dau, Wentu Song, C. Yuen

引用次数: 2

The indirect rate-distortion function of a binary i.i.d source 二进制i.d源的间接率失真函数

2015 IEEE Information Theory Workshop - Fall (ITW) Pub Date : 2015-05-19 DOI: 10.1109/ITWF.2015.7360794

A. Kipnis, S. Rini, A. Goldsmith

引用次数: 18

Zero error coordination 零误差协调

2015 IEEE Information Theory Workshop - Fall (ITW) Pub Date : 2015-05-05 DOI: 10.1109/ITWF.2015.7360763

Mahed Abroshan, A. Gohari, S. Jaggi

{"title":"Zero error coordination","authors":"Mahed Abroshan, A. Gohari, S. Jaggi","doi":"10.1109/ITWF.2015.7360763","DOIUrl":"https://doi.org/10.1109/ITWF.2015.7360763","url":null,"abstract":"In this paper, we consider a zero error coordination problem wherein the nodes of a network exchange messages to be able to perfectly coordinate their actions with the individual observations of each other. While previous works on coordination commonly assume an asymptotically vanishing error, we assume exact, zero error coordination. Furthermore, unlike previous works that employ the empirical or strong notions of coordination, we define and use a notion of set coordination. This notion of coordination bears similarities with the empirical notion of coordination. We observe that set coordination, in its special case of two nodes with a one-way communication link is equivalent with the “Hide and Seek” source coding problem of McEliece and Posner. The Hide and Seek problem has known intimate connections with graph entropy, rate distortion theory, Rényi mutual information and even error exponents. Other special cases of the set coordination problem relate to Witsenhausen's zero error rate and the distributed computation problem. These connections motivate a better understanding of set coordination, its connections with empirical coordination, and its study in more general setups. This paper takes a first step in this direction by proving new results for two node networks, including capacity characterizations for the linear case.","PeriodicalId":281890,"journal":{"name":"2015 IEEE Information Theory Workshop - Fall (ITW)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132941056","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

Index coding and network coding via rank minimization 索引编码和网络编码通过秩最小化

2015 IEEE Information Theory Workshop - Fall (ITW) Pub Date : 2015-04-26 DOI: 10.1109/ITWF.2015.7360725

Xiao Huang, S. Rouayheb

引用次数: 27

On critical index coding problems 关键索引编码问题

2015 IEEE Information Theory Workshop - Fall (ITW) Pub Date : 2015-04-25 DOI: 10.1109/ITWF.2015.7360724

Fatemeh Arbabjolfaei, Young-Han Kim

引用次数: 8