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

Finite-memory least squares universal prediction of individual continuous sequences 单个连续序列的有限记忆最小二乘法普遍预测

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

R. Dar, M. Feder

{"title":"Finite-memory least squares universal prediction of individual continuous sequences","authors":"R. Dar, M. Feder","doi":"10.1109/ISIT.2011.6033961","DOIUrl":"https://doi.org/10.1109/ISIT.2011.6033961","url":null,"abstract":"In this paper we consider the problem of universal prediction of individual continuous sequences with square-error loss, using a deterministic finite-state machine (FSM). The goal is to attain universally the performance of the best constant predictor tuned to the sequence, which predicts the empirical mean and incurs the empirical variance as the loss. The paper analyzes the tradeoff between the number of states of the universal FSM and the excess loss (regret). We first present a machine, termed Exponential Decaying Memory (EDM) machine, used in the past for predicting binary sequences, and show bounds on its performance. Then we consider a new class of machines, Degenerated Tracking Memory (DTM) machines, find the optimal DTM machine and show that it outperforms the EDM machine for a small number of states. Incidentally, we prove a lower bound indicating that even with large number of states the regret of the DTM machine does not vanish. Finally, we show a lower bound on the achievable regret of any FSM, and suggest a new machine, the Enhanced Exponential Decaying Memory, which attains the bound and outperforms the EDM for any number of states.","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":"127407721","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}

引用次数: 1

When Alamouti codes meet interference alignment: Transmission schemes for two-user X channel 当Alamouti码满足干扰对准时:双用户X信道的传输方案

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

Liangbin Li, H. Jafarkhani, S. Jafar

引用次数: 39

A simple method to construct LDPC codes based on projective planes 一种基于投影平面构造LDPC码的简单方法

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

S. Kovalev, V. Krachkovsky

引用次数: 3

Minimal trellis for systematic recursive convolutional encoders 最小网格系统递归卷积编码器

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

C. Pimentel, R. Souza, B. Filho, Isaac Benchimol

{"title":"Minimal trellis for systematic recursive convolutional encoders","authors":"C. Pimentel, R. Souza, B. Filho, Isaac Benchimol","doi":"10.1109/ISIT.2011.6034011","DOIUrl":"https://doi.org/10.1109/ISIT.2011.6034011","url":null,"abstract":"We consider high-rate systematic recursive convolutional encoders to be adopted as constituent encoders in turbo schemes. It has been shown by Douillard and Berrou that the construction of high-rate turbo codes by means of high-rate constituent encoders offers several advantages over the typical construction based on the puncturing of rate-1/2 constituent encoders. To reduce the decoding complexity associated with high-rate codes, we adopt the “minimal” trellis representation of convolutional codes introduced by McEliece and Lin. While in the literature this trellis has been obtained for nonrecursive nonsystematic generator matrices, we herein introduce the construction of the “minimal” trellis for a systematic recursive convolutional encoding matrix. We also derive expressions for the arithmetic decoding complexity when the max-log-MAP algorithm is applied over the conventional and the “minimal” trellises. Examples are provided, which show that significant savings in decoding complexity are obtained, while keeping the same error performance of conventional schemes, when the minimal trellis is used. Finally, a code search is conducted and examples are provided which indicate that a refinement in terms of decoding complexity-error performance trade-off is obtained.","PeriodicalId":208375,"journal":{"name":"2011 IEEE International Symposium on Information Theory Proceedings","volume":"40 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":"114308824","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}

引用次数: 11

Optimal MaxWeight scheduling in a multihop wireless network via branch and bound 基于分支和绑定的多跳无线网络的最优MaxWeight调度

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

C. Weeraddana, M. Codreanu, M. Latva-aho, A. Ephremides

引用次数: 0

The ordered Hamming metric and ordered symmetric channels 有序汉明度量和有序对称信道

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

Woomyoung Park, A. Barg

引用次数: 18

Relaying via hybrid coding 通过混合编码中继

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

Young-Han Kim, S. Lim, P. Minero

引用次数: 10

Some constructions of maximal witness codes 最大见证码的一些构造

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

Nikolaos Makriyannis, Bertrand Meyer

引用次数: 2

Constrained Flash memory programming 受限闪存编程

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

A. Berman, Y. Birk

引用次数: 59

Efficient distributed source coding for multiple receivers via matrix sparsification 通过矩阵稀疏化实现多接收机的高效分布式源编码

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

C. Avin, Michael Borokhovich, A. Cohen, Zvi Lotker

引用次数: 3