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

On the performance of multiple description codes over bit error channels 误码信道中多描述码的性能研究

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

H. Coward, R. Knopp, S. Servetto

引用次数: 15

Partially concatenated convolutional codes 部分连接的卷积码

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

J. Freudenberger, Martin Bossert, V. Zybablov, S. Shavgulidze

引用次数: 3

Deriving performance bounds for ISI channels using Gallager codes 使用Gallager码推导ISI信道的性能界限

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

A. Kavcic, B. Marcus, M. Mitzenmacher, B. Wilson

引用次数: 7

Fibonacci and Galois mode feedback with carry shift registers 带进位移位寄存器的斐波那契和伽罗瓦模式反馈

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

M. Goresky, A. Klapper

引用次数: 2

Information-disturbance tradeoff in quantum measurement on the uniform ensemble 均匀系综上量子测量中的信息干扰权衡

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

Howard Barnum

引用次数: 64

Iterative multiuser joint decoding: unified framework and asymptotic analysis 迭代多用户联合译码:统一框架与渐近分析

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

J. Boutros, G. Caire

{"title":"Iterative multiuser joint decoding: unified framework and asymptotic analysis","authors":"J. Boutros, G. Caire","doi":"10.1109/ISIT.2001.936180","DOIUrl":"https://doi.org/10.1109/ISIT.2001.936180","url":null,"abstract":"The synchronous chip-rate discrete-time CDMA channel with channel coding is analysed and the corresponding factor graph is presented. Iterative joint decoding can be derived in a simple and direct way by applying the sum-product algorithm to the factor graph. Since variables have degree 2, no computation takes place at the variable nodes. Computation at the code nodes is just soft-in soft-out (SISO) decoding, whose output is the extrinsic PMF of the coded symbols. Computation at the channel transition nodes is equivalent to MAP symbol-by-symbol multiuser detection, whose complexity is generally exponential in K. We show that several previously proposed low-complexity algorithms based on interference cancellation (IC) can be derived in a simple direct way by approximating the extrinsic PMF output by the SISO decoders either as a single mass-point PMF (hard decision) or as a Gaussian PDF with the same mean and variance (moment matching). Differently from all previously presented methods (derived from heuristic reasoning), we see clearly that extrinsic rather than a posteriori PMF should be fed back. This yields important advantages in terms of limiting achievable throughput.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"34 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":"132719095","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}

引用次数: 336

Maximum-likelihood detection of block coded CDMA using the A* algorithm 基于A*算法的分组编码CDMA的最大似然检测

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

Peter Németh, L. Rasmussen, T. Aulin

引用次数: 7

On relation between code geometry and decoding error probability 码的几何形状与译码错误概率的关系

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

M.V. Burnashev

引用次数: 5

Near-optimum decoding for subcodes of Reed-Muller codes Reed-Muller码子码的近最优译码

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

I. Dumer, K. Shabunov

引用次数: 15

Group characters and unitary space-time codes 群字符和酉空时码

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

A. Shokrollahi

引用次数: 4