2010 IEEE Information Theory Workshop最新文献_第5页

Low-complexity wire-tap codes with security and error-correction guarantees 具有安全性和纠错保证的低复杂度窃听代码

2010 IEEE Information Theory Workshop Pub Date : 2010-09-30 DOI: 10.1109/CIG.2010.5592824

Yuval Cassuto, Z. Bandic

引用次数: 10

Computation of the robust symmetrical number system dynamic range 鲁棒对称数系统动态范围的计算

2010 IEEE Information Theory Workshop Pub Date : 2010-09-30 DOI: 10.1109/CIG.2010.5592647

B. L. Luke, P. E. Pace

引用次数: 11

Information-theoretic performance analysis of LMS MIMO communications LMS MIMO通信的信息论性能分析

2010 IEEE Information Theory Workshop Pub Date : 2010-09-30 DOI: 10.1109/CIG.2010.5592839

G. Alfano, A. Maio, A. Tulino

{"title":"Information-theoretic performance analysis of LMS MIMO communications","authors":"G. Alfano, A. Maio, A. Tulino","doi":"10.1109/CIG.2010.5592839","DOIUrl":"https://doi.org/10.1109/CIG.2010.5592839","url":null,"abstract":"Information-theoretic performance analysis of a MIMO communication over Land Mobile Satellite (LMS) channels, under ergodic and non-ergodic regimes, is performed. The capacity-achieving input covariance matrix, and the corresponding ergodic capacity, assuming perfect receive-side information but making different assumptions on the amount of channel knowledge at the transmitter, are derived. We obtain exact results, but for the case when perfect channel knowledge is assumed at both ends of the link, for which we provide an upper bound to the ergodic capacity. In the non-ergodic scenario, we compute the outage capacity in absence of power-control, and discuss the asymptotic Gaussianity of the mutual information, which strongly depends on the overall number of degrees of freedom available on the channel. Design guidelines for multiantenna LMS channels are gained studying the low Signal-to-Noise Ratio (SNR) behavior of the capacity, still under the assumption of absence of knowledge of the channel matrix (or its statistics) at the transmitter. The results are illustrated through several examples, aimed at assessing the impact on the performance of the diversity order and/or the Line-of-Sight (LOS) fluctuations.","PeriodicalId":354925,"journal":{"name":"2010 IEEE Information Theory Workshop","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127535693","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

On LP decoding of polar codes 极性码的LP译码

2010 IEEE Information Theory Workshop Pub Date : 2010-09-30 DOI: 10.1109/CIG.2010.5592698

Naveen Goela, S. B. Korada, M. Gastpar

{"title":"On LP decoding of polar codes","authors":"Naveen Goela, S. B. Korada, M. Gastpar","doi":"10.1109/CIG.2010.5592698","DOIUrl":"https://doi.org/10.1109/CIG.2010.5592698","url":null,"abstract":"Polar codes are the first codes to provably achieve capacity on the symmetric binary-input discrete memoryless channel (B-DMC) with low encoding and decoding complexity. The parity check matrix of polar codes is high-density and we show that linear program (LP) decoding fails on the fundamental polytope of the parity check matrix. The recursive structure of the code permits a sparse factor graph representation. We define a new polytope based on the fundamental polytope of the sparse graph representation. This new polytope P is defined in a space of dimension O(N logN) where N is the block length. We prove that the projection of P in the original space is tighter than the fundamental polytope based on the parity check matrix. The LP decoder over P obtains the ML-certificate property. In the case of the binary erasure channel (BEC), the new LP decoder is equivalent to the belief propagation (BP) decoder operating on the sparse factor graph representation, and hence achieves capacity. Simulation results of SC (successive cancelation) decoding, LP decoding over tightened polytopes, and (ML) maximum likelihood decoding are provided. For channels other than the BEC, we discuss why LP decoding over P with a linear objective function is insufficient.","PeriodicalId":354925,"journal":{"name":"2010 IEEE Information Theory Workshop","volume":"43 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127587031","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}

引用次数: 104

Every channel with time structure has a capacity sequence 每一个有时间结构的信道都有一个容量序列

2010 IEEE Information Theory Workshop Pub Date : 2010-09-30 DOI: 10.1109/CIG.2010.5592902

R. Ahlswede

引用次数: 2

Multiple Access Wiretap channels with strong secrecy 具有强保密性的多址窃听通道

2010 IEEE Information Theory Workshop Pub Date : 2010-09-30 DOI: 10.1109/CIG.2010.5592953

Mohammad Hossein Yassaee, M. Aref

引用次数: 65

Orbit codes — A new concept in the area of network coding 轨道码——网络编码领域的一个新概念

2010 IEEE Information Theory Workshop Pub Date : 2010-09-30 DOI: 10.1109/CIG.2010.5592788

Anna-Lena Horlemann-Trautmann, Felice Manganiello, J. Rosenthal

引用次数: 52

The capacity region of the interference channel with a relay in the strong interference regime subject to phase fading 具有中继的干扰信道在强干扰区受相位衰落影响的容量区域

2010 IEEE Information Theory Workshop Pub Date : 2010-09-30 DOI: 10.1109/CIG.2010.5592746

R. Dabora

引用次数: 5

Cooperative ARQs with opportunistic distributed space-time coding: Effective protocols and performance analysis 基于机会分布式空时编码的协同arq:有效协议与性能分析

2010 IEEE Information Theory Workshop Pub Date : 2010-09-30 DOI: 10.1109/CIG.2010.5592722

Hsin-Li Chiu, Sau-Hsuan Wu, Jin-Hao Li

引用次数: 1

Coupled graphical models and their thresholds 耦合图形模型及其阈值

2010 IEEE Information Theory Workshop Pub Date : 2010-09-30 DOI: 10.1109/CIG.2010.5592881

Seyed Hamed Hassani, N. Macris, R. Urbanke

引用次数: 57