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

2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)最新文献

筛选
英文 中文
Compressing as well as the best tiling of an image 压缩以及图像的最佳平铺
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-06-25 DOI: 10.1109/ISIT.2000.866331
Wee Sun Lee
{"title":"Compressing as well as the best tiling of an image","authors":"Wee Sun Lee","doi":"10.1109/ISIT.2000.866331","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866331","url":null,"abstract":"We investigate the task of compressing an image by using different probability models for compressing different regions of the image. We introduce a class of probability models for images, the k-rectangular tilings of an image, that is formed by partitioning the image into k rectangular regions and generating the coefficients within each region by using a probability model selected from a finite class of N probability models. For an image of size n/spl times/n, we give a sequential probability assignment algorithm that codes the image with a code length which is within O(k log Nn/k) of the code length produced by the best probability model in the class. The algorithm has a computational complexity of O(Nn/sup 3/). An interesting subclass of the class of k-rectangular tilings is the class of tilings using rectangles whose widths are powers of two. This class is far more flexible than quadtrees and yet has a sequential probability assignment algorithm that produces a code length that is within O(k log Nn/k) of the best model in the class with a computational complexity of O(Nn/sup 2/ log n) (similar to the computational complexity of sequential probability assignment using quadtrees).","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117071798","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
Minimum bandwidth basis functions for the fourth-moment bandwidth measure 最小带宽基函数的第四矩带宽测量
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-06-25 DOI: 10.1109/ISIT.2000.866714
E. A. Fain, Lockheed Martin
{"title":"Minimum bandwidth basis functions for the fourth-moment bandwidth measure","authors":"E. A. Fain, Lockheed Martin","doi":"10.1109/ISIT.2000.866714","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866714","url":null,"abstract":"We present a fourth-moment measure of the \"bandwidth\" of a strictly time-limited signal and obtain a minimum bandwidth basis for /spl Lscr//sup 2/(a,b). Such a basis consists of orthonormal waveforms with the smallest obtainable bandwidths. The primary advantage of the fourth-moment bandwidth relative to the root mean square (RMS) and fractional out-of-band energy (FOBE) measures is that its basis functions have a O(1/f/sup 3/) frequency roll-off compared to the O(1/f/sup 2/) and O(1/f) decay of the RMS and FOBE basis functions, respectively.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129512853","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
Sphere decoding of space-time codes 时空码的球面解码
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-06-25 DOI: 10.1109/ISIT.2000.866660
O. Damen, A. Chkeif, J.-C. Belflore
{"title":"Sphere decoding of space-time codes","authors":"O. Damen, A. Chkeif, J.-C. Belflore","doi":"10.1109/ISIT.2000.866660","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866660","url":null,"abstract":"We explore in this paper the lattice sphere packing representation of a multi-antenna system and the algebraic space-time (ST) codes. We apply the sphere decoding (SD) algorithm to the resulting lattice code. For the uncoded system, SD yields, with a small increase in complexity, a huge improvement over the well-known V-BLAST detection algorithm. SD of algebraic ST codes exploits the full diversity of the coded multi-antenna system, and makes the proposed scheme very appealing to take advantage of the richness of the multi-antenna environment. The fact that the SD does not depend on the constellation size, gives rise to systems with very high spectral efficiency, maximum likelihood (ML) performance, and low decoding complexity.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129877306","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
Data compression via binary decision diagrams 通过二进制决策图进行数据压缩
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-06-25 DOI: 10.1109/ISIT.2000.866594
J. Kieffer, Philippe Flajolet, E. Yang
{"title":"Data compression via binary decision diagrams","authors":"J. Kieffer, Philippe Flajolet, E. Yang","doi":"10.1109/ISIT.2000.866594","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866594","url":null,"abstract":"A binary data string of length 2/sup k/ induces a Boolean function of k variables which can be represented by a unique reduced binary decision diagram. We losslessly compress the data string indirectly by compressing this binary decision diagram. The resulting data compression algorithm is universal.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130521097","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
Signaling for the Gaussian channel with side information at the transmitter 在发送端有侧信息的高斯信道的信令
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-06-25 DOI: 10.1109/ISIT.2000.866646
F. Willems
{"title":"Signaling for the Gaussian channel with side information at the transmitter","authors":"F. Willems","doi":"10.1109/ISIT.2000.866646","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866646","url":null,"abstract":"We investigate the Gaussian side information channel in the Shannon (1958) setup and propose a method that achieves correlation between the signal and the side information noise. The capacity still remains to be determined however.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123903644","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
On the accuracy of estimating tail probabilities in queues 关于队列中尾部概率估计的准确性
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-06-25 DOI: 10.1109/ISIT.2000.866373
A. Zeevi
{"title":"On the accuracy of estimating tail probabilities in queues","authors":"A. Zeevi","doi":"10.1109/ISIT.2000.866373","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866373","url":null,"abstract":"The document was not made available for publication as part of the conference proceedings.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123974400","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
Low complexity maximum-likelihood decoding of product codes 产品代码的低复杂度最大似然解码
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-06-25 DOI: 10.1109/ISIT.2000.866377
O. Al-Askary
{"title":"Low complexity maximum-likelihood decoding of product codes","authors":"O. Al-Askary","doi":"10.1109/ISIT.2000.866377","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866377","url":null,"abstract":"Many block codes can be represented as an intersection of two or more easily decoded codes. We present a new decoding algorithm for decoding product codes that utilizes this property. It will be shown that this algorithm is maximum-likelihood decoding. The complexity of the algorithm depends on the decoding complexity of the constituent codes and the quality of the channel.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121300338","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
Turbo nonlinear CPFSK with iterative decoding Turbo非线性CPFSK迭代译码
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-06-25 DOI: 10.1109/ISIT.2000.866487
Bonjin Ku, Goong-Gon Kim, Hayoung Yang, D. Hong, C. Kang
{"title":"Turbo nonlinear CPFSK with iterative decoding","authors":"Bonjin Ku, Goong-Gon Kim, Hayoung Yang, D. Hong, C. Kang","doi":"10.1109/ISIT.2000.866487","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866487","url":null,"abstract":"A turbo nonlinear continuous phase frequency shift keying (CPFSK) with iterative maximum a posteriori probability (MAP) decoding is proposed. It uses the nonlinear CPFSK encoding components proposed by us. They have nonlinear characteristics and good performance of power and bandwidth with simple structures.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114560950","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
Iterative source-channel decoding using soft-in/soft-out decoders 使用软入/软出解码器的迭代源信道解码
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-06-25 DOI: 10.1109/ISIT.2000.866468
N. Gortz
{"title":"Iterative source-channel decoding using soft-in/soft-out decoders","authors":"N. Gortz","doi":"10.1109/ISIT.2000.866468","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866468","url":null,"abstract":"The concept of iterative decoding of concatenated channel codes is applied to joint source-channel decoding (JSCD). Extrinsic information from the soft-in/soft-out channel decoder is used as a priori information for the new soft-in/soft-out source decoder and vice versa. In this novel iterative approach the redundancies within the data-bits and the channel codewords are alternately exploited in order to approximate the highly complex optimal JSCD.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"214 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121551746","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}
引用次数: 29
Independent component analysis for blind multiuser detections 盲多用户检测的独立分量分析
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-06-25 DOI: 10.1109/ISIT.2000.866544
A. Kuh, Xiaohong Gong
{"title":"Independent component analysis for blind multiuser detections","authors":"A. Kuh, Xiaohong Gong","doi":"10.1109/ISIT.2000.866544","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866544","url":null,"abstract":"We apply a novel signal processing method based on independent component analysis (ICA) to blind multiuser receivers. ICA is well suited for blind multiuser detection problems as the criterion used to separate signals is a mutual information minimization principle which attempts to separate independent signals from mixed signals. When the cross-correlations between signature sequences are large, ICA has a better performance than decorrelating receivers and linear MMSE receivers.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"57 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114020778","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学术官方微信