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

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

筛选
英文 中文
On error probabilities for convolutional codes for low signal/noise ratio 低信噪比卷积码的误差概率
Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252) Pub Date : 1998-08-16 DOI: 10.1109/ISIT.1998.708996
M. Burnashev
{"title":"On error probabilities for convolutional codes for low signal/noise ratio","authors":"M. Burnashev","doi":"10.1109/ISIT.1998.708996","DOIUrl":"https://doi.org/10.1109/ISIT.1998.708996","url":null,"abstract":"Some new approaches to error performance investigation for low signal/noise ratio are proposed. As an example some new upper bounds for the first-error event and bit-error probabilities are presented.","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":"132890761","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
An information-theoretic characterization of Markov random fields and its applications 马尔可夫随机场的信息论表征及其应用
Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252) Pub Date : 1998-08-16 DOI: 10.1109/ISIT.1998.708657
Raymond W. Yeung, Tony T. Lee, Z. Ye
{"title":"An information-theoretic characterization of Markov random fields and its applications","authors":"Raymond W. Yeung, Tony T. Lee, Z. Ye","doi":"10.1109/ISIT.1998.708657","DOIUrl":"https://doi.org/10.1109/ISIT.1998.708657","url":null,"abstract":"We obtain a non-redundant characterization of a Markov random field (MRF) in terms of the unconditional joint entropies of the random variables involved. A canonical form for information expressions conditioning on a MRF is identified, and the dimension of the Shannon's information measures of a MRF is determined.","PeriodicalId":133728,"journal":{"name":"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","volume":"51 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":"133347406","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
Coding theorems of quantum information theory 量子信息理论的编码定理
Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252) Pub Date : 1998-08-16 DOI: 10.1109/ISIT.1998.708670
H. Yuen
{"title":"Coding theorems of quantum information theory","authors":"H. Yuen","doi":"10.1109/ISIT.1998.708670","DOIUrl":"https://doi.org/10.1109/ISIT.1998.708670","url":null,"abstract":"Summary form only given. Shannon's original proof of the channel coding theorem via typical input/output sequences is presented in a sphere-packing form to determine the minimum quantum source coding rate. Let S(/spl rho/)/spl equiv/-tr/spl rho/log/spl rho/ be the Von Neumann entropy of a density operator p on a finite-dimensional space H, i/spl rarr//spl rho//sub i/ the state modulation map on an alphabet I, /spl rho/~/spl equiv//spl Sigma//sub i/p/sub i//spl rho//sub i/ the average state with respect to a prior distribution p/sub i/ on I, and S~(/spl rho//sub i/)/spl equiv//spl Sigma//sub i/p/sub i/S(/spl rho//sub i/). The minimum quantum state dimension per symbol needed to represent {/spl rho//sub i/} under {p/sub i/} with arbitrarily small error is shown to be S(/spl rho/~)-S~(/spl rho//sub i/) for a whole class of error measures. This generalizes to arbitrary mixed states the pure state result. Further generalizations of this result to arbitrary alphabet I, infinite dimensional H, as well as rate-distortion coding are presented. Channel coding for restoring quantum states is discussed with the conclusion that for typical noisy channels nonzero channel capacity cannot be obtained. Relations of these results, in particular the quantity S(/spl rho/~)-S~(/spl rho//sub i/), to classical (nonquantum) information transfer are elaborated.","PeriodicalId":133728,"journal":{"name":"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","volume":"3 37","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132747281","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}
引用次数: 14
On the error exponent for woven convolutional codes with outer warp 外经纱编织卷积码的误差指数
Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252) Pub Date : 1998-08-16 DOI: 10.1109/ISIT.1998.708995
V. Zyablov, S. Shavgulidze, O. Skopintsev, S. Höst, R. Johannesson
{"title":"On the error exponent for woven convolutional codes with outer warp","authors":"V. Zyablov, S. Shavgulidze, O. Skopintsev, S. Höst, R. Johannesson","doi":"10.1109/ISIT.1998.708995","DOIUrl":"https://doi.org/10.1109/ISIT.1998.708995","url":null,"abstract":"The error exponent and the decoding complexity of binary woven convolutional codes with outer warp and with binary convolutional codes as outer and inner codes are studied. It is shown that an error probability that is exponentially decreasing with the product of the outer and inner code memories can be achieved with a non-exponentially increasing decoding complexity.","PeriodicalId":133728,"journal":{"name":"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","volume":"44 4 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":"131445721","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}
引用次数: 13
Statistical study of the effect of the interleaver on turbo-code performance 交织器对涡轮码性能影响的统计研究
Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252) Pub Date : 1998-08-16 DOI: 10.1109/ISIT.1998.709027
Atousa H. S. Mohammadi, W. Zhuang
{"title":"Statistical study of the effect of the interleaver on turbo-code performance","authors":"Atousa H. S. Mohammadi, W. Zhuang","doi":"10.1109/ISIT.1998.709027","DOIUrl":"https://doi.org/10.1109/ISIT.1998.709027","url":null,"abstract":"In this article we evaluate the standard deviation of the union performance bound for a turbo-code over all possible interleavers of length N. The asymptotic analysis (for large N) shows that the ratio of the standard deviation to the mean value of the bound remains constant with respect to N but increases rapidly with the SNR.","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":"133845949","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
Spherical 7-design in the 2/sup n/-dimensional Euclidean space 2/sup - n维欧氏空间中的球面7-设计
Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252) Pub Date : 1998-08-16 DOI: 10.1109/ISIT.1998.708967
V. Sidelnikov
{"title":"Spherical 7-design in the 2/sup n/-dimensional Euclidean space","authors":"V. Sidelnikov","doi":"10.1109/ISIT.1998.708967","DOIUrl":"https://doi.org/10.1109/ISIT.1998.708967","url":null,"abstract":"We consider a finite subgroup /spl Theta//sub n/ of the group O(N) of orthogonal matrices, where N=2/sup n/, n=1, 2, ... . This group was defined in [4] and we use it to construct spherical designs in the 2/sup n/-dimensional Euclidean space R/sup N/. We prove that representations /spl rho//sub 1/, /spl rho//sub 2/ and /spl rho//sub 3/ of the group /spl Theta//sub n/ on the spaces of harmonic polynomials of degrees 1, 2 and 3 respectively are irreducible. This together with the earlier results [1, 3] imply that the orbit /spl Theta//sub n,2/x of any initial point x on the unit sphere S/sub N-1/ is a 7-design in the Euclidean space of dimension 2/sup n/.","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":"115488558","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
Error event characterization and coding for the equalized Lorentzian channel 均衡洛伦兹信道的错误事件表征与编码
Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252) Pub Date : 1998-08-16 DOI: 10.1109/ISIT.1998.708661
B. Moision, P. Siegel, E. Soljanin
{"title":"Error event characterization and coding for the equalized Lorentzian channel","authors":"B. Moision, P. Siegel, E. Soljanin","doi":"10.1109/ISIT.1998.708661","DOIUrl":"https://doi.org/10.1109/ISIT.1998.708661","url":null,"abstract":"Coding methods to enhance the performance of sequence estimators for an intersymbol interference (ISI) channel are presented. The ISI channel considered is modeled with a Lorentzian step response, and equalized to a finite-duration, discrete impulse response. The coding follows from a characterization of the dominant error events for a suboptimal sequence estimator which uses a Euclidean distance metric for detection of a signal in colored noise.","PeriodicalId":133728,"journal":{"name":"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","volume":"54 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":"115504365","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}
引用次数: 8
Performance of turbo-coded FH-SS with partial-band interference 部分频带干扰下涡轮编码跳频信号的性能研究
Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252) Pub Date : 1998-08-16 DOI: 10.1109/ISIT.1998.709061
J.H. Kang, W. Stark
{"title":"Performance of turbo-coded FH-SS with partial-band interference","authors":"J.H. Kang, W. Stark","doi":"10.1109/ISIT.1998.709061","DOIUrl":"https://doi.org/10.1109/ISIT.1998.709061","url":null,"abstract":"We investigate the application of turbo codes to a noncoherently received slow frequency-hopped spread spectrum (FH-SS) system with partial-band interference. The modified turbo decoder computes branch transition probabilities for cases where jamming side information is or is not available. For cases where no side information is available, we exploit the channel memory by computing channel state estimates.","PeriodicalId":133728,"journal":{"name":"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","volume":"6 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":"115623001","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
Skewness and pseudocodewords in iterative decoding 迭代译码中的偏度和伪码字
Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252) Pub Date : 1998-08-16 DOI: 10.1109/ISIT.1998.708741
B. Frey, R. Kotter, A. Vardy
{"title":"Skewness and pseudocodewords in iterative decoding","authors":"B. Frey, R. Kotter, A. Vardy","doi":"10.1109/ISIT.1998.708741","DOIUrl":"https://doi.org/10.1109/ISIT.1998.708741","url":null,"abstract":"Impressive performances by low-density parity-check codes and turbo codes have inspired researchers to determine how their iterative decoders depart from optimal decoding. Iterative decoding can be viewed as the application of the sum-product or min-sum algorithm in a graph that describes the constraints on a system of variables. The authors discuss here how iterative decoding maximizes correlation, and skewness and pseudocodewords in the decoding tree.","PeriodicalId":133728,"journal":{"name":"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","volume":"76 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":"115656026","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}
引用次数: 32
Iterative multiuser detector with antenna array: an EM-based approach 天线阵列的迭代多用户探测器:一种基于电磁的方法
Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252) Pub Date : 1998-08-16 DOI: 10.1109/ISIT.1998.709029
A. Chkeif, G. K. Kaleh
{"title":"Iterative multiuser detector with antenna array: an EM-based approach","authors":"A. Chkeif, G. K. Kaleh","doi":"10.1109/ISIT.1998.709029","DOIUrl":"https://doi.org/10.1109/ISIT.1998.709029","url":null,"abstract":"We consider multiuser detection using antenna array. We use both the EM algorithm and its modified version, known as the space-alternating generalized expectation-maximization (SAGE) algorithm, to iteratively estimate the direction of arrival (DOA) and the transmitted symbols for each user of the CDMA system.","PeriodicalId":133728,"journal":{"name":"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","volume":"14 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":"115740347","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学术文献互助群
群 号：481959085
Book学术官方微信