Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)最新文献_第2页

An iterative algorithm for calculating posterior probability and model representation 一种计算后验概率和模型表示的迭代算法

Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252) Pub Date : 2001-09-12 DOI: 10.1109/ISIT.2001.936099

T. Matsushima, T. Matsushima, S. Hirasawa

引用次数: 1

Decision directed algorithms for multiuser detection 多用户检测的决策导向算法

Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252) Pub Date : 2001-09-12 DOI: 10.1109/ISIT.2001.935871

G. Moustakides

引用次数: 3

Asymptotic normality of linear CDMA multiuser detect 线性CDMA多用户检测的渐近正态性

Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252) Pub Date : 2001-09-12 DOI: 10.1109/ISIT.2001.936170

Dongning Guo, S. Verdú, L. Rasmussen

引用次数: 9

Network information flow-multiple sources 网络信息流——多源

Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252) Pub Date : 2001-06-29 DOI: 10.1109/ISIT.2001.935965

Lihua Song, R. Yeung

{"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}

引用次数: 24

Turbo codes with recursive nonsystematic quick-look-in constituent codes 具有递归非系统快速查找组成码的Turbo码

Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252) Pub Date : 2001-06-29 DOI: 10.1109/ISIT.2001.936004

P. Massey, D. Costello

引用次数: 25

Space-time autocoding constellations with pairwise-independent signals 具有两两无关信号的时空自编码星座

Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252) Pub Date : 2001-06-29 DOI: 10.1109/ISIT.2001.936189

T. Marzetta, B. Hassibi, B. Hochwald

{"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}

引用次数: 0

On possibility of error-free filtering under nonstationary distortions 非平稳畸变下无误差滤波的可能性

Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252) Pub Date : 2001-06-29 DOI: 10.1109/ISIT.2001.935952

M. Pinsker, V.V. Prelov

引用次数: 0

Constructions of regular and irregular LDPC codes using Ramanujan graphs and ideas from Margulis 用拉马努金图和马古利斯思想构造正则和不规则LDPC码

Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252) Pub Date : 2001-06-29 DOI: 10.1109/ISIT.2001.935867

J. Rosenthal, P. Vontobel

引用次数: 48

An efficient protocol for realizing cooperative diversity in wireless networks 一种实现无线网络协同分集的有效协议

Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252) Pub Date : 2001-06-29 DOI: 10.1109/ISIT.2001.936157

J. N. Laneman, G. Wornell, David Tse

引用次数: 733

On the minimum description length principle for switching sources 关于开关源的最小描述长度原则

Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252) Pub Date : 2001-06-29 DOI: 10.1109/ISIT.2001.936078

G. Shamir, D. Costello

引用次数: 2