2008 IEEE International Symposium on Information Theory最新文献

筛选
英文 中文
Analysis of outage capacity performance for cooperative DF and AF relaying in dissimilar Rayleigh fading channels 不同瑞利衰落信道下协同DF和AF中继的中断容量性能分析
2008 IEEE International Symposium on Information Theory Pub Date : 2008-07-06 DOI: 10.1109/ISIT.2008.4595035
S. Shrestha, K. Chang
{"title":"Analysis of outage capacity performance for cooperative DF and AF relaying in dissimilar Rayleigh fading channels","authors":"S. Shrestha, K. Chang","doi":"10.1109/ISIT.2008.4595035","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595035","url":null,"abstract":"Cooperative relaying permits one or more relay to transmit a signal from source to destination, thereby increasing network coverage and spectral efficiency. The performance of cooperative relaying is often measured as outage probability. However, appropriate measure for the channel quality is outage capacity. Although outage probability for cooperative relaying protocol has been analyzed before, very little research has been addressed for outage capacity. This paper is the first of its kind in which we derive a closed-form analytical solution of outage capacity using fixed decode and forward relaying and amplify and forward relaying in dissimilar Rayleigh fading channels, considering channel coefficients known to the receiver side. Analytical results show a tradeoff between SNR and number of relays for specific outage capacity. From the comparison between decode and forward relaying and amplify and forward relaying, it is observed that decode and forward relaying outperforms amplify and forward relaying for a large number of relays.","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133403543","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}
引用次数: 34
Ergodic capacity and average rate-guaranteed scheduling for wireless multiuser OFDM systems 无线多用户OFDM系统的遍历容量和平均速率保证调度
2008 IEEE International Symposium on Information Theory Pub Date : 2008-07-06 DOI: 10.1109/ISIT.2008.4595276
Xin Wang, G. Giannakis
{"title":"Ergodic capacity and average rate-guaranteed scheduling for wireless multiuser OFDM systems","authors":"Xin Wang, G. Giannakis","doi":"10.1109/ISIT.2008.4595276","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595276","url":null,"abstract":"The challenging task of scheduling multi-user orthogonal frequency-division multiplexed transmissions amounts to jointly optimum allocation of subcarriers, rate and power resources. The optimization problem for deterministic channels reduces to an integer program known to be exponentially complex. Interestingly, the present paper shows that almost surely optimal allocation is possible at low complexity in the wireless setup, provided that the random fading channel has continuous distribution function. Specifically, it is established that the ergodic capacity achieving allocation follows a greedy water-filling scheme with linear complexity in the number of users and subcarriers. The result extends to accommodate fairness through general utility functions and constraints on the minimum average user rates. When the channel distribution is known, the optimal on-line scheme relies on low-complexity provably convergent subgradient iterations to obtain pertinent dual variables off line. To accommodate channel uncertainties, stochastic subgradient iterations provide dual variables on line with guaranteed convergence to their off-line counterparts.","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115697023","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}
引用次数: 23
Asymmetric Gaussian multiple descriptions and asymmetric multilevel diversity coding 非对称高斯多重描述与非对称多电平分集编码
2008 IEEE International Symposium on Information Theory Pub Date : 2008-07-06 DOI: 10.1109/ISIT.2008.4595338
S. Mohajer, C. Tian, S. Diggavi
{"title":"Asymmetric Gaussian multiple descriptions and asymmetric multilevel diversity coding","authors":"S. Mohajer, C. Tian, S. Diggavi","doi":"10.1109/ISIT.2008.4595338","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595338","url":null,"abstract":"We consider asymmetric multiple description (MD) source coding for Gaussian source under mean squared error distortion constraints, and focus on the three description problem. Inner and outer bounds for the rate region are derived, both of which can be represented as the intersection of ten half spaces with matching normal directions. Moreover, the gap between the inner and outer bounds is shown to be small. The inner bound relies on the rate region characterization of a lossless asymmetric multilevel diversity (MLD) coding problem treated in our earlier work, which is a natural generalization of the symmetric MLD coding problem previously considered by Roche et al. Different from symmetric MLD coding, superposition coding is not sufficient in the asymmetric case, and ideas akin to network coding need to be used strategically. Equipped with this finding, and motivated by the connection between symmetric MD and symmetric MLD coding, in this work we consider asymmetric MD as a lossy version of the asymmetric MLD coding, which requires coding beyond simple superposition. An outer bound is also derived, which bears a geometric structure particularly suitable for comparison with the inner bound. Combining the inner and outer bounds provides an approximate characterization of the rate region for the asymmetric Gaussian three description problem.","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114246211","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
Framework and algorithms for collaborative compression 协同压缩的框架和算法
2008 IEEE International Symposium on Information Theory Pub Date : 2008-07-06 DOI: 10.1109/ISIT.2008.4595404
K. Viswanathan, R. Swaminathan
{"title":"Framework and algorithms for collaborative compression","authors":"K. Viswanathan, R. Swaminathan","doi":"10.1109/ISIT.2008.4595404","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595404","url":null,"abstract":"We present a framework for considering the problem of compressing large collections of similar sequences. In this framework, an unknown individual sequence is modified several times independently to obtain the collection of sequences to be compressed. For certain collections generated by context-dependent bit flips of the individual sequencepsilas bits, and for those generated by simple edit operations on the individual sequence, we derive universal compression algorithms that compress the collection of sequences almost as well as an optimal compressor that has knowledge of the underlying individual sequence and the modifying processes.","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116714962","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
On the effective capacities of multiple-antenna Gaussian channels 多天线高斯信道的有效容量研究
2008 IEEE International Symposium on Information Theory Pub Date : 2008-07-06 DOI: 10.1109/ISIT.2008.4595458
Lingjia Liu, J. Chamberland
{"title":"On the effective capacities of multiple-antenna Gaussian channels","authors":"Lingjia Liu, J. Chamberland","doi":"10.1109/ISIT.2008.4595458","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595458","url":null,"abstract":"The concept of effective capacity offers a novel methodology to investigate the impact that design decisions at the physical layer may have on system performance at the link layer. Assuming a constant flow of incoming data, the effective capacity characterizes the maximum arrival rate that a wireless system can support as a function of its service requirements. Service requirements in this framework are defined in terms of the asymptotic decay-rate of buffer occupancy. This article studies the effective capacity of a class of multiple-antenna wireless systems subject to Rayleigh flat fading. The effective capacity of the multi-antenna Gaussian channel is characterized, and system performance is evaluated in the low signal-to-noise ratio regime. Additional to the power gain of the multiple receive antenna system, we show that there is a statistical gain associated with a multiple transmit antenna system. When the number of transmit and/or receive antennas becomes large, the effective capacity of the system is bounded away from zero, even under very stringent service constraints. This phenomena, which results from channel-hardening, suggests that a multiple-antenna configuration is especially beneficial to delay-sensitive traffic.","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"170 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117269317","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}
引用次数: 79
Convolutional Tanner structures for non-ergodic wireless channels 非遍历无线信道的卷积坦纳结构
2008 IEEE International Symposium on Information Theory Pub Date : 2008-07-06 DOI: 10.1109/ISIT.2008.4595170
J. Boutros, E. Viterbo, G. Cohen
{"title":"Convolutional Tanner structures for non-ergodic wireless channels","authors":"J. Boutros, E. Viterbo, G. Cohen","doi":"10.1109/ISIT.2008.4595170","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595170","url":null,"abstract":"We propose an original technique for the design of convolutional Tanner structures that are full diversity under iterative decoding. The code design is based on the analysis of the local trellis neighborhood and is suitable for transmission over wireless non-ergodic channels. This new technique enables us to split the giant convolutional checknode into multiple smaller checknodes which is a means to mimic the standard analysis of LDPC codes under iterative message passing decoding.","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114994919","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
Divisibility properties of Kloosterman sums over finite fields of characteristic two 特征二有限域上Kloosterman和的可整除性
2008 IEEE International Symposium on Information Theory Pub Date : 2008-07-06 DOI: 10.1109/ISIT.2008.4595463
P. Charpin, T. Helleseth, V. Zinoviev
{"title":"Divisibility properties of Kloosterman sums over finite fields of characteristic two","authors":"P. Charpin, T. Helleseth, V. Zinoviev","doi":"10.1109/ISIT.2008.4595463","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595463","url":null,"abstract":"Let K(a) be the so-called classical Kloosterman sums over F2m, where m is even. In this paper, we compute K(a) modulo 24, completing our previous results for odd m. We extensively study the links between K(a) and other exponential sums, in particular with the cubic sums. We point out (as we did for odd m) that the values K(a) are related with cosets of weight 4 of primitive narrow sense extended BCH codes of length n = 2m and minimum distance 8.","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115399977","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
An information-theoretic measure for the computational fidelity of physical processes 物理过程计算保真度的一种信息理论度量
2008 IEEE International Symposium on Information Theory Pub Date : 2008-07-06 DOI: 10.1109/ISIT.2008.4595412
N. Anderson
{"title":"An information-theoretic measure for the computational fidelity of physical processes","authors":"N. Anderson","doi":"10.1109/ISIT.2008.4595412","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595412","url":null,"abstract":"An information-theoretic measure is proposed for the fidelity of classical information processing operations implemented in quantum mechanical hardware. This fidelity measure quantifies the degree to which a specified logic operation - a mapping from logical inputs to logical outputs - is mirrored in the mapping of initial states into distinguishable final states of a quantum system by a physical process. We formally define the computational fidelity, discuss its characteristics, illustrate its application, and comment on its connection to fundamental limits on the physical cost of information processing.","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123086143","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
Performance analysis of incremental relaying with relay selection and adaptive modulation over non-identically distributed cooperative paths 非同分布协作路径上具有中继选择和自适应调制的增量中继性能分析
2008 IEEE International Symposium on Information Theory Pub Date : 2008-07-06 DOI: 10.1109/ISIT.2008.4595478
Kyu-Sung Hwang, Young-Chai Ko, Mohamed-Slim Alouini
{"title":"Performance analysis of incremental relaying with relay selection and adaptive modulation over non-identically distributed cooperative paths","authors":"Kyu-Sung Hwang, Young-Chai Ko, Mohamed-Slim Alouini","doi":"10.1109/ISIT.2008.4595478","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595478","url":null,"abstract":"In this paper, we consider an incremental relaying protocol based on an amplify-and-forward transmission in conjunction with a best relay selection scheme over non-identically distributed relay channels. In order to satisfy the spectral efficiency and the bit error rate (BER) requirements, adaptive modulation is applied to our proposed scheme. We derive the average spectral efficiency, average BER and outage probability for the performance analysis of our proposed scheme. For a more tractable analysis, we start with an upper bound for the combined signal-to-noise ratio at the destination and provide closed-form expressions for independent non-identically distributed Rayleigh fading conditions. Our analytical-based numerical results are validated by some computer-based simulations. These results show that our proposed scheme leads to a considerable improvement in the performance of cooperative diversity systems.","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124921375","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
Rate loading in OFDM based on bit-level capacities OFDM中基于位级容量的速率加载
2008 IEEE International Symposium on Information Theory Pub Date : 2008-07-06 DOI: 10.1109/ISIT.2008.4595199
C. Stierstorfer, R. Fischer
{"title":"Rate loading in OFDM based on bit-level capacities","authors":"C. Stierstorfer, R. Fischer","doi":"10.1109/ISIT.2008.4595199","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595199","url":null,"abstract":"A new bit allocation algorithm for uncoded transmission over parallel, independent channels (e.g., multicarrier transmission) is proposed. In contrast to state-of-the-art loading algorithms it is based on bit-level capacities and aims at the maximization of the so-called parallel decoding capacity. The algorithm can be implemented very efficiently and requires significantly lower complexity than existing approaches. Numerical results show a performance in terms of the bit-error ratio comparable to established bit-loading algorithms.","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122710056","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}
引用次数: 9
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学术官方微信