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

2008 5th International Symposium on Turbo Codes and Related Topics最新文献

筛选
英文 中文
Free distance bounds for protograph-based regular LDPC convolutional codes 基于图形的正则LDPC卷积码的自由距离边界
2008 5th International Symposium on Turbo Codes and Related Topics Pub Date : 2008-04-28 DOI: 10.1109/TURBOCODING.2008.4658734
David G. M. Mitchell, A. E. Pusane, N. Goertz, D. Costello
{"title":"Free distance bounds for protograph-based regular LDPC convolutional codes","authors":"David G. M. Mitchell, A. E. Pusane, N. Goertz, D. Costello","doi":"10.1109/TURBOCODING.2008.4658734","DOIUrl":"https://doi.org/10.1109/TURBOCODING.2008.4658734","url":null,"abstract":"In this paper, asymptotic methods are used to form lower bounds on the free distance to constraint length ratio of several ensembles of regular, asymptotically good, protograph-based LDPC convolutional codes. In particular, we show that the free distance to constraint length ratio of the regular LDPC convolutional codes exceeds that of the minimum distance to block length ratio of the corresponding LDPC block codes.","PeriodicalId":284046,"journal":{"name":"2008 5th International Symposium on Turbo Codes and Related Topics","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115773297","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
Lower bounds on the rate-distortion function of individual LDGM codes 个别LDGM码的率失真函数下界
2008 5th International Symposium on Turbo Codes and Related Topics Pub Date : 2008-04-10 DOI: 10.1109/TURBOCODING.2008.4658729
S. Kudekar, R. Urbanke
{"title":"Lower bounds on the rate-distortion function of individual LDGM codes","authors":"S. Kudekar, R. Urbanke","doi":"10.1109/TURBOCODING.2008.4658729","DOIUrl":"https://doi.org/10.1109/TURBOCODING.2008.4658729","url":null,"abstract":"We consider lossy compression of a binary symmetric source by means of a low-density generator-matrix code. We derive two lower bounds on the rate distortion function which are valid for any low-density generator-matrix code with a given node degree distribution L(x) on the set of generators and for any encoding algorithm. These bounds show that, due to the sparseness of the code, the performance is strictly bounded away from the Shannon rate-distortion function. In this sense, our bounds represent a natural generalization of Gallagerpsilas bound on the maximum rate at which low-density parity-check codes can be used for reliable transmission. Our bounds are inspired by the recent work of Dimakis, Wainwright, and Ramchandran, but they apply to individual codes.","PeriodicalId":284046,"journal":{"name":"2008 5th International Symposium on Turbo Codes and Related Topics","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129934369","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}
引用次数: 13
Irregular turbo code design for the binary erasure channel 二进制擦除信道的不规则turbo码设计
2008 5th International Symposium on Turbo Codes and Related Topics Pub Date : 2008-04-03 DOI: 10.1109/TURBOCODING.2008.4658711
G. Kraidy, V. Savin
{"title":"Irregular turbo code design for the binary erasure channel","authors":"G. Kraidy, V. Savin","doi":"10.1109/TURBOCODING.2008.4658711","DOIUrl":"https://doi.org/10.1109/TURBOCODING.2008.4658711","url":null,"abstract":"In this paper, the design of irregular turbo codes for the binary erasure channel is investigated. An analytic expression of the erasure probability of punctured recursive systematic convolutional codes is derived. This expression will be used to study the density evolution of turbo codes over the binary erasure channel, that will allow for the design of capacity-approaching irregular turbo codes. Next, we propose a graph-optimal interleaver for irregular turbo codes. Simulation results for different coding rates are shown at the end.","PeriodicalId":284046,"journal":{"name":"2008 5th International Symposium on Turbo Codes and Related Topics","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132473147","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
Lower bounds on the minimum pseudodistance for linear codes with q-ary PSK modulation over AWGN AWGN上q位PSK调制线性码的最小伪距离下界
2008 5th International Symposium on Turbo Codes and Related Topics Pub Date : 2008-03-26 DOI: 10.1109/TURBOCODING.2008.4658737
Vitaly Skachek, M. Flanagan
{"title":"Lower bounds on the minimum pseudodistance for linear codes with q-ary PSK modulation over AWGN","authors":"Vitaly Skachek, M. Flanagan","doi":"10.1109/TURBOCODING.2008.4658737","DOIUrl":"https://doi.org/10.1109/TURBOCODING.2008.4658737","url":null,"abstract":"We present lower bounds on the minimum pseudocodeword effective Euclidean distance (or minimum ldquopseudodistancerdquo) for coded modulation systems using linear codes with q-ary phase-shift keying (PSK) modulation over the additive white Gaussian noise (AWGN) channel. These bounds apply to both binary and nonbinary coded modulation systems which use direct modulation mapping of coded symbols. The minimum pseudodistance may serve as a first-order measure of error-correcting performance for both linear-programming and message-passing based receivers. In the case of a linear-programming based receiver, the minimum pseudodistance may be used to form an exact bound on the codeword error rate of the system.","PeriodicalId":284046,"journal":{"name":"2008 5th International Symposium on Turbo Codes and Related Topics","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122373772","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
首页 上一页
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学术官方微信