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

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

筛选
英文 中文
Rate-distortion optimal tree algorithms for piecewise polynomials 分段多项式的率失真最优树算法
Proceedings. IEEE International Symposium on Information Theory Pub Date : 2002-06-30 DOI: 10.1109/ISIT.2002.1023618
R. Shukla, M. Do, P. Dragotti, M. Vetterli
{"title":"Rate-distortion optimal tree algorithms for piecewise polynomials","authors":"R. Shukla, M. Do, P. Dragotti, M. Vetterli","doi":"10.1109/ISIT.2002.1023618","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023618","url":null,"abstract":"In this paper, we are interested in a coding scheme, which achieves oracle like asymptotic rate-distortion (R-D) behavior with polynomial complexity for 1-D as well as 2-D signals. In particular, for the 1-D case we present a coding scheme which utilizes binary tree segmentation with optimal bit allocation among different segments. Investigation of the algorithm reveals the inherent weakness in the initial coding scheme, leading to a suboptimal performance. The optimal binary tree scheme in the 1-D case can be easily extended to the 2-D case as an optimal quadtree scheme with the similar computational complexity. The proposed optimal quadtree scheme also achieves the oracle like R-D performance for some simple classes of images whereas for the 2-D case there is no known algorithm achieving the right R-D behavior at reasonable computational cost.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"27 1","pages":"346-"},"PeriodicalIF":0.0,"publicationDate":"2002-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81052790","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 the analysis of variable-to-variable length codes 变到变长码的分析
Proceedings. IEEE International Symposium on Information Theory Pub Date : 2002-06-30 DOI: 10.1109/ISIT.2002.1023448
S. Savari, W. Szpankowski
{"title":"On the analysis of variable-to-variable length codes","authors":"S. Savari, W. Szpankowski","doi":"10.1109/ISIT.2002.1023448","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023448","url":null,"abstract":"We simplify the formula for the redundancy of a large class of variable-to-variable length codes on discrete, memoryless sources and find new asymptotic upper bounds on the redundancy of the Tunstall-Huffman code and the Tunstall-Shannon-Fano code.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"13 1","pages":"176-"},"PeriodicalIF":0.0,"publicationDate":"2002-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83474172","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
Diversity and freedom: a fundamental tradeoff in multiple antenna channels 多样性和自由:多天线信道的基本权衡
Proceedings. IEEE International Symposium on Information Theory Pub Date : 2002-06-30 DOI: 10.1109/ISIT.2002.1023748
Lizhong Zheng, David Tse
{"title":"Diversity and freedom: a fundamental tradeoff in multiple antenna channels","authors":"Lizhong Zheng, David Tse","doi":"10.1109/ISIT.2002.1023748","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023748","url":null,"abstract":"Multiple antennas can be used for increasing the amount of diversity or the number of degrees of freedom in wireless communication systems. We propose the point of view to study the tradeoff between the two types of gains. In this paper, we present the complete results on the optimal tradeoff, and give a brief discussion on the techniques used to get the results.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"330 1","pages":"476-"},"PeriodicalIF":0.0,"publicationDate":"2002-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87301566","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}
引用次数: 32
A characterization of functional duality between source and channel coding 信源和信道编码之间功能对偶性的表征
Proceedings. IEEE International Symposium on Information Theory Pub Date : 2002-06-30 DOI: 10.1109/ISIT.2002.1023496
S. Pradhan, J. Chou, K. Ramchandran
{"title":"A characterization of functional duality between source and channel coding","authors":"S. Pradhan, J. Chou, K. Ramchandran","doi":"10.1109/ISIT.2002.1023496","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023496","url":null,"abstract":"Source coding under a rate-distortion (R-D) constraint and channel coding under a channel cost constraint have long been considered as duals of each other starting from Shannon (1959). We address this duality with the objective of providing a mathematical characterization of it in a functional sense. To be specific, given an optimal source (channel) coding scheme, we detail the conditions under which such a scheme is a functional dual to a channel (respectively source) coding scheme. We show that this functional duality is enabled through appropriate choices of metrics and constraints for the dual source (or channel) coding problem. We then extend this duality formulation to source and channel coding with side information.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"53 1","pages":"224-"},"PeriodicalIF":0.0,"publicationDate":"2002-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84730084","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
Energy reduction and fundamental energy limits in digital VLSI circuits 数字VLSI电路中的能量降低和基本能量限制
Proceedings. IEEE International Symposium on Information Theory Pub Date : 2002-06-30 DOI: 10.1109/ISIT.2002.1023665
P. Sotiriadis, V. Tarokh, A. Chandrakasan
{"title":"Energy reduction and fundamental energy limits in digital VLSI circuits","authors":"P. Sotiriadis, V. Tarokh, A. Chandrakasan","doi":"10.1109/ISIT.2002.1023665","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023665","url":null,"abstract":"We address the problem of deriving the minimum cost (energy), necessary for a unit to process a bit of information. We also address the use of coding in order to achieve this limit.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"36 1","pages":"393-"},"PeriodicalIF":0.0,"publicationDate":"2002-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88177982","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
Performance bounds for turbo coded multiple antenna systems turbo编码多天线系统的性能边界
Proceedings. IEEE International Symposium on Information Theory Pub Date : 2002-06-30 DOI: 10.1109/ISIT.2002.1023574
A. Stefanov, T. Duman
{"title":"Performance bounds for turbo coded multiple antenna systems","authors":"A. Stefanov, T. Duman","doi":"10.1109/ISIT.2002.1023574","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023574","url":null,"abstract":"We derive performance bounds for turbo coded multiple antenna systems. We describe a method for obtaining the weight enumerating function of turbo coded multiple antenna systems in order to take into account the presence of transmit and receive antenna diversity.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"103 1","pages":"302-"},"PeriodicalIF":0.0,"publicationDate":"2002-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79676265","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
n-channel symmetric multiple descriptions: new rate regions n通道对称多重描述:新的速率区域
Proceedings. IEEE International Symposium on Information Theory Pub Date : 2002-06-30 DOI: 10.1109/ISIT.2002.1023365
R. Puri, S. Pradhan, K. Ramchandran
{"title":"n-channel symmetric multiple descriptions: new rate regions","authors":"R. Puri, S. Pradhan, K. Ramchandran","doi":"10.1109/ISIT.2002.1023365","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023365","url":null,"abstract":"A new achievable region for the symmetric n-channel multiple descriptions (MD) problem (n>2) is presented. This is derived from our recent result for the problem of information theoretic characterization of maximum distance separable erasure codes in a source-channel coding framework. The rate region presented here is a generalization of the ElGamal and Cover region for the case of n=2 descriptions and achieves points that have not been known in the literature previously.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"40 1","pages":"93-"},"PeriodicalIF":0.0,"publicationDate":"2002-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90256985","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
LDPC decoding using multiple representations LDPC解码使用多种表示
Proceedings. IEEE International Symposium on Information Theory Pub Date : 2002-06-30 DOI: 10.1109/ISIT.2002.1023728
K. Andrews, S. Dolinar, F. Pollara
{"title":"LDPC decoding using multiple representations","authors":"K. Andrews, S. Dolinar, F. Pollara","doi":"10.1109/ISIT.2002.1023728","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023728","url":null,"abstract":"For a particular block code, a multitude of different parity check matrices could be chosen to represent the code constraints. We demonstrate that belief propagation decoders based on different parity check matrices often respond in different ways, and that for a given complexity, it may be preferable to use several decoders for fewer iterations, than to run a single decoder for many iterations. We also propose some additional decoder architectures that use multiple representations of the parity constraints.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"50 1","pages":"456-"},"PeriodicalIF":0.0,"publicationDate":"2002-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73568447","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
An analytical method for performance analysis of binary linear block codes 二进制线性分组码性能分析的一种解析方法
Proceedings. IEEE International Symposium on Information Theory Pub Date : 2002-06-30 DOI: 10.1109/ISIT.2002.1023675
A. Abedi, A. Khandani
{"title":"An analytical method for performance analysis of binary linear block codes","authors":"A. Abedi, A. Khandani","doi":"10.1109/ISIT.2002.1023675","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023675","url":null,"abstract":"An analytical method for performance evaluation of binary linear block codes using an additive white Gaussian noise (AWGN) channel model with binary phase shift keying (BPSK) modulation is presented. We focus on the probability distribution function (pdf) of the bit log-likelihood ratio (LLR) which is expressed in terms of the Gram-Charlier series expansion. This expansion requires knowledge of the statistical moments of the bit LLR. We introduce an analytical method for calculating these moments. It is shown that the estimate of the bit error probability provided by the proposed method will asymptotically converge to the true bit error performance.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"2 1","pages":"403-"},"PeriodicalIF":0.0,"publicationDate":"2002-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78380504","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
Space-time multiplexing for multi-antenna channels 多天线信道的空时复用
Proceedings. IEEE International Symposium on Information Theory Pub Date : 2002-06-30 DOI: 10.1109/ISIT.2002.1023494
Ke Liu, A. Sayeed
{"title":"Space-time multiplexing for multi-antenna channels","authors":"Ke Liu, A. Sayeed","doi":"10.1109/ISIT.2002.1023494","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023494","url":null,"abstract":"Space-time multiplexing or linear dispersion coding spreads transmit signals across spacetime dimensions and linearly multiplexes spread signals at the transmitter. It subsumes various linear signaling techniques including Bell Laboratory Layered Space-Time (BLAST) architecture and spacetime block codes. In this paper, we present space-time multiplexing from a signal processing perspective that views design of space-time multiplexing as that of multiple access in space-time dimensions. The structure of symbol space-time spreading codes significantly affects symbol separability and diversity-rate trade-off intrinsic to multi-antenna systems. It is shown that BLAST and space-time block codes represent two extremes. The former separates symbols in spatial dimension to achieve high rate, while the latter uses temporal dimension to construct orthogonal spreading codes with full diversity but with large rate penalty. Efficient exploitation of spatial and temporal dimensions calls for a balance of diversity and rate. We propose such an approach for transmit diversity utilization - layered transmit diversity - that combines spatial and temporal dimensions for symbol separation and is able to operate very close to channel capacity.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"24 1","pages":"222-"},"PeriodicalIF":0.0,"publicationDate":"2002-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78557526","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
首页 上一页 下一页 尾页
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学术官方微信
小红书