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

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

筛选
英文 中文
On the computation of weight enumerators for convolutional codes 卷积码中权重枚举数的计算
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2003-04-22 DOI: 10.1109/ISIT.2000.866326
C. Pimentel
{"title":"On the computation of weight enumerators for convolutional codes","authors":"C. Pimentel","doi":"10.1109/ISIT.2000.866326","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866326","url":null,"abstract":"Performance bounds for maximum likelihood decoding of convolutional codes over memoryless channels are commonly measured using the first few terms of the series expansion of the transfer function T(x,y). In this paper we present an efficient algebraic method to obtain this truncated series without first computing the complete T(x,y).","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115568181","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
Iterative decoding algorithms updating likelihood and channel values based on interim hard decision results 基于中期硬决策结果更新似然值和信道值的迭代译码算法
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-12-01 DOI: 10.1109/ISIT.2000.866469
M. Ariyoshi, I. Sasase
{"title":"Iterative decoding algorithms updating likelihood and channel values based on interim hard decision results","authors":"M. Ariyoshi, I. Sasase","doi":"10.1109/ISIT.2000.866469","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866469","url":null,"abstract":"This paper presents novel decoding algorithms for turbo codes, in which the likelihood and channel values are updated in order for those values to become closer to the true values thorough the iterative decoding procedure. The criteria for updating the likelihood and channel values are proposed, those are based on the simple means to compare the interim hard decision results from each of component decoders.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133272372","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
Multiuser detection in a quantum channel 量子信道中的多用户检测
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-12-01 DOI: 10.1109/ISIT.2000.866574
J. Concha, H. Poor
{"title":"Multiuser detection in a quantum channel","authors":"J. Concha, H. Poor","doi":"10.1109/ISIT.2000.866574","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866574","url":null,"abstract":"The use of multiuser detection techniques in multiple access optical channels has been studied in the literature, with emphasis on optical CDMA. In general, it has been assumed that the optical detection is carried out by p-i-n diodes, which count the photons present in the field. However, the theory of quantum detection indicates that other measurements might yield significantly smaller error probabilities. In this paper, we show by example that this can happen in the multiple-access case. We also note that the quantum multiuser detection problem differs from the classical one, in that quantum measurement precludes the use of matched filter banks for non-orthogonal signals.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126056468","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
On capacity and spreading in CDMA systems CDMA系统的容量与扩展
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-12-01 DOI: 10.1109/ISIT.2000.866423
M. Motani, V. Veeravalli, C. Heegard
{"title":"On capacity and spreading in CDMA systems","authors":"M. Motani, V. Veeravalli, C. Heegard","doi":"10.1109/ISIT.2000.866423","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866423","url":null,"abstract":"The problem of maximizing a weighted linear combination of the rates of users in a multiuser synchronous CDMA system is considered. We find that although spreading decreases capacity, nontrivial low rate coding can help to mitigate this loss.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125669742","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
Universal linear least-squares prediction 通用线性最小二乘预测
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-12-01 DOI: 10.1109/ISIT.2000.866371
A. Singer, M. Feder
{"title":"Universal linear least-squares prediction","authors":"A. Singer, M. Feder","doi":"10.1109/ISIT.2000.866371","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866371","url":null,"abstract":"An approach to the problem of linear prediction is discussed that is based on previous developments in the universal coding and computational learning theory literature. This development provides a novel perspective on the adaptive filtering problem, and represents a significant departure from traditional adaptive filtering methodologies. In this context, we demonstrate a sequential algorithm for linear prediction whose accumulated squared prediction error, for every possible sequence, is asymptotically as small as the best fixed linear predictor for that sequence.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116644335","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}
引用次数: 18
Asymptotically optimal waterfilling in multiple antenna multiple access channels 多天线多址信道渐近最优充水
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-12-01 DOI: 10.1109/ISIT.2000.866764
P. Viswanath, David Tse, V. Anantharam
{"title":"Asymptotically optimal waterfilling in multiple antenna multiple access channels","authors":"P. Viswanath, David Tse, V. Anantharam","doi":"10.1109/ISIT.2000.866764","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866764","url":null,"abstract":"This paper considers \"vector multiple access channels\" (VMAC) where each user has multiple \"degrees of freedom\" and studies the effect of power allocation as a function of the channel state on the \"sum capacity\" defined as the maximum sum of rates of users per unit degree of freedom at which the users can jointly reliably transmit, in an information theoretic sense. A concrete example of a VMAC is a MAC with multiple antennas at the receiver where the antennas provide spatial degrees of freedom. Our main result is the identification of a simple dynamic power allocation scheme that is optimal in a large system, i.e., in the regime of a large number of users and a correspondingly large number of antennas. A key feature of this policy is that, for any user, it depends only on the instantaneous amplitude of the slow fading component of the vector channel of that user alone and the structure of the policy is \"waterfilling\".","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121881449","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
General formulas for Csiszar's source coding cutoff rates cisszar源编码截止率的一般公式
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-12-01 DOI: 10.1109/ISIT.2000.866449
Po-Ning Chen, F. Alajaji
{"title":"General formulas for Csiszar's source coding cutoff rates","authors":"Po-Ning Chen, F. Alajaji","doi":"10.1109/ISIT.2000.866449","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866449","url":null,"abstract":"In this work, Csiszar's (1995) fixed-length source coding /spl beta/-cutoff rates are investigated for the class of arbitrary discrete sources with memory. It is demonstrated that the limsup and liminf Renyi entropy rates provide the formulas for the forward and reverse /spl beta/-cutoff rates, respectively. Consequently, new fixed-length source coding operational characterizations for the Renyi entropy rates are established.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125997570","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
Very high-speed Reed-Solomon decoders 非常高速的里德-所罗门解码器
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-12-01 DOI: 10.1109/ISIT.2000.866717
D. Sarwate, Naresh R Shanbhag
{"title":"Very high-speed Reed-Solomon decoders","authors":"D. Sarwate, Naresh R Shanbhag","doi":"10.1109/ISIT.2000.866717","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866717","url":null,"abstract":"A pipelined finite-field multiplier structure in conjunction with a single systolic array implementation of the Berlekamp-Massey algorithm leads to a highly parallel decoder architecture in which the critical path delay is an order of magnitude smaller than the path delays of conventional architectures.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127549073","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
Sum capacity of DS-CDMA with colored noise 带彩色噪声的DS-CDMA总容量
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-12-01 DOI: 10.1109/ISIT.2000.866422
P. Viswanath, V. Anantharam
{"title":"Sum capacity of DS-CDMA with colored noise","authors":"P. Viswanath, V. Anantharam","doi":"10.1109/ISIT.2000.866422","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866422","url":null,"abstract":"We consider a direct sequence code division multiple access (DS-CDMA) channel in colored additive Gaussian noise and focus on the sum capacity of this channel. The sum capacity is the maximum sum of rates at which users can jointly reliably transmit, in an information theoretic sense. We completely characterize optimum sum capacity, which is obtained by choosing the signature sequences of the users appropriately. Our characterization is constructive in that we provide a combinatorial algorithm to generate the optimum signature sequences as a function of the covariance of the additive background noise and power constraints of the users. The characterization also allows us to identify a saddle property of the optimum sum capacity: convexity in the covariance matrix of the additive noise and concavity in the vector of user power constraints.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"1999 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128253042","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
Simple soft-output detection for magnetic recording channels 简单的软输出检测磁记录通道
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-12-01 DOI: 10.1109/ISIT.2000.866555
E. Soljanin
{"title":"Simple soft-output detection for magnetic recording channels","authors":"E. Soljanin","doi":"10.1109/ISIT.2000.866555","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866555","url":null,"abstract":"Recent success of turbo-like coding schemes on memoryless channels has sparked interest in using them on intersymbol interference (ISI) channels. Decoders for turbo and low density parity check (LDPC) codes perform much better with soft input information which has to be supplied by the channel detector as its soft output. We consider a class of ISI channels commonly used to model magnetic recording channels in a wide range of linear recording densities, and show that simple soft output detectors are possible, since the channel transfer functions belong to a family of special polynomials.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124621873","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
下一页 尾页
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学术官方微信