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

Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)最新文献

筛选
英文 中文
Unequal error protection codes based on |u|u+/spl upsi/|/spl middot/| construction 基于|u|u+/spl upsi/|/spl middot/|结构的不等错保护码
Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252) Pub Date : 1998-08-16 DOI: 10.1109/ISIT.1998.708797
J. Limbanyen, K. Yamaguchi
{"title":"Unequal error protection codes based on |u|u+/spl upsi/|/spl middot/| construction","authors":"J. Limbanyen, K. Yamaguchi","doi":"10.1109/ISIT.1998.708797","DOIUrl":"https://doi.org/10.1109/ISIT.1998.708797","url":null,"abstract":"A well-known |u|u+/spl upsi/| construction is given to a (n,k/sub 1/) linear code with a (n,k/sub 2/) linear code to form a (2n,k/sub 1/+k/sub 2/) linear code. The purpose of this research is to investigate how the |u|u+/spl upsi/|/spl middot/| construction can be used to construct new different codes. In this paper we limit the discussion on linear unequal error protection (LUEP) codes.","PeriodicalId":133728,"journal":{"name":"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132458122","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
Investigation of the error performance of Tunstall coding Tunstall编码误差性能的研究
Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252) Pub Date : 1998-08-16 DOI: 10.1109/ISIT.1998.708803
J. A. Briffa, Victor Buttigieg
{"title":"Investigation of the error performance of Tunstall coding","authors":"J. A. Briffa, Victor Buttigieg","doi":"10.1109/ISIT.1998.708803","DOIUrl":"https://doi.org/10.1109/ISIT.1998.708803","url":null,"abstract":"The error performance of the Tunstall code is analysed, and a relevant metric defined. Several parameters in the encoding process are considered, with the objective of minimising the effect of errors without sacrificing compression. The results obtained show that the error performance may be significantly improved without loss of compression.","PeriodicalId":133728,"journal":{"name":"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134294899","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
Multiple description transform coding: robustness to erasures using tight frame expansions 多重描述变换编码:使用紧框架展开对擦除的鲁棒性
Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252) Pub Date : 1998-08-16 DOI: 10.1109/ISIT.1998.709013
Vivek K Goyal, M. Vetterli, J. Kovacevic
{"title":"Multiple description transform coding: robustness to erasures using tight frame expansions","authors":"Vivek K Goyal, M. Vetterli, J. Kovacevic","doi":"10.1109/ISIT.1998.709013","DOIUrl":"https://doi.org/10.1109/ISIT.1998.709013","url":null,"abstract":"We propose the use of a tight frame expansion for generalized multiple description coding. This method is conceptually very similar to using a block channel code, except it is done on continuous-valued data prior to quantization. A sketch of the distortion analysis is given.","PeriodicalId":133728,"journal":{"name":"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127576128","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}
引用次数: 116
Equalization with an H/sup /spl infin// criterion 均衡与H/sup /spl infin//准则
Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252) Pub Date : 1998-08-16 DOI: 10.1109/ISIT.1998.709054
B. Hassibi, A. Erdogan, T. Kailath
{"title":"Equalization with an H/sup /spl infin// criterion","authors":"B. Hassibi, A. Erdogan, T. Kailath","doi":"10.1109/ISIT.1998.709054","DOIUrl":"https://doi.org/10.1109/ISIT.1998.709054","url":null,"abstract":"We study the problem of linear equalization from an H/sup /spl infin// point of view and parameterize, in closed form, all possible H/sup /spl infin//-optimal equalizers. The results indicate an interesting dichotomy between minimum phase and non-minimum phase channels: for minimum phase channels the best causal equalizer performs as well as the best noncausal equalizer, whereas for non-minimum phase channels, causal equalizers cannot reduce the estimation error bounds from their a priori values.","PeriodicalId":133728,"journal":{"name":"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","volume":"254 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132601542","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
On the existence of a steady state solution to a dynamic jamming game 一类动态干扰对策稳态解的存在性
Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252) Pub Date : 1998-08-16 DOI: 10.1109/ISIT.1998.708908
R. K. Mallik, R. Scholtz
{"title":"On the existence of a steady state solution to a dynamic jamming game","authors":"R. K. Mallik, R. Scholtz","doi":"10.1109/ISIT.1998.708908","DOIUrl":"https://doi.org/10.1109/ISIT.1998.708908","url":null,"abstract":"A proof for the existence of a steady state solution to an on-off slotted dynamic communication jamming game is presented.","PeriodicalId":133728,"journal":{"name":"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","volume":"146 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132774681","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
From matched filters to martingales 从匹配的过滤器到鞅
Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252) Pub Date : 1998-08-16 DOI: 10.1109/ISIT.1998.708578
T. Kailath
{"title":"From matched filters to martingales","authors":"T. Kailath","doi":"10.1109/ISIT.1998.708578","DOIUrl":"https://doi.org/10.1109/ISIT.1998.708578","url":null,"abstract":"Summary form only given. The famous matched filter solution for maximizing the output SNR of a known signal in additive white noise was independently discovered by several investigators in the mid-forties. Since then it has appeared as a key component of optimal detectors in a variety of scenarios. Its first appearance was perhaps in D.O. North's 1943 RCA report, which is remarkable for the facility with which the author exploits sophisticated (for the times) mathematical analysis to obtain useful physical results and insights; among other items, the Rice distribution is introduced and used in a routine way. Since then, the concept has evolved and grown in a fascinating way, which is outlined, chiefly through the early work of V.A. Kotelnikov (1947) and of P.M. Woodward, and its notable extensions to multipath problems through the estimator-correlator ideas of P. Price and P.E. Green. We describe how the effort to extend these results to non-Gaussian signals led back in a fascinating way to the original likelihood ratio formulas. Martingale theory and the need for attention to the definition of stochastic integrals arose in a natural way in the course of this development and later enabled, among other things, the development of close parallels between detection problems for signals with additive Gaussian noise and with \"multiplicative\" Poisson-type noise. As interest in such areas declined in the information theory community, the methods began to appear in finance theory, where they were soon also regarded as the natural tool. Moreover the growing emphasis on soft-decision rules in the new turbo coding schemes may renew interest in general likelihood ratio formulas.","PeriodicalId":133728,"journal":{"name":"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130813148","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
New lower bounds on aperiodic crosscorrelation of binary codes 二进位码非周期互关的新下界
Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252) Pub Date : 1998-08-16 DOI: 10.1109/ISIT.1998.709076
V. Levenshtein
{"title":"New lower bounds on aperiodic crosscorrelation of binary codes","authors":"V. Levenshtein","doi":"10.1109/ISIT.1998.709076","DOIUrl":"https://doi.org/10.1109/ISIT.1998.709076","url":null,"abstract":"For the minimum aperiodic crosscorrelation /spl theta/(n,M) of binary codes of size M and length n over the alphabet {1,-1} it is known that the celebrated Welch (1974) bound /spl theta//sup 2/(n,M)/spl ges/((M-1)n/sup 2/)/(2Mn-M-1). In this paper the Welch bound is strengthened for all M/spl ges/4 and n/spl ges/2. In the asymptotic process when M tends to infinity as n/spl rarr//spl infin/, this strengthening gives the factor 2 as compared to the Welch bound and coincides with the corresponding asymptotic bound on the square of the minimum periodic crosscorrelation of binary codes (Sidelnikov 1971). Our purpose is to estimate the aperiodic crosscorrelation /spl theta/(C) of a code C in E/sup n/={1,-1}/sup n/ which is defined as follows: /spl theta/(C)=max|/spl theta/(x,y;l)| where the maximum is taken over all x=(x/sub 1/,...,x/sub n/)/spl isin/C, y=(y/sub 1/,...,y/sub n/)/spl isin/C, l=0,l,...n-1 such that l/spl ne/0 when x=y and /spl theta/(x,y;l)=/spl Sigma//sub j=1//sup n-l/x/sub j/y/sub j/+l.","PeriodicalId":133728,"journal":{"name":"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130742775","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}
引用次数: 44
Fast soft-decision decoding for block codes using a trellis 快速软判决解码块码使用网格
Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252) Pub Date : 1998-08-16 DOI: 10.1109/ISIT.1998.708834
Xiao-Hong Peng, A. Burr, P. Farrell, J. M. Gil-García
{"title":"Fast soft-decision decoding for block codes using a trellis","authors":"Xiao-Hong Peng, A. Burr, P. Farrell, J. M. Gil-García","doi":"10.1109/ISIT.1998.708834","DOIUrl":"https://doi.org/10.1109/ISIT.1998.708834","url":null,"abstract":"The trellis used for decoding can be significantly simplified by using the results from decoding the component codes of the full code. The saving on decoding complexity varies according to the decoding performances required. The method applies to any block code that can be decomposed into component codes.","PeriodicalId":133728,"journal":{"name":"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130958475","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
Random sequence analysis of optimum near-far resistance in a variable chipping rate dual-rate CDMA system 可变速率双速率CDMA系统中最优近远电阻的随机序列分析
Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252) Pub Date : 1998-08-16 DOI: 10.1109/ISIT.1998.708709
Jiangxin Chen, U. Mitra
{"title":"Random sequence analysis of optimum near-far resistance in a variable chipping rate dual-rate CDMA system","authors":"Jiangxin Chen, U. Mitra","doi":"10.1109/ISIT.1998.708709","DOIUrl":"https://doi.org/10.1109/ISIT.1998.708709","url":null,"abstract":"Direct-sequence code-division multiple-access (DS/CDMA) provides natural implementations for multi-rate communications systems. In this work, we will extend prior results on multi-rate systems with constant chipping rates to the case of variable chipping rate access (VCR) where chipping rates are proportional to user data rates. We use optimum near-far resistance as the performance measure of interest; thus for random sequences, the goal is to determine the average optimum near-far resistance. A random signature sequence analysis for the MMSE receiver operating in a single-rate system has been developed previously. We will combine the previous techniques; results on random matrices; and our prior work on variable spreading length (VSL) systems. The resulting two propositions for VCR systems are provided here.","PeriodicalId":133728,"journal":{"name":"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131200885","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
Fundamental limitations on multiple-antenna wireless links in Rayleigh fading 瑞利衰落中多天线无线链路的基本限制
Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252) Pub Date : 1998-08-16 DOI: 10.1109/ISIT.1998.708915
T. Marzetta, B. Hochwald
{"title":"Fundamental limitations on multiple-antenna wireless links in Rayleigh fading","authors":"T. Marzetta, B. Hochwald","doi":"10.1109/ISIT.1998.708915","DOIUrl":"https://doi.org/10.1109/ISIT.1998.708915","url":null,"abstract":"Multiple-antenna wireless links have been shown theoretically to sustain enormous data rates in Rayleigh flat-fading, provided that the propagation coefficients between pairs of transmitter and receiver antennas are statistically independent and known to the receiver. It is not always possible for the receiver to learn the coefficients. Without assuming any knowledge of the fading coefficients and without imposing any ad hoc training schemes, we examine the capacity of the link as a function of the fading rate and SNR. We first look at piecewise constant fading processes where we compute the capacity at high SNRs. We then look at continuous fading processes, and it is shown that the capacity cannot be increased by increasing the number of transmitter antennas beyond a certain fading coherence time. This is radically different from the case when the fading coefficients are known, where the capacity increases indefinitely by increasing the number of transmitter and receiver antennas.","PeriodicalId":133728,"journal":{"name":"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132829821","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
首页 上一页 下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信