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

2008 IEEE International Symposium on Information Theory最新文献

筛选
英文 中文
Rate distortion function with a proportional mean-square error distortion measure 具有比例均方误差失真测量的速率失真函数
2008 IEEE International Symposium on Information Theory Pub Date : 2008-07-06 DOI: 10.1109/ISIT.2008.4595109
J. Binia
{"title":"Rate distortion function with a proportional mean-square error distortion measure","authors":"J. Binia","doi":"10.1109/ISIT.2008.4595109","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595109","url":null,"abstract":"New bounds on the rate distortion function of certain stationary time-discrete and time-continuous sources, with a proportional-weighted mean-square error (MSE) distortion measure, are given. The growth, g, of the rate distortion function, as a result of changing from a non-weighted MSE distortion measure to a proportional-weighted distortion criterion is analyzed. It is shown in the time-discrete case that for a small distortion d, the growth g, and the difference between the rate distortion functions of a Gaussian, memoryless source and a source with memory, both with the same marginal statistics and MSE distortion measure, share the same upper bound.","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"46 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":"124813967","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
Tight upper and lower bounds on the constrained capacity of non-coherent multi-antenna channels 非相干多天线信道约束容量的严格上下界
2008 IEEE International Symposium on Information Theory Pub Date : 2008-07-06 DOI: 10.1109/ISIT.2008.4595459
K. Padmanabhan, S. Venkatraman, O. Collins
{"title":"Tight upper and lower bounds on the constrained capacity of non-coherent multi-antenna channels","authors":"K. Padmanabhan, S. Venkatraman, O. Collins","doi":"10.1109/ISIT.2008.4595459","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595459","url":null,"abstract":"This paper first presents an optimal receiver and coding scheme for a multi-user, multi-receiver, non-coherent Rayleigh flat fading channel which achieves the channel's constrained capacity (i.e., the capacity for a fixed input distribution). The paper then goes on to analyze the optimal receiver and uses it to generate tight upper and lower bounds on the constrained capacity. Knowing this constrained capacity is essential to judge the efficiency of coding schemes for the channel; it performs the same function as BPSK capacity for the AWGN channel in judging LDPC codes. The paper then goes on to present a practicable correlation based receiver that uses a novel iterative channel estimation technique. The performance of this receiver remains close to the constrained capacity as long as the per-user SNR is low; there is no requirement on the aggregate SNR. With 50 users, 50 receivers and a brickwall fading channel with a coherence length of 200 symbols, for example, the correlation based receiver achieves a sum rate of 36 bits/sec/Hz, significantly greater than any current cellular standards.","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"14 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":"124826581","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
Lossy compression of active sources 有源的有损压缩
2008 IEEE International Symposium on Information Theory Pub Date : 2008-07-06 DOI: 10.1109/ISIT.2008.4595335
Hari Palaiyanur, Cheng Chang, A. Sahai
{"title":"Lossy compression of active sources","authors":"Hari Palaiyanur, Cheng Chang, A. Sahai","doi":"10.1109/ISIT.2008.4595335","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595335","url":null,"abstract":"In computer vision, an active vision source is a sensor that explores its environment in an active way, deciding to investigate parts of the environment in greater depth based on what it currently sees. We study the problem of determining the rate required to compress the output of an active vision source to within a desired fidelity. In order to make the problem analytically tractable, we assume that the environment is memoryless and gain insights into the distinction between compression of passive and active sources. We show that modelling of the sources is crucial by considering two extreme cases: adversarially active sources and helpful active sources. The theory of arbitrarily varying sources is useful for these purposes and we expand on it by allowing the party controlling the variation in the source to have partial or noisy observations of the environment. We give several examples showing that there is a large difference in the rate required to compress active sources that are adversarially modelled and active sources that are jointly optimized with the coding system. The results suggest that when active sources are part of a networked system where rate comes at a premium, large savings can be reaped by jointly optimizing the coding system with the computer vision system.","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"2003 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":"125775753","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}
引用次数: 5
An achievable rate region for the two-way two-relay channel 用于双向双中继信道的可实现速率区域
2008 IEEE International Symposium on Information Theory Pub Date : 2008-07-06 DOI: 10.1109/ISIT.2008.4595034
Jonathan Ponniah, Liang-Liang Xie
{"title":"An achievable rate region for the two-way two-relay channel","authors":"Jonathan Ponniah, Liang-Liang Xie","doi":"10.1109/ISIT.2008.4595034","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595034","url":null,"abstract":"We propose an achievable rate region for the two- way two-relay channel using decode-and-forward block Markovian coding. A previous attempt to obtain an achievable region for this network encountered a fundamental deadlock problem in which each relay needed to decode before the other to enable mutual assistance. In this paper, the deadlock is resolved by introducing an additional constraint that ensures some relay can decode at least one source before the other relay. The resulting achievable region is an extension of existing results for the two- way single-relay channel.","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"8 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":"125883898","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}
引用次数: 33
OFDM peak-to-average power ratio reduction based on the simplex code 基于单纯形码的OFDM峰均功率比降低
2008 IEEE International Symposium on Information Theory Pub Date : 2008-07-06 DOI: 10.1109/ISIT.2008.4595198
R. Fischer, C. Siegl
{"title":"OFDM peak-to-average power ratio reduction based on the simplex code","authors":"R. Fischer, C. Siegl","doi":"10.1109/ISIT.2008.4595198","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595198","url":null,"abstract":"A new scheme for peak-to-average power ratio reduction in OFDM systems is proposed which combines the principles of multiple signal representation with selection (as done in selected mapping) and the use of channel coding. Thereby, in contrast to existing approaches, the code is arranged over a number of OFDM frames rather than over the carriers. Given the initial OFDM frames all linear combinations thereof are generated; from that the best are selected. The corresponding generator matrix is identical to that of the Simplex code. Specifically, we consider multi-antenna transmission, where the proposed scheme does not cause any additional delay, but utilize the dimension space adequately. The scheme is very flexible; due to the selection step any criterion of optimality can be taken into account. Performance is derived analytically and is covered by numerical results which are in very good agreement with theory.","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"49 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":"125907119","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
Design and analysis of Generalized LT-codes using colored ripples 彩色波纹广义lt码的设计与分析
2008 IEEE International Symposium on Information Theory Pub Date : 2008-07-06 DOI: 10.1109/ISIT.2008.4595354
Shirish S. Karande, K. Misra, S. Soltani, H. Radha
{"title":"Design and analysis of Generalized LT-codes using colored ripples","authors":"Shirish S. Karande, K. Misra, S. Soltani, H. Radha","doi":"10.1109/ISIT.2008.4595354","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595354","url":null,"abstract":"Research has shown that fluid limits of Markov processes can be used to obtain closed form expressions for the evolution of the ripple-size. In this work we extend the above analysis to generalized LT (GLT) codes, which can be used to represent LT encoding (with priorities) over multiple data segments. In our analysis, we segregate the ripple into multiple colored ripples, where each color corresponds to a segment. We derive closed form expressions for the size of each ripple. We utilize these expressions to design GLT distributions, optimized for a desired intermediate and unequal recovery.","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"49 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":"126153411","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
Universal decoding for linear Gaussian fading channels in the competitive minimax sense 竞争极小极大意义下线性高斯衰落信道的通用解码
2008 IEEE International Symposium on Information Theory Pub Date : 2008-07-06 DOI: 10.1109/ISIT.2008.4595093
N. Weinberger, M. Feder
{"title":"Universal decoding for linear Gaussian fading channels in the competitive minimax sense","authors":"N. Weinberger, M. Feder","doi":"10.1109/ISIT.2008.4595093","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595093","url":null,"abstract":"We address the problem of communicating over an unknown linear fading channel with additive white Gaussian noise, in the high SNR regime. A block fading model is adopted where the channel fading vector is unknown, yet assumed constant during the block. For a given codebook, a competitive minimax criterion is used to find a decoder ignorant of the specific channel fading prevailing, yet its performance, relative to the Maximum Likelihood decoder, has the best worst case. For a codebook with two codewords, the decoder is found explicitly, and a numerical method is described to find its performance.","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"408 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":"123559257","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 branch and cut algorithm for finding the minimum distance of a linear block code 用于寻找线性分组码的最小距离的分支和切割算法
2008 IEEE International Symposium on Information Theory Pub Date : 2008-07-06 DOI: 10.1109/ISIT.2008.4594976
Ahmet B. Keha, T. Duman
{"title":"A branch and cut algorithm for finding the minimum distance of a linear block code","authors":"Ahmet B. Keha, T. Duman","doi":"10.1109/ISIT.2008.4594976","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4594976","url":null,"abstract":"We give a branch-and-cut algorithm for finding the minimum distance of a binary linear error correcting code. We give two integer programming (IP) models and study the convex hull of the single constraint relaxation of these IP models. We use the new inequalities as cuts in a branch-and-cut scheme. Finally, we report computational results based on low density parity check (LDPC) codes that demonstrate the effectiveness of our cuts.","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"47 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":"125403689","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
The diversity-multiplexing tradeoff for independent parallel MIMO channels 独立并行MIMO信道的分集-复用权衡
2008 IEEE International Symposium on Information Theory Pub Date : 2008-07-06 DOI: 10.1109/ISIT.2008.4595414
P. Mitran
{"title":"The diversity-multiplexing tradeoff for independent parallel MIMO channels","authors":"P. Mitran","doi":"10.1109/ISIT.2008.4595414","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595414","url":null,"abstract":"The diversity-multiplexing tradeoff has become a powerful tool to analyze MIMO fading channels. In this paper, we first derive the diversity-multiplexing tradeoff for the case that the transmitter and receiver are connected by multiple parallel and independent MIMO channels, each of which may be utilized for some limiting fraction of the total time. Our main result in this respect is an elegant geometric characterization of the tradeoff curve in terms of the Zheng-Tse tradeoff for a single MIMO channel. We then apply this result to compute bounds on the DMT for a three phase bi-directional cooperation (or two-way relay) protocol. These bounds are shown to be tight in the case of single antenna nodes and the optimal relative time duration of each phase that maximizes the diversity of the end-users is determined. The DMT derived here may also be of importance to problems where a node can be seen to receive information over channels that can be decomposed into parallel independent components, which is often the case in protocols for half-duplex cooperative networks.","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"110 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":"116549276","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}
引用次数: 10
Capacity bounds for MIMO shared relay channel with half-duplex constraint 半双工约束下MIMO共享中继信道的容量边界
2008 IEEE International Symposium on Information Theory Pub Date : 2008-07-06 DOI: 10.1109/ISIT.2008.4595322
M. Khojastepour, Xiaodong Wang
{"title":"Capacity bounds for MIMO shared relay channel with half-duplex constraint","authors":"M. Khojastepour, Xiaodong Wang","doi":"10.1109/ISIT.2008.4595322","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595322","url":null,"abstract":"We consider a shared relay channel (SRC) where a single relay assists the communications between multiple source-destination links under the half-duplex (HD) constraint. Specifically, we derive lower and upper bounds on the capacity of 2-user AWGN MIMO SRC with two source-destination pairs. Two different coding strategies are presented based on super-position coding and on dirty paper coding, respectively. We compare the performance of the proposed SRC coding schemes with that of a TDMA strategy where each source-destination pair communicates in alternative time slots with the assistance of the relay. The proposed coding schemes for SRC results in significant performance improvement over TDMA strategy in terms of both ergodic capacity and outage probability.","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":"122110388","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学术官方微信