Pub Date : 2009-06-28DOI: 10.1109/ISIT.2009.5205725
S. Yüksel
A stochastic stability result for a class of adaptive quantizers which were introduced by Goodman and Gersho is presented. We consider a case where the input process is a linear Markov source which is not necessarily stable. We present a stochastic stability result for the estimation error and the quantizer, thus generalizing the stability result of Goodman and Gersho to a Markovian, and furthermore to an unstable, setting. Furthermore, it is shown that, there exists a unique invariant distribution for the state and the quantizer parameters under mild irreducibility conditions. The second moment under the invariant distribution is finite, if the system noise is Gaussian.
{"title":"Stochastic stability of adaptive quantizers for Markov sources","authors":"S. Yüksel","doi":"10.1109/ISIT.2009.5205725","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205725","url":null,"abstract":"A stochastic stability result for a class of adaptive quantizers which were introduced by Goodman and Gersho is presented. We consider a case where the input process is a linear Markov source which is not necessarily stable. We present a stochastic stability result for the estimation error and the quantizer, thus generalizing the stability result of Goodman and Gersho to a Markovian, and furthermore to an unstable, setting. Furthermore, it is shown that, there exists a unique invariant distribution for the state and the quantizer parameters under mild irreducibility conditions. The second moment under the invariant distribution is finite, if the system noise is Gaussian.","PeriodicalId":92224,"journal":{"name":"International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2009-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89471565","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 : 2009-06-28DOI: 10.1109/ISIT.2009.5205676
P. Grünwald, P. Harremoës
Disclosed herein are herbicidal pyridine compounds substituted at the 2- or 6-position with an OR2 moiety where R2 is hydrogen, lower alkyl, halomethyl, lower cyanoalkyl, alkenyl or alkynyl, as well as herbicidal compositions and herbicidal use of these compounds.
{"title":"Finiteness of redundancy, regret, Shtarkov sums, and Jeffreys integrals in exponential families","authors":"P. Grünwald, P. Harremoës","doi":"10.1109/ISIT.2009.5205676","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205676","url":null,"abstract":"Disclosed herein are herbicidal pyridine compounds substituted at the 2- or 6-position with an OR2 moiety where R2 is hydrogen, lower alkyl, halomethyl, lower cyanoalkyl, alkenyl or alkynyl, as well as herbicidal compositions and herbicidal use of these compounds.","PeriodicalId":92224,"journal":{"name":"International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2009-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83380715","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 : 2009-05-05DOI: 10.1109/ISIT.2009.5205806
G. Durisi, V. Morgenshtern, H. Bölcskei
The noncoherent capacity of stationary discrete-time fading channels is known to be very sensitive to the fine details of the channel model. More specifically, the measure of the set of harmonics where the power spectral density of the fading process is nonzero determines if capacity grows logarithmically in SNR or slower than logarithmically. An engineering-relevant problem is to characterize the SNR value at which this sensitivity starts to matter. In this paper, we consider the general class of continuous-time Rayleigh-fading channels that satisfy the wide-sense stationary uncorrelated-scattering (WSSUS) assumption and are, in addition, underspread. For this class of channels, we show that the noncoherent capacity is close to the AWGN capacity for all SNR values of practical interest, independently of whether the scattering function is compactly supported or not. As a byproduct of our analysis, we obtain an information-theoretic pulse-design criterion for orthogonal frequency-division multiplexing systems.
{"title":"On the sensitivity of noncoherent capacity to the channel model","authors":"G. Durisi, V. Morgenshtern, H. Bölcskei","doi":"10.1109/ISIT.2009.5205806","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205806","url":null,"abstract":"The noncoherent capacity of stationary discrete-time fading channels is known to be very sensitive to the fine details of the channel model. More specifically, the measure of the set of harmonics where the power spectral density of the fading process is nonzero determines if capacity grows logarithmically in SNR or slower than logarithmically. An engineering-relevant problem is to characterize the SNR value at which this sensitivity starts to matter. In this paper, we consider the general class of continuous-time Rayleigh-fading channels that satisfy the wide-sense stationary uncorrelated-scattering (WSSUS) assumption and are, in addition, underspread. For this class of channels, we show that the noncoherent capacity is close to the AWGN capacity for all SNR values of practical interest, independently of whether the scattering function is compactly supported or not. As a byproduct of our analysis, we obtain an information-theoretic pulse-design criterion for orthogonal frequency-division multiplexing systems.","PeriodicalId":92224,"journal":{"name":"International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2009-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73206218","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 : 2009-01-06DOI: 10.1109/ISIT.2009.5205399
Chandra Nair
Motivated by a simple broadcast channel, we generalize the notions of a less noisy receiver and a more capable receiver to an essentially less noisy receiver and an essentially more capable receiver respectively. We establish the capacity regions of these classes by borrowing on existing techniques to obtain the characterization of the capacity region for certain new and interesting classes of broadcast channels. We also establish the relationships between the new classes and the existing classes.
{"title":"Capacity regions of two new classes of 2-receiver broadcast channels","authors":"Chandra Nair","doi":"10.1109/ISIT.2009.5205399","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205399","url":null,"abstract":"Motivated by a simple broadcast channel, we generalize the notions of a less noisy receiver and a more capable receiver to an essentially less noisy receiver and an essentially more capable receiver respectively. We establish the capacity regions of these classes by borrowing on existing techniques to obtain the characterization of the capacity region for certain new and interesting classes of broadcast channels. We also establish the relationships between the new classes and the existing classes.","PeriodicalId":92224,"journal":{"name":"International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2009-01-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80142520","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 : 2009-01-01DOI: 10.1109/ISIT.2009.5205476
Jibo Wei, X. Lan
{"title":"The expected complexity of sphere decoding algorithm in spatial correlated MIMO channels","authors":"Jibo Wei, X. Lan","doi":"10.1109/ISIT.2009.5205476","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205476","url":null,"abstract":"","PeriodicalId":92224,"journal":{"name":"International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2009-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74849511","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 : 2008-12-01DOI: 10.1109/ISITA.2008.4895457
A. Schönhuth
A solution of the identifiability problem (IP) for hidden Markov models (HMMs), based on a novel algebraic theory for random sources, is presented. It gives rise to an efficient and practical algorithm that can be easily implemented. Extant approaches are exponential in the number of hidden states and therefore only applicable to a limited degree. The algorithm can be equally applied to solve the IP for quantum random walks (QRWs) that have recently been presented as an analogon of Markov chains in quantum information theory. Moreover, the algorithm can be used to efficiently test HMMs and QRWs for ergodicity, which had remained an open problem so far.
{"title":"Simple and efficient solution of the identifiability problem for hidden Markov sources and quantum random walks","authors":"A. Schönhuth","doi":"10.1109/ISITA.2008.4895457","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895457","url":null,"abstract":"A solution of the identifiability problem (IP) for hidden Markov models (HMMs), based on a novel algebraic theory for random sources, is presented. It gives rise to an efficient and practical algorithm that can be easily implemented. Extant approaches are exponential in the number of hidden states and therefore only applicable to a limited degree. The algorithm can be equally applied to solve the IP for quantum random walks (QRWs) that have recently been presented as an analogon of Markov chains in quantum information theory. Moreover, the algorithm can be used to efficiently test HMMs and QRWs for ergodicity, which had remained an open problem so far.","PeriodicalId":92224,"journal":{"name":"International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85590421","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 : 2008-09-04DOI: 10.1109/ISIT.2009.5205923
K. Sakaniwa, K. Kasai, Takayuki Nozaki
The covariance evolution is a system of differential equations with respect to the covariance of the number of edges connecting to the nodes of each residual degree. Solving the covariance evolution, we can derive distributions of the number of check nodes of residual degree 1, which helps us to estimate the block error probability for finite-length LDPC code. Amraoui et al. resorted to numerical computations to solve the covariance evolution. In this paper, we give the analytical solution of the covariance evolution.
{"title":"Analytical solution of covariance evolution for regular LDPC codes","authors":"K. Sakaniwa, K. Kasai, Takayuki Nozaki","doi":"10.1109/ISIT.2009.5205923","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205923","url":null,"abstract":"The covariance evolution is a system of differential equations with respect to the covariance of the number of edges connecting to the nodes of each residual degree. Solving the covariance evolution, we can derive distributions of the number of check nodes of residual degree 1, which helps us to estimate the block error probability for finite-length LDPC code. Amraoui et al. resorted to numerical computations to solve the covariance evolution. In this paper, we give the analytical solution of the covariance evolution.","PeriodicalId":92224,"journal":{"name":"International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76654512","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 : 2008-07-06DOI: 10.1109/ISIT.2008.4595146
T. Wadayama
In this paper, an analysis of the undetected error probability of ensembles of mtimesn binary matrices is presented. The ensemble called the Bernoulli ensemble whose members are considered as matrices generated from i.i.d. Bernoulli source is mainly considered here. The main contributions of this work are (i) derivation of the error exponent of the average undetected error probability and (ii) closed form expressions for the variance of the undetected error probability. It is shown that the behavior of the exponent for a sparse ensemble is somewhat different from that for a dense ensemble. Furthermore, as a byproduct of the proof of the variance formula, simple covariance formula of the weight distribution is derived.
{"title":"On undetected error probability of binary matrix ensembles","authors":"T. Wadayama","doi":"10.1109/ISIT.2008.4595146","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595146","url":null,"abstract":"In this paper, an analysis of the undetected error probability of ensembles of mtimesn binary matrices is presented. The ensemble called the Bernoulli ensemble whose members are considered as matrices generated from i.i.d. Bernoulli source is mainly considered here. The main contributions of this work are (i) derivation of the error exponent of the average undetected error probability and (ii) closed form expressions for the variance of the undetected error probability. It is shown that the behavior of the exponent for a sparse ensemble is somewhat different from that for a dense ensemble. Furthermore, as a byproduct of the proof of the variance formula, simple covariance formula of the weight distribution is derived.","PeriodicalId":92224,"journal":{"name":"International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77768443","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 : 2007-06-24DOI: 10.1109/ISIT.2007.4557111
J. Walsh
We extend Gaussian approximation density evolution (DE) techniques from the soft iterative decoding of turbo and low density parity check (LDPC) codes to the performance and convergence analysis of belief propagation (BP) and expectation propagation (EP) in randomly connected very large sparse homogeneous factor graphs. A strict form of the Gaussian approximation allows the use of extrinsic information transfer (EXIT) charts to study the performance and convergence of the algorithms. The result is a graphical tool that design engineers can use to quickly predict the performance and convergence speed of BP or EP applied to these inference problems. We demonstrate the utility of the new tool, and a motivation for the generalization of the results, by showing how it may surprisingly be applied to determine the performance of a scheme for distributed data fusion in a sensor network.
{"title":"EXIT and Density Evolution Analysis for Homogeneous Expectation Propagation","authors":"J. Walsh","doi":"10.1109/ISIT.2007.4557111","DOIUrl":"https://doi.org/10.1109/ISIT.2007.4557111","url":null,"abstract":"We extend Gaussian approximation density evolution (DE) techniques from the soft iterative decoding of turbo and low density parity check (LDPC) codes to the performance and convergence analysis of belief propagation (BP) and expectation propagation (EP) in randomly connected very large sparse homogeneous factor graphs. A strict form of the Gaussian approximation allows the use of extrinsic information transfer (EXIT) charts to study the performance and convergence of the algorithms. The result is a graphical tool that design engineers can use to quickly predict the performance and convergence speed of BP or EP applied to these inference problems. We demonstrate the utility of the new tool, and a motivation for the generalization of the results, by showing how it may surprisingly be applied to determine the performance of a scheme for distributed data fusion in a sensor network.","PeriodicalId":92224,"journal":{"name":"International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73038322","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 : 2007-06-24DOI: 10.1109/ISIT.2007.4557529
V. Aggarwal, A. Calderbank
This paper describes a common mathematical framework for the design of additive and non-additive Quantum Error Correcting Codes. It is based on a correspondence between boolean functions and projection operators. The new framework extends to operator quantum error correcting codes.
{"title":"Boolean Functions, Projection Operators and Quantum Error Correcting Codes","authors":"V. Aggarwal, A. Calderbank","doi":"10.1109/ISIT.2007.4557529","DOIUrl":"https://doi.org/10.1109/ISIT.2007.4557529","url":null,"abstract":"This paper describes a common mathematical framework for the design of additive and non-additive Quantum Error Correcting Codes. It is based on a correspondence between boolean functions and projection operators. The new framework extends to operator quantum error correcting codes.","PeriodicalId":92224,"journal":{"name":"International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79761966","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
扫码关注我们
求助内容：
应助结果提醒方式：