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

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

筛选
英文 中文
On the detrimental effect of assuming a linear model for non-linear AWGN channels 对非线性AWGN信道采用线性模型的不利影响
2011 IEEE International Symposium on Information Theory Proceedings Pub Date : 2011-10-03 DOI: 10.1109/ISIT.2011.6033852
J. Fahs, I. Abou-Faycal
{"title":"On the detrimental effect of assuming a linear model for non-linear AWGN channels","authors":"J. Fahs, I. Abou-Faycal","doi":"10.1109/ISIT.2011.6033852","DOIUrl":"https://doi.org/10.1109/ISIT.2011.6033852","url":null,"abstract":"In communication theory, one of the best understood and commonly adopted channel model is the average-power constrained linear AWGN channel, the capacity of which is given by the expression 1 over 2 log(1 + SNR). But what if the channel is not linear? How bad is it to adopt a linear model for a non-linear channel?","PeriodicalId":208375,"journal":{"name":"2011 IEEE International Symposium on Information Theory Proceedings","volume":"12 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":"128638331","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
Shannon meets Blackwell and Le Cam: Channels, codes, and statistical experiments Shannon会见Blackwell和Le Cam:频道、代码和统计实验
2011 IEEE International Symposium on Information Theory Proceedings Pub Date : 2011-10-03 DOI: 10.1109/ISIT.2011.6033729
M. Raginsky
{"title":"Shannon meets Blackwell and Le Cam: Channels, codes, and statistical experiments","authors":"M. Raginsky","doi":"10.1109/ISIT.2011.6033729","DOIUrl":"https://doi.org/10.1109/ISIT.2011.6033729","url":null,"abstract":"The Blackwell-Le Cam decision theory provides an approximation framework for statistical experiments in terms of expected risks of optimal decision procedures. The Blackwell partial order formalizes an intuitive notion of which experiment of a given pair is “more informative” for the purposes of inference. The Le Cam deficiency is an approximation measure for any two statistical experiments (with the same parameter space), and it tells us how much we will lose if we base our decisions on one experiment rather than another. In this paper, we develop an extension of the Blackwell-Le Cam theory, starting from a partial ordering for channels introduced by Shannon. In particular, we define a new approximation measure for channels, which we call the Shannon deficiency, and use it to prove an approximation theorem for channel codes that extends an earlier result of Shannon. We also construct a broad class of deficiency-like measures for channels based on generalized divergences, relate them to several alternative notions of capacity, and prove new upper and lower bounds on the Le Cam deficiency.","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":"128644901","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}
引用次数: 45
Accessible capacity of secondary users over the Gaussian interference channel 高斯干扰信道上辅助用户的可访问容量
2011 IEEE International Symposium on Information Theory Proceedings Pub Date : 2011-10-03 DOI: 10.1109/ISIT.2011.6034248
Xiujie Huang, Xiao Ma, Lei Lin, B. Bai
{"title":"Accessible capacity of secondary users over the Gaussian interference channel","authors":"Xiujie Huang, Xiao Ma, Lei Lin, B. Bai","doi":"10.1109/ISIT.2011.6034248","DOIUrl":"https://doi.org/10.1109/ISIT.2011.6034248","url":null,"abstract":"A new problem formulation is presented for the Gaussian interference channels (GIFC) with two pairs of users, which are distinguished as primary users and secondary users, respectively. The primary users employ a pair of encoder and decoder that were originally designed to satisfy a given error performance requirement (EPR) under the assumption that no interference exists. In the case when the secondary users attempt to access the same medium, we are interested in the maximum transmission rate (defined as accessible capacity) at which secondary users can communicate reliably without affecting the EPR under the constraint that the primary encoder (not the decoder) is kept unchanged. The relation of the accessible capacity to the capacity region of the GIFC is revealed. By modeling the primary encoder as a generalized trellis code (GTC), we are able to treat the secondary links as finite state channels. Then upper and lower bounds on the accessible capacity are derived and computed by using the BCJR algorithm. The numerical results show us either expected or interesting facts.","PeriodicalId":208375,"journal":{"name":"2011 IEEE International Symposium on Information Theory Proceedings","volume":"51 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":"129599164","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
On throughput and delay scaling with cooperative spectrum sharing 基于协同频谱共享的吞吐量和时延扩展研究
2011 IEEE International Symposium on Information Theory Proceedings Pub Date : 2011-10-03 DOI: 10.1109/ISIT.2011.6034250
Yang Han, S. Ting, M. Motani, A. Pandharipande
{"title":"On throughput and delay scaling with cooperative spectrum sharing","authors":"Yang Han, S. Ting, M. Motani, A. Pandharipande","doi":"10.1109/ISIT.2011.6034250","DOIUrl":"https://doi.org/10.1109/ISIT.2011.6034250","url":null,"abstract":"In this paper, we propose a cooperative spectrum sharing protocol (CSSP) between two overlapping static ad hoc wireless networks where the primary and secondary networks consist of n and m randomly distributed nodes respectively. The secondary network achieves spectrum access along with the primary network by allowing its nodes to relay the primary traffic. Taking advantage of the broadcast nature of wireless channels, the secondary nodes are able to forward primary and secondary packets simultaneously by transmitting a superimposed signal. We analyze the throughput and delay scaling performance of the proposed protocol and show that given m ≥ n, the primary network is able to achieve a per-node throughput scaling which is better than that of a stand-alone network with n nodes. At the same time, the secondary network achieves the same throughput scaling as a stand-alone network with m nodes. We also derive the throughput-delay tradeoff for both the primary and secondary systems in this scenario.","PeriodicalId":208375,"journal":{"name":"2011 IEEE International Symposium on Information Theory Proceedings","volume":"57 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":"127054068","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}
引用次数: 12
Linear growing minimum distance of ultra-sparse non-binary cluster-LDPC codes 超稀疏非二进制簇ldpc码的线性增长最小距离
2011 IEEE International Symposium on Information Theory Proceedings Pub Date : 2011-10-03 DOI: 10.1109/ISIT.2011.6034183
V. Savin, D. Declercq
{"title":"Linear growing minimum distance of ultra-sparse non-binary cluster-LDPC codes","authors":"V. Savin, D. Declercq","doi":"10.1109/ISIT.2011.6034183","DOIUrl":"https://doi.org/10.1109/ISIT.2011.6034183","url":null,"abstract":"In this paper, we study the asymptotic minimum distance of non-binary cluster-LDPC codes whose subjacent binary parity-check matrix is composed of localized density of ones, concentrated in clusters of bits. A particular attention is given to cluster codes represented by ultra-sparse bipartite graphs, in the sense that each symbol-node is connected to exactly dv = 2 constraint-nodes. We derive a lower bound on the minimum distance of non-binary cluster-LDPC codes and we show that there exist ensembles of ultra-sparse codes whose minimum distance grows linearly with the code length (with probability going to 1 as the code length goes to infinity). This result is in contrast with “classical” non-binary LDPC codes based on graphs with strictly regular dv = 2 symbol-nodes, whose minimum distance grows at most logarithmically with the code length. We also show that one can build practical non-binary cluster-LDPC codes with various finite codeword lengths, whose minimum distance is close to the Gilbert-Varshamov bound.","PeriodicalId":208375,"journal":{"name":"2011 IEEE International Symposium on Information Theory Proceedings","volume":"71 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":"127170539","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 stability region of multi-queue multi-server queueing systems with stationary channel distribution 信道分布平稳的多队列多服务器排队系统的稳定区域
2011 IEEE International Symposium on Information Theory Proceedings Pub Date : 2011-10-03 DOI: 10.1109/ISIT.2011.6033860
H. Halabian, I. Lambadaris, Chung-Horng Lung
{"title":"On the stability region of multi-queue multi-server queueing systems with stationary channel distribution","authors":"H. Halabian, I. Lambadaris, Chung-Horng Lung","doi":"10.1109/ISIT.2011.6033860","DOIUrl":"https://doi.org/10.1109/ISIT.2011.6033860","url":null,"abstract":"In this paper, we characterize the stability region of multi-queue multi-server (MQMS) queueing systems with stationary channel and packet arrival processes. Toward this, the necessary and sufficient conditions for the stability of the system are derived under general arrival processes with finite first and second moments. We show that when the arrival processes are stationary, the stability region form is a polytope for which we explicitly find the coefficients of the linear inequalities which characterize the stability region polytope.","PeriodicalId":208375,"journal":{"name":"2011 IEEE International Symposium on Information Theory Proceedings","volume":"22 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":"129129386","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
Multi-terminal source coding through a relay 通过继电器进行多终端源编码
2011 IEEE International Symposium on Information Theory Proceedings Pub Date : 2011-10-03 DOI: 10.1109/ISIT.2011.6033874
R. Soundararajan, S. Vishwanath
{"title":"Multi-terminal source coding through a relay","authors":"R. Soundararajan, S. Vishwanath","doi":"10.1109/ISIT.2011.6033874","DOIUrl":"https://doi.org/10.1109/ISIT.2011.6033874","url":null,"abstract":"This paper studies a multi-terminal source coding problem, where two terminals possess two (correlated) Gaussian sources to be compressed and delivered to the destination through an intermediate relay. Unlike the CEO and conventional two-terminal source coding problems as well as point-to-point relay source coding problem, lattices are found to play an important role in achieving #x201C;good#x201D; rates for this problem setting. Two achievable strategies - compute-and-forward and compress-and-forward are used to develop achievable rates for this problem setting. For the symmetric case, the inner and outer bounds developed are shown to be within 1/2 bits of each other.","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":"122360799","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
Proactive multicasting with predictable demands 具有可预测需求的主动多播
2011 IEEE International Symposium on Information Theory Proceedings Pub Date : 2011-10-03 DOI: 10.1109/ISIT.2011.6033994
John Tadrous, A. Eryilmaz, H. E. Gamal
{"title":"Proactive multicasting with predictable demands","authors":"John Tadrous, A. Eryilmaz, H. E. Gamal","doi":"10.1109/ISIT.2011.6033994","DOIUrl":"https://doi.org/10.1109/ISIT.2011.6033994","url":null,"abstract":"In a recent work, we have introduced the notion of proactive resource allocation in wireless networks whereby the predictability of user demands are leveraged to significantly enhance the spectral efficiency of the network in outage limited regimes. In this paper, we expand the horizon to the important scenario of multicast traffic. Our analysis reveals two additional types of gains that can be leveraged in this proactive multicast scenario. The first can be attributed to the basic nature of multicast traffic in which each request would represent a data source rather than a user, as it would in the unicast case. The second is the demand alignment phenomenon whereby the predictive network would wait to gather as much requests as possible and serve them altogether using the same resources. We analytically derive the impact of these advantages on the system diversity gain, which quantifies the exponential decay rate of the outage probability, and further illustrate the resulting gains via numerical results.","PeriodicalId":208375,"journal":{"name":"2011 IEEE International Symposium on Information Theory Proceedings","volume":"46 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":"130720158","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}
引用次数: 6
Soft decode-and-forward using LDPC coding in half-duplex relay channels 在半双工中继信道中使用LDPC编码进行软译码和转发
2011 IEEE International Symposium on Information Theory Proceedings Pub Date : 2011-10-03 DOI: 10.1109/ISIT.2011.6033787
M. Azmi, Jun Yu Li, Jinhong Yuan, R. Malaney
{"title":"Soft decode-and-forward using LDPC coding in half-duplex relay channels","authors":"M. Azmi, Jun Yu Li, Jinhong Yuan, R. Malaney","doi":"10.1109/ISIT.2011.6033787","DOIUrl":"https://doi.org/10.1109/ISIT.2011.6033787","url":null,"abstract":"This paper proposes a new soft decode-and-forward (SDF) protocol using LDPC codes in the half-duplex relay channels. In order for the encoding of the additional parity-check symbols at the relay to be linear and systematic, we introduce a structured rate-compatible (RC) LDPC code. We then develop the soft-decoding and soft-re-encoding algorithms for the proposed RC-LDPC code, which allows the relay to forward soft messages to the destination when the relay fails to decode the source's message. Furthermore, we propose a new method, which we refer to as soft fading, to compute the log-likelihood ratio (LLR) of the received signal at the destination for the SDF protocol. We show that our proposed method performs better when compared to a previous reported method in literature.","PeriodicalId":208375,"journal":{"name":"2011 IEEE International Symposium on Information Theory Proceedings","volume":"120 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":"132391979","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
Double-Hamming based QC LDPC codes with large minimum distance 基于双锤击的大最小距离QC LDPC代码
2011 IEEE International Symposium on Information Theory Proceedings Pub Date : 2011-10-03 DOI: 10.1109/ISIT.2011.6034273
I. Bocharova, F. Hug, R. Johannesson, B. Kudryashov
{"title":"Double-Hamming based QC LDPC codes with large minimum distance","authors":"I. Bocharova, F. Hug, R. Johannesson, B. Kudryashov","doi":"10.1109/ISIT.2011.6034273","DOIUrl":"https://doi.org/10.1109/ISIT.2011.6034273","url":null,"abstract":"A new method using Hamming codes to construct base matrices of (J,K)-regular LDPC convolutional codes with large free distance is presented. By proper labeling the corresponding base matrices and tailbiting these parent convolutional codes to given lengths, a large set of quasi-cyclic (QC) (J,K)-regular LDPC block codes with large minimum distance is obtained. The corresponding Tanner graphs have girth up to 14. This new construction is compared with two previously known constructions of QC (J,K)-regular LDPC block codes with large minimum distance exceeding (J + 1)!. Applying all three constructions, new QC (J,K)-regular block LDPC codes with J = 3 or 4, shorter codeword lengths and/or better distance properties than those of previously known codes are presented.","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":"130468703","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}
引用次数: 6
首页 上一页 下一页 尾页
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学术官方微信