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

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

筛选
英文 中文
Comparison of LDPC block and LDPC convolutional codes based on their decoding latency LDPC块码与LDPC卷积码的译码延迟比较
2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC) Pub Date : 2012-10-08 DOI: 10.1109/ISTC.2012.6325232
N. Hassan, M. Lentmaier, G. Fettweis
{"title":"Comparison of LDPC block and LDPC convolutional codes based on their decoding latency","authors":"N. Hassan, M. Lentmaier, G. Fettweis","doi":"10.1109/ISTC.2012.6325232","DOIUrl":"https://doi.org/10.1109/ISTC.2012.6325232","url":null,"abstract":"We compare LDPC block and LDPC convolutional codes with respect to their decoding performance under low decoding latencies. Protograph based regular LDPC codes are considered with rather small lifting factors. LDPC block and convolutional codes are decoded using belief propagation. For LDPC convolutional codes, a sliding window decoder with different window sizes is applied to continuously decode the input symbols. We show the required Eb/N0 to achieve a bit error rate of 10-5 for the LDPC block and LDPC convolutional codes for the decoding latency of up to approximately 550 information bits. It has been observed that LDPC convolutional codes perform better than the block codes from which they are derived even at low latency. We demonstrate the trade off between complexity and performance in terms of lifting factor and window size for a fixed value of latency. Furthermore, the two codes are also compared in terms of their complexity as a function of Eb/N0. Convolutional codes with Viterbi decoding are also compared with the two above mentioned codes.","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":"129786145","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}
引用次数: 45
An architecture for faster than Nyquist Turbo broadcasting 一个比奈奎斯特Turbo广播更快的架构
2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC) Pub Date : 2012-10-08 DOI: 10.1109/ISTC.2012.6325221
Yong Jin Daniel Kim, J. Bajcsy
{"title":"An architecture for faster than Nyquist Turbo broadcasting","authors":"Yong Jin Daniel Kim, J. Bajcsy","doi":"10.1109/ISTC.2012.6325221","DOIUrl":"https://doi.org/10.1109/ISTC.2012.6325221","url":null,"abstract":"Recently [16], we have proposed using faster than Nyquist (FTN) signaling to achieve transmission over continuous-time broadcast channels and shown that it can achieve the capacity region of the two-user Gaussian broadcast channel. Benefits of FTN broadcasting include separate encoding and explicit transmission of all users' data, i.e., unlike the previously proposed broadcast coding schemes, no joint encoding is needed. This paper presents a design of a Turbo-coded broadcast transmitter based on the FTN signaling. The proposed receiver architecture has a low implementation complexity and is based on Turbo decoding and successive cancellation of FTN-induced intersymbol interference. The presented simulation results indicate that the designed FTN broadcast architecture can be superior to the time-sharing broadcasting used in practice, and shows the potential to perform close to the capacity boundaries of the Gaussian broadcast channel.","PeriodicalId":197982,"journal":{"name":"2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC)","volume":"12 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":"124755194","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
Iterative detection/decoding of majority-logic decodable nonbinary LDPC codes over partial response channels 部分响应信道上多数逻辑可解码非二进制LDPC码的迭代检测/解码
2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC) Pub Date : 2012-10-08 DOI: 10.1109/ISTC.2012.6325227
Shancheng Zhao, Xiao Ma, B. Bai
{"title":"Iterative detection/decoding of majority-logic decodable nonbinary LDPC codes over partial response channels","authors":"Shancheng Zhao, Xiao Ma, B. Bai","doi":"10.1109/ISTC.2012.6325227","DOIUrl":"https://doi.org/10.1109/ISTC.2012.6325227","url":null,"abstract":"This paper is concerned with the applications of majority-logic decodable nonbinary low-density parity-check (LDPC) codes to partial response (PR) channels. We propose a joint detection/decoding algorithm that works in an iterative manner by exchanging messages between the Viterbi detector and a generalized majority logic decoder (GMLGD). The Viterbi detector is implemented over a sectionalized trellis. The hard-decisions made by the Viterbi detector are then passed to the decoder. The decoder delivers as output estimates of each coded symbols, which will be utilized in next iteration to update the branch metrics of the trellis. Since the proposed algorithm requires only integer operations and finite field operations, it can be implemented with simple combinational logic circuits. Simulation results and complexity analysis show that, when compared with the conventional turbo equalizer implemented with the BCJR algorithm and the Q-ary sum-product algorithm (BCJR-QSPA), the proposed algorithm has a much lower complexity but suffers from a little performance degradation. So the proposed algorithm provides a good candidate for trade-offs between performance and complexity.","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":"129295483","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
Analysis of high order recurrent neural networks for analog decoding 用于模拟解码的高阶递归神经网络分析
2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC) Pub Date : 2012-10-08 DOI: 10.1109/ISTC.2012.6325210
M. Mostafa, W. Teich, J. Lindner
{"title":"Analysis of high order recurrent neural networks for analog decoding","authors":"M. Mostafa, W. Teich, J. Lindner","doi":"10.1109/ISTC.2012.6325210","DOIUrl":"https://doi.org/10.1109/ISTC.2012.6325210","url":null,"abstract":"Forward error correction coding (FEC) is a classical and well known technique to improve the efficiency of a digital transmission. Despite of intensive research in this field the Shannon limit was unachievable for a long time, but today iterative techniques can approach this limit. However, iterative decoding is computationally very demanding, especially for real time applications and/or high data rates. This encouraged researchers to look for alternatives, which led to the new field of analog decoding, meaning an implementation with analog circuits. The performance gain of those analog decoders compared to a digital implementation is believed to be at least a factor of 100 in terms of speed or power consumption. In this paper we focus on iterative threshold decoding. We show that this method can be considered as a dynamical system, which can be described by high order recurrent neural networks. Using this representation we give a qualitative description of the long term behavior of such a dynamical system. The continuous time high order recurrent neural networks can be understood as the basis for an analog implementation of iterative threshold decoding.","PeriodicalId":197982,"journal":{"name":"2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC)","volume":"175 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":"116501224","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}
引用次数: 5
Improved message passing techniques in fast correlation attacks on stream ciphers 流密码快速相关攻击中改进的消息传递技术
2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC) Pub Date : 2012-10-08 DOI: 10.1109/ISTC.2012.6325183
Martin Ågren, Martin Hell, T. Johansson, Carl Löndahl
{"title":"Improved message passing techniques in fast correlation attacks on stream ciphers","authors":"Martin Ågren, Martin Hell, T. Johansson, Carl Löndahl","doi":"10.1109/ISTC.2012.6325183","DOIUrl":"https://doi.org/10.1109/ISTC.2012.6325183","url":null,"abstract":"The fast correlation attack is a general cryptanalytic attack directed at stream ciphers and is related to the decoding of low-density parity-check (LDPC) codes. In this paper, we improve the message passing algorithm by exploiting the fact that the sum of an arbitrary number of initial state variables, called a fixed point, can be written as the sum of only a few other variables. This will result in better use of information in the message passing algorithm. Simulations show that this added information results in better success probabilities for the attack. Our technique may also find applications to LDPC codes with girth 4, although such codes are normally avoided.","PeriodicalId":197982,"journal":{"name":"2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC)","volume":"55 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":"127554729","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}
引用次数: 42
A puncturing algorithm for rate-compatible LDPC convolutional codes 一种率兼容LDPC卷积码的穿刺算法
2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC) Pub Date : 2012-10-08 DOI: 10.1109/ISTC.2012.6325182
Hua Zhou, David G. M. Mitchell, N. Goertz, D. Costello
{"title":"A puncturing algorithm for rate-compatible LDPC convolutional codes","authors":"Hua Zhou, David G. M. Mitchell, N. Goertz, D. Costello","doi":"10.1109/ISTC.2012.6325182","DOIUrl":"https://doi.org/10.1109/ISTC.2012.6325182","url":null,"abstract":"A family of rate-compatible (RC) punctured low-density parity-check convolutional codes (LDPC-CCs) is derived from an LDPC-CC by periodically puncturing encoded bits (variable nodes) with respect to several criteria: (1) ensuring the recoverability of punctured variable nodes, (2) minimizing the number of completely punctured cycle trapping sets (CPCTSs), and (3) minimizing the number of punctured variable nodes involved in short cycles. As an example, a family of RC punctured LDPC-CCs with rates 4/9, 4/8, 4/7, 4/6, and 4/5 are obtained from the (21,3, 5) Tanner LDPC-CC.","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":"126469284","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
Compress-and-forward in the multiple-access relay channel: With or without network coding? 多址中继信道中的压缩转发:使用或不使用网络编码?
2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC) Pub Date : 2012-10-08 DOI: 10.1109/ISTC.2012.6325213
A. Winkelbauer, N. Goertz, G. Matz
{"title":"Compress-and-forward in the multiple-access relay channel: With or without network coding?","authors":"A. Winkelbauer, N. Goertz, G. Matz","doi":"10.1109/ISTC.2012.6325213","DOIUrl":"https://doi.org/10.1109/ISTC.2012.6325213","url":null,"abstract":"We consider compress-and-forward-based transmission strategies for the multiple-access relay channel. In particular, we study the impact of the capacity on the relay-destination link on the usefulness of network coding in this context. To this end, we compare a transmission scheme with network coding to a simple forwarding scheme without network coding. For both schemes we design optimal log-likelihood ratio (LLR) vector quantizers using the information bottleneck method. Moreover, we provide closed-form expressions for the LLR statistics at the relay which are required for the vector quantizer design. Numerical simulation results show that the usefulness of network coding depends strongly on the capacity of the relay-destination channel as well as on the number of sources.","PeriodicalId":197982,"journal":{"name":"2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC)","volume":"62 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":"131346968","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}
引用次数: 11
Irregular repeat accumulate codes with few iterations for the binary adder channel 用于二进制加法器信道的不规则重复累加码
2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC) Pub Date : 2012-10-08 DOI: 10.1109/ISTC.2012.6325230
Guangsong Wang, I. Land, A. Grant
{"title":"Irregular repeat accumulate codes with few iterations for the binary adder channel","authors":"Guangsong Wang, I. Land, A. Grant","doi":"10.1109/ISTC.2012.6325230","DOIUrl":"https://doi.org/10.1109/ISTC.2012.6325230","url":null,"abstract":"Iterative interference cancellation is a powerful technique for design of multiuser decoders. Careful encoder and decoder design is essential for reducing implementation complexity. When used in conjunction with iteratively-decodeable sparse graph codes, there is a choice to be made between the number of multiuser interference cancellation stages and the number of iterations used for decoding each user's code. Too few decoder iterations may increase the number of interference cancellation steps, whereas too many may superfluous, or even inhibit the convergence behaviour of the cancellation loop. In this paper we design non-systematic irregular repeat-accumulate codes for multiple-access channels where the number of cancellation stages and number of decoder iterations at each stage are fixed. The design goal is minimal bit error rate. Our formulation is based on extrinsic information transfer, and introduces the number of iterations directly into the curve fitting problem. For clear development of concepts, we restrict attention to the binary adder channel, where our approach is exact. Generalisation to other sparse graph codes and other multiple-access channels is straightforward, subject to the usual approximations.","PeriodicalId":197982,"journal":{"name":"2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC)","volume":"51 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":"133906833","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}
引用次数: 5
Adaptive decoding algorithms for LDPC codes with redundant check nodes 冗余校验节点LDPC码的自适应译码算法
2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC) Pub Date : 2012-10-08 DOI: 10.1109/ISTC.2012.6325222
Kai Zhang, H. Chen, Xiao Ma
{"title":"Adaptive decoding algorithms for LDPC codes with redundant check nodes","authors":"Kai Zhang, H. Chen, Xiao Ma","doi":"10.1109/ISTC.2012.6325222","DOIUrl":"https://doi.org/10.1109/ISTC.2012.6325222","url":null,"abstract":"This paper is concerned with decoding of algebraic low-density parity-check (LDPC) codes that are constructed based on finite fields and finite geometries. The parity-check matrices of such codes usually have redundant rows. Equivalently, their Tanner graphs have redundant check nodes. Based on this property, we propose an adaptive decoding algorithm. In the adaptive decoding algorithm, all the check nodes are classified into active nodes and silent nodes according to certain criteria, and only active check nodes are involved in the iterative procession. That is, each variable node collects messages from active check nodes and passes the extrinsic messages to its active neighbors. Two approaches to select the active check nodes are presented. Simulation results show that, the adaptive decoding algorithm can make a trade-off between the complexity and the performance.","PeriodicalId":197982,"journal":{"name":"2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC)","volume":"9 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131858711","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}
引用次数: 5
A 2.15GBit/s turbo code decoder for LTE advanced base station applications 2.15GBit/s turbo码解码器，适用于LTE高级基站应用
2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC) Pub Date : 2012-10-08 DOI: 10.1109/ISTC.2012.6325191
T. Ilnseher, F. Kienle, C. Weis, N. Wehn
{"title":"A 2.15GBit/s turbo code decoder for LTE advanced base station applications","authors":"T. Ilnseher, F. Kienle, C. Weis, N. Wehn","doi":"10.1109/ISTC.2012.6325191","DOIUrl":"https://doi.org/10.1109/ISTC.2012.6325191","url":null,"abstract":"The LTE standard [1], will soon be upgraded to LTE advanced, which will add new techniques like multi user MIMO using iterative demodulation, cooperative multi point reception (CoMP) and beam forming to increase the system throughput in the uplink of one cell. An eNodeB supporting multiple cells will require a throughput of multiple GBit/s. Thus a turbo code decoder with a very high throughput target while maintaining an excellent communications performance is required. The major challenge is the support of very high code rates and the stringent latency requirements. We present the first LTE advanced compliant LTE turbo code decoder with a throughput of 2.15GBit/s at frequency of 450MHz and area of 7.7mm2 in a 65nm process node with worst case P&R constraints. The decoder can perform 6 full iterations at a large window size of 192 at full throughput, which results in a highly competitive communications performance.","PeriodicalId":197982,"journal":{"name":"2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC)","volume":"4 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":"123895124","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}
引用次数: 51
下一页 尾页
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学术官方微信