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

Proceedings of 1994 IEEE International Symposium on Information Theory最新文献

筛选
英文 中文
Soft decision decoding of linear block codes using genetic algorithms 基于遗传算法的线性分组码软判决译码
Proceedings of 1994 IEEE International Symposium on Information Theory Pub Date : 1994-06-27 DOI: 10.1109/ISIT.1994.394622
H. Maini, K. Mehrotra, C. Mohan, S. Ranka
{"title":"Soft decision decoding of linear block codes using genetic algorithms","authors":"H. Maini, K. Mehrotra, C. Mohan, S. Ranka","doi":"10.1109/ISIT.1994.394622","DOIUrl":"https://doi.org/10.1109/ISIT.1994.394622","url":null,"abstract":"Soft decision decoding is a difficult search problem, for which optimal algorithms are computationally intractable. Genetic algorithms (GA) are stochastic optimisation techniques that have successfully solved many difficult search problems. We have developed a high performance GA for suboptimal soft decision decoding of binary linear block codes, which gives bit error probabilities as low as 0.00183 for a [104, 52] extended quadratic residue code with a signal-to-noise ratio of 2.5 dB, exploring only 30,000 codewords, whereas the search space contains 10/sup 1/5 codewords. Success ensues from the use of a new crossover operator that exploits problem-specific knowledge.<<ETX>>","PeriodicalId":331390,"journal":{"name":"Proceedings of 1994 IEEE International Symposium on Information Theory","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126265167","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
Subspace subcodes of Reed-Solomon codes Reed-Solomon码的子空间子码
Proceedings of 1994 IEEE International Symposium on Information Theory Pub Date : 1994-06-27 DOI: 10.1109/ISIT.1994.395045
M. Hattori, R. McEliece, G. Solomon
{"title":"Subspace subcodes of Reed-Solomon codes","authors":"M. Hattori, R. McEliece, G. Solomon","doi":"10.1109/ISIT.1994.395045","DOIUrl":"https://doi.org/10.1109/ISIT.1994.395045","url":null,"abstract":"A subspace subcode of a Reed-Solomon (SSRS) code over GF(2/sup m/) is the set of RS code-words, whose components all lie in a particular GF(2)-subspace of GF(2/sup m/). SSRS codes include both generalized BCH codes and \"trace-shortened\" RS codes as special cases. In this paper we present an explicit formula for the dimension of an arbitrary RS subspace subcode. Using this formula, we find that in many cases, SSRS codes are competitive with algebraic geometry codes, and that in some cases, the dimension of the best subspace subcode is larger than that of the corresponding GBCH code.<<ETX>>","PeriodicalId":331390,"journal":{"name":"Proceedings of 1994 IEEE International Symposium on Information Theory","volume":"172 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114152498","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}
引用次数: 47
Learning decision rules for pattern classification under a family of probability measures 在一组概率测度下学习模式分类的决策规则
Proceedings of 1994 IEEE International Symposium on Information Theory Pub Date : 1994-06-27 DOI: 10.1109/ISIT.1994.394875
S. Kulkarni, M. Vidyasagar
{"title":"Learning decision rules for pattern classification under a family of probability measures","authors":"S. Kulkarni, M. Vidyasagar","doi":"10.1109/ISIT.1994.394875","DOIUrl":"https://doi.org/10.1109/ISIT.1994.394875","url":null,"abstract":"In this paper, the PAC learnability of decision rules for pattern classification under a family of probability measures is investigated. It is shown that uniform boundedness of the metric entropy of the class of decision rules is both necessary and sufficient for learnability if the family of probability measures is either compact, or contains an interior point, with respect to total variation metric. Then it is shown that learnability is preserved under finite unions of families of probability measures, and also that learnability with respect to each of a finite number of measures implies learnability with respect to the convex hull of the families of \"commensurate\" probability measures.<<ETX>>","PeriodicalId":331390,"journal":{"name":"Proceedings of 1994 IEEE International Symposium on Information Theory","volume":"37 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120884995","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
Fast parallel algorithms for decoding Reed-Solomon codes 快速并行算法解码里德-所罗门码
Proceedings of 1994 IEEE International Symposium on Information Theory Pub Date : 1994-06-27 DOI: 10.1109/ISIT.1994.394851
D. Dabiri, I. Blake
{"title":"Fast parallel algorithms for decoding Reed-Solomon codes","authors":"D. Dabiri, I. Blake","doi":"10.1109/ISIT.1994.394851","DOIUrl":"https://doi.org/10.1109/ISIT.1994.394851","url":null,"abstract":"New algorithms for decoding Reed-Solomon (RS) codes based on remainder polynomials are given. The algorithms solve the Welch-Berlekamp (1983) equations and have a parallel structure suitable for systolic implementation on a linear array of processors.<<ETX>>","PeriodicalId":331390,"journal":{"name":"Proceedings of 1994 IEEE International Symposium on Information Theory","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120953991","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
Convexity of error probability in binary scalar detection 二进制标量检测中误差概率的凸性
Proceedings of 1994 IEEE International Symposium on Information Theory Pub Date : 1994-06-27 DOI: 10.1109/ISIT.1994.395084
M. Azizoglu
{"title":"Convexity of error probability in binary scalar detection","authors":"M. Azizoglu","doi":"10.1109/ISIT.1994.395084","DOIUrl":"https://doi.org/10.1109/ISIT.1994.395084","url":null,"abstract":"This paper obtains results on the convexity of error probability in the detection of binary-valued scalar signals corrupted by additive noise. It is shown that the error probability of the maximum likelihood receiver is a convex function of the signal-to-noise ratio (SNR) when the noise has a unimodal, differentiable probability density function. This result has some interesting implications on the optimum strategies of the transmitter and the jammer, as well as the optimal use of multiple channels.<<ETX>>","PeriodicalId":331390,"journal":{"name":"Proceedings of 1994 IEEE International Symposium on Information Theory","volume":"2022 17","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120967835","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
A practical demodulator for continuous phase modulation 一个实用的连续相位调制解调器
Proceedings of 1994 IEEE International Symposium on Information Theory Pub Date : 1994-06-27 DOI: 10.1109/ISIT.1994.394860
M.H.M. Costa
{"title":"A practical demodulator for continuous phase modulation","authors":"M.H.M. Costa","doi":"10.1109/ISIT.1994.394860","DOIUrl":"https://doi.org/10.1109/ISIT.1994.394860","url":null,"abstract":"A simple method to coherently demodulate continuous phase modulation (CPM) is described, assuming carrier and symbol synchronisation. Maximum likelihood CPM receivers typically employ a metric acquisition stage followed by a maximum likelihood sequence estimator, e.g., a Viterbi decoder. For optimal demodulation, the receiver must estimate the signal component along each possible transmitted waveform, which may require a large number of matched filters. In general, 2M/sup L/ filters are necessary, where L is the length of the frequency pulses in symbol periods, and M is the number of symbols transmitted per interval. An alternative to reduce the number of matched filters is to exploit the linear dependence among signals. The proposed method is illustrated with an example of continuous phase frequency shift keying (CPFSK).<<ETX>>","PeriodicalId":331390,"journal":{"name":"Proceedings of 1994 IEEE International Symposium on Information Theory","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116636274","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
Topological stochastic grammars 拓扑随机语法
Proceedings of 1994 IEEE International Symposium on Information Theory Pub Date : 1994-06-27 DOI: 10.1109/ISIT.1994.394777
M. Alder, C. Desilva, R. Mclaughlin
{"title":"Topological stochastic grammars","authors":"M. Alder, C. Desilva, R. Mclaughlin","doi":"10.1109/ISIT.1994.394777","DOIUrl":"https://doi.org/10.1109/ISIT.1994.394777","url":null,"abstract":"King Sun Fu (1982) has discussed the need for recognising that human pattern recognition is syntactic. When the human eye reads a character, there is evidence that the character is decomposed into 'strokes' and that the relationship between the components is coded in some way. Similar observations have been made by Pavlidis (1977) and others. The program inaugurated by Fu demanded the use of string grammar inference and an arguably premature discretisation process, and has foundered on both technical theoretical and practical grounds. We argue that we can pursue Fu's quest by formulating a theory of topological stochastic grammars, in which the discretisation arises from the data, and where the model is a continuous one.<<ETX>>","PeriodicalId":331390,"journal":{"name":"Proceedings of 1994 IEEE International Symposium on Information Theory","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121798187","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
Finite precision decorrelating receivers for multi-user CDMA communication systems 多用户CDMA通信系统的有限精度解相关接收机
Proceedings of 1994 IEEE International Symposium on Information Theory Pub Date : 1994-06-27 DOI: 10.1109/ISIT.1994.394740
Bernd-Peter Paris
{"title":"Finite precision decorrelating receivers for multi-user CDMA communication systems","authors":"Bernd-Peter Paris","doi":"10.1109/ISIT.1994.394740","DOIUrl":"https://doi.org/10.1109/ISIT.1994.394740","url":null,"abstract":"Linear decorrelating receivers for direct-sequence spread spectrum multiple access communication systems appear to be the most promising candidates for practical implementations of multi-user detectors. Decorrelating receivers compare favorably to other receiver structures because they are optimally near-far resistant, they do not require knowledge of the received signal amplitudes, and their computational complexity is on the same order as that of the conventional matched filter detector. However, in general optimum single user decorrelating receivers correlate the received signal with a sequence of real numbers and complexity comparisons did not reflect the need for a floating point multiplier in optimum decorrelating receivers. The authors focus on the problem of demodulating a single user's signal in a multi-user environment. More specifically, they investigate the question whether it is possible to design single-user receivers which are identical in structure and complexity to the conventional matched filter receiver.<<ETX>>","PeriodicalId":331390,"journal":{"name":"Proceedings of 1994 IEEE International Symposium on Information Theory","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123863251","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
Semi-feedback for the binary multiplying channel 二进制相乘信道的半反馈
Proceedings of 1994 IEEE International Symposium on Information Theory Pub Date : 1994-06-27 DOI: 10.1109/ISIT.1994.394693
J. Schalkwijk, H. B. Meeuwissen
{"title":"Semi-feedback for the binary multiplying channel","authors":"J. Schalkwijk, H. B. Meeuwissen","doi":"10.1109/ISIT.1994.394693","DOIUrl":"https://doi.org/10.1109/ISIT.1994.394693","url":null,"abstract":"In his paper on two-way channels (TWC) Shannon (1961) derived the so-called inner and outer bound region. For a TWC without feedback the outer bound coincides with the inner bound. As a consequence, the capacity region of a TWC without feedback is equal to its inner bound. Furthermore, Shannon showed that for the binary multiplying channel (BMC) the inner and outer bound are different. Dueck (1980) also proved the existence of a TWC with feedback at one terminal (semi-feedback) for which the capacity region is in excess of its inner bound region. However, the BMC with semi-feedback was believed to have a capacity region that coincides with the inner bound region. Nevertheless, a semi-strategy has been constructed for the BMC that operates beyond the inner bound region. The semi-strategy is based on both the new message percolation technique of Schalkwijk (see Proceedings Joint Swedish-Russian International Workshop on Information Theory, vol.6, p. 87-91, Sweden, 1993) and the old bootstrapping technique.<<ETX>>","PeriodicalId":331390,"journal":{"name":"Proceedings of 1994 IEEE International Symposium on Information Theory","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124970012","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
Design of entropy-constrained quantizers based on coset codes 基于协集码的熵约束量化器设计
Proceedings of 1994 IEEE International Symposium on Information Theory Pub Date : 1994-06-27 DOI: 10.1109/ISIT.1994.394974
Cheng-Chieh Lee, N. Farvardin
{"title":"Design of entropy-constrained quantizers based on coset codes","authors":"Cheng-Chieh Lee, N. Farvardin","doi":"10.1109/ISIT.1994.394974","DOIUrl":"https://doi.org/10.1109/ISIT.1994.394974","url":null,"abstract":"Asymptotic vector quantization (VQ) theory indicates that at high rates, the optimal VQ uniformly places its reproduction vectors in the high dimensional space in a manner that each of the quantization cells is made as spherical as possible. As compared with scalar quantizers whose quantization cells are cubic, VQ exploits the space-filling efficiency of its constituent convex polytope and hence achieves the so-called granular gain.<<ETX>>","PeriodicalId":331390,"journal":{"name":"Proceedings of 1994 IEEE International Symposium on Information Theory","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125123398","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
首页 上一页
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学术官方微信