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

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

筛选
英文 中文
Achievable rates of random number generators for an arbitrary prescribed distribution from an arbitrary given distribution 从任意给定分布得到任意规定分布的随机数生成器的可实现率
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-12-01 DOI: 10.1109/ISIT.2000.866447
T. Yoshida, T. Matsushima, S. Hirasawa
{"title":"Achievable rates of random number generators for an arbitrary prescribed distribution from an arbitrary given distribution","authors":"T. Yoshida, T. Matsushima, S. Hirasawa","doi":"10.1109/ISIT.2000.866447","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866447","url":null,"abstract":"We show maximal rates in the case that random number generators generate a random sequence with an arbitrary prescribed distribution from a random sequence with an arbitrary given distribution.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"39 1 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":"126084944","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
Further results on unequal error protection of convolutional codes 卷积码不等错误保护的进一步研究
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-12-01 DOI: 10.1109/ISIT.2000.866325
Chung-hsuan Wang, Chi-chao Chao
{"title":"Further results on unequal error protection of convolutional codes","authors":"Chung-hsuan Wang, Chi-chao Chao","doi":"10.1109/ISIT.2000.866325","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866325","url":null,"abstract":"In this paper, we concentrate on the study of combining the optimality with respect to unequal error protection and canonicity of generator matrices for convolutional codes. The transformation which can keep the optimality of generator matrices is constructed, based on which a procedure for obtaining a basic and optimal generator matrix with the smallest external degree is also proposed. Moreover, necessary and sufficient conditions for a canonical generator matrix whose separation vector is the greatest among all canonical generator matrices are given. Finally, the existence of the greatest separation vector among all canonical generator matrices is proved for some convolutional codes.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"31 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":"115987300","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 fast interpolation method for list decoding of RS and algebraic-geometric codes RS和代数-几何码列表译码的快速插值方法
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-12-01 DOI: 10.1109/ISIT.2000.866777
S. Sakata, Y. Numakami, M. Fujisawa
{"title":"A fast interpolation method for list decoding of RS and algebraic-geometric codes","authors":"S. Sakata, Y. Numakami, M. Fujisawa","doi":"10.1109/ISIT.2000.866777","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866777","url":null,"abstract":"In this paper, we present an efficient algorithm to find a Grobner basis of the ideal set of polynomials I(V) based on the Berlekamp-Massey-Sakata (BMS) algorithm, which gives another efficient method of giving the solution at the first stage of the Sudan algorithm (1997). We also show that the interpolation problem can be generalized to find a Grobner basis of the ideal I(V;M) which consists of polynomials having zeros (/spl alpha//sub i/,/spl beta//sub i/)/spl isin/V with some multiplicity condition specified by a set M (/spl isin/Z/sub 0//sup 2/) of integer vectors. This Hermitian type of interpolation problem takes a role in the improved version of the Sudan algorithm. A modification of BMS the algorithm can be applied to solve this problem. On the other hand, for list decoding of one-point AG codes our method can be adapted to find a Grobner basis of a relevant ideal.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"1 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":"129683446","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
Linear parallel interference cancellation using fixed weighting factors for long-code CDMA 基于固定加权因子的长码CDMA线性并行干扰消除
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-12-01 DOI: 10.1109/ISIT.2000.866630
Dongning Guo, L. Rasmussen
{"title":"Linear parallel interference cancellation using fixed weighting factors for long-code CDMA","authors":"Dongning Guo, L. Rasmussen","doi":"10.1109/ISIT.2000.866630","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866630","url":null,"abstract":"Linear weighted multistage parallel interference cancellation (PIC) implements exactly the family of polynomial expansion detectors. For long-code CDMA, a set of optimal weights is found which minimizes the ensemble averaged mean squared error (MSE) over random codes. The weights are dependent on moments of the eigenvalues of the correlation matrix, where exact expressions are derived. The loss incurred by averaging rather than using the optimal, time-varying weights is practically negligible.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"1 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":"125860649","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
Evaluation of the spectral efficiency of spread-spectrum multiple-access systems 扩频多址系统频谱效率的评估
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-12-01 DOI: 10.1109/ISIT.2000.866738
M. Bystrom, J. Modestino
{"title":"Evaluation of the spectral efficiency of spread-spectrum multiple-access systems","authors":"M. Bystrom, J. Modestino","doi":"10.1109/ISIT.2000.866738","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866738","url":null,"abstract":"We present an approach for evaluating the spectral efficiency of a direct-sequence spread-spectrum system based on the channel cutoff rate. The spectral efficiency is evaluated independently of specific forward error control codes, and thus can provide general insight into system performance and parameter tradeoffs.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"1 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":"133154853","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
Algebraic soft-decision decoding of Reed-Solomon codes Reed-Solomon码的代数软判决译码
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-10-26 DOI: 10.1109/ISIT.2000.866351
R. Koetter, A. Vardy
{"title":"Algebraic soft-decision decoding of Reed-Solomon codes","authors":"R. Koetter, A. Vardy","doi":"10.1109/ISIT.2000.866351","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866351","url":null,"abstract":"A polynomial-time soft-decision decoding algorithm for Reed-Solomon codes is developed. The algorithm is algebraic in nature and builds upon the interpolation procedure proposed by Guruswami and Sudan (see IEEE Trans. Inform. Theory, vol.45, pp.1755-64, Sept. 1999) for hard-decision decoding. Algebraic soft-decision decoding is achieved by means of converting the soft-decision reliability information into a set of interpolations points along with their multiplicities. The conversion procedure is shown to be optimal for a certain probabilistic model. The resulting soft-decoding algorithm significantly outperforms both the Guruswami-Sudan decoding and the generalized minimum distance (GMD) decoding, while maintaining a complexity that is polynomial in the length of the code. Asymptotic analysis for a large number of interpolation points is presented, culminating in a complete geometric characterization of the decoding regions of the proposed algorithm. The algorithm easily extends to polynomial-time soft-decision decoding of BCH codes and codes from algebraic curves.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128331365","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}
引用次数: 633
Adaptive joint detection and decoding in flat-fading channels via mixture Kalman filtering 基于混合卡尔曼滤波的平衰落信道自适应联合检测与解码
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-09-01 DOI: 10.1109/ISIT.2000.866569
Rong Chen, Xiaodong Wang, Jun S. Liu
{"title":"Adaptive joint detection and decoding in flat-fading channels via mixture Kalman filtering","authors":"Rong Chen, Xiaodong Wang, Jun S. Liu","doi":"10.1109/ISIT.2000.866569","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866569","url":null,"abstract":"A novel adaptive Bayesian receiver for signal detection in flat-fading channels is developed based on the sequential Monte Carlo methodology. The basic idea is to treat the transmitted signals as missing data and to sequentially impute multiple copies of them based on the observed signals. The imputed signal sequences, together with their importance weights, provide a way to approximate the Bayesian estimate of the transmitted signals and the channel states. It is shown through simulations that the proposed sequential Monte Carlo receivers achieve near-bound performance in fading channels without the aid of any training/pilot symbols or decision feedback. Moreover, the proposed receiver structure exhibits massive parallelism and is ideally suited for high-speed parallel implementation using the VLSI systolic array technology.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127688613","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}
引用次数: 223
On the existence and construction of good codes with low peak-to-average power ratios 低峰均功率比良好规范的存在与构造
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-09-01 DOI: 10.1109/ISIT.2000.866515
K. Paterson, V. Tarokh
{"title":"On the existence and construction of good codes with low peak-to-average power ratios","authors":"K. Paterson, V. Tarokh","doi":"10.1109/ISIT.2000.866515","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866515","url":null,"abstract":"The peak-to-average power ratio PAPR(/spl Cscr/) of a code /spl Cscr/ is an important characteristic of that code when it is used in OFDM communications. We establish bounds on the region of achievable triples (R, d, PAPR(/spl Cscr/)) where R is the code rate and d is the minimum Euclidean distance of the code. We prove a lower bound on PAPR in terms of R and d and show that there exist asymptotically good codes whose PAPR is at most 8logn. We give explicit constructions of error-correcting codes with low PAPR by employing bounds for hybrid exponential sums over Galois fields and rings.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133380602","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}
引用次数: 298
Statistical imaging and complexity regularization 统计成像和复杂性正则化
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-08-01 DOI: 10.1109/ISIT.2000.866344
P. Moulin, Juan Liu
{"title":"Statistical imaging and complexity regularization","authors":"P. Moulin, Juan Liu","doi":"10.1109/ISIT.2000.866344","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866344","url":null,"abstract":"We apply complexity regularization to statistical ill-posed inverse problems in imaging. We formulate a natural distortion measure in image space and develop nonasymptotic bounds on estimation performance in terms of an index of resolvability that characterizes the compressibility of the true image. These bounds extend previous results that were obtained under simpler observational models.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125616917","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
A class of Sudan-decodable codes 一类苏丹可解码的代码
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-07-01 DOI: 10.1109/ISIT.2000.866402
R. R. Nielsen
{"title":"A class of Sudan-decodable codes","authors":"R. R. Nielsen","doi":"10.1109/ISIT.2000.866402","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866402","url":null,"abstract":"In this paper Sudan's algorithm is modified into an efficient method to list-decode a class of codes which can be seen as a generalization of Reed-Solomon codes. The algorithm is specialized into a very efficient method for unique decoding. The code construction can be generalized based on algebraic-geometry codes and the decoding algorithms are generalized accordingly. Comparisons with Reed-Solomon and Hermitian codes are made.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128825192","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
首页 上一页 下一页 尾页
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学术官方微信