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

2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)最新文献

筛选
英文 中文
An improvement to GMD-like decoding algorithms 类gmd解码算法的改进
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-06-25 DOI: 10.1109/ISIT.2000.866694
H. Tokushiga, T. Koumoto, T. Kasami
{"title":"An improvement to GMD-like decoding algorithms","authors":"H. Tokushiga, T. Koumoto, T. Kasami","doi":"10.1109/ISIT.2000.866694","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866694","url":null,"abstract":"For binary linear block codes, we introduce a multiple generalized minimum distance (GMD) decoding algorithm, where GMD-like decoding is iterated around a few appropriately selected search centers. Compared with the original GMD decoding by Forney (1966), this decoding algorithm provides better error performance by increasing the number of iterations of erasure and error correction moderately. To reduce the number of iterations, we derive new effective sufficient conditions on the optimality of decoded codewords.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129594624","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
Achievable distortion regions of Gaussian broadcast systems 高斯广播系统可实现的失真区域
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-06-25 DOI: 10.1109/ISIT.2000.866314
U. Mittal, N. Phamdo
{"title":"Achievable distortion regions of Gaussian broadcast systems","authors":"U. Mittal, N. Phamdo","doi":"10.1109/ISIT.2000.866314","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866314","url":null,"abstract":"We consider the problem of broadcasting a bandlimited white Gaussian source on an additive bandlimited white Gaussian noise channel with two receivers. Several hybrid digital-analog joint source-channel codes are proposed. The design principle is based on bandwidth/power splitting and matched tandem coding. The distortion regions of these codes are presented.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127137539","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
Local LDP for the shape of random Young diagram with restrictions on length and height of steps 具有步长和步高限制的随机杨图形状的局部LDP
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-06-25 DOI: 10.1109/ISIT.2000.866771
V. Blinovsky
{"title":"Local LDP for the shape of random Young diagram with restrictions on length and height of steps","authors":"V. Blinovsky","doi":"10.1109/ISIT.2000.866771","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866771","url":null,"abstract":"We solve the local large deviation problem (LDP) for the shape of random Young diagram when lengths and heights of the steps of the shapes of diagrams take values from given (and in general different for length and height) sets of nonegative integers. To solve this problem we use some new considerations and some methods from our previous works (Blinovsky, 1999).","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127242098","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
Partitioning for SA(B,C) detectors on ISI AWGN channels ISI AWGN信道上SA(B,C)检测器的划分
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-06-25 DOI: 10.1109/ISIT.2000.866393
A. Cedergren, T. Aulin
{"title":"Partitioning for SA(B,C) detectors on ISI AWGN channels","authors":"A. Cedergren, T. Aulin","doi":"10.1109/ISIT.2000.866393","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866393","url":null,"abstract":"In this paper partitioning for the SA(B,C) algorithm on intersymbol interference (ISI) channels is considered. Substantial savings in complexity can be made by using the SA(B,C), while achieving almost optimal error performance.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131321883","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
Grobner bases and alternant codes over Galois rings 格罗伯纳碱基和伽罗瓦环上的交替密码
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-06-25 DOI: 10.1109/ISIT.2000.866746
E. Byrne, P. Fitzpatrick
{"title":"Grobner bases and alternant codes over Galois rings","authors":"E. Byrne, P. Fitzpatrick","doi":"10.1109/ISIT.2000.866746","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866746","url":null,"abstract":"We give a new algorithm for the solution of the Hamming metric decoding problem for alternant codes over a Galois ring R. First we develop a comprehensive theory of Grobner bases over R|x/sub 1/,...,x/sub n/|, which is of independent interest. By specialising to the case of one variable, we show that the solution of the key equation can be determined as a certain minimal element in a Grobner basis of the solution module.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126919079","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
A new block-coded modulation scheme for Rayleigh fading channel, soft output decoding issues 针对瑞利衰落信道的软输出译码问题，提出了一种新的分组编码调制方案
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-06-25 DOI: 10.1109/ISIT.2000.866547
S. Yousefi, E. Hons, A. Khandani, B. Frey
{"title":"A new block-coded modulation scheme for Rayleigh fading channel, soft output decoding issues","authors":"S. Yousefi, E. Hons, A. Khandani, B. Frey","doi":"10.1109/ISIT.2000.866547","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866547","url":null,"abstract":"We investigate the application of the sum-product algorithm to the decoding of a q-ary block-coded modulation (BCM) scheme which is based on extending the parity check equations of a binary block code to q-ary symbols. This is achieved by decomposing the code into a sub-code with an acyclic Tanner graph and its cosets which are represented by a trellis diagram. The combination of these two cycle-free graphs are used to develop an efficient soft output decoding algorithm for the given code.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123309838","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
Non-linear MMSE estimation and SbS-MAP receivers 非线性MMSE估计与SbS-MAP接收机
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-06-25 DOI: 10.1109/ISIT.2000.866372
S. Galli
{"title":"Non-linear MMSE estimation and SbS-MAP receivers","authors":"S. Galli","doi":"10.1109/ISIT.2000.866372","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866372","url":null,"abstract":"For the first time it is here shown that symbol-by-symbol maximum a posteriori (SbS-MAP) receivers are able to generate non-linear minimum mean square error (NL-MMSE) estimates of the transmitted symbols.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121536495","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}
引用次数: 6
Art of constructing low-complexity encoders/decoders for constrained block codes 为受限分组码构造低复杂度编码器/解码器的艺术
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-06-25 DOI: 10.1109/ISIT.2000.866439
D. Modha, B. Marcus
{"title":"Art of constructing low-complexity encoders/decoders for constrained block codes","authors":"D. Modha, B. Marcus","doi":"10.1109/ISIT.2000.866439","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866439","url":null,"abstract":"Suppose we are given a block code, that is, a list of at least 2/sup p/ q-bit self-concatenable codewords. A rate p:q block encoder is a dataword-to-codeword assignment from 2/sup p/ p-bit datawords to 2/sup p/ q-bit codewords, and the corresponding block decoder is the inverse of the encoder. We propose efficient heuristic computer algorithms (i) to eliminate the excess codewords; and (ii) to construct low hardware complexity block encoders/decoders. Constructing low-complexity encoder/decoders for very high rate codes is of immense economical value-as these codes may be implemented in mass-market magnetic recording systems. For several practical constraints, block encoders/decoders generated using the proposed algorithms are comparable in complexity to human-generated encoders/decoders, but are significantly simpler than lexicographical encoders/decoders.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121628184","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}
引用次数: 7
Universal prediction of individual binary sequences in the presence of arbitrarily varying, memoryless additive noise 在存在任意变化的、无记忆的加性噪声的情况下对单个二值序列的通用预测
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-06-25 DOI: 10.1109/ISIT.2000.866387
T. Weissman, N. Merhav
{"title":"Universal prediction of individual binary sequences in the presence of arbitrarily varying, memoryless additive noise","authors":"T. Weissman, N. Merhav","doi":"10.1109/ISIT.2000.866387","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866387","url":null,"abstract":"The problem of predicting the next outcome of an individual binary sequence, based on past observations which are corrupted by arbitrarily varying memoryless additive noise, is considered. The goal of the predictor is to perform, for each individual sequence, \"almost\" as well as the best in a set of experts, where performance is evaluated using a general loss function. This setting is a generalization of the original problem of universal prediction of individual sequences relative to a set of experts.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122999100","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
Contradicting a myth: good turbo codes with large memory order 与神话相矛盾:具有大内存顺序的良好涡轮码
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-06-25 DOI: 10.1109/ISIT.2000.866414
P. Massey, O.Y. Takeshita, D. J. Costello
{"title":"Contradicting a myth: good turbo codes with large memory order","authors":"P. Massey, O.Y. Takeshita, D. J. Costello","doi":"10.1109/ISIT.2000.866414","DOIUrl":"https://doi.org/10.1109/ISIT.2000.866414","url":null,"abstract":"The purpose of this paper is to contradict a common myth about turbo codes. We are specifically addressing R=1/3 parallel-concatenated codes using systematic, recursive constituent codes. Myth: Turbo codes consisting of constituent codes with large memory order (i.e., a large number of trellis states) are not as effective as the original Berrou-Glavieux-Thitimajshima turbo code (1993) in the waterfall region of small signal-to-noise ratios (SNRs). This myth is contradicted by a turbo code whose recursive constituent codes have 256 states. Decoding this turbo code with the BCJR APP decoder gives bit-error-rate (BER) and frame-error-rate (FER) performance better than the original (Berrou) turbocode at all SNRs.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122190367","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}
引用次数: 18
首页 上一页 下一页 尾页
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学术文献互助群
群 号：604180095
Book学术官方微信