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

2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC)最新文献

筛选
英文 中文
Interleaver design for spectrally-efficient bit-interleaved LDPC-coded modulation 频谱高效位交错ldpc编码调制的交织器设计
2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC) Pub Date : 2012-10-08 DOI: 10.1109/ISTC.2012.6325235
S. Nowak, R. Kays
{"title":"Interleaver design for spectrally-efficient bit-interleaved LDPC-coded modulation","authors":"S. Nowak, R. Kays","doi":"10.1109/ISTC.2012.6325235","DOIUrl":"https://doi.org/10.1109/ISTC.2012.6325235","url":null,"abstract":"A design methodology for interleavers in bit-interleaved coded modulation systems deploying (binary irregular) low-density parity-check (LDPC) codes and higher-order modulation is presented. The interleaver is introduced to balance unequal error protection characteristics inherent in coding and modulation. For this purpose, mapping distributions are used to describe the interleaver configuration. Furthermore, an optimization procedure is applied to derive good mapping distributions for practical block lengths in the order of 102-103 bits. Exemplary numerical results are presented for higher-order modulation and LDPC codes as defined in the IEEE standard 802.11n.","PeriodicalId":197982,"journal":{"name":"2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC)","volume":"126 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122486152","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
Utilization of 2-D Markov source correlation using block turbo codes 利用块涡轮码的二维马尔可夫源相关
2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC) Pub Date : 2012-10-08 DOI: 10.1109/ISTC.2012.6325198
M. Izhar, N. Fisal, Xiaobo Zhou, K. Anwar, T. Matsumoto
{"title":"Utilization of 2-D Markov source correlation using block turbo codes","authors":"M. Izhar, N. Fisal, Xiaobo Zhou, K. Anwar, T. Matsumoto","doi":"10.1109/ISTC.2012.6325198","DOIUrl":"https://doi.org/10.1109/ISTC.2012.6325198","url":null,"abstract":"This paper proposes a joint source-channel coding technique using high rate block turbo codes where two-dimensional (2-D) source correlation of binary Markov source is well exploited. A modified Bahl-Cocke-Jelinek-Raviv (BCJR) algorithm is used in both horizontal and vertical decoders to exploit the 2-D source correlation. Based on extrinsic information transfer (EXIT) chart analysis and trajectory evaluation, we found out that the log-likelihood ratio (LLR) correlation for the block turbo codes increases as the source correlation becomes stronger and this prevents iterative decoding from convergence. A memory-1 accumulator with random interleaver is added to the design to minimise the LLR correlation and to achieve better performance when the source correlation is very strong. Further improvement can be achieved by replacing the memory-1 accumulator with a longer memory code to further reduce the statistical dependency of the LLR. It is shown that the proposed technique can achieve significant improvement over the standard system where the source correlation is not exploited.","PeriodicalId":197982,"journal":{"name":"2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127820863","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
Spatially coupled protograph-based LDPC codes for incremental redundancy 增量冗余的基于空间耦合原型的LDPC码
2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC) Pub Date : 2012-10-08 DOI: 10.1109/ISTC.2012.6325218
Walter P. Nitzold, M. Lentmaier, G. Fettweis
{"title":"Spatially coupled protograph-based LDPC codes for incremental redundancy","authors":"Walter P. Nitzold, M. Lentmaier, G. Fettweis","doi":"10.1109/ISTC.2012.6325218","DOIUrl":"https://doi.org/10.1109/ISTC.2012.6325218","url":null,"abstract":"We investigate a family of protograph based rate-compatible LDPC convolutional codes. The code family shows improved thresholds close to the Shannon limit compared to their uncoupled versions for the binary erasure channel as well as the AWGN channel. In fact, the gap to Shannon limit is almost uniform for all members of the code family ensuring good performance for all subsequent incremental redundancy transmissions. Compared to similar code families based on regular LDPC codes [1] the complexity of our approach grows slower for the considered rates.","PeriodicalId":197982,"journal":{"name":"2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122159822","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
New quasi-cyclic LDPC codes with girth at least eight based on Sidon sequences 基于Sidon序列的周长至少为8的拟循环LDPC码
2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC) Pub Date : 2012-10-08 DOI: 10.1109/ISTC.2012.6325193
Guohua Zhang, Rong Sun, Xinmei Wang
{"title":"New quasi-cyclic LDPC codes with girth at least eight based on Sidon sequences","authors":"Guohua Zhang, Rong Sun, Xinmei Wang","doi":"10.1109/ISTC.2012.6325193","DOIUrl":"https://doi.org/10.1109/ISTC.2012.6325193","url":null,"abstract":"A new family of quasi-cyclic low-density parity-check (LDPC) codes of girth at least eight is explicitly constructed from Sidon sequences. These codes can be encoded using simple shift-registers. Furthermore, for short to moderate lengths these quasi-cyclic codes perform close to random progressive edge-growth (PEG) LDPC codes in terms of bit-error probability and block-error probability, collectively.","PeriodicalId":197982,"journal":{"name":"2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128304742","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
Low ML-detection complexity, adaptive 2×2 STBC, with powerful FEC codes 低ml检测复杂度，自适应2×2 STBC，具有强大的FEC代码
2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC) Pub Date : 2012-10-08 DOI: 10.1109/ISTC.2012.6325226
A. Falou, C. Langlais, C. A. Nour, C. Douillard
{"title":"Low ML-detection complexity, adaptive 2×2 STBC, with powerful FEC codes","authors":"A. Falou, C. Langlais, C. A. Nour, C. Douillard","doi":"10.1109/ISTC.2012.6325226","DOIUrl":"https://doi.org/10.1109/ISTC.2012.6325226","url":null,"abstract":"We present an adaptive space time block code (STBC) for 2×2 MIMO systems designed to be used with powerful forward error correcting (FEC) codes and having a low ML-detection complexity. STBCs are commonly designed according to the rank-determinant criteria, suitable for high signal to noise ratio (SNR) values. However, powerful FEC codes like turbo codes achieve iterative convergence at low to moderate SNR. Thus, we first propose a non-asymptotic STBC design criterion based on the bitwise mutual information (BMI) maximization at a specific target SNR. According to this criterion, an adaptive matrix D based STBC is defined for a wide range of SNRs. Resulting code outperforms the original matrix D and closes the gap to the more complex Golden code in the context of a WiMAX system.","PeriodicalId":197982,"journal":{"name":"2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128261066","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
A novel soft equalization for MIMO systems with recycled extrinsic information 一种具有外部信息循环的MIMO系统软均衡方法
2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC) Pub Date : 2012-10-08 DOI: 10.1109/ISTC.2012.6325219
O. Oguz
{"title":"A novel soft equalization for MIMO systems with recycled extrinsic information","authors":"O. Oguz","doi":"10.1109/ISTC.2012.6325219","DOIUrl":"https://doi.org/10.1109/ISTC.2012.6325219","url":null,"abstract":"This paper introduces a novel soft equalization technique to be employed in the iterative receivers for the reception of MIMO channels. In a nutshell the proposed soft equalization technique utilizes the extrinsic information which is provided by a soft decoder in such a way that its output contains traces of the extrinsic information. The resulting structure results in a symbol-wise iterative soft equalization and it provides significant improvement in the convergence speed over the classical schemes when iterative soft equalizer is selected along with a constellation size dependent improvement on the error performance.","PeriodicalId":197982,"journal":{"name":"2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125316294","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
Short low-rate non-binary turbo codes 短低速率非二进制涡轮码
2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC) Pub Date : 2012-10-08 DOI: 10.1109/ISTC.2012.6325195
G. Liva, B. Matuz, E. Paolini, M. Chiani
{"title":"Short low-rate non-binary turbo codes","authors":"G. Liva, B. Matuz, E. Paolini, M. Chiani","doi":"10.1109/ISTC.2012.6325195","DOIUrl":"https://doi.org/10.1109/ISTC.2012.6325195","url":null,"abstract":"A serial concatenation of an outer non-binary turbo code with different inner binary codes is introduced and analyzed. The turbo code is based on memory-1 time-variant recursive convolutional codes over high order fields. The resulting codes possess low rates and capacity-approaching performance, thus representing an appealing solution for spread spectrum communications. The performance of the scheme is investigated on the additive white Gaussian noise channel with coherent and noncoherent detection via density evolution analysis. The proposed codes compare favorably w.r.t. other low rate constructions in terms of complexity/performance trade-off. Low error floors and performances close to the sphere packing bound are achieved down to small block sizes (k =192 information bits).","PeriodicalId":197982,"journal":{"name":"2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126715849","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
Pairwise joint probability propagation in BICM-ID BICM-ID中的成对联合概率传播
2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC) Pub Date : 2012-10-08 DOI: 10.1109/ISTC.2012.6325188
F. Alberge
{"title":"Pairwise joint probability propagation in BICM-ID","authors":"F. Alberge","doi":"10.1109/ISTC.2012.6325188","DOIUrl":"https://doi.org/10.1109/ISTC.2012.6325188","url":null,"abstract":"The iterative decoding of BICM is analyzed from an optimization point of view. The objective function underlying the standard iterative decoding is a coarse approximation of the optimal Maximum Likelihood Decoding. This approximation is suitable when large block of data are processed but may be critical for short blocks. In this contribution, it is proved that refined approximations can be obtained by propagating extrinsics on groups of bits. The particular case of pairwise joint probability propagation is investigated. Its computational complexity is similar to standard iterative decoding. Simulations show the favorable behavior of the proposed method.","PeriodicalId":197982,"journal":{"name":"2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC)","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132412714","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
Low-density hybrid-check coded superposition mapping in BICM-OFDM BICM-OFDM中的低密度混合校验编码叠加映射
2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC) Pub Date : 2012-10-08 DOI: 10.1109/ISTC.2012.6325225
Zhenyu Shi, P. Hoeher
{"title":"Low-density hybrid-check coded superposition mapping in BICM-OFDM","authors":"Zhenyu Shi, P. Hoeher","doi":"10.1109/ISTC.2012.6325225","DOIUrl":"https://doi.org/10.1109/ISTC.2012.6325225","url":null,"abstract":"Superposition mapping (SM) is known to be capacity achieving on the Gaussian channel, but an outer code is necessary because SM is a non-bijective modulation scheme. Towards this goal, the combination of SM with bit-interleaved coded modulation (BICM) has extensively been studied for the Gaussian channel. SM in conjunction with BICM-OFDM has recently been proposed by the authors for frequency-selective fading channels. In this paper, the results are extended by applying the concept of low-density hybrid-check (LDHC) coding. We propose a flexible overall code design taking adaptive bit loads into account. The performance of the system proposal is analyzed, with special focus on the degree allocation of the concatenated code, and the effect of iterations.","PeriodicalId":197982,"journal":{"name":"2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130422824","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 memory reduced decoding scheme for double binary convolutional turbo code based on forward recalculation 一种基于前向重计算的双二进制卷积turbo码内存缩减译码方案
2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC) Pub Date : 2012-10-08 DOI: 10.1109/ISTC.2012.6325203
Ming Zhan, Liang Zhou
{"title":"A memory reduced decoding scheme for double binary convolutional turbo code based on forward recalculation","authors":"Ming Zhan, Liang Zhou","doi":"10.1109/ISTC.2012.6325203","DOIUrl":"https://doi.org/10.1109/ISTC.2012.6325203","url":null,"abstract":"In the implementation of iterative decoder for double binary convolutional turbo code (DB CTC), memory accessing accounts for a large part of the overall power consumption. In this paper, an iterative decoding scheme with small memory size is proposed. The new method is based on an improved maximum a posterior probability (MAP) algorithm, and stores part of the backward metrics in the state metrics cache (SMC). While at the corresponding time that the not stored metrics are used, they can be recalculated by a Compare-Select-Recalculate Processing (CSRP) unit in the forward direction. Since the memory size for SMC is 25% decreased as compared with conventional scheme, less memory accessing is needed. Moreover, complexity analysis and numerical simulation are presented to demonstrate the effectiveness of our proposed scheme.","PeriodicalId":197982,"journal":{"name":"2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC)","volume":"8 10","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132227594","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
首页 上一页 下一页 尾页
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学术官方微信