Pub Date : 2001-09-12DOI: 10.1109/ISIT.2001.936099
T. Matsushima, T. Matsushima, S. Hirasawa
We introduce a representation method of probability models that can be applied to any code such as turbo, low density parity check (LDPC) or tail-biting code. Moreover, we propose an iterative algorithm that calculates marginal posterior probabilities on the introduced probability model class. The decoding error probability for the LDPC codes of the proposed algorithm is less than that of the sum-product algorithm.
{"title":"An iterative algorithm for calculating posterior probability and model representation","authors":"T. Matsushima, T. Matsushima, S. Hirasawa","doi":"10.1109/ISIT.2001.936099","DOIUrl":"https://doi.org/10.1109/ISIT.2001.936099","url":null,"abstract":"We introduce a representation method of probability models that can be applied to any code such as turbo, low density parity check (LDPC) or tail-biting code. Moreover, we propose an iterative algorithm that calculates marginal posterior probabilities on the introduced probability model class. The decoding error probability for the LDPC codes of the proposed algorithm is less than that of the sum-product algorithm.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134359300","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-09-12DOI: 10.1109/ISIT.2001.935871
G. Moustakides
We present a class of constraint LMS-like adaptive linear detection schemes that constitutes a generalization to the popular blind adaptive detector. We show that, contrary to the general belief, the conventional LMS and its constraint version, when in training mode, do not necessarily outperform the blind LMS of Honig et al. (1995). Trained algorithms uniformly outperform their blind counterparts only if they incorporate knowledge of the amplitude of the user of interest. Decision directed versions of such algorithms are shown to be equally efficient as their trained prototypes and significantly better than the blind versions.
{"title":"Decision directed algorithms for multiuser detection","authors":"G. Moustakides","doi":"10.1109/ISIT.2001.935871","DOIUrl":"https://doi.org/10.1109/ISIT.2001.935871","url":null,"abstract":"We present a class of constraint LMS-like adaptive linear detection schemes that constitutes a generalization to the popular blind adaptive detector. We show that, contrary to the general belief, the conventional LMS and its constraint version, when in training mode, do not necessarily outperform the blind LMS of Honig et al. (1995). Trained algorithms uniformly outperform their blind counterparts only if they incorporate knowledge of the amplitude of the user of interest. Decision directed versions of such algorithms are shown to be equally efficient as their trained prototypes and significantly better than the blind versions.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":" 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113949381","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-09-12DOI: 10.1109/ISIT.2001.936170
Dongning Guo, S. Verdú, L. Rasmussen
This paper studies the asymptotic distribution of the output of a family of linear multiuser receivers. Every receiver in the family is a function of the channel correlation matrix of a simple form. It is proved that conditioned on almost all spreading codes, the output decision statistic of such a receiver converges to a Gaussian law in distribution as the system size goes to infinity. This set of receivers encompasses a matched filter, MMSE receiver, parallel interference cancelers, and many other linear receivers of interest. The normality principle solidifies the importance of the signal-to-interference ratio in the many-user analysis of linear multiuser detectors.
{"title":"Asymptotic normality of linear CDMA multiuser detect","authors":"Dongning Guo, S. Verdú, L. Rasmussen","doi":"10.1109/ISIT.2001.936170","DOIUrl":"https://doi.org/10.1109/ISIT.2001.936170","url":null,"abstract":"This paper studies the asymptotic distribution of the output of a family of linear multiuser receivers. Every receiver in the family is a function of the channel correlation matrix of a simple form. It is proved that conditioned on almost all spreading codes, the output decision statistic of such a receiver converges to a Gaussian law in distribution as the system size goes to infinity. This set of receivers encompasses a matched filter, MMSE receiver, parallel interference cancelers, and many other linear receivers of interest. The normality principle solidifies the importance of the signal-to-interference ratio in the many-user analysis of linear multiuser detectors.","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-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132466307","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-29DOI: 10.1109/ISIT.2001.935965
Lihua Song, R. Yeung
We consider the scenario of multicasting a set of information sources in communication networks with multiple senders, multiple encoders and multiple decoders (multi-source multi-sink networks). The information sources are allowed to be encoded within the network, and they are reconstructed by the decoders, where each decoder reconstructs a certain subset of the information sources almost perfectly. We first investigate network coding on acyclic networks in which the reconstruction requirements are arbitrary but the information sources are independent. Inner and outer bounds on the admissible coding rate region are obtained in terms of /spl Gamma/*/sub n/, which is a fundamental region in the entropy space defined by Yeung (1997). Our work extends the work by Yeung and Zhang (1999) on distributed source coding. In addition, we prove that the outer bound for the acyclic single-source single-sink network is tight. We also investigate the multi-source multi-sink network with independent discrete memoryless channels. The admissibility of such a network is characterized under the multicasting requirements that each sink is required to recover all the information sources, which may be correlated.
{"title":"Network information flow-multiple sources","authors":"Lihua Song, R. Yeung","doi":"10.1109/ISIT.2001.935965","DOIUrl":"https://doi.org/10.1109/ISIT.2001.935965","url":null,"abstract":"We consider the scenario of multicasting a set of information sources in communication networks with multiple senders, multiple encoders and multiple decoders (multi-source multi-sink networks). The information sources are allowed to be encoded within the network, and they are reconstructed by the decoders, where each decoder reconstructs a certain subset of the information sources almost perfectly. We first investigate network coding on acyclic networks in which the reconstruction requirements are arbitrary but the information sources are independent. Inner and outer bounds on the admissible coding rate region are obtained in terms of /spl Gamma/*/sub n/, which is a fundamental region in the entropy space defined by Yeung (1997). Our work extends the work by Yeung and Zhang (1999) on distributed source coding. In addition, we prove that the outer bound for the acyclic single-source single-sink network is tight. We also investigate the multi-source multi-sink network with independent discrete memoryless channels. The admissibility of such a network is characterized under the multicasting requirements that each sink is required to recover all the information sources, which may be correlated.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"197 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132198397","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-29DOI: 10.1109/ISIT.2001.936004
P. Massey, D. Costello
Prior attempts at designing nonsystematic turbo codes have not achieved performances better than systematic turbo codes. This paper presents a new class of nonsystematic turbo codes that perform very well. The idea behind this new class of codes is to use a doubly-asymmetric turbo code where one of the constituent codes is a "recursive nonsystematic quick look-in" code, and the other constituent code(s) is a "big numerator accumulator".
{"title":"Turbo codes with recursive nonsystematic quick-look-in constituent codes","authors":"P. Massey, D. Costello","doi":"10.1109/ISIT.2001.936004","DOIUrl":"https://doi.org/10.1109/ISIT.2001.936004","url":null,"abstract":"Prior attempts at designing nonsystematic turbo codes have not achieved performances better than systematic turbo codes. This paper presents a new class of nonsystematic turbo codes that perform very well. The idea behind this new class of codes is to use a doubly-asymmetric turbo code where one of the constituent codes is a \"recursive nonsystematic quick look-in\" code, and the other constituent code(s) is a \"big numerator accumulator\".","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117008154","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-29DOI: 10.1109/ISIT.2001.936189
T. Marzetta, B. Hassibi, B. Hochwald
Summary form only given. The space-time autocoding effect implies that arbitrarily reliable communication is possible within a single coherence interval in Rayleigh flat fading as the symbol-duration of the coherence interval and the number of transmit antennas grow simultaneously. For relatively short (e.g., 16-symbol) coherence intervals, a codebook of isotropically random unitary space-time signals theoretically supports transmission rates that are a significant fraction of autocapacity with an extremely low probability of error. However a constellation of the required size (typically L=2/sup 80/) is impossible to generate and store, and due to lack of structure there is little hope of finding a fast decoding scheme. We propose a random, but highly structured, constellation that is completely specified by log/sub 2/ L independent isotropically distributed unitary matrices. The distinguishing property of this construction is that any two signals in the constellation are pairwise statistically independent and isotropically distributed. Thus, the pairwise probability of error, and hence the union bound on the block probability of error, of the structured constellation is identical to that of a fully random constellation of independent signals.
{"title":"Space-time autocoding constellations with pairwise-independent signals","authors":"T. Marzetta, B. Hassibi, B. Hochwald","doi":"10.1109/ISIT.2001.936189","DOIUrl":"https://doi.org/10.1109/ISIT.2001.936189","url":null,"abstract":"Summary form only given. The space-time autocoding effect implies that arbitrarily reliable communication is possible within a single coherence interval in Rayleigh flat fading as the symbol-duration of the coherence interval and the number of transmit antennas grow simultaneously. For relatively short (e.g., 16-symbol) coherence intervals, a codebook of isotropically random unitary space-time signals theoretically supports transmission rates that are a significant fraction of autocapacity with an extremely low probability of error. However a constellation of the required size (typically L=2/sup 80/) is impossible to generate and store, and due to lack of structure there is little hope of finding a fast decoding scheme. We propose a random, but highly structured, constellation that is completely specified by log/sub 2/ L independent isotropically distributed unitary matrices. The distinguishing property of this construction is that any two signals in the constellation are pairwise statistically independent and isotropically distributed. Thus, the pairwise probability of error, and hence the union bound on the block probability of error, of the structured constellation is identical to that of a fully random constellation of independent signals.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133396167","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-29DOI: 10.1109/ISIT.2001.935952
M. Pinsker, V.V. Prelov
The problem of filtering for singular stationary stochastic processes under nonstationary distortions is considered. For certain models of nonstationary distortions, sufficient conditions under which error-free filtering of such processes is possible are obtained.
{"title":"On possibility of error-free filtering under nonstationary distortions","authors":"M. Pinsker, V.V. Prelov","doi":"10.1109/ISIT.2001.935952","DOIUrl":"https://doi.org/10.1109/ISIT.2001.935952","url":null,"abstract":"The problem of filtering for singular stationary stochastic processes under nonstationary distortions is considered. For certain models of nonstationary distortions, sufficient conditions under which error-free filtering of such processes is possible are obtained.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129829331","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-29DOI: 10.1109/ISIT.2001.935867
J. Rosenthal, P. Vontobel
Some twenty years ago Margulis (1982) proposed an algebraic construction of low density parity check (LDPC) codes. In this paper we mimick the construction of Margulis and describe a method for algebraically constructing regular and irregular LDPC codes.
{"title":"Constructions of regular and irregular LDPC codes using Ramanujan graphs and ideas from Margulis","authors":"J. Rosenthal, P. Vontobel","doi":"10.1109/ISIT.2001.935867","DOIUrl":"https://doi.org/10.1109/ISIT.2001.935867","url":null,"abstract":"Some twenty years ago Margulis (1982) proposed an algebraic construction of low density parity check (LDPC) codes. In this paper we mimick the construction of Margulis and describe a method for algebraically constructing regular and irregular LDPC codes.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"157 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134249421","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-29DOI: 10.1109/ISIT.2001.936157
J. N. Laneman, G. Wornell, David Tse
We develop two variants of an energy-efficient cooperative diversity protocol that combats fading induced by multipath propagation in wireless networks, The underlying techniques build upon the classical relay channel and related work and exploit space diversity available at distributed antennas through coordinated transmission and processing by cooperating radios. While applicable to any wireless setting, these protocols are particularly attractive in ad-hoc or peer-to-peer wireless networks, in which radios are typically constrained to employ a single antenna. Substantial energy-savings resulting from these protocols can lead to reduced battery drain, longer network lifetime, and improved network performance in terms of, e.g., capacity.
{"title":"An efficient protocol for realizing cooperative diversity in wireless networks","authors":"J. N. Laneman, G. Wornell, David Tse","doi":"10.1109/ISIT.2001.936157","DOIUrl":"https://doi.org/10.1109/ISIT.2001.936157","url":null,"abstract":"We develop two variants of an energy-efficient cooperative diversity protocol that combats fading induced by multipath propagation in wireless networks, The underlying techniques build upon the classical relay channel and related work and exploit space diversity available at distributed antennas through coordinated transmission and processing by cooperating radios. While applicable to any wireless setting, these protocols are particularly attractive in ad-hoc or peer-to-peer wireless networks, in which radios are typically constrained to employ a single antenna. Substantial energy-savings resulting from these protocols can lead to reduced battery drain, longer network lifetime, and improved network performance in terms of, e.g., capacity.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"232 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132118244","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-29DOI: 10.1109/ISIT.2001.936078
G. Shamir, D. Costello
The MDL principle is derived for universal lossless coding of piecewise stationary sources with repeating statistics (PSRSs).
针对具有重复统计量的分段平稳源(psss)的通用无损编码，导出了MDL原理。
{"title":"On the minimum description length principle for switching sources","authors":"G. Shamir, D. Costello","doi":"10.1109/ISIT.2001.936078","DOIUrl":"https://doi.org/10.1109/ISIT.2001.936078","url":null,"abstract":"The MDL principle is derived for universal lossless coding of piecewise stationary sources with repeating statistics (PSRSs).","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"45 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133581648","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
扫码关注我们
求助内容：
应助结果提醒方式：