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

2008 IEEE International Symposium on Information Theory最新文献

筛选
英文 中文
Universal coding theorem for relay channels 中继信道的通用编码定理
2008 IEEE International Symposium on Information Theory Pub Date : 2008-07-06 DOI: 10.1109/ISIT.2008.4595033
Toshifumi Sakai, T. Uyematsu
{"title":"Universal coding theorem for relay channels","authors":"Toshifumi Sakai, T. Uyematsu","doi":"10.1109/ISIT.2008.4595033","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595033","url":null,"abstract":"Relay channels are known as a model of multihop wireless networks which are often studied. In relay channels, the sender sends a message to the relay and the receiver, the relay encodes the channel output again and forwards it to the receiver, and the receiver decodes the message from the channel output. This paper deals with the universal coding problem for relay channels. First, we propose two new decoders based on the maximum mutual information decoder and show the existence of a universal code for relay channels by combining the proposed decoders and the coding scheme obtained by Cover and El Gamal. Second, we clarify the condition that the probability of error for each decoder decreases exponentially as the block length tends to infinity. Finally, we prove that the proposed universal code achieves the capacity of the degraded relay channel.","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":"130629541","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
Secret-key generation with correlated sources and noisy channels 具有相关源和噪声信道的密钥生成
2008 IEEE International Symposium on Information Theory Pub Date : 2008-07-06 DOI: 10.1109/ISIT.2008.4595138
A. Khisti, S. Diggavi, G. Wornell
{"title":"Secret-key generation with correlated sources and noisy channels","authors":"A. Khisti, S. Diggavi, G. Wornell","doi":"10.1109/ISIT.2008.4595138","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595138","url":null,"abstract":"A joint-source-channel setup for secret-key generation between remote terminals is considered. The sender communicates to the receiver over a discrete memoryless wiretap channel and the sender and receiver observe a pair of correlated discrete memoryless sources. Lower and upper bounds for the secret-key rate are presented and shown to coincide for the case when the underlying channel is a reversely degraded parallel channel. Our setup also provides an operational significance to the rate-equivocation tradeoff of the wiretap channel, and this is illustrated in detail for the Gaussian case.","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"115 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":"132145571","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}
引用次数: 42
On subspace structure in source and channel coding 源信道编码中的子空间结构
2008 IEEE International Symposium on Information Theory Pub Date : 2008-07-06 DOI: 10.1109/ISIT.2008.4595336
A. Fletcher, S. Rangan, Vivek K Goyal
{"title":"On subspace structure in source and channel coding","authors":"A. Fletcher, S. Rangan, Vivek K Goyal","doi":"10.1109/ISIT.2008.4595336","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595336","url":null,"abstract":"The use of subspace structure in source and channel coding is studied. We show that for source coding of an i.i.d. Gaussian source, restriction of the codebook to a union of subspaces need not induce any performance penalty. In fact, in N-dimensional space, a two-stage quantization of first projecting to the nearest of J subspaces of dimension K in a random first-stage codebook of subspaces, followed by quantizing to the nearest of codewords in a second-stage codebook within the K-dimensional subspace induces no performance loss. This structure allows the rate-distortion bound to be approached asymptotically with block length N. The dual results for channel coding are explicitly described: for an additive white Gaussian noise channel, we introduce a particular subspace-based codebook that induces no rate loss, and the Shannon capacity is achieved. While this has complexity exponential in N, it is reduced from an unstructured search.","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":"130876012","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
Integrated MAP detector for V-BLAST systems V-BLAST系统集成MAP探测器
2008 IEEE International Symposium on Information Theory Pub Date : 2008-07-06 DOI: 10.1109/ISIT.2008.4595476
Zhendong Luo, Dawei Huang
{"title":"Integrated MAP detector for V-BLAST systems","authors":"Zhendong Luo, Dawei Huang","doi":"10.1109/ISIT.2008.4595476","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595476","url":null,"abstract":"In this paper, we propose a novel soft-decision detector, called integrated maximum a posteriori (IMAP) detector, for vertical Bell Laboratories layered space-time (V-BLAST) systems. The proposed detector can avoid estimating channel state information (CSI) and directly generate a posteriori probability of data symbols via efficient iterative computations. Moreover, a list-based fast searching algorithm is developed to further reduce the complexity of this detector in the cases of large numbers of transmit antennas or high data rates. Computer simulation shows that the IMAP detector can approximately achieve the performance of the optimal detector using the perfect CSI.","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"44 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":"130937261","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
QoS support with utility-based power control QoS支持基于实用程序的功率控制
2008 IEEE International Symposium on Information Theory Pub Date : 2008-07-06 DOI: 10.1109/ISIT.2008.4595349
S. Stańczak, A. Feistel, H. Boche
{"title":"QoS support with utility-based power control","authors":"S. Stańczak, A. Feistel, H. Boche","doi":"10.1109/ISIT.2008.4595349","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595349","url":null,"abstract":"This paper addresses the problem of incorporating QoS support into the traditional utility-based power control problem. We present a novel problem formulation, prove relevant properties of an optimal power allocation and propose a decentralized recursive algorithm with global convergence.","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"26 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":"127634867","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
Distributed beamforming with binary signaling 分布式波束形成与二进制信号
2008 IEEE International Symposium on Information Theory Pub Date : 2008-07-06 DOI: 10.1109/ISIT.2008.4595115
Mark Johnson, M. Mitzenmacher, K. Ramchandran
{"title":"Distributed beamforming with binary signaling","authors":"Mark Johnson, M. Mitzenmacher, K. Ramchandran","doi":"10.1109/ISIT.2008.4595115","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595115","url":null,"abstract":"We consider a distributed beamforming problem where nodes are restricted to sending binary phases to a receiver that has access to a one-bit feedback channel. Our simplified model allows us to prove a rigorous lower bound on the running time and to explore algorithmic techniques and analyses. We demonstrate both upper and lower bounds on the convergence time that are linear in the number of nodes in the system. Our upper bound is given by analyzing a simple randomized algorithm. We also discuss methods for accurately approximating the convergence time numerically that apply to this algorithm, as well as more general algorithms. Finally, we investigate modifications of the basic algorithm which improve the constant factor in the running time.","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":"129246078","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
Minimum distance bounds for multiple-serially concatenated code ensembles 多个串行连接的代码集成的最小距离界限
2008 IEEE International Symposium on Information Theory Pub Date : 2008-07-06 DOI: 10.1109/ISIT.2008.4595316
C. Koller, J. Kliewer, K. Zigangirov, D. Costello
{"title":"Minimum distance bounds for multiple-serially concatenated code ensembles","authors":"C. Koller, J. Kliewer, K. Zigangirov, D. Costello","doi":"10.1109/ISIT.2008.4595316","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595316","url":null,"abstract":"It has recently been shown that the minimum distance of the ensemble of repeat multiple accumulate codes grows linearly with block length. In this paper, we present a method to obtain the distance growth rate coefficient of multiple-serially concatenated code ensembles and determine the growth rate coefficient of the rate 1/2 double-serially concatenated code consisting of an outer memory one convolutional code followed by two accumulators. We compare both the growth rate of the minimum distance, as well as the convergence behavior, of this code with rate 1/2 repeat multiple accumulate codes, and we show that repeat multiple accumulate codes have better minimum distance growth but worse performance in terms of convergence.","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"22 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":"126768244","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 full diversity linear dispersion codes with partial interference cancellation group decoding 全分集线性色散码的部分干扰消除群译码
2008 IEEE International Symposium on Information Theory Pub Date : 2008-07-06 DOI: 10.1109/ISIT.2008.4595193
Xiaoyong Guo, X. Xia
{"title":"On full diversity linear dispersion codes with partial interference cancellation group decoding","authors":"Xiaoyong Guo, X. Xia","doi":"10.1109/ISIT.2008.4595193","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595193","url":null,"abstract":"In this paper, we propose a partial interference cancellation (PIC) group decoding for linear dispersive space-time block codes (STBC) and a design criterion for the codes to achieve full diversity when the PIC group decoding is used at the receiver. A PIC group decoding decodes the symbols embedded in an STBC by dividing them into several groups and decoding each group separately after a linear PIC operation is implemented. It can be viewed as an intermediate decoding between the maximum likelihood (ML) receiver that decodes all the embedded symbols together, i.e., all embedded symbols are in a single group, and a zero-forcing (ZF) receiver that decodes all the embedded symbols separately and independently, i.e., each group has and only has one embedded symbol, after the ZF operation is implemented. The PIC group decoding provides a framework to adjust the complexity-performance tradeoff by choosing the sizes of the symbol groups. Our proposed design criterion (group independence) for the PIC group decoding to achieve full diversity is an intermediate condition between the loosest ML full rank criterion of codewords and the strongest ZF linear independence condition of the column vectors in the equivalent channel matrix. A design example is also given.","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"205 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":"123386661","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 reversible information hiding system 可逆信息隐藏系统的研究
2008 IEEE International Symposium on Information Theory Pub Date : 2008-07-06 DOI: 10.1109/ISIT.2008.4595125
M. Haroutunian, Smbat Tonoyan, O. Koval, S. Voloshynovskiy
{"title":"On reversible information hiding system","authors":"M. Haroutunian, Smbat Tonoyan, O. Koval, S. Voloshynovskiy","doi":"10.1109/ISIT.2008.4595125","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595125","url":null,"abstract":"In this paper we consider the problem of reversible information hiding in the case when the attacker uses only discrete memoryless channels (DMC), the decoder knows only the class of channels, but not the DMC chosen by the attacker, the attacker knows the information-hiding strategy, probability distributions of all random variables, but not the side information. We introduce the notion of reversible information hiding Incapacity, which expresses the dependence of the information hiding rate on the error probability exponent E and the distortion levels for the information hider, for the attacker and for the host data approximation. The random coding bound for reversible information hiding B-capacity is found. We obtain the lower bound for reversibility information hiding capacity for E rarr 0. In particular, we have analyzed two special cases of the general problem formulation, pure reversibility and pure message communications.","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"81 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":"123097903","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
A semicontinuity theorem and its application to network source coding 半连续性定理及其在网络源编码中的应用
2008 IEEE International Symposium on Information Theory Pub Date : 2008-07-06 DOI: 10.1109/ISIT.2008.4595022
Jun Chen, A. Wagner
{"title":"A semicontinuity theorem and its application to network source coding","authors":"Jun Chen, A. Wagner","doi":"10.1109/ISIT.2008.4595022","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595022","url":null,"abstract":"For a general class of Gaussian network source coding problems for which no single-letter characterization of the rate-distortion region is known, it is shown that the rate- distortion region is inner semicontinuous with respect to the source distribution. This semicontinuity theorem is used to obtain two new results, one for the Gaussian many-help-one problem and one for the Gaussian robust distributed source coding problem.","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"45 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":"114171057","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
首页 上一页 下一页 尾页
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学术官方微信