2011 IEEE International Symposium on Information Theory Proceedings最新文献_第9页

Communicating remote Gaussian sources over Gaussian multiple access channels 通过高斯多址信道通信远程高斯源

2011 IEEE International Symposium on Information Theory Proceedings Pub Date : 2011-10-03 DOI: 10.1109/ISIT.2011.6034242

A. Lapidoth, I-Hsiang Wang

引用次数: 8

A transform approach for computing the ranks of parity-check matrices of quasi-cyclic LDPC codes 一种计算拟循环LDPC码奇偶校验矩阵秩的变换方法

2011 IEEE International Symposium on Information Theory Proceedings Pub Date : 2011-10-03 DOI: 10.1109/ISIT.2011.6034147

Qiuju Diao, Qin Huang, Shu Lin, K. Abdel-Ghaffar

引用次数: 6

DRESS codes for the storage cloud: Simple randomized constructions 存储云的着装代码:简单的随机结构

2011 IEEE International Symposium on Information Theory Proceedings Pub Date : 2011-10-03 DOI: 10.1109/ISIT.2011.6033980

S. Pawar, Nima Noorshams, S. Rouayheb, K. Ramchandran

引用次数: 69

Worst-case linear transmit strategies with limited relay information in Gaussian relay networks 高斯中继网络中中继信息有限的最坏情况线性传输策略

2011 IEEE International Symposium on Information Theory Proceedings Pub Date : 2011-10-03 DOI: 10.1109/ISIT.2011.6034028

S. Corroy, R. Mathar

引用次数: 0

Half-duplex relaying based on quantize-and-forward 基于量化转发的半双工中继

2011 IEEE International Symposium on Information Theory Proceedings Pub Date : 2011-10-03 DOI: 10.1109/ISIT.2011.6034004

Sha Yao, M. Skoglund, Thanh Tùng Kim, H. Poor

{"title":"Half-duplex relaying based on quantize-and-forward","authors":"Sha Yao, M. Skoglund, Thanh Tùng Kim, H. Poor","doi":"10.1109/ISIT.2011.6034004","DOIUrl":"https://doi.org/10.1109/ISIT.2011.6034004","url":null,"abstract":"The original compress-and-forward relaying scheme uses the technique of random binning at the relay node and successive decoding at the destination node. Recently, a scheme (termed the quantize-and-forward scheme in this paper) without binning and using joint decoding at the destination node has been proposed, which has been shown to achieve the same rate as the original compress-and-forward scheme. Since the previous work focuses on the so-called full duplex relay network, in this paper, an adaption of it for relay networks with a half-duplex relay is provided. Coding schemes and achievable rate results are presented for discrete memoryless half-duplex relay channels and half-duplex additive white Gaussian noise (AWGN) relay channels. Moreover, slow fading channels are considered, for which outage-related performance measures are evaluated. Specifically, the outage probability and the expected rate of the quantize-and-forward scheme are derived and compared with other well-known schemes. Furthermore, the diversity-multiplexing tradeoff is derived. It is shown that the quantize-and-forward scheme is a more suitable scheme than the compress-and-forward scheme over slow fading channels and it achieves the optimal diversity-multiplexing trade-off of a half-duplex relay channel.","PeriodicalId":208375,"journal":{"name":"2011 IEEE International Symposium on Information Theory Proceedings","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122878567","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}

引用次数: 5

Analysis of fast sparse superposition codes 快速稀疏叠加码分析

2011 IEEE International Symposium on Information Theory Proceedings Pub Date : 2011-10-03 DOI: 10.1109/ISIT.2011.6033853

A. Barron, Antony Joseph

引用次数: 8

Cooperative computation in wireless networks 无线网络中的协同计算

2011 IEEE International Symposium on Information Theory Proceedings Pub Date : 2011-10-03 DOI: 10.1109/ISIT.2011.6034251

M. Nokleby, B. Aazhang

引用次数: 4

Network Simplification: The Gaussian diamond network with multiple antennas 网络简化:多天线高斯菱形网络

2011 IEEE International Symposium on Information Theory Proceedings Pub Date : 2011-10-03 DOI: 10.1109/ISIT.2011.6034245

Caner Nazaroglu, B. Ebrahimi, Ayfer Özgür, C. Fragouli

引用次数: 14

List decoding of polar codes 列出极性码的解码

2011 IEEE International Symposium on Information Theory Proceedings Pub Date : 2011-10-03 DOI: 10.1109/ISIT.2011.6033904

I. Tal, A. Vardy

{"title":"List decoding of polar codes","authors":"I. Tal, A. Vardy","doi":"10.1109/ISIT.2011.6033904","DOIUrl":"https://doi.org/10.1109/ISIT.2011.6033904","url":null,"abstract":"We describe a successive-cancellation list decoder for polar codes, which is a generalization of the classic successive-cancellation decoder of Arikan. In the proposed list decoder, up to L decoding paths are considered concurrently at each decoding stage. Simulation results show that the resulting performance is very close to that of a maximum-likelihood decoder, even for moderate values of L. Thus it appears that the proposed list decoder bridges the gap between successive-cancellation and maximum-likelihood decoding of polar codes. The specific list-decoding algorithm that achieves this performance doubles the number of decoding paths at each decoding step, and then uses a pruning procedure to discard all but the L “best” paths. In order to implement this algorithm, we introduce a natural pruning criterion that can be easily evaluated. Nevertheless, straightforward implementation still requires O(L · n2) time, which is in stark contrast with the O(n log n) complexity of the original successive-cancellation decoder. We utilize the structure of polar codes to overcome this problem. Specifically, we devise an efficient, numerically stable, implementation taking only O(L · n log n) time and O(L · n) space.","PeriodicalId":208375,"journal":{"name":"2011 IEEE International Symposium on Information Theory Proceedings","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125792676","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}

引用次数: 1512

Performance bounds for active sequential hypothesis testing 主动序列假设检验的性能界

2011 IEEE International Symposium on Information Theory Proceedings Pub Date : 2011-10-03 DOI: 10.1109/ISIT.2011.6034055

Mohammad Naghshvar, T. Javidi

引用次数: 16