Pub Date : 2001-06-24DOI: 10.1109/ISIT.2001.936067
K. Nakagawa
We give a sufficient condition for the exponential decay of the tail of a discrete probability distribution. We focus on analytic properties of the probability generating function of a discrete probability distribution, especially the radius of convergence and the number of poles on the circle of convergence. The result is applied to an M/G/1 type Markov chain to provide a weak sufficient condition for the exponential decay of the tail of the stationary distribution. We give a counter example for the Proposition 1 of Glynn and Whitt (1994), which insists a "better result" than in this paper. Furthermore, we give an example of an M/G/1 type Markov chain such that the tail of its stationary distribution does not decay exponentially.
给出了离散概率分布尾部指数衰减的一个充分条件。重点讨论离散概率分布的概率生成函数的解析性质，特别是收敛半径和收敛圆上的极点数。将结果应用于M/G/1型马尔可夫链，为平稳分布尾部指数衰减提供了一个弱充分条件。我们以Glynn and Whitt(1994)的Proposition 1作为反例，它坚持比本文“更好的结果”。进一步，我们给出了M/G/1型马尔可夫链的一个例子，使其平稳分布的尾部不呈指数衰减。
{"title":"On the exponential decay rate of the tail of a queue length distribution","authors":"K. Nakagawa","doi":"10.1109/ISIT.2001.936067","DOIUrl":"https://doi.org/10.1109/ISIT.2001.936067","url":null,"abstract":"We give a sufficient condition for the exponential decay of the tail of a discrete probability distribution. We focus on analytic properties of the probability generating function of a discrete probability distribution, especially the radius of convergence and the number of poles on the circle of convergence. The result is applied to an M/G/1 type Markov chain to provide a weak sufficient condition for the exponential decay of the tail of the stationary distribution. We give a counter example for the Proposition 1 of Glynn and Whitt (1994), which insists a \"better result\" than in this paper. Furthermore, we give an example of an M/G/1 type Markov chain such that the tail of its stationary distribution does not decay exponentially.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131244370","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}
Pub Date : 2001-06-24DOI: 10.1109/ISIT.2001.935939
B. Ryabko, J. Suzuki
The asymptotic performance of the multilevel pattern matching (MPM) code and a Lempel-Ziv'77 (LZ) code are compared. It is known that both codes have the Shannon entropy as the asymptotic performance if they are employed for stationary ergodic sources, but the redundancy of MPM is less than that of LZ. It is shown that there exists a large set of sequences that can be compressed well by LZ but cannot be compressed by MPM.
{"title":"Comparing the multilevel pattern matching code and the Lempel-Ziv codes","authors":"B. Ryabko, J. Suzuki","doi":"10.1109/ISIT.2001.935939","DOIUrl":"https://doi.org/10.1109/ISIT.2001.935939","url":null,"abstract":"The asymptotic performance of the multilevel pattern matching (MPM) code and a Lempel-Ziv'77 (LZ) code are compared. It is known that both codes have the Shannon entropy as the asymptotic performance if they are employed for stationary ergodic sources, but the redundancy of MPM is less than that of LZ. It is shown that there exists a large set of sequences that can be compressed well by LZ but cannot be compressed by MPM.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133494568","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}
Pub Date : 2001-06-24DOI: 10.1109/ISIT.2001.935976
Yu-Sun Liu
An easy-to-use analytical method for finite population frequency-hop networks with locally adaptive retransmission backoff is developed. This method offers insight into the system dynamics without solving nonlinear equations. By using this method, it is shown that exponential backoff policy with small minimum retransmission probability is stable and its throughput is not too far away from the optimum, if the code block length is small and the number of users is not unreasonably large. Finally, the accuracy of the method is verified by extensive simulation results.
{"title":"Performance analysis of frequency-hop packet radio networks with adaptive retransmission backoff","authors":"Yu-Sun Liu","doi":"10.1109/ISIT.2001.935976","DOIUrl":"https://doi.org/10.1109/ISIT.2001.935976","url":null,"abstract":"An easy-to-use analytical method for finite population frequency-hop networks with locally adaptive retransmission backoff is developed. This method offers insight into the system dynamics without solving nonlinear equations. By using this method, it is shown that exponential backoff policy with small minimum retransmission probability is stable and its throughput is not too far away from the optimum, if the code block length is small and the number of users is not unreasonably large. Finally, the accuracy of the method is verified by extensive simulation results.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"152 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132719278","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}
Pub Date : 2001-06-24DOI: 10.1109/ISIT.2001.936021
K. Foltz, Jehoshua Bruck
We consider two ways to send items over a broadcast channel and compare them using the metric of expected waiting time. The first is frequency division, where each item is broadcast on its own subchannel of lower bandwidth. We find the optimal allocation of bandwidth to the subchannels for this method. Then we look at time division, where items are sent sequentially on a single full-bandwidth channel. We show that for any frequency division broadcast schedule, we can find a better time division schedule. Thus time division is better than frequency division.
{"title":"Time division is better than frequency division for periodic Internet broadcast of dynamic data","authors":"K. Foltz, Jehoshua Bruck","doi":"10.1109/ISIT.2001.936021","DOIUrl":"https://doi.org/10.1109/ISIT.2001.936021","url":null,"abstract":"We consider two ways to send items over a broadcast channel and compare them using the metric of expected waiting time. The first is frequency division, where each item is broadcast on its own subchannel of lower bandwidth. We find the optimal allocation of bandwidth to the subchannels for this method. Then we look at time division, where items are sent sequentially on a single full-bandwidth channel. We show that for any frequency division broadcast schedule, we can find a better time division schedule. Thus time division is better than frequency division.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133207304","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}
Pub Date : 2001-06-24DOI: 10.1109/ISIT.2001.936059
Pascal Frossard, Pierre Vandegheynst
Compression efficiency is mainly driven by redundancy of the overcomplete set of functions chosen for non-orthogonal signal decompositions. Redundancy is an important criteria in the design of dictionaries, whose size only provides a first indication without however taking into account the distribution of the atoms. This paper provides a new formulation for the structural redundancy of an overcomplete set of functions. The structural redundancy factor directly drives the energy compaction properties of non-orthogonal transforms in frame expansion or matching pursuit.
{"title":"Redundancy in non-orthogonal transforms","authors":"Pascal Frossard, Pierre Vandegheynst","doi":"10.1109/ISIT.2001.936059","DOIUrl":"https://doi.org/10.1109/ISIT.2001.936059","url":null,"abstract":"Compression efficiency is mainly driven by redundancy of the overcomplete set of functions chosen for non-orthogonal signal decompositions. Redundancy is an important criteria in the design of dictionaries, whose size only provides a first indication without however taking into account the distribution of the atoms. This paper provides a new formulation for the structural redundancy of an overcomplete set of functions. The structural redundancy factor directly drives the energy compaction properties of non-orthogonal transforms in frame expansion or matching pursuit.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124287214","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}
Pub Date : 2001-06-24DOI: 10.1109/ISIT.2001.936181
A. Krause, A. Sella, Yair Be’ery
The recently presented geometric interpretation of turbo-decoding has founded a framework for the analysis of decoding parallel-concatenated codes. We extend this analytical basis for the case of decoding serially concatenated codes, and focus on product codes (i.e., product codes with checks on checks). For this case, the extrinsic information should be calculated not only for the information bits, but also for the check bits, and we extend the theory accordingly. We show how the analysis tools can be adopted, and use them to investigate the convergence of product codes with check on checks: we derive a general form for the update equations, as well as expressions for the Jacobian and stability matrices. We show that these matrices can be viewed as a generalization of the corresponding matrices of parallel-concatenated product codes.
{"title":"Convergence analysis of turbo-decoding of serially concatenated product codes","authors":"A. Krause, A. Sella, Yair Be’ery","doi":"10.1109/ISIT.2001.936181","DOIUrl":"https://doi.org/10.1109/ISIT.2001.936181","url":null,"abstract":"The recently presented geometric interpretation of turbo-decoding has founded a framework for the analysis of decoding parallel-concatenated codes. We extend this analytical basis for the case of decoding serially concatenated codes, and focus on product codes (i.e., product codes with checks on checks). For this case, the extrinsic information should be calculated not only for the information bits, but also for the check bits, and we extend the theory accordingly. We show how the analysis tools can be adopted, and use them to investigate the convergence of product codes with check on checks: we derive a general form for the update equations, as well as expressions for the Jacobian and stability matrices. We show that these matrices can be viewed as a generalization of the corresponding matrices of parallel-concatenated product codes.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124326368","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}
Pub Date : 2001-06-24DOI: 10.1109/ISIT.2001.935918
G. Caire, C. Leanderson
The throughput performance of an incremental-redundancy ARQ scheme based on simple convolutional codes of rate 1/M is evaluated for the block-fading Gaussian collision channel. The performance of these codes is seen to get close to the limiting performance of binary random codes with typical set decoding.
{"title":"Throughput performance of an incremental-redundancy ARQ scheme in the block-fading Gaussian collision channel","authors":"G. Caire, C. Leanderson","doi":"10.1109/ISIT.2001.935918","DOIUrl":"https://doi.org/10.1109/ISIT.2001.935918","url":null,"abstract":"The throughput performance of an incremental-redundancy ARQ scheme based on simple convolutional codes of rate 1/M is evaluated for the block-fading Gaussian collision channel. The performance of these codes is seen to get close to the limiting performance of binary random codes with typical set decoding.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114385454","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}
Pub Date : 2001-06-24DOI: 10.1109/ISIT.2001.936039
J. Wolfmann
We determine all binary cyclic codes of length 2n with n odd which are Nechaev-Gray (1989, 1991) images of cyclic codes over Z/sub 4/ and we present several families of such codes.
{"title":"Binary cyclic codes which are Z/sub 4/-cyclic codes","authors":"J. Wolfmann","doi":"10.1109/ISIT.2001.936039","DOIUrl":"https://doi.org/10.1109/ISIT.2001.936039","url":null,"abstract":"We determine all binary cyclic codes of length 2n with n odd which are Nechaev-Gray (1989, 1991) images of cyclic codes over Z/sub 4/ and we present several families of such codes.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117351126","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}
Pub Date : 2001-06-24DOI: 10.1109/ISIT.2001.935942
F. Topsoe
We present an algorithm of low complexity which determines exactly the optimal predictor for the model of order preserving distributions on a large class of trees. No closed formula for this problem exists.
{"title":"Exact prediction and universal coding for trees","authors":"F. Topsoe","doi":"10.1109/ISIT.2001.935942","DOIUrl":"https://doi.org/10.1109/ISIT.2001.935942","url":null,"abstract":"We present an algorithm of low complexity which determines exactly the optimal predictor for the model of order preserving distributions on a large class of trees. No closed formula for this problem exists.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116241251","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}
Pub Date : 2001-06-24DOI: 10.1109/ISIT.2001.936048
Honggang Li, Qiao Wang, Lenan Wu
The second order sampling was proposed by Kohnlenberg (1953), and Wang rebuilt it on a translation invariance view point. In this paper, we study the stability of this sampling scheme for band-pass signals, discuss some properties of sampling functions, and give the optimal phase shift to reduce the condition number.
{"title":"Second order sampling with optimal phase shift for band-pass signals","authors":"Honggang Li, Qiao Wang, Lenan Wu","doi":"10.1109/ISIT.2001.936048","DOIUrl":"https://doi.org/10.1109/ISIT.2001.936048","url":null,"abstract":"The second order sampling was proposed by Kohnlenberg (1953), and Wang rebuilt it on a translation invariance view point. In this paper, we study the stability of this sampling scheme for band-pass signals, discuss some properties of sampling functions, and give the optimal phase shift to reduce the condition number.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"134 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123455127","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：