发布求助
文献互助 智能选刊 最新文献

Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494)最新文献

筛选
英文 中文
An upper bound on the capacity of channels with memory and constraint input 具有存储器和约束输入的信道容量的上界
Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494) Pub Date : 2001-09-02 DOI: 10.1109/ITW.2001.955166
P. Vontobel, D. Arnold
{"title":"An upper bound on the capacity of channels with memory and constraint input","authors":"P. Vontobel, D. Arnold","doi":"10.1109/ITW.2001.955166","DOIUrl":"https://doi.org/10.1109/ITW.2001.955166","url":null,"abstract":"A method for computing upper bounds on capacity for a class of time-invariant indecomposable finite state channels is presented. It extends a result for finite-input memoryless channels. Numerical results are provided for selected channels having memory and constraint (binary) input.","PeriodicalId":288814,"journal":{"name":"Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131329717","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}
引用次数: 56
The advantages of non-binary turbo codes 非二进制turbo码的优点
Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494) Pub Date : 2001-09-02 DOI: 10.1109/ITW.2001.955136
C. Berrou, M. Jézéquel, C. Douillard, S. Kerouédan
{"title":"The advantages of non-binary turbo codes","authors":"C. Berrou, M. Jézéquel, C. Douillard, S. Kerouédan","doi":"10.1109/ITW.2001.955136","DOIUrl":"https://doi.org/10.1109/ITW.2001.955136","url":null,"abstract":"Non-binary turbo codes are built from recursive systematic convolutional (RSC) component codes with m inputs (m/spl ges/2). This construction offers better performance than classical binary turbo codes, especially at very low BER and high coding rate. Some examples with rate 2/3 are given on 8-state and 16-state duo-binary turbo code associated with QPSK and 8-PSK modulation.","PeriodicalId":288814,"journal":{"name":"Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114944609","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}
引用次数: 120
Product accumulate codes: properties and performance 产品积累代码:属性和性能
Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494) Pub Date : 2001-09-02 DOI: 10.1109/ITW.2001.955123
K. Narayanan, Jing Li, C. Georghiades
{"title":"Product accumulate codes: properties and performance","authors":"K. Narayanan, Jing Li, C. Georghiades","doi":"10.1109/ITW.2001.955123","DOIUrl":"https://doi.org/10.1109/ITW.2001.955123","url":null,"abstract":"A new class of codes, named product accumulate codes, which are the concatenation of an outer product code and an inner rate-1 differential encoder (or accumulator) is proposed. We show that these codes can perform within a few tenths of a dB from the Shannon limit for rates/spl ges/1/2. For practical block lengths, these codes provide similar performance to turbo codes but with significantly lower decoding complexity.","PeriodicalId":288814,"journal":{"name":"Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494)","volume":"131 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121402036","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}
引用次数: 3
The turbo principle in joint source channel decoding of variable length codes 变长码联合源信道译码的turbo原理
Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494) Pub Date : 2001-09-02 DOI: 10.1109/ITW.2001.955127
J. Hagenauer, R. Bauer
{"title":"The turbo principle in joint source channel decoding of variable length codes","authors":"J. Hagenauer, R. Bauer","doi":"10.1109/ITW.2001.955127","DOIUrl":"https://doi.org/10.1109/ITW.2001.955127","url":null,"abstract":"The turbo principle has been widely applied to various detection/decoding problems in recent years. Here we show how the general idea can be extended to a communication scheme where a variable length code is used for data compression followed by a channel code to protect the data against channel errors. Iterations are performed between the channel decoder and the decoder for the variable length source code. Since the exchange of extrinsic information is essential for the performance of turbo decoding schemes we describe how EXIT-charts can be applied to predict the performance of the iterative source-channel decoding approach.","PeriodicalId":288814,"journal":{"name":"Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122062872","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
Message-passing decoders and their application to storage systems 消息传递解码器及其在存储系统中的应用
Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494) Pub Date : 2001-09-02 DOI: 10.1109/ITW.2001.955120
B. Kurkoski, P. Siegel, J. Wolf
{"title":"Message-passing decoders and their application to storage systems","authors":"B. Kurkoski, P. Siegel, J. Wolf","doi":"10.1109/ITW.2001.955120","DOIUrl":"https://doi.org/10.1109/ITW.2001.955120","url":null,"abstract":"Message-passing has been proposed for decoding parity check codes, especially low density parity check (LDPC) codes. We propose using message-passing detectors for partial response channels. Furthermore, we investigate how a single message-passing detector/decoder can be matched to a combination of a partial response channel and a LDPC code.","PeriodicalId":288814,"journal":{"name":"Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126624062","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}
引用次数: 1
Regular low-density parity-check codes from combinatorial designs 组合设计中的规则低密度奇偶校验码
Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494) Pub Date : 2001-09-02 DOI: 10.1109/ITW.2001.955146
Sarah J. Johnson, S. Weller
{"title":"Regular low-density parity-check codes from combinatorial designs","authors":"Sarah J. Johnson, S. Weller","doi":"10.1109/ITW.2001.955146","DOIUrl":"https://doi.org/10.1109/ITW.2001.955146","url":null,"abstract":"Analytically constructed LDPC codes comprise only a very small subset of possible codes and as a result LDPC codes are still, for the most part, constructed randomly. This paper extends the class of LDPC codes that can be systematically generated by presenting a construction method for regular LDPC codes based on combinatorial designs known as Kirkman triple systems. We construct (3, /spl rho/)-regular codes whose Tanner graph is free of 4-cycles for any integer /spl rho/, and examine girth and minimum distance properties of several classes of LDPC codes obtained from combinatorial designs.","PeriodicalId":288814,"journal":{"name":"Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127175475","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}
引用次数: 106
MMSE analysis of certain large isometric random precoded systems 某大型等距随机预编码系统的MMSE分析
Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494) Pub Date : 2001-09-02 DOI: 10.1109/ITW.2001.955170
M. Debbah, W. Hachem, P. Loubaton, M. D. Courville
{"title":"MMSE analysis of certain large isometric random precoded systems","authors":"M. Debbah, W. Hachem, P. Loubaton, M. D. Courville","doi":"10.1109/ITW.2001.955170","DOIUrl":"https://doi.org/10.1109/ITW.2001.955170","url":null,"abstract":"Linear precoding consists in multiplying by a N/spl times/K matrix a K-dimensional vector obtained by serial to parallel conversion of a symbol sequence to be transmitted. We analyse the performance of MMSE receivers for certain large random isometric precoded systems on fading channels. Using new tools, borrowed from the so-called free probability theory, it can be shown that the signal to interference plus noise ratio at the equalizer output converges almost surely to a deterministic value depending on the probability distribution of the channel coefficients when N/spl rarr/+/spl infin/ and K/N/spl rarr//spl alpha//spl les/1. These asymptotic results are used to optimally balance the redundancy introduced between linear precoding and classical convolutional coding, while preserving a simple MMSE equalization scheme at the receiver.","PeriodicalId":288814,"journal":{"name":"Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128296108","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}
引用次数: 127
Methods and limits of iterative multiuser decoding 迭代多用户译码的方法和限制
Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494) Pub Date : 2001-09-02 DOI: 10.1109/ITW.2001.955131
M. Moher
{"title":"Methods and limits of iterative multiuser decoding","authors":"M. Moher","doi":"10.1109/ITW.2001.955131","DOIUrl":"https://doi.org/10.1109/ITW.2001.955131","url":null,"abstract":"Previous work has identified iterative multiuser decoding techniques that are often only limited by theoretical channel capacity. These investigations usually dealt with the case where user waveforms are decorrelated to some degree. Investigations with identical waveforms indicate that the theoretical capacity limits are not always achieved. Performance has a threshold-like behaviour, as one might expect with a capacity limit, but the threshold is, in some cases, above the theoretical capacity for the channel under investigation. In this paper, an explanation for this behaviour is proposed.","PeriodicalId":288814,"journal":{"name":"Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125942956","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}
引用次数: 2
A class of systematic t/B-error correcting codes for semiconductor memory systems 一类用于半导体存储系统的系统t/ b错误校正码
Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494) Pub Date : 2001-09-02 DOI: 10.1109/ITW.2001.955144
G. Umanesan, E. Fujiwara
{"title":"A class of systematic t/B-error correcting codes for semiconductor memory systems","authors":"G. Umanesan, E. Fujiwara","doi":"10.1109/ITW.2001.955144","DOIUrl":"https://doi.org/10.1109/ITW.2001.955144","url":null,"abstract":"This paper proposes a class of systematic codes called single t/B-error correcting - single b-bit byte error correcting - single b-bit block error detecting (S/sub t/B/EC-S/sub b/EC-S/sub B/ED) codes for high speed semiconductor memory systems. The proposed codes correct multiple random t-bit errors occurring within a chip and b-bit byte errors caused by sub-array data faults while simultaneously indicating B-bit block errors caused by complete chip failures.","PeriodicalId":288814,"journal":{"name":"Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121848355","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
Differential turbo space-time coding 差分涡轮空时编码
Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494) Pub Date : 2001-09-02 DOI: 10.1109/ITW.2001.955157
A. Grant, C. Schlegel
{"title":"Differential turbo space-time coding","authors":"A. Grant, C. Schlegel","doi":"10.1109/ITW.2001.955157","DOIUrl":"https://doi.org/10.1109/ITW.2001.955157","url":null,"abstract":"Serial concatenation of standard convolutional or block codes with differential space-time modulation is considered for flat fading multiple antenna channels. Extrinsic information transfer is used to predict thresholds for various outer codes. Using the differential structure of the inner code near coherent performance is obtained without the use of training symbols.","PeriodicalId":288814,"journal":{"name":"Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132467304","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}
引用次数: 28
首页 上一页 下一页 尾页
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学术官方微信