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

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

筛选
英文 中文
Thresholds for turbo codes turbo码的阈值
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-06-25 DOI: 10.1109/ISIT.2000.866615
T. Richardson, R. Urbanke
{"title":"Thresholds for turbo codes","authors":"T. Richardson, R. Urbanke","doi":"10.1109/ISIT.2000.866615","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866615","url":null,"abstract":"We prove the existence of thresholds for turbo codes and we prove concentration of the performance of turbo codes within the ensemble determined by the random interleaver. In effect, we show that the results obtained for low-density parity-check codes extend to turbo codes. The main technical innovation is to rigorously show that dependence of output extrinsic information on input priors decays with distance along the trellis. In an infinitely long turbo code the densities of the extrinsic information fulfill a certain symmetry condition which we call the consistency condition. This condition provides the basis for an efficient Monte-Carlo algorithm for the determination of thresholds for turbo codes. Thresholds of all symmetric parallel concatenated codes of memory up to 6 have been determined.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124758763","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}
引用次数: 42
On error-free filtering under dependent distortions 相关失真下的无误差滤波
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-06-25 DOI: 10.1109/ISIT.2000.866657
M. Pinsker, V.V. Prelov
{"title":"On error-free filtering under dependent distortions","authors":"M. Pinsker, V.V. Prelov","doi":"10.1109/ISIT.2000.866657","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866657","url":null,"abstract":"The problem of error-tree filtering for a discrete-time, stationary, singular, stochastic process X={X/sub n/} from observations Y={Y/sub n/} in the case of dependent distortions, i.e., where the pair (X,Y) forms a jointly stationary process is considered.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124815384","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
Interleavers for unpunctured symmetric turbo codes 非穿孔对称turbo码的交织器
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-06-25 DOI: 10.1109/ISIT.2000.866748
J. A. Briffa, Victor Buttigieg
{"title":"Interleavers for unpunctured symmetric turbo codes","authors":"J. A. Briffa, Victor Buttigieg","doi":"10.1109/ISIT.2000.866748","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866748","url":null,"abstract":"The turbo code interleaver design problem is considered for relatively large block sizes, where the effect of trellis termination is less marked. An optimised interleaver design technique based on simulated annealing is proposed. The performance is significantly better than the Berrou-Glavieux interleaver without an increase in delay.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129416098","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
Iterating the Arimoto-Blahut algorithm for faster convergence 迭代Arimoto-Blahut算法以获得更快的收敛速度
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-06-25 DOI: 10.1109/ISIT.2000.866533
J. Sayir
{"title":"Iterating the Arimoto-Blahut algorithm for faster convergence","authors":"J. Sayir","doi":"10.1109/ISIT.2000.866533","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866533","url":null,"abstract":"The Arimoto-Blahut algorithm determines the capacity of a discrete memoryless channel through an iterative process in which the input probability distribution is adapted at each iteration. While it converges towards the capacity-achieving distribution for any discrete memoryless channel, the convergence can be slow when the channel has a large input alphabet. This is unfortunate when only a small number of the input letters are assigned non-zero probabilities in the capacity-achieving distribution. If we knew which input letters will end up with a probability of zero, we could eliminate these letters and operate the algorithm on a subset of the input alphabet. The algorithm would converge towards the same solution faster. We present an algorithm which makes use of this fact to speed up the convergence of the Arimoto-Blahut algorithm in such situations.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128480526","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
Soft decision decoding of Reed Solomon codes 软判决解码里德所罗门码
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-06-25 DOI: 10.1109/ISIT.2000.866352
V. Ponnampalam, B. Vucetic
{"title":"Soft decision decoding of Reed Solomon codes","authors":"V. Ponnampalam, B. Vucetic","doi":"10.1109/ISIT.2000.866352","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866352","url":null,"abstract":"The paper presents a maximum likelihood decoding (MLD) and a sub-optimum decoding algorithm for Reed-Solomon codes. The proposed algorithms are based on the algebraic structure of RS codes represented in GF(2). Theoretical bounds on the performance are derived and shown to be accurate. The proposed sub-optimum algorithm is seen to have better error performance compared to other sub-optimum decoding algorithms while the new MLD algorithm has significantly lower decoding complexity when compared to other MLD algorithms.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128265400","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
On point-to-point communication networks 在点对点通信网络上
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-06-25 DOI: 10.1109/ISIT.2000.866311
Lihua Song, R. Yeung
{"title":"On point-to-point communication networks","authors":"Lihua Song, R. Yeung","doi":"10.1109/ISIT.2000.866311","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866311","url":null,"abstract":"A point-to-point communication network is represented by (G,C), where G=(V,/spl epsiv/) is a directed graph with vertex set V and edge set /spl epsiv/, and C=[C/sub ij/,(i,j)/spl isin//spl epsiv/] is a nonnegative-valued vector. A vertex in V represents a node in the communication network, and an edge (i,j) represents a point-to-point discrete memoryless channel (DMC) from node i to node j whose capacity is C/sub ij/. We assume that the channels in the network are independent of each other. An information source with entropy rate h is generated at source node /spl delta/ and recovered at sink node t with arbitrarily small probability of error. We show that the value of a max-flow from node /spl delta/ to node t in (G,C) must be greater than or equal to h. This results implies a separation theorem for network coding and channel coding in such a communication network.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128621764","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
Pruned convolutional codes for flexible unequal error protection against insertion/deletion/reversal errors 针对插入/删除/反转错误的灵活不等错误保护的修剪卷积码
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-06-25 DOI: 10.1109/ISIT.2000.866558
B. Brink, H. C. Ferreira, W. A. Clarke
{"title":"Pruned convolutional codes for flexible unequal error protection against insertion/deletion/reversal errors","authors":"B. Brink, H. C. Ferreira, W. A. Clarke","doi":"10.1109/ISIT.2000.866558","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866558","url":null,"abstract":"The class of punctured convolutional codes were first constructed by starting with low rate convolutional codes, and by periodically puncturing single bits out of some code symbols in a time varying trellis diagram. Thus, simplified Viterbi decoders could decode the resulting codes, with only two branches entering each state in the trellis diagram. This concept was ingeniously extended by J. Hagenhauer (1988) to construct incrementally variable rate codes for unequal error protection. Here we somewhat reverse the above procedure, and name the resulting codes \"pruned codes\". We start with optimal high rate convolutional codes, and periodically delete complete code symbols and branches to obtain a time varying trellis diagram. Hence, lower rate codes capable also of correcting insertions and deletions can be constructed.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128642527","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}
引用次数: 9
Space-time codes based on rank codes 基于等级码的空时码
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-06-25 DOI: 10.1109/ISIT.2000.866582
E. Gabidulin, M. Bossert, P. Lusina
{"title":"Space-time codes based on rank codes","authors":"E. Gabidulin, M. Bossert, P. Lusina","doi":"10.1109/ISIT.2000.866582","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866582","url":null,"abstract":"The application of maximum rank distance (MRD) codes is investigated with respect to the space-time code scenario. A construction method is presented based on primitive polynomials over extended Galois fields. A one-to-one mapping is then performed between the Galois field code symbols and the complex transmission symbols.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129364809","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}
引用次数: 31
Collusion-secure fingerprinting and B/sub 2/-sequences 合谋安全指纹识别和B/sub 2/-序列
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-06-25 DOI: 10.1109/ISIT.2000.866540
G. Cohen, S. Litsyn, G. Zémor
{"title":"Collusion-secure fingerprinting and B/sub 2/-sequences","authors":"G. Cohen, S. Litsyn, G. Zémor","doi":"10.1109/ISIT.2000.866540","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866540","url":null,"abstract":"We discuss a strategy initiated by Boneh and Shaw (see IEEE Trans. Inform. Theory, vol.44, p.1897-1905, 1998) for collusion-secure fingerprinting. We show that under this strategy, finding fingerprinting schemes that resist coalitions of two users amounts to finding B/sub 2/-sequences of binary vectors. A sequence of vectors v/sub 1/, v/sub 2/,..., v/sub n/ is a B/sub 2/-sequence if all sums v/sub i/+v/sub j/, 1/spl les/i/spl les/j/spl les/n, are different: the associated extremal set-theoretic problem is what is the maximal size of a B/sub 2/-sequence? We shed new light on this old combinatorial problem and improve on previously known upper bounds.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129542663","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
Cycle length distributions in graphical models for iterative decoding 迭代译码图形模型中的周期长度分布
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-06-25 DOI: 10.1109/ISIT.2000.866440
Xianping Ge, D. Eppstein, Padhraic Smyth
{"title":"Cycle length distributions in graphical models for iterative decoding","authors":"Xianping Ge, D. Eppstein, Padhraic Smyth","doi":"10.1109/ISIT.2000.866440","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866440","url":null,"abstract":"This paper analyses the distribution of cycle lengths in turbo decoding graphs. It is known that the widely-used iterative decoding algorithm for turbo codes is in fact a special case of a quite general local message-passing algorithm for efficiently computing posterior probabilities in acyclic directed graphical (ADG) models (also known as \"belief networks\"). However, this local message-passing algorithm in theory only works for graphs with no cycles. Why it works in practice (i.e., performs near-optimally in terms of bit decisions) on ADGs for turbo codes is not well understood since turbo decoding graphs can have many cycles.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129579609","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学术官方微信