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

2010 IEEE International Symposium on Information Theory最新文献

筛选
英文 中文
Joint FEC coding and linear precoding for MIMO ISI channels MIMO ISI信道的联合FEC编码和线性预编码
2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513454
Chongbin Xu, Xiaojun Yuan, L. Ping, Xiaokang Lin
{"title":"Joint FEC coding and linear precoding for MIMO ISI channels","authors":"Chongbin Xu, Xiaojun Yuan, L. Ping, Xiaokang Lin","doi":"10.1109/ISIT.2010.5513454","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513454","url":null,"abstract":"In this paper, we present a joint forward-error-correction (FEC) coding and linear precoding scheme for multiple-input multiple-output (MIMO) and inter-symbol interference (ISI) channels with imperfect channel state information at the transmitter (CSIT). We first study the performance of ideally coded systems. We focus on an average power gain (APG) method that can achieve capacity in the two extreme cases of no CSIT and perfect CSIT. In the more general case, the performance of the APG method improves progressively with the CSIT quality. We then consider the implementation of this APG method in a practically coded system. We propose a unified scheme involving beamforming, water-filling, and diversity coding. The core of the new scheme is a joint FEC coding and linear precoding strategy at the transmitter and an iterative detection process at the receiver. Simulation results demonstrate that the proposed scheme can achieve significant performance gain by efficiently utilizing the available CSIT.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"177 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":"116061770","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
Coding for high-density magnetic recording 高密度磁记录编码
2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513783
A. Mazumdar, A. Barg, N. Kashyap
{"title":"Coding for high-density magnetic recording","authors":"A. Mazumdar, A. Barg, N. Kashyap","doi":"10.1109/ISIT.2010.5513783","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513783","url":null,"abstract":"We study a model of errors in binary data that arises in terabit-density magnetic recording. Under this model, several bits of the data are replaced by the values of their neighbors on the medium. We consider a simple one-dimensional version of this model, and derive several properties of codes that correct this type of error.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"17 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":"123489614","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
Interference neutralization in distributed lossy source coding 分布式有损源编码中的干扰抑制
2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513259
M. Maddah-ali, David Tse
{"title":"Interference neutralization in distributed lossy source coding","authors":"M. Maddah-ali, David Tse","doi":"10.1109/ISIT.2010.5513259","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513259","url":null,"abstract":"We consider a problem of distributed lossy Gaussian source coding with inputs (y<inf>1</inf>, y<inf>2</inf>, y<inf>3</inf>), where y<inf>1</inf> and y<inf>2</inf> are positively correlated, y<inf>3</inf> = y<inf>1</inf> − cy<inf>2</inf>, c ≥ 0, and the decoder requires y<inf>3</inf> with a target distortion. For this problem, known achievable schemes are unboundedly loose. Inspired by results of binary expansion models, we characterize the rate-distortion region within a bounded gap. Treating each source as a multilayer input, an achievable scheme is developed based on the following observations: (i) some middle layers of y<inf>1</inf> and y<inf>2</inf> are not needed at the decoder, (ii) the required layers are combined with some unneeded interference information, (iii) linear operations among input layers can unboundedly reduce the load of reporting interference. Showing that the cut-set outer-bound has an unbounded gap, we also establish a new outer-bound to prove the bounded-gap result. <sup>1</sup>","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"60 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":"123010329","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}
引用次数: 24
On the dynamics of ℓ1 decoding: A microscopic approach 1解码的动力学:微观方法
2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513438
Weiyu Xu, A. Tang
{"title":"On the dynamics of ℓ1 decoding: A microscopic approach","authors":"Weiyu Xu, A. Tang","doi":"10.1109/ISIT.2010.5513438","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513438","url":null,"abstract":"ℓ<inf>1</inf> minimization, also called Basis Pursuit, has been known to have strong sparse recovery performance both theoretically and empirically. Previously known analytical approaches for ℓ<inf>1</inf> minimization have limitations in deriving custom stability performance bounds for signals with sparsity (the number of nonzero elements) level beyond the ℓ<inf>1</inf> weak recovery threshold [6]. In this paper, instead of focusing on the static decoding results of ℓ<inf>1</inf> minimization, we develop a microscopic analytical approach by studying the dynamics of ℓ<inf>1</inf> minimization. This approach can give useful characterizations of ℓ<inf>1</inf> decoding results and lead to new performance bounds on ℓ<inf>1</inf> decoding error. Contrary to known stability results for ℓ<inf>1</inf> minimization below the ℓ<inf>1</inf> weak threshold, we prove that ℓ<inf>1</inf> minimization decoding errors can experience an explosive growth in terms of the signal tail immediately beyond the ℓ<inf>1</inf> minimization weak threshold. This new analytical approach is motivated by the applications of analyzing the emerging iterative reweighted ℓ<inf>1</inf> minimization algorithms.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"42 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":"123339599","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
A zero-sum property for the KECCAK-f permutation with 18 rounds 18发KECCAK-f排列的零和性质
2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513442
Christina Boura, A. Canteaut
{"title":"A zero-sum property for the KECCAK-f permutation with 18 rounds","authors":"Christina Boura, A. Canteaut","doi":"10.1109/ISIT.2010.5513442","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513442","url":null,"abstract":"A new type of distinguishing property, named the zero-sum property has been recently presented by Aumasson and Meier [1]. It has been applied to the inner permutation of the hash function KECCAK and it has led to a distinguishing property for the KECCAK-f permutation up to 16 rounds, out of 24 in total. Here, we additionally exploit some spectral properties of the KECCAK-f permutation and we improve the previously known upper bounds on the degree of the inverse permutation after a certain number of rounds. This result enables us to extend the zero-sum property to 18 rounds of the KECCAK-f permutation, which was the number of rounds in the previous version of KECCAK submitted to the SHA-3 competition.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"45 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":"124210887","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}
引用次数: 47
Relay-aided Interference Alignment for the quasi-static interference channel 准静态干扰通道的中继辅助干扰对准
2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513393
B. Nourani, A. Motahari, A. Khandani
{"title":"Relay-aided Interference Alignment for the quasi-static interference channel","authors":"B. Nourani, A. Motahari, A. Khandani","doi":"10.1109/ISIT.2010.5513393","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513393","url":null,"abstract":"In this paper, we first investigate the Degrees Of Freedom (DOF) for the M-user Interference Channel (IC) in static environments with the help of a MIMO relay. The relay stores the received signal during the first time-slot and sends a linearly-transformed version over the next time-slot. Using this scheme, it is shown that Interference Alignment can be done with much less complexity. Having very loose constraints on the channel structure, the proposed method calculates a proper choice for the relay gains such that the M-user IC is able to achieve a DOF of M over 2. It is also proved that if the relay's output power scales as P over (log P)t where P is the power of the transmitters, there is no loss in the achieved DOF. This result is true for all positive and negative ranges of t. In other words, in an M-user IC with quasi-static channel gains, it is possible to achieve M over 2 DOF through the use of a MIMO relay whose power grows at a rate slower than that of the transmitters. Similarly, a network of low-power users can benefit from our proposed method if the relay power scales faster than the power of the main transmitters. The results of this paper are valuable when being applied to a practical system. While it is very difficult to use Interference Alignment in M-user IC setup, adding a relay can make alignment more affordable by simplifying the transmitter/receiver structure.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"40 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":"125653451","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}
引用次数: 52
Optimal multiresolution quantization for broadcast channels with random index assignment 随机索引分配广播信道的最优多分辨率量化
2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513257
Fei Teng, E. Yang, Xiang Yu
{"title":"Optimal multiresolution quantization for broadcast channels with random index assignment","authors":"Fei Teng, E. Yang, Xiang Yu","doi":"10.1109/ISIT.2010.5513257","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513257","url":null,"abstract":"This paper studies the design and analysis of multiresolution vector quantization (MRVQ) for broadcast channels. Given a broadcast system with MRVQ, a random index assignment, and a coded broadcast channel, we first obtain a closed-form formula for the weighted end-to-end distortion (EED) of the system. Based on the formula, an iterative algorithm is then proposed for designing optimal MRVQ for the broadcast system. Experimental results demonstrate that multiresolution quantizers jointly designed with channel conditions by the proposed algorithm significantly reduce the weighted EED in comparison with multiresolution quantizers designed without reference to channel conditions.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"1 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":"129677847","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
On the physics of rate-distortion theory 论速率畸变理论的物理学
2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513286
N. Merhav
{"title":"On the physics of rate-distortion theory","authors":"N. Merhav","doi":"10.1109/ISIT.2010.5513286","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513286","url":null,"abstract":"We revisit and extend the physical interpretation recently given to a certain identity between large-deviations rate-functions, as well as applications of this identity to rate-distortion theory, as an instance of thermal equilibrium between several physical systems that are brought into contact. Our new interpretation, of mechanical equilibrium between these systems, is shown to have several advantages. This physical point of view also provides a trigger to the development of certain new alternative representations of the rate-distortion function and channel capacity.","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":"124576881","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}
引用次数: 3
Fair rate adaptation in multiuser interference channels 多用户干扰信道中的公平速率自适应
2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513395
A. Tajer, N. Prasad, Xiaodong Wang
{"title":"Fair rate adaptation in multiuser interference channels","authors":"A. Tajer, N. Prasad, Xiaodong Wang","doi":"10.1109/ISIT.2010.5513395","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513395","url":null,"abstract":"Achievable rate regions of multiuser fading interference channels depend on their fading realizations. Motivated by this premise we consider the problem of adapting the users' rates to fading variations. Channel-dependent rate adjustments are accomplished after each transition of the fading channel from one state to another. Such rate adjustments (increments or decrements) are constrained to meet some notion of fairness among the users and are designed to ensure that all users remain decodable. Here, we employ the notions of symmetric fair and max-min fair rate adaptations and offer algorithms for computing such fair rate adaptations. Besides fairness, the two other major features of these algorithms are that they are amenable to distributed implementation with limited information exchange among the users, and their complexities scale polynomially in the number of users.","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":"130861211","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
On the structure of M-ary Sidelnikov sequences of period p2m − 1 周期为p2m−1的m -玛利Sidelnikov序列的结构
2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513664
N. Yu, G. Gong
{"title":"On the structure of M-ary Sidelnikov sequences of period p2m − 1","authors":"N. Yu, G. Gong","doi":"10.1109/ISIT.2010.5513664","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513664","url":null,"abstract":"For prime p and a positive integer m, it is shown that M-ary Sidelnikov sequences of period p<sup>2m</sup> − 1, if M | p<sup>m</sup> − 1, can be equivalently generated by the operation of elements in a finite field GF(p<sup>m</sup>), including a p<sup>m</sup>-ary m-sequence. The equivalent representation over GF(p<sup>m</sup>) requires low complexity for implementing the Sidelnikov sequences. Moreover, a (p<sup>m</sup> − 1)×(pm+1) array structure is introduced for the Sidelnikov sequences. From the array structure, it is found that about a half of the column sequences of length p<sup>m</sup> − 1 and their constant multiples have the low correlation magnitude bounded by 3√pm + 1.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"28 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":"128833981","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
首页 上一页 下一页 尾页
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学术官方微信