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

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

筛选
英文 中文
A direct geometrical method for bounding the error exponent for families of trellis channel codes 栅格信道码族误差指数边界的直接几何方法
Proceedings of 1994 IEEE International Symposium on Information Theory Pub Date : 1994-06-27 DOI: 10.1109/ISIT.1994.394986
V. Šenk, D. Lazic, D. Drajic
{"title":"A direct geometrical method for bounding the error exponent for families of trellis channel codes","authors":"V. Šenk, D. Lazic, D. Drajic","doi":"10.1109/ISIT.1994.394986","DOIUrl":"https://doi.org/10.1109/ISIT.1994.394986","url":null,"abstract":"Noting that a trellis code is a union of sub-block codes of different length, the error exponent of the families of trellis codes with known distance distribution of its sub-block codes is determined. The approach allows the analysis of the effect of memory length and of parallel transitions.<<ETX>>","PeriodicalId":331390,"journal":{"name":"Proceedings of 1994 IEEE International Symposium on Information Theory","volume":"76 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":"124998762","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
Conditional entropy-constrained vector quantization: high-rate theory and design algorithms 条件熵约束向量量化:高速率理论和设计算法
Proceedings of 1994 IEEE International Symposium on Information Theory Pub Date : 1994-06-27 DOI: 10.1109/ISIT.1994.394979
D. Garrido, W. Pearlman
{"title":"Conditional entropy-constrained vector quantization: high-rate theory and design algorithms","authors":"D. Garrido, W. Pearlman","doi":"10.1109/ISIT.1994.394979","DOIUrl":"https://doi.org/10.1109/ISIT.1994.394979","url":null,"abstract":"The performance of optimum vector quantizers subject to a conditional entropy constraint is studied in this work.<<ETX>>","PeriodicalId":331390,"journal":{"name":"Proceedings of 1994 IEEE International Symposium on Information Theory","volume":"1 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":"129691062","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
A lower bound on the probability of erasure for an anti-jamming code when used on the binary OR-channel 在二进制或信道上使用的抗干扰码的擦除概率的下界
Proceedings of 1994 IEEE International Symposium on Information Theory Pub Date : 1994-06-27 DOI: 10.1109/ISIT.1994.395094
G. Hedby
{"title":"A lower bound on the probability of erasure for an anti-jamming code when used on the binary OR-channel","authors":"G. Hedby","doi":"10.1109/ISIT.1994.395094","DOIUrl":"https://doi.org/10.1109/ISIT.1994.395094","url":null,"abstract":"An anti-jamming code consists of a set of codes obtained from the coset partitioning of a larger code. The code is used over a binary OR-channel subject to intentional interference. We derive a lower bound on the probability of erasing a codeword.<<ETX>>","PeriodicalId":331390,"journal":{"name":"Proceedings of 1994 IEEE International Symposium on Information Theory","volume":"10 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":"128642370","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
Performance evaluation method for trellis modulation code without uniformity 非均匀栅格调制码的性能评价方法
Proceedings of 1994 IEEE International Symposium on Information Theory Pub Date : 1994-06-27 DOI: 10.1109/ISIT.1994.394682
H. Ogiwara, Kazuo Oohira
{"title":"Performance evaluation method for trellis modulation code without uniformity","authors":"H. Ogiwara, Kazuo Oohira","doi":"10.1109/ISIT.1994.394682","DOIUrl":"https://doi.org/10.1109/ISIT.1994.394682","url":null,"abstract":"Zehavi and Wolf (Z-W) proposed an evaluation method for a trellis modulation code (see IEEE Trans. Inform. Theory, vol.IT-33, p.196, 1987). By the method, code performance is evaluated based on the error state transition diagram, of which structure is equal to that of the code. It is applied to a rate k/(k+1) code generated by a Massey type encoder. It is only applied to a code having certain symmetry called uniformity. Another definition of uniformity is proposed by Biglieri and McLane (1991) for the same problem. Here, we propose an extension of the methods. The restriction of uniformity is removed by modifying the labels of state transitions in the Z-W's error state diagram.<<ETX>>","PeriodicalId":331390,"journal":{"name":"Proceedings of 1994 IEEE International Symposium on Information Theory","volume":"16 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":"127340197","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
Entropy splitting hypergraphs 熵分裂超图
Proceedings of 1994 IEEE International Symposium on Information Theory Pub Date : 1994-06-27 DOI: 10.1109/ISIT.1994.394705
G. Simonyi
{"title":"Entropy splitting hypergraphs","authors":"G. Simonyi","doi":"10.1109/ISIT.1994.394705","DOIUrl":"https://doi.org/10.1109/ISIT.1994.394705","url":null,"abstract":"Hypergraph entropy is a sub-additive functional on hypergraphs. We characterize those uniform hypergraphs F for which the entropy of F and the entropy of its complement adds up exactly to the entropy of the complete uniform hypergraph. Hypergraph entropy is an information theoretic functional on a hypergraph with a probability distribution on its vertex set. It is a generalisation of graph entropy.<<ETX>>","PeriodicalId":331390,"journal":{"name":"Proceedings of 1994 IEEE International Symposium on Information Theory","volume":"1 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":"130074217","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
Reduced-state sequence estimation of digital sequence in the presence of intersymbol interference using state partitioning 利用状态划分方法对存在码间干扰的数字序列进行状态估计
Proceedings of 1994 IEEE International Symposium on Information Theory Pub Date : 1994-06-27 DOI: 10.1109/ISIT.1994.394820
R. Kamel, Y. Bar-Ness
{"title":"Reduced-state sequence estimation of digital sequence in the presence of intersymbol interference using state partitioning","authors":"R. Kamel, Y. Bar-Ness","doi":"10.1109/ISIT.1994.394820","DOIUrl":"https://doi.org/10.1109/ISIT.1994.394820","url":null,"abstract":"A reduced-state sequence estimator for linear dispersive channels is described. The technique is based on partitioning the set of all possible channel states in a way that defines a trellis with fewer states resulting in reduced complexity. The new technique results in a generalization of trellises that were previously obtained in Duel-Hallen and Heegard (IEEE Trans. on Communications, vol. COM 37, p.428-36). The Viterbi algorithm (VA) is used to search for the best path through the reduced state trellis.<<ETX>>","PeriodicalId":331390,"journal":{"name":"Proceedings of 1994 IEEE International Symposium on Information Theory","volume":"21 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":"130103170","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
Synchronous DS-SSMA with improved decorrelating decision-feedback multiuser detection 改进去相关决策反馈多用户检测的同步DS-SSMA
Proceedings of 1994 IEEE International Symposium on Information Theory Pub Date : 1994-06-27 DOI: 10.1109/ISIT.1994.394839
Lei Wei, C. Schlegel
{"title":"Synchronous DS-SSMA with improved decorrelating decision-feedback multiuser detection","authors":"Lei Wei, C. Schlegel","doi":"10.1109/ISIT.1994.394839","DOIUrl":"https://doi.org/10.1109/ISIT.1994.394839","url":null,"abstract":"Several multiuser detectors for direct sequence spread-spectrum multiple-access (DS-SSMA) systems have been. Of particular interest is the decorrelating decision-feedback detector (DDFD). It employs forward decorrelating and feedback filters to cancel multiuser interference. The DDFD has several disadvantages. The paper addresses these problems and an improved DDFD, whose complexity is linear in the number of users is proposed.<<ETX>>","PeriodicalId":331390,"journal":{"name":"Proceedings of 1994 IEEE International Symposium on Information Theory","volume":"68 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":"128906065","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}
引用次数: 20
On a standard convexity argument in multi-user information theory 多用户信息论中的一个标准凸性论证
Proceedings of 1994 IEEE International Symposium on Information Theory Pub Date : 1994-06-27 DOI: 10.1109/ISIT.1994.394911
Raymond W. Yeung
{"title":"On a standard convexity argument in multi-user information theory","authors":"Raymond W. Yeung","doi":"10.1109/ISIT.1994.394911","DOIUrl":"https://doi.org/10.1109/ISIT.1994.394911","url":null,"abstract":"We clarify a standard convexity argument often invoked in the proof of the converse of a coding theorem in multi-user information theory, and bring out an interesting problem regarding mixing similar polytopes.<<ETX>>","PeriodicalId":331390,"journal":{"name":"Proceedings of 1994 IEEE International Symposium on Information Theory","volume":"10 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":"132409071","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
Universal source coding with a fidelity criterion 具有保真标准的通用源代码
Proceedings of 1994 IEEE International Symposium on Information Theory Pub Date : 1994-06-27 DOI: 10.1109/ISIT.1994.395005
E. Kurtas, M. Salehi
{"title":"Universal source coding with a fidelity criterion","authors":"E. Kurtas, M. Salehi","doi":"10.1109/ISIT.1994.395005","DOIUrl":"https://doi.org/10.1109/ISIT.1994.395005","url":null,"abstract":"Proposes a variable rate vector quantization algorithm which can adapt itself to variations in the source statistics by progressively updating the individual codewords. The proposed algorithm optimally parses the incoming source vectors and then quantizes them accordingly. After each quantization step, codeword updating is performed to track changes in the source statistics. No knowledge of the source statistics is assumed and no side information is transmitted.<<ETX>>","PeriodicalId":331390,"journal":{"name":"Proceedings of 1994 IEEE International Symposium on Information Theory","volume":"56 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":"132423084","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
Anti-jamming on the OR-channel or通道抗干扰
Proceedings of 1994 IEEE International Symposium on Information Theory Pub Date : 1994-06-27 DOI: 10.1109/ISIT.1994.395095
C.C. Jonsson
{"title":"Anti-jamming on the OR-channel","authors":"C.C. Jonsson","doi":"10.1109/ISIT.1994.395095","DOIUrl":"https://doi.org/10.1109/ISIT.1994.395095","url":null,"abstract":"We propose a frequency hopping scheme with M-ary frequency shift keying applied to the OR-channel and give its error and erasure probabilities. Asymptotically, the bit error probability is bounded away from zero whereas it polynomially tends to zero for our previously proposed generalized scheme.<<ETX>>","PeriodicalId":331390,"journal":{"name":"Proceedings of 1994 IEEE International Symposium on Information Theory","volume":"93 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":"132893355","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学术官方微信