IEEE Trans. Inf. Theory最新文献

筛选
英文 中文
Large system performance of linear multiuser receivers in multipath fading channels 多径衰落信道下线性多用户接收机的大系统性能
IEEE Trans. Inf. Theory Pub Date : 2000-09-01 DOI: 10.1109/18.868478
J. Evans, David Tse
{"title":"Large system performance of linear multiuser receivers in multipath fading channels","authors":"J. Evans, David Tse","doi":"10.1109/18.868478","DOIUrl":"https://doi.org/10.1109/18.868478","url":null,"abstract":"A linear multiuser receiver for a particular user in a code-division multiple-access (CDMA) network gains potential benefits from knowledge of the channels of all users in the system. In fast multipath fading environments we cannot assume that the channel estimates are perfect and the inevitable channel estimation errors will limit this potential gain. We study the impact of channel estimation errors on the performance of linear multiuser receivers, as well as the channel estimation problem itself. Of particular interest are the scalability properties of the channel and data estimation algorithms: what happens to the performance as the system bandwidth and the number of users (and hence channels to estimate) grows? Our main results involve asymptotic expressions for the signal-to-interference ratio of linear multiuser receivers in the limit of large processing gain, with the number of users divided by the processing gain held constant. We employ a random model for the spreading sequences and the limiting signal-to-interference ratio expressions are independent of the actual signature sequences, depending only on the system loading and the channel statistics: background noise power, energy profile of resolvable multipaths, and channel coherence time. The effect of channel uncertainty on the performance of multiuser receivers is succinctly captured by the notion of effective interference.","PeriodicalId":13250,"journal":{"name":"IEEE Trans. Inf. Theory","volume":"16 1","pages":"2059-2078"},"PeriodicalIF":0.0,"publicationDate":"2000-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74734372","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}
引用次数: 308
Source and channel rate allocation for channel codes satisfying the Gilbert-Varshamov or Tsfasman-Vladut-Zink bounds 满足Gilbert-Varshamov或Tsfasman-Vladut-Zink边界的信道码的信源和信道速率分配
IEEE Trans. Inf. Theory Pub Date : 2000-09-01 DOI: 10.1109/18.868483
A. Méhes, K. Zeger
{"title":"Source and channel rate allocation for channel codes satisfying the Gilbert-Varshamov or Tsfasman-Vladut-Zink bounds","authors":"A. Méhes, K. Zeger","doi":"10.1109/18.868483","DOIUrl":"https://doi.org/10.1109/18.868483","url":null,"abstract":"We derive bounds for optimal rate allocation between source and channel coding for linear channel codes that meet the Gilbert-Varshamov or Tsfasman-Vladut-Zink (1984) bounds. Formulas giving the high resolution vector quantizer distortion of these systems are also derived. In addition, we give bounds on how far below the channel capacity the transmission rate should be for a given delay constraint. The bounds obtained depend on the relationship between channel code rate and relative minimum distance guaranteed by the Gilbert-Varshamov bound, and do not require sophisticated decoding beyond the error correction limit. We demonstrate that the end-to-end mean-squared error decays exponentially fast as a function of the overall transmission rate, which need not be the case for certain well-known structured codes such as Hamming codes.","PeriodicalId":13250,"journal":{"name":"IEEE Trans. Inf. Theory","volume":"20 1","pages":"2133-2151"},"PeriodicalIF":0.0,"publicationDate":"2000-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75357642","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}
引用次数: 4
A suboptimal quadratic change detection scheme 次优二次变化检测方案
IEEE Trans. Inf. Theory Pub Date : 2000-09-01 DOI: 10.1109/18.868480
I. Nikiforov
{"title":"A suboptimal quadratic change detection scheme","authors":"I. Nikiforov","doi":"10.1109/18.868480","DOIUrl":"https://doi.org/10.1109/18.868480","url":null,"abstract":"We address the problem of detecting changes in multivariate Gaussian random signals with an unknown mean after the change. The window-limited generalized-likelihood ratio (GLR) scheme is a well-known approach to solve this problem. However, this algorithm involves at least (log /spl gamma/)//spl rho/ likelihood-ratio computations at each stage, where /spl gamma/(/spl gamma//spl rarr//spl infin/) is the mean time before a false alarm and /spl rho/ is the Kullback-Leibler information. We establish a new suboptimal recursive approach which is based on a collection of L parallel recursive /spl chi//sup 2/ tests instead of the window-limited GLR scheme. This new approach involves only a fixed number L of likelihood-ratio computations at each stage for any combinations of /spl gamma/ and /spl rho/. By choosing an acceptable value of nonoptimality, the designer can easily find a tradeoff between the complexity of the quadratic change detection algorithm and its efficiency.","PeriodicalId":13250,"journal":{"name":"IEEE Trans. Inf. Theory","volume":"18 1","pages":"2095-2107"},"PeriodicalIF":0.0,"publicationDate":"2000-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74861474","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}
引用次数: 25
A class of linear codes with good parameters 一类具有良好参数的线性码
IEEE Trans. Inf. Theory Pub Date : 2000-09-01 DOI: 10.1109/18.868488
C. Xing, S. Ling
{"title":"A class of linear codes with good parameters","authors":"C. Xing, S. Ling","doi":"10.1109/18.868488","DOIUrl":"https://doi.org/10.1109/18.868488","url":null,"abstract":"A construction of linear codes with good parameters is given. Based on Brouwer's table, more than 100 new codes are obtained from our construction.","PeriodicalId":13250,"journal":{"name":"IEEE Trans. Inf. Theory","volume":"31 1","pages":"2184-2188"},"PeriodicalIF":0.0,"publicationDate":"2000-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81608606","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}
引用次数: 23
The weight hierarchies of some product codes 一些产品代码的权重层次结构
IEEE Trans. Inf. Theory Pub Date : 2000-09-01 DOI: 10.1109/18.868495
Jeng Yune Park
{"title":"The weight hierarchies of some product codes","authors":"Jeng Yune Park","doi":"10.1109/18.868495","DOIUrl":"https://doi.org/10.1109/18.868495","url":null,"abstract":"We determine the weight hierarchies of the product of an n-tuple space and an arbitrary code, the product of an m-dimensional even-weight code and the [24,12,8] extended Golay code, and the product of an m-dimensional even-weight code and the [8,4,4] extended Hamming code. The conjecture d/sub r/=d*/sub r/ is proven for all three cases.","PeriodicalId":13250,"journal":{"name":"IEEE Trans. Inf. Theory","volume":"122 1","pages":"2228-2235"},"PeriodicalIF":0.0,"publicationDate":"2000-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76694523","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}
引用次数: 10
Systematic design of unitary space-time constellations 统一时空星座的系统设计
IEEE Trans. Inf. Theory Pub Date : 2000-09-01 DOI: 10.1109/18.868472
B. Hochwald, T. Marzetta, T. Richardson, W. Sweldens, R. Urbanke
{"title":"Systematic design of unitary space-time constellations","authors":"B. Hochwald, T. Marzetta, T. Richardson, W. Sweldens, R. Urbanke","doi":"10.1109/18.868472","DOIUrl":"https://doi.org/10.1109/18.868472","url":null,"abstract":"We propose a systematic method for creating constellations of unitary space-time signals for multiple-antenna communication links. Unitary space-time signals, which are orthonormal in time across the antennas, have been shown to be well-tailored to a Rayleigh fading channel where neither the transmitter nor the receiver knows the fading coefficients. The signals can achieve low probability of error by exploiting multiple-antenna diversity. Because the fading coefficients are not known, the criterion for creating and evaluating the constellation is nonstandard and differs markedly from the familiar maximum-Euclidean-distance norm. Our construction begins with the first signal in the constellation-an oblong complex-valued matrix whose columns are orthonormal-and systematically produces the remaining signals by successively rotating this signal in a high-dimensional complex space. This construction easily produces large constellations of high-dimensional signals. We demonstrate its efficacy through examples involving one, two, and three transmitter antennas.","PeriodicalId":13250,"journal":{"name":"IEEE Trans. Inf. Theory","volume":"47 1","pages":"1962-1973"},"PeriodicalIF":0.0,"publicationDate":"2000-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81143064","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}
引用次数: 746
A fast algorithm for determining the linear complexity of a sequence with period pn over GF(q) 周期为pn / GF(q)序列线性复杂度的一种快速算法
IEEE Trans. Inf. Theory Pub Date : 2000-09-01 DOI: 10.1109/18.868492
G. Xiao, Shimin Wei, Kwok-Yan Lam, K. Imamura
{"title":"A fast algorithm for determining the linear complexity of a sequence with period pn over GF(q)","authors":"G. Xiao, Shimin Wei, Kwok-Yan Lam, K. Imamura","doi":"10.1109/18.868492","DOIUrl":"https://doi.org/10.1109/18.868492","url":null,"abstract":"A fast algorithm is presented for determining the linear complexity of a sequence with period p/sup n/ over GF (q), where p is an odd prime, and where q is a prime and a primitive root (mod p/sup 2/).","PeriodicalId":13250,"journal":{"name":"IEEE Trans. Inf. Theory","volume":"24 1","pages":"2203-2206"},"PeriodicalIF":0.0,"publicationDate":"2000-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81915014","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}
引用次数: 66
Analysis of contention tree algorithms 争用树算法分析
IEEE Trans. Inf. Theory Pub Date : 2000-09-01 DOI: 10.1109/18.868486
A. Janssen, M.L.M. Jong
{"title":"Analysis of contention tree algorithms","authors":"A. Janssen, M.L.M. Jong","doi":"10.1109/18.868486","DOIUrl":"https://doi.org/10.1109/18.868486","url":null,"abstract":"The Capetanakis-Tsybakov-Mikhailov (1978, 1979) contention tree algorithm provides an efficient scheme for multiaccessing a broadcast-communication channel. This paper studies the statistical properties of multiple-access contention tree algorithms with ternary feedback for an arbitrary degree of node. The particular quantities under investigation are the number of levels required for a random contender to have successful access, as well as the number of levels and the number of contention frames required to provide access for all contenders. Through classical Fourier analysis approximations to both the average and the variance are calculated as a function of the number of contenders n. It is demonstrated that in the limit of large n these quantities do not converge to a fixed mode, but contain an oscillating term as well.","PeriodicalId":13250,"journal":{"name":"IEEE Trans. Inf. Theory","volume":"22 1","pages":"2163-2172"},"PeriodicalIF":0.0,"publicationDate":"2000-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90055582","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}
引用次数: 78
The super-trellis structure of turbo codes turbo码的超网格结构
IEEE Trans. Inf. Theory Pub Date : 2000-09-01 DOI: 10.1109/18.868494
M. Breiling, L. Hanzo
{"title":"The super-trellis structure of turbo codes","authors":"M. Breiling, L. Hanzo","doi":"10.1109/18.868494","DOIUrl":"https://doi.org/10.1109/18.868494","url":null,"abstract":"In this contribution we derive the super-trellis structure of turbo codes. We show that this structure and its associated decoding complexity depend strongly on the interleaver applied in the turbo encoder. We provide upper bounds for the super-trellis complexity. Turbo codes are usually decoded by an iterative decoding algorithm, which is suboptimum. Applying the super-trellis structure, we can optimally decode simple turbo codes and compare the associated bit-error rate results to those of iterative algorithms.","PeriodicalId":13250,"journal":{"name":"IEEE Trans. Inf. Theory","volume":"52 1","pages":"2212-2228"},"PeriodicalIF":0.0,"publicationDate":"2000-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77949465","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}
引用次数: 26
Perfect reconstruction formulas and bounds on aliasing error in sub-nyquist nonuniform sampling of multiband signals 完善了多波段信号亚奈奎斯特非均匀采样混叠误差的重构公式和界
IEEE Trans. Inf. Theory Pub Date : 2000-09-01 DOI: 10.1109/18.868487
R. Venkataramani, Y. Bresler
{"title":"Perfect reconstruction formulas and bounds on aliasing error in sub-nyquist nonuniform sampling of multiband signals","authors":"R. Venkataramani, Y. Bresler","doi":"10.1109/18.868487","DOIUrl":"https://doi.org/10.1109/18.868487","url":null,"abstract":"We examine the problem of periodic nonuniform sampling of a multiband signal and its reconstruction from the samples. This sampling scheme, which has been studied previously, has an interesting optimality property that uniform sampling lacks: one can sample and reconstruct the class /spl Bscr/(/spl Fscr/) of multiband signals with spectral support /spl Fscr/, at rates arbitrarily close to the Landau (1969) minimum rate equal to the Lebesgue measure of /spl Fscr/, even when /spl Fscr/ does not tile R under translation. Using the conditions for exact reconstruction, we derive an explicit reconstruction formula. We compute bounds on the peak value and the energy of the aliasing error in the event that the input signal is band-limited to the \"span of /spl Fscr/\" (the smallest interval containing /spl Fscr/) which is a bigger class than the valid signals /spl Bscr/(/spl Fscr/), band-limited to /spl Fscr/. We also examine the performance of the reconstruction system when the input contains additive sample noise.","PeriodicalId":13250,"journal":{"name":"IEEE Trans. Inf. Theory","volume":"42 1","pages":"2173-2183"},"PeriodicalIF":0.0,"publicationDate":"2000-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85869201","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}
引用次数: 280
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学术文献互助群
群 号:481959085
Book学术官方微信