发布求助
文献互助 智能选刊 最新文献

2011 IEEE International Symposium on Information Theory Proceedings最新文献

筛选
英文 中文
On the construction of polar codes 论极性码的构造
2011 IEEE International Symposium on Information Theory Proceedings Pub Date : 2011-10-03 DOI: 10.1109/ISIT.2011.6033724
Ramtin Pedarsani, Seyed Hamed Hassani, I. Tal, E. Telatar
{"title":"On the construction of polar codes","authors":"Ramtin Pedarsani, Seyed Hamed Hassani, I. Tal, E. Telatar","doi":"10.1109/ISIT.2011.6033724","DOIUrl":"https://doi.org/10.1109/ISIT.2011.6033724","url":null,"abstract":"We consider the problem of efficiently constructing polar codes over binary memoryless symmetric (BMS) channels. The complexity of designing polar codes via an exact evaluation of the polarized channels to find which ones are “good” appears to be exponential in the block length. In [3], Tal and Vardy show that if instead the evaluation if performed approximately, the construction has only linear complexity. In this paper, we follow this approach and present a framework where the algorithms of [3] and new related algorithms can be analyzed for complexity and accuracy. We provide numerical and analytical results on the efficiency of such algorithms, in particular we show that one can find all the “good” channels (except a vanishing fraction) with almost linear complexity in block-length (except a polylogarithmic factor).","PeriodicalId":208375,"journal":{"name":"2011 IEEE International Symposium on Information Theory Proceedings","volume":"24 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":"121474858","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}
引用次数: 127
The universality and linearity of compression by substring enumeration 子串枚举压缩的通用性和线性性
2011 IEEE International Symposium on Information Theory Proceedings Pub Date : 2011-10-03 DOI: 10.1109/ISIT.2011.6033796
Danny Dubé, H. Yokoo
{"title":"The universality and linearity of compression by substring enumeration","authors":"Danny Dubé, H. Yokoo","doi":"10.1109/ISIT.2011.6033796","DOIUrl":"https://doi.org/10.1109/ISIT.2011.6033796","url":null,"abstract":"A new lossless data compression technique called compression by substring enumeration (CSE) has recently been introduced. Two conjectures have been stated in the original paper and they have not been proved there nor in subsequent papers on CSE. The first conjecture says that CSE is universal for Markovian sources, provided an appropriate predictor is devised. The second one says that CSE has a linear complexity both in time and in space. In this paper, we present an appropriate predictor and demonstrate that CSE indeed becomes universal for any order-k Markovian source. Finally, we prove that the compacted substring tree on which CSE's linear complexity depends effectively has linear size.","PeriodicalId":208375,"journal":{"name":"2011 IEEE International Symposium on Information Theory Proceedings","volume":"64 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":"126285230","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}
引用次数: 14
Results on the redundancy of universal compression for finite-length sequences 有限长度序列通用压缩冗余的结果
2011 IEEE International Symposium on Information Theory Proceedings Pub Date : 2011-10-03 DOI: 10.1109/ISIT.2011.6033793
Ahmad Beirami, F. Fekri
{"title":"Results on the redundancy of universal compression for finite-length sequences","authors":"Ahmad Beirami, F. Fekri","doi":"10.1109/ISIT.2011.6033793","DOIUrl":"https://doi.org/10.1109/ISIT.2011.6033793","url":null,"abstract":"In this paper, we investigate the redundancy of universal coding schemes on smooth parametric sources in the finite-length regime. We derive an upper bound on the probability of the event that a sequence of length n, chosen using Jeffreys' prior from the family of parametric sources with d unknown parameters, is compressed with a redundancy smaller than (1 − ∈) d over 2 log n for any ∈ > 0. Our results also confirm that for large enough n and d, the average minimax redundancy provides a good estimate for the redundancy of most sources. Our result may be used to evaluate the performance of universal source coding schemes on finite-length sequences. Additionally, we precisely characterize the minimax redundancy for two-stage codes. We demonstrate that the two-stage assumption incurs a negligible redundancy especially when the number of source parameters is large. Finally, we show that the redundancy is significant in the compression of small sequences.","PeriodicalId":208375,"journal":{"name":"2011 IEEE International Symposium on Information Theory Proceedings","volume":"42 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":"126482035","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}
引用次数: 36
Codes for unordered sets of words 无序词集的代码
2011 IEEE International Symposium on Information Theory Proceedings Pub Date : 2011-10-03 DOI: 10.1109/ISIT.2011.6033752
Y. Reznik
{"title":"Codes for unordered sets of words","authors":"Y. Reznik","doi":"10.1109/ISIT.2011.6033752","DOIUrl":"https://doi.org/10.1109/ISIT.2011.6033752","url":null,"abstract":"We study the problem of coding of unordered sets of words, appearing in language processing, retrieval, machine learning, computer vision, and other fields. We review known results about this problem, and offer a code construction technique suitable for solving it. We show that in a memoryless model the expected length of our codes approaches Ht − log m! + O(m) where m is the number of words in the set, t is the combined length of all words, and H is the entropy of the source. We also offer design of a universal code for sets of words and perform its redundancy analysis.","PeriodicalId":208375,"journal":{"name":"2011 IEEE International Symposium on Information Theory Proceedings","volume":"9 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":"125688430","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
The secrecy capacity region of a special class of multiple access channels 一类特殊的多址信道的保密容量区域
2011 IEEE International Symposium on Information Theory Proceedings Pub Date : 2011-10-03 DOI: 10.1109/ISIT.2011.6034205
Nan Liu, Wei Kang
{"title":"The secrecy capacity region of a special class of multiple access channels","authors":"Nan Liu, Wei Kang","doi":"10.1109/ISIT.2011.6034205","DOIUrl":"https://doi.org/10.1109/ISIT.2011.6034205","url":null,"abstract":"We study the problem of secure communications over the multiple access channel where there is one eavesdropper in the system and the eavesdropper can only overhear the transmitted signal of one of the transmitters. This channel model can be seen as a special case of both scenarios currently studied in the literature for multiple access channels with secrecy constraints. In this simplified model, we obtain the secrecy capacity region if the multiple access channel satisfies certain conditions. We also compare the capacity regions of this special class of multiple access channels with and without secrecy constraints to illustrate the price paid for secrecy.","PeriodicalId":208375,"journal":{"name":"2011 IEEE International Symposium on Information Theory Proceedings","volume":"45 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":"125769306","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}
引用次数: 7
Encoding of multivariate stimuli with MIMO neural circuits 用多输入多输出神经回路编码多元刺激
2011 IEEE International Symposium on Information Theory Proceedings Pub Date : 2011-10-03 DOI: 10.1109/ISIT.2011.6034277
A. Lazar, E. Pnevmatikakis
{"title":"Encoding of multivariate stimuli with MIMO neural circuits","authors":"A. Lazar, E. Pnevmatikakis","doi":"10.1109/ISIT.2011.6034277","DOIUrl":"https://doi.org/10.1109/ISIT.2011.6034277","url":null,"abstract":"We present a general MIMO neural circuit architecture for the encoding of multivariate stimuli in the time domain. The signals belong to the finite space of vector-valued trigonometric polynomials. They are filtered with a linear time-invariant kernel and then processed by a population of leaky integrate-and-fire neurons. We present formal, intuitive, necessary conditions for faithful encoding and provide a perfect recovery (decoding) algorithm. We extend these results to multivariate product spaces and apply them to video encoding with MIMO neural circuits. We demonstrate that our encoding circuits can serve as measurement devices for compressed sensing of frequency sparse signals. Finally, we provide necessary spike density conditions for the decoding of infinite-dimensional vector valued bandlimited functions encoded with MIMO neural circuits.","PeriodicalId":208375,"journal":{"name":"2011 IEEE International Symposium on Information Theory Proceedings","volume":"4 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":"127918005","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
On the St. Petersburg paradox 关于圣彼得堡悖论
2011 IEEE International Symposium on Information Theory Proceedings Pub Date : 2011-10-03 DOI: 10.1109/ISIT.2011.6033850
T. Cover
{"title":"On the St. Petersburg paradox","authors":"T. Cover","doi":"10.1109/ISIT.2011.6033850","DOIUrl":"https://doi.org/10.1109/ISIT.2011.6033850","url":null,"abstract":"We<sup>1</sup> ask what is the appropriate price c to pay to receive an amount X ≥ 0; X ∼ F(x). This is known as the St. Petersburg paradox if Pr{X = 2<sup>k</sup>} = 2<sup>−k</sup>, k = 1, 2, … Here EX = ∞. Is any price c aceptable? We consider this distribution as well as the distribution Pr{X = 2<sup>2k</sup>} = 2<sup>−k</sup>, k = 1, 2, …, which might be called the super St. Petersburg paradox in which not only is EX equal to infinity, but E log X is infinity as well. Let μ<inf>r</inf> = (EX<sup>r</sup>)<sup>1/r</sup> denote the r<sup>th</sup> mean of X. We identify three critical costs, μ<inf>−1</inf> = 1/E(1/X), μ<inf>0</inf> = e<sup>E lnX</sup>, and μ<inf>1</inf> = EX, and conclude that we want some of X if c ≤ μ<inf>1</inf>, and that taking all of X is growth optimal if c ≤ μ<inf>−1</inf>. Thus all prices c are attractive in the St. Petersburg game.","PeriodicalId":208375,"journal":{"name":"2011 IEEE International Symposium on Information Theory Proceedings","volume":"10 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":"115982576","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}
引用次数: 49
Coding for a network coded fountain 对网络编码喷泉进行编码
2011 IEEE International Symposium on Information Theory Proceedings Pub Date : 2011-10-03 DOI: 10.1109/ISIT.2011.6034050
Shenghao Yang, R. Yeung
{"title":"Coding for a network coded fountain","authors":"Shenghao Yang, R. Yeung","doi":"10.1109/ISIT.2011.6034050","DOIUrl":"https://doi.org/10.1109/ISIT.2011.6034050","url":null,"abstract":"Batched sparse (BATS) codes are proposed for transmitting a collection of packets through communication networks employing linear network coding. BATS codes generalize fountain codes and preserve the properties such as ratelessness and low encoding/decoding complexity. Moreover, the buffer size and the computation capability of the intermediate network nodes required to apply BATS codes are independent of the number of packets for transmission. It is verified theoretically for certain cases and demonstrated numerically for the general cases that BATS codes achieve rates very close to the capacity of linear operator channels.","PeriodicalId":208375,"journal":{"name":"2011 IEEE International Symposium on Information Theory Proceedings","volume":"3 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":"132025666","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}
引用次数: 72
Performance analysis of coded V-BLAST with optimum power and rate allocation 优化功率和速率分配的编码V-BLAST性能分析
2011 IEEE International Symposium on Information Theory Proceedings Pub Date : 2011-10-03 DOI: 10.1109/ISIT.2011.6033871
V. Kostina, S. Loyka
{"title":"Performance analysis of coded V-BLAST with optimum power and rate allocation","authors":"V. Kostina, S. Loyka","doi":"10.1109/ISIT.2011.6033871","DOIUrl":"https://doi.org/10.1109/ISIT.2011.6033871","url":null,"abstract":"Several optimization strategies for instantaneous rate and/or power allocation in the coded V-BLAST are studied analytically. Outage probabilities and system capacities of these strategies in a spatial multiplexing system are compared under generic settings. Since the conventional waterfilling algorithm is suboptimal for the coded V-BLAST, a recently-proposed “fractional waterfilling” algorithm is studied, which simultaneously maximizes the system capacity and minimizes the outage probability. A comparative, closed-form performance analysis of this and other algorithms is presented, including bounds on the outage probability and its low-outage approximations. The fractional waterfilling algorithm attains the full MIMO channel diversity and outperforms the other algorithms by a wide margin.","PeriodicalId":208375,"journal":{"name":"2011 IEEE International Symposium on Information Theory Proceedings","volume":" 7","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132123955","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
Interference alignment with per-antenna power constraints 天线功率约束下的干扰对准
2011 IEEE International Symposium on Information Theory Proceedings Pub Date : 2011-10-03 DOI: 10.1109/ISIT.2011.6034072
Jonathan Starr, Omar El Ayach, R. Heath
{"title":"Interference alignment with per-antenna power constraints","authors":"Jonathan Starr, Omar El Ayach, R. Heath","doi":"10.1109/ISIT.2011.6034072","DOIUrl":"https://doi.org/10.1109/ISIT.2011.6034072","url":null,"abstract":"Interference alignment is a technique for designing transmit precoders that is known to achieve the maximum multiplexing gain in the interference channel. Prior work on interference alignment has assumed sum-power constraints in designing the transmit precoders. In practice, however, each transmit antenna has its own power amplifier which constrains the power radiated from each antenna. This paper proposes and analyzes two algorithms for performing interference alignment with per-antenna equality and inequality power constraints. It is proven that incorporating inequality constraints can be done arbitrarily and does not affect the feasibility of interference alignment. Further, we show that incorporating equality constraints is more difficult and requires more antennas for interference alignment to be feasible, especially in the case of single-stream systems. It is shown through analysis and numerical sum-rate calculations that per-antenna inequality constraints result in a systematic power loss versus the cases of per-antenna equality constraints or no constraints at all.","PeriodicalId":208375,"journal":{"name":"2011 IEEE International Symposium on Information Theory Proceedings","volume":"18 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":"132401501","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
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信