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

2010 IEEE International Symposium on Information Theory最新文献

筛选
英文 中文
Quasi-Hadamard matrix Quasi-Hadamard矩阵
2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513675
Ki-Hyeon Park, Hong‐Yeop Song
{"title":"Quasi-Hadamard matrix","authors":"Ki-Hyeon Park, Hong‐Yeop Song","doi":"10.1109/ISIT.2010.5513675","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513675","url":null,"abstract":"We apply the Hadamard equivalence to all the binary matrices of size m × n and study various properties of this equivalence relation and its classes. We propose to use HR-minimal as a representative of each equivalence class and count the number of HR-minimals of size m × n for m ≤ 3. Some properties and constructions of HR-minimals are investigated. HR-minimals with the largest weight on its second row are defined as Quasi-Hadamard matrices, which are very similar to Hadamard matrices in terms of the absolute correlations of pairs of rows, in the sense that they give a set of row vectors with “best possible orthogonality.” We report lots of exhaustive search results and open problems, one of which is equivalent to the Hadamard conjecture.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114703928","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}
引用次数: 2
On efficient repetition error correcting codes 高效重复纠错码的研究
2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513741
L. Tallini, Noha Elarief, B. Bose
{"title":"On efficient repetition error correcting codes","authors":"L. Tallini, Noha Elarief, B. Bose","doi":"10.1109/ISIT.2010.5513741","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513741","url":null,"abstract":"This paper gives the theory and design of efficient codes capable of correcting errors caused by the insertion and deletion of a repeated symbol in the information sequence. Two efficient methods are described. For any fixed t<inf>+</inf>, t<inf>−</inf> ∈ IN, one method gives a fixed length scheme to encode k information bits into a systematic code of length n = k + r, with r = (t<inf>+</inf> + t<inf>−</inf>) log<inf>2</inf> k + O(log log k), capable of correcting the insertion of t<inf>+</inf> repeated symbols and, simultaneously, correcting the deletion of t<inf>−</inf> repeated symbols in every codeword. The second method is a systematic variable length scheme which on average doubles the number of information bits k compared to the first method. The time complexity of the entire coding process for both schemes is T = O (k + (1+min{t<inf>−</inf>, t<inf>+</inf>})t) multiplication operations over a finite field containing k elements. The space complexity is S = O(k+t) field memory elements. The generalization to the m-ary case, m ≥ 2, is also given.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"246 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124297553","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}
引用次数: 13
Minimizing streaming delay in homogeneous peer-to-peer networks 在同构对等网络中最小化流延迟
2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513291
Wenjie Jiang, Shaoquan Zhang, Minghua Chen, M. Chiang
{"title":"Minimizing streaming delay in homogeneous peer-to-peer networks","authors":"Wenjie Jiang, Shaoquan Zhang, Minghua Chen, M. Chiang","doi":"10.1109/ISIT.2010.5513291","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513291","url":null,"abstract":"Two questions on the theory of content distribution capacity are addressed in this paper: What is the worst user delay performance bound in a chunk-based P2P streaming systems under peer fanout degree constraint? Can we achieve both the minimum delay and the maximum streaming rate simultaneously? In the homogeneous user scenario, we propose a tree-based algorithm called Inverse Waterfilling, which schedules the chunk transmission following an optimal transmitting structure, under fanout degree bound. We show that the algorithm guarantees the delay bound for each chunk of the stream and maintains the maximum streaming rate at the same time.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127751036","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
Distributed rotation recovers spatial diversity 分布式旋转恢复空间多样性
2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513461
Sheng Yang, J. Belfiore
{"title":"Distributed rotation recovers spatial diversity","authors":"Sheng Yang, J. Belfiore","doi":"10.1109/ISIT.2010.5513461","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513461","url":null,"abstract":"In relay networks, a conventional way to exploit spatial diversity is to introduce distributed space-time processing at the relays. In our work, we show that even simple time-varying distributed rotation can recover spatial diversity. The main idea is to convert the inherent spatial diversity to time diversity by creating an artificial fast fading channel. It turns out that the proposed framework is both tractable from the theoretical point of view and simple from the practical point of view. Furthermore, the framework is quite general and can be applied to a wide range of linear/nonlinear relaying strategies. As applications, we first propose a linear relaying scheme called rotate-and-forward for multiple-antenna two-hop layered networks. It is shown that, in some non-trivial setting, this scheme outperforms existing schemes and achieves the optimal diversity-multiplexing tradeoff. The second application is a decode-and-forward scheme based on the same idea in the single-antenna multiple-relay channel. It is shown to achieve the maximum diversity with low signaling complexity.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125448234","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}
引用次数: 15
Large system analysis of projection based algorithms for the MIMO broadcast channel 基于投影的MIMO广播信道大系统分析
2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513449
C. Guthy, W. Utschick, M. Honig
{"title":"Large system analysis of projection based algorithms for the MIMO broadcast channel","authors":"C. Guthy, W. Utschick, M. Honig","doi":"10.1109/ISIT.2010.5513449","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513449","url":null,"abstract":"Analytical results for the average sum rate achievable in the Multiple-Input Multiple-Output (MIMO) broadcast channel with algorithms relying on full channel state information at the transmitter are hard to obtain in practice. In the large system limit, when the number of transmit and receive antennas goes to infinity at a finite fixed ratio, however, the eigenvalues of many random matrices become deterministic and analytical expressions for the sum rate can be derived in some cases. In this paper we will present large system expressions for the sum rate for three sub-optimum algorithms, namely the Successive Encoding Successive Allocation Method (SESAM), Block Diagonalization and Block Diagonalization with Dirty Paper Coding. In case the large system limit of the sum rate does not exist, we derive lower bounds. By simulation results it is shown that the asymptotic results serve as a good approximation of the system performance with finite system parameters of reasonable size.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121759571","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
Error floor analysis in LDGM codes LDGM代码中的误差层分析
2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513607
Kejing Liu, J. Garcia-Frías
{"title":"Error floor analysis in LDGM codes","authors":"Kejing Liu, J. Garcia-Frías","doi":"10.1109/ISIT.2010.5513607","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513607","url":null,"abstract":"Based on discrete density evolution (DDE), we develop closed form expressions to predict the error floor of LDGM codes. The first, rougher, approximation is obtained by assuming perfect message passing between systematic and parity bit nodes in DDE. The second, finer, expression leads to a more involved formulation. While the rougher approximation matches well to simulation results and DDE analysis for high signal to noise ratio (additive white Gaussian noise, AWGN, channel) or low crossover probability (binary symmetric channel, BSC), the finer approximation shows a good match for a wider range in the channel quality.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131448266","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}
引用次数: 20
Sum capacity of general deterministic interference channel with channel output feedback 具有信道输出反馈的一般确定性干扰信道的和容量
2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513336
Achaleshwar Sahai, V. Aggarwal, M. Yuksel, A. Sabharwal
{"title":"Sum capacity of general deterministic interference channel with channel output feedback","authors":"Achaleshwar Sahai, V. Aggarwal, M. Yuksel, A. Sabharwal","doi":"10.1109/ISIT.2010.5513336","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513336","url":null,"abstract":"In a two-user interference channel, there are four possible feedback paths - two from each receiver to the transmitters. This leads to 16 possible models of feedback. In this paper, we derive the sum capacity of two user deterministic interference channel for all sixteen cases. We find that whenever any of the direct link feedback from a receiver to its own transmitter is present, the sum-capacity is the same as when all four feedback links are present. Further when no direct link feedback is present, the sum capacity with one cross-link feedback and two cross-links of feedback is the same. This sum-capacity is the same as the sum-capacity when there is no feedback except in the regime of interference in which both interfering links are weaker than both the direct-links in which case the sum-capacity is the same as sum-capacity of the feedback model with all four feedback links.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130126609","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
New low-density parity-check codes with large girth based on hypergraphs 基于超图的大周长低密度奇偶校验码
2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513639
I. Bocharova, F. Hug, R. Johannesson, B. Kudryashov, Roman V. Satyukov
{"title":"New low-density parity-check codes with large girth based on hypergraphs","authors":"I. Bocharova, F. Hug, R. Johannesson, B. Kudryashov, Roman V. Satyukov","doi":"10.1109/ISIT.2010.5513639","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513639","url":null,"abstract":"The relation between low-density parity-check (LDPC) codes and hypergraphs supports searching for powerful LDPC codes based on hypergraphs. On the other hand, coding theory methods can be used in searching for hypergraphs with large girth. Moreover, compact representations of hypergraphs based on convolutional codes can be found. Algorithms for iteratively constructing LDPC codes with large girth and for determining their minimum distance are introduced. New quasi-cyclic (QC) LDPC codes are presented, some having both optimal girth and optimal minimum distance.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130162705","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}
引用次数: 8
On the code length of TCAM coding schemes 论TCAM编码方案的码长
2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513403
Ori Rottenstreich, I. Keslassy
{"title":"On the code length of TCAM coding schemes","authors":"Ori Rottenstreich, I. Keslassy","doi":"10.1109/ISIT.2010.5513403","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513403","url":null,"abstract":"All high-speed Internet devices need to implement classification, i.e. they must determine whether incoming packet headers belong to a given subset of a search space. To do it, they encode the subset using ternary arrays in special high-speed devices called TCAMs (ternary content-addressable memories). However, the optimal coding for arbitrary subsets is unknown. In particular, to encode an arbitrary range subset of the space of all W-bit values, previous works have successively reduced the upper-bound on the code length from 2W–2 to 2W–4, then 2W–5, and finally W TCAM entries. In this paper, we prove that this final result is optimal for typical prefix coding and cannot be further improved, i.e. the bound of W is tight. To do so, we introduce new analytical tools based on independent sets and alternating paths.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134021991","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
Structure theorem for real-time variable-rate lossy source encoders and memory-limited decoders with side information 实时可变速率有损源编码器和带边信息的内存有限解码器的结构定理
2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513283
Y. Kaspi, N. Merhav
{"title":"Structure theorem for real-time variable-rate lossy source encoders and memory-limited decoders with side information","authors":"Y. Kaspi, N. Merhav","doi":"10.1109/ISIT.2010.5513283","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513283","url":null,"abstract":"We extend Witsenhausen's structure theorem for real-time source coding, so as to accommodate both variable-rate coding and causal side information at the decoder.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134142659","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
首页 上一页 下一页 尾页
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学术官方微信