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

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

筛选
英文 中文
Selection procedure for binary turbocode permutation parameters 二进制涡轮码排列参数的选择程序
2008 5th International Symposium on Turbo Codes and Related Topics Pub Date : 2008-10-24 DOI: 10.1109/TURBOCODING.2008.4658710
Y. Saouter
{"title":"Selection procedure for binary turbocode permutation parameters","authors":"Y. Saouter","doi":"10.1109/TURBOCODING.2008.4658710","DOIUrl":"https://doi.org/10.1109/TURBOCODING.2008.4658710","url":null,"abstract":"Permutation design is a crucial point for turbocodes in terms of error correction performance. Many permutation design models have been proposed to deal with this point. However, most of them are defined in terms of several free parameters that have to be correctly chosen. In this article, we describe a new criterion to optimize the choice of the permutation. Then we use it with two other standard criteria to design a procedure which enables only those permutation sets giving good performance to be selected.","PeriodicalId":284046,"journal":{"name":"2008 5th International Symposium on Turbo Codes and Related Topics","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115487016","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
MMSE turbo equalization using a low complexity series expansion to approximate the matrix inversion in frequency selective MIMO channels 使用低复杂度级数展开的MMSE turbo均衡来近似频率选择性MIMO信道中的矩阵反转
2008 5th International Symposium on Turbo Codes and Related Topics Pub Date : 2008-10-24 DOI: 10.1109/TURBOCODING.2008.4658698
N. Le Josse, C. Laot, K. Amis
{"title":"MMSE turbo equalization using a low complexity series expansion to approximate the matrix inversion in frequency selective MIMO channels","authors":"N. Le Josse, C. Laot, K. Amis","doi":"10.1109/TURBOCODING.2008.4658698","DOIUrl":"https://doi.org/10.1109/TURBOCODING.2008.4658698","url":null,"abstract":"The paper describes a novel approach to overcome the need for matrix inversion required by minimum mean square error (MMSE) turbo equalization in MIMO systems. In particular, turbo MMSE equalization based on an efficient series expansion from a truncated Taylor series expansion to approximate the matrix inversion is addressed. By adjusting a scaling factor, the proposed series expansion is directly optimized according to a fixed order with respect to a system performance criterion for each source to be estimated. The proposed approach enables low complexity receiver without the need for a complicated eigenvalue calculation procedure. From the first order, the proposed series expansion ensures the best bit error rate performance with a simple non iterative receiver in comparison with previous approaches. Taking advantage of the iterative process, the resulting MMSE turbo equalizer reaches the matched filter bound.","PeriodicalId":284046,"journal":{"name":"2008 5th International Symposium on Turbo Codes and Related Topics","volume":"164 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127301960","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
Decoding of LDPC codes with binary vector messages and scalable complexity 解码LDPC码与二进制矢量消息和可扩展的复杂性
2008 5th International Symposium on Turbo Codes and Related Topics Pub Date : 2008-10-24 DOI: 10.1109/TURBOCODING.2008.4658724
Gottfried Lechner, I. Land, Lars K. Rasmussen
{"title":"Decoding of LDPC codes with binary vector messages and scalable complexity","authors":"Gottfried Lechner, I. Land, Lars K. Rasmussen","doi":"10.1109/TURBOCODING.2008.4658724","DOIUrl":"https://doi.org/10.1109/TURBOCODING.2008.4658724","url":null,"abstract":"In this paper, an iterative decoder for LDPC codes, suitable for high-speed processing, is proposed and analyzed. The messages exchanged between the nodes are binary vectors, where the information is conveyed by the number of ones rather than their positions in the vector. Regarding this aspect, the approach exhibits some similarities to stochastic decoding techniques. The check node decoders perform simple bit-wise modulo-2 additions, whereas the variable node decoders perform more complex processing tasks, making the resulting structure attractive for high-speed hardware implementation. By selecting the length of the binary vector messages between one and infinity, the complexity and the performance of the decoder can be scaled between that of the original binary message passing algorithm and that of the sum-product algorithm. Density evolution is developed for the proposed decoding algorithm, and decoding thresholds are determined as functions of the length of the binary vector messages. Simulation results exemplify the performance for finite-length codes.","PeriodicalId":284046,"journal":{"name":"2008 5th International Symposium on Turbo Codes and Related Topics","volume":"21 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126726766","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
High throughput hardware architecture for (1440,1344) low-density parity-check code utilizing quasi-cyclic structure 利用准循环结构的(1440,1344)低密度奇偶校验码的高吞吐量硬件架构
2008 5th International Symposium on Turbo Codes and Related Topics Pub Date : 2008-10-24 DOI: 10.1109/TURBOCODING.2008.4658676
H. Yamagishi, M. Noda
{"title":"High throughput hardware architecture for (1440,1344) low-density parity-check code utilizing quasi-cyclic structure","authors":"H. Yamagishi, M. Noda","doi":"10.1109/TURBOCODING.2008.4658676","DOIUrl":"https://doi.org/10.1109/TURBOCODING.2008.4658676","url":null,"abstract":"High throughput architecture of an encoder and a decoder for a quasi-cyclic low-density parity-check (LDPC) code is proposed. A new systematic encoding method is carried out by polynomial manipulation. The proposed decoder architecture, where the check-node process is split into two processes so that the memory access becomes column-wise, enables overlapped message-passing for any parity-check matrix. The hardware architecture for the check-node processes utilizing a quasi-cyclic structure does not require complex multiplexers. Hardware employing the proposed architecture for a (1440,1344) LDPC code designed for high throughput millimeter wave application is evaluated using 65 nm CMOS technology. The gate count of the encoder for 3 Gbps and 6 Gbps throughput is 2.5 k and 3.1 k, respectively, and the gate count of the decoder for 8 iterations is 304 k and 409 k, respectively. A bit-error rate of 10-6 is obtained at Eb/N0 of 5.9 dB, and the estimated power consumption of the decoder is 58 mW for 3 Gbps and 86 mW for 6 Gbps.","PeriodicalId":284046,"journal":{"name":"2008 5th International Symposium on Turbo Codes and Related Topics","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116078481","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
The performance of sphere decoders for iterative Spatial Multiplexing MIMO receiver 球面解码器在迭代空间复用MIMO接收机中的性能
2008 5th International Symposium on Turbo Codes and Related Topics Pub Date : 2008-10-24 DOI: 10.1109/TURBOCODING.2008.4658682
Ming Zhao, Zhenning Shi, Mark C. Reed
{"title":"The performance of sphere decoders for iterative Spatial Multiplexing MIMO receiver","authors":"Ming Zhao, Zhenning Shi, Mark C. Reed","doi":"10.1109/TURBOCODING.2008.4658682","DOIUrl":"https://doi.org/10.1109/TURBOCODING.2008.4658682","url":null,"abstract":"Pohst and Schnorr-Euchner (SE) are two popular sphere decoders (SD) to perform near maximum likelihood (ML) detection in Spatial Multiplexing multiple-input-multiple-output (MIMO) system. Recent work [1] showed Pohst and SE are two variants of the well known stack sequential decoding and proposed modification to each strategy to shown significant complexity reduction but with near ML performance. This paper proposed modified Pohst and SE algorithms by taking into account the a priori information to estimate the maximum a posteriori (MAP) probability of the received symbol sequence. Simulation results show that significant performance gain can be achieved from iterative MAP approach and complexity reduction can be obtained for SE enumeration strategy with minor performance loss compared to Phost enumeration algorithm.","PeriodicalId":284046,"journal":{"name":"2008 5th International Symposium on Turbo Codes and Related Topics","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114564134","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
Average min-sum decoding of LDPC codes LDPC码的平均最小和译码
2008 5th International Symposium on Turbo Codes and Related Topics Pub Date : 2008-10-24 DOI: 10.1109/TURBOCODING.2008.4658725
N. Axvig, D. Dreher, K. Morrison, E. Psota, L. C. Pérez, J.L. Walker
{"title":"Average min-sum decoding of LDPC codes","authors":"N. Axvig, D. Dreher, K. Morrison, E. Psota, L. C. Pérez, J.L. Walker","doi":"10.1109/TURBOCODING.2008.4658725","DOIUrl":"https://doi.org/10.1109/TURBOCODING.2008.4658725","url":null,"abstract":"Simulations have shown that the outputs of min-sum (MS) decoding generally behave in one of two ways: either the output vector eventually stabilizes at a codeword or it eventually cycles through a finite set of vectors that may include both codewords and non-codewords. The latter behavior has significantly contributed to the difficulty in studying the performance of this decoder. To overcome this problem, a new decoder, average min-sum (AMS), is proposed; this decoder outputs the average of the MS output vectors over a finite set of iterations. Simulations comparing MS, AMS, linear programming (LP) decoding, and maximum likelihood (ML) decoding are presented, illustrating the relative performances of each of these decoders. In general, MS and AMS have comparable word error rates; however, in the simulation of a code with large block length, AMS has a significantly lower bit error rate. Finally, AMS pseudocodewords are introduced and their relationship to graph cover and LP pseudocodewords is explored, with particular focus on the AMS pseudocodewords of regular LDPC codes and cycle codes.","PeriodicalId":284046,"journal":{"name":"2008 5th International Symposium on Turbo Codes and Related Topics","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124604348","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}
引用次数: 12
A reduced-complexity box-plus decoder for LDPC codes LDPC码的低复杂度盒加解码器
2008 5th International Symposium on Turbo Codes and Related Topics Pub Date : 2008-10-24 DOI: 10.1109/TURBOCODING.2008.4658689
Matthew Viens, W. Ryan
{"title":"A reduced-complexity box-plus decoder for LDPC codes","authors":"Matthew Viens, W. Ryan","doi":"10.1109/TURBOCODING.2008.4658689","DOIUrl":"https://doi.org/10.1109/TURBOCODING.2008.4658689","url":null,"abstract":"The primary contribution of this paper is the full description of a new decoder for LDPC codes - the reduced-complexity box-plus (RCBP) decoder. This new decoder is based on the combination of two known decoding algorithms, the box-plus decoder and the a-min* decoder. What is new, however, is the check-node processor design which is based on a highly compressed look-up table. This compression exploits the symmetry and redundancy of the full table in order to losslessly reduce the 1024-element table to merely two easily implementable logic equations. Simulations of the RCBP decoder are compared to a low-complexity decoder patented by Flarion/Qualcomm. The RCBP decoder was found to be essentially equal in terms of bit error rate and frame error rate performance. Our analysis of the RCBP decoderpsilas speed and complexity indicate that it is superior to the Flarion/Qualcomm decoder in these aspects.","PeriodicalId":284046,"journal":{"name":"2008 5th International Symposium on Turbo Codes and Related Topics","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127649373","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}
引用次数: 4
Convergence analysis of code-aided channel estimation by means of transfer charts 基于传输图的编码辅助信道估计的收敛性分析
2008 5th International Symposium on Turbo Codes and Related Topics Pub Date : 2008-10-24 DOI: 10.1109/TURBOCODING.2008.4658719
S. Godtmann, A. Ispas, G. Ascheid
{"title":"Convergence analysis of code-aided channel estimation by means of transfer charts","authors":"S. Godtmann, A. Ispas, G. Ascheid","doi":"10.1109/TURBOCODING.2008.4658719","DOIUrl":"https://doi.org/10.1109/TURBOCODING.2008.4658719","url":null,"abstract":"In this paper, we investigate the convergence behavior of code-aided channel estimation, also denoted as joint iterative channel estimation and decoding. A mutual information transfer chart is introduced in order to trace the information exchange between channel estimator and decoder throughout the iterative process. Furthermore, a heuristic concept to improve code-aided channel estimation is introduced that outperforms the classical concepts and has the major advantage that it allows for accurate convergence analysis.","PeriodicalId":284046,"journal":{"name":"2008 5th International Symposium on Turbo Codes and Related Topics","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124553778","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
Nonbinary group decoder diversity for decoding dense block codes 用于解码密集分组码的非二进制组解码器分集
2008 5th International Symposium on Turbo Codes and Related Topics Pub Date : 2008-10-24 DOI: 10.1109/TURBOCODING.2008.4658727
D. Declercq
{"title":"Nonbinary group decoder diversity for decoding dense block codes","authors":"D. Declercq","doi":"10.1109/TURBOCODING.2008.4658727","DOIUrl":"https://doi.org/10.1109/TURBOCODING.2008.4658727","url":null,"abstract":"In this paper, we present a new and promising framework, called ldquogroup decoder diversityrdquo based on the observation that different non-binary Tanner graphs of the same binary code, decoded with a non-binary belief propagation decoder can have distinct convergence behaviors and fixed points. This framework is especially interesting for binary codes which are dense or locally-dense, and for which the usual binary iterative decoders perform far from the optimum curves. By using the diversity brought by decoding distinct Tanner graphs of the same code, we managed to have very good decoding performance for BCH codes over BPSK-AWGN and BSC channels.","PeriodicalId":284046,"journal":{"name":"2008 5th International Symposium on Turbo Codes and Related Topics","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116286174","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}
引用次数: 4
A practical low-density coding scheme for binary dirty paper channel 一种实用的二进位脏纸通道低密度编码方案
2008 5th International Symposium on Turbo Codes and Related Topics Pub Date : 2008-10-24 DOI: 10.1109/TURBOCODING.2008.4658732
F. Kayhan, Toshiyuki Tanaka
{"title":"A practical low-density coding scheme for binary dirty paper channel","authors":"F. Kayhan, Toshiyuki Tanaka","doi":"10.1109/TURBOCODING.2008.4658732","DOIUrl":"https://doi.org/10.1109/TURBOCODING.2008.4658732","url":null,"abstract":"Recently, dirty-paper coding has been attracting a lot of attentions due to its connection with various problems such as data hiding, precoding for ISI channels and MIMO Gaussian broadcasting. One of the main challenges is to design codes with practical encoding and decoding algorithms. In this paper we propose a simple coding scheme for the binary dirty-paper channel -with the interference known non-causally to the encoder- by compounding low-density graphical structures. In our construction, the codewords of a channel code are both the bin indexes and parity-syndromes for a quantizer code. This novelty allows us to use reinforced belief propagation algorithm as a quantization algorithm for a LDPC code. Our construction has a natural nested and coset structure and achieves the capacity of dirty paper channel using random linear component codes and maximum- likelihood encoding/decoding algorithms. By selecting the constituent codes from the ensemble of LDPC codes, this scheme allows for efficient iterative (suboptimal) algorithms at both encoder and decoder.","PeriodicalId":284046,"journal":{"name":"2008 5th International Symposium on Turbo Codes and Related Topics","volume":"315 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116360723","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
下一页 尾页
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学术官方微信