检索结果-内蒙古大学图书馆

Low-complexity low-density parity check decoding algorithm for high-speed very large scale integration implementation

引用

IET COMMUNICATIONS 2012年第16期6卷 2575-2581页

作者： Angarita, F. Marin-Roig, J. Almenar, V. Valls, J. Univ Politecn Valencia Inst Telecomunicac & Aplicac Multimedia Gandia 46730 Spain

This study proposes a new low-complexity decoding algorithm for low-density parity check codes, which is a variation of the offset min-sum algorithm and achieves a similar performance with lower hardware cost. A finite precision study is presented and the hardware cost of the implementation of three very large scale integration architectures is evaluated. As a conclusion, the proposed algorithm achieves similar performance with an area saving of around 18, 10 and 14% for the memory-based partially parallel, fully parallel and sliced message passing implementations, respectively.

关键词： character parity check decoding algorithm Parity check Very large scale integration parity check codes valid parity check low density parity check codes

来源：评论

学校读者我要写书评

暂无评论

Message-Passing decoding algorithm of Low-Density Lattice Codes with Gaussian Approximation

Message-Passing Decoding Algorithm of Low-Density Lattice Co...

引用

IEEE International Conference on Wireless Information Technology and Systems (ICWITS)

作者： Li, Yang Bie, Zhisong Beijing Univ Posts & Telecommun Minist Educ Key Lab Universal Wireless Commun Beijing 100876 Peoples R China

ISBN: (纸本)9781467309479;9781467309462

In this paper we apply the single Gaussian approximation without using the moment matching method. The computation complexity is further reduced while keeping an indistinguishable performance loss. This paper is organized as follows. In section II, we describe the basic concepts of LDLC codes. Section III is devoted to describing the proposed decoding algorithm with single Gaussian approximation. Section IVpresents some simulation results. Section V concludes the paper.

关键词： Gaussian approximation COG2 gene check matrix decoding algorithm Codes message passing Gauss

来源：评论

学校读者我要写书评

暂无评论

3-Bit decoding algorithm for AWGN Channels

3-Bit Decoding Algorithm for AWGN Channels

引用

International Symposium on Information Theory and its Applications (ISITA)

作者： Kamabe, Hiroshi Ono, Hiroshi Gifu Univ Dept Informat Sci 1-1 Yanagido Gifu 5011193 Japan

ISBN: (纸本)9784885522673

Simple implementations of decoders for LDPC codes are important practical problems when the decoders have the severe energy consumption constraints or the computation time constraints. A 3-bit decoding algorithm, proposed by Planjery et al. [1], can be regarded as a simplified version of the sum-product algorithm [3]. The algorithm has a very good performance of frame error rate at the error flower region when the algorithm is used for the BSC channels. Although the 3-bit decoding algorithm is not so good for the AWGN channels, it can be shown that the performance of the 3-bit decoding algorithm can be improved by introducing bias terms. It will also be shown that the computation time for the sum-product algorithm can be decreased by applying the 3-bit decoding algorithm to outputs from the sum-product algorithm.

关键词： Sum-product algorithm 3-bit decoding algorithm decoders AWGN computational time Bit error rate AWGN channels low density parity check codes energy consumption

来源：评论

学校读者我要写书评

暂无评论

VLSI Implementation of decoding algorithms using EG-LDPC Codes

引用

Procedia Computer Science 2017年 115卷 143-150页

作者： M.N. Giri Prasad C. Chinnapu Reddy J. Chinna Babu O/o CTE Vijayawada Andhra Pradesh India

The LDPC codes are Shannon Limit codes that can achieve low bit error rates for SNR applications. The features of LDPC Codes are reduction in the decoding time, latency and as well as no error-floors at high SNRs. The proposed algorithms are SBF, MSA, and MLDD. The various decoding algorithms have been compared for these codes. The parameters are describing the which algorithm further helps in selecting the better decoder used for Medical and Signal Processing Applications. These codes are also used in Generating the Barcodes depends on the size of the Parity Check matrix.

关键词： LDPC codes decoding algorithm Shannon limit Soft Decision decoding Hard Decision decoding

来源：评论

学校读者我要写书评

暂无评论

AN IMPROVED STEADY SEGMENT BASED decoding algorithm BY USING RESPONSE PROBABILITY FOR LVCSR

AN IMPROVED STEADY SEGMENT BASED DECODING ALGORITHM BY USING...

引用

8th International Symposium on Chinese Spoken Language Processing (ISCSLP)

作者： Yang, Zhanlei Liu, Wenju Chao, Hao Chinese Acad Sci Inst Automat NLPR Beijing 100190 Peoples R China

ISBN: (纸本)9781467325073;9781467325066

This paper proposes a novel decoding algorithm by integrating both steady speech segments and observations' location information into conventional path extension framework. First, speech segments which possess stable spectrum are extracted. Second, a preliminarily improved algorithm is given by modifying traditional inter-HMM extension framework using the detected steady segments. Then, at probability calculation stage, response probability (RP), which represents location information of observations within acoustic feature space, is further incorporated into decoding. Thus, RP directs the decoder to enhance/weaken path candidates that get through the front end steady-segment-based decoding. Experiments conducted on Mandarin speech recognition show that character error rate of proposed algorithm achieves a 4.6% relative reduction when compared with a system in which only steady segment is used, and run time factor achieves a 10.0% relative reduction when compared with a system in which only RP is used.

关键词： decoding algorithm path extension steady segment response probability probability fusion

来源：评论

学校读者我要写书评

暂无评论

A Novel Hardware-Oriented decoding algorithm for Non-binary LDPC Codes

A Novel Hardware-Oriented Decoding Algorithm for Non-binary ...

引用

IEEE Asia Pacific Conference on Circuits and Systems (APCCAS)

作者： Yang, Hong Yang, Qing-qing Fang, Yuanwei Zhou, Xiaofang Sobelman, Gerald E. Fudan Univ State Key Lab ASIC & Syst Shanghai 200433 Peoples R China Univ Minnesota Dept Elect & Comp Engn Minneapolis MN USA

ISBN: (纸本)9781457717284;9781457717291

This paper presents a novel hardware-oriented decoding algorithm in the log-domain for non-binary LDPC codes over GF(2(m)). As for max-log-SPA, only summations and comparisons are required in this new algorithm. During the vertical update, these two operations are divided into layers based on the distribution of variable vectors that satisfy the check function. The number of additions during the vertical update is reduced by a factor of approximately p-2 without a performance loss, where p is the row weight of the parity check matrix.

关键词： check matrix decoding algorithm low density parity check codes vertical

来源：评论

学校读者我要写书评

暂无评论

LDPC Decoder Based on Markov Chain Monte Carlo Method 14

LDPC Decoder Based on Markov Chain Monte Carlo Method

引用

14th IEEE Asia Pacific Conference on Circuits and Systems (APCCAS)

作者： Jin, Jiejun Liang, Xiao Xu, Yunhao Zhang, Zaichen You, Xiaohu Zhang, Chuan Southeast Univ Lab Efficient Architectures Digital Commun & Sign Nanjing Jiangsu Peoples R China Southeast Univ Natl Mobile Commun Res Lab Nanjing Jiangsu Peoples R China Southeast Univ Chien Shiung Wu Coll Nanjing Jiangsu Peoples R China Southeast Univ Quantum Informat Ctr Nanjing Jiangsu Peoples R China

ISBN: (纸本)9781538682401

Low-density parity check (LDPC) codes have attracted the attention of a large number of researchers with its near-Shannon performance and easy implementation features. As a data coding scheme under the 5G scenario, how to achieve efficient encoding/decoding for LDPC codes has become one of the important research topics. Under this condition, this paper 1) proposes a novel decoding algorithm for LDPC codes using the Markov Chain Monte Carlo (MCMC) method and 2) introduces two improved versions, MCMC-S and MCMC-L, which achieve better results. Simulation figures show that the improved methods outperform the traditional belief propagation (BP) decoding method in relatively short codes by more than 1 dB at the bit error rate (BER) of 10. Very large scale integration (VLSI) architecture of the proposed method is also given in this paper.

关键词： LDPC codes decoding algorithm Markov Chain Monte Carlo (MCMC) method VLSI

来源：评论

学校读者我要写书评

暂无评论

A QC-LDPC code based digital signature algorithm

A QC-LDPC code based digital signature algorithm

引用

International Conference on Networking and Network Applications (NaNA)

作者： Ren, Fang Yang, Xuefei Zheng, Dong Xian Univ Posts & Telecommun Sch Telecommun & Informat Engn Xian Shaanxi Peoples R China Xian Univ Posts & Telecommun Natl Engn Lab Wireless Secur Xian Shaanxi Peoples R China

ISBN: (纸本)9781538683033

CFS digital signature algorithm, which proposed in 2001, is the most important code based digital signature algorithm and can resist the known attack of quantum algorithms. But the efficiency of CFS is very low because of the extremely low signing speed and the large public key size. In this paper, a variation of CFS algorithm is presented. Instead of the Goppa code and the Patterson decoding algorithm, the new algorithm selects the Quasi-Cyclic Low Density Parity Check (QC-LDPC) code and the Belief Propagation (BP) decoding algorithm in the signing process. Compared with CFS algorithm, the new algorithm greatly reduces the storage space of public key and improves the efficiency of signature without compromising the security.

关键词： code based cryptography digital signature QCLDPC code decoding algorithm

来源：评论

学校读者我要写书评

暂无评论

Constant overhead quantum fault-tolerance with quantum expander codes 59

Constant overhead quantum fault-tolerance with quantum expan...

引用

59th IEEE Annual Symposium on Foundations of Computer Science (FOCS)

作者： Fawzi, Omar Grospellier, Antoine Leverrier, Anthony Univ Lyon ENS Lyon UCBL CNRSLIPUMR 5668 F-69007 Lyon France INRIA Paris France

ISBN: (纸本)9781538642306

We prove that quantum expander codes can be combined with quantum fault-tolerance techniques to achieve constant overhead: the ratio between the total number of physical qubits required for a quantum computation with faulty hardware and the number of logical qubits involved in the ideal computation is asymptotically constant, and can even be taken arbitrarily close to 1 in the limit of small physical error rate. This improves on the polylogarithmic overhead promised by the standard threshold theorem. To achieve this, we exploit a framework introduced by Gottesman together with a family of constant rate quantum codes, quantum expander codes. Our main technical contribution is to analyze an efficient decoding algorithm for these codes and prove that it remains robust in the presence of noisy syndrome measurements, a property which is crucial for fault-tolerant circuits. We also establish two additional features of the decoding algorithm that make it attractive for quantum computation: it can be parallelized to run in logarithmic depth, and is single-shot, meaning that it only requires a single round of noisy syndrome measurement.

关键词： decoding algorithm single-shot quantum error correction expander codes percolation

来源：评论

学校读者我要写书评

暂无评论

Low-complexity decoders for non-binary turbo codes 10

Low-complexity decoders for non-binary turbo codes

引用

10th IEEE International Symposium on Turbo Codes & Iterative Information Processing (ISTC)

作者： Klaimi, Rami Nour, Charbel Abdel Douillard, Catherine Farah, Joumana CNRS UMR 6285 Lab STICC IMT Atlantique Brest France Lebanese Univ Fac Engn Roumieh Lebanon

ISBN: (纸本)9781538670484

Following the increasing interest in non-binary coding schemes, turbo codes over different Galois fields have started to be considered recently. While showing improved performance when compared to their binary counterparts, the decoding complexity of this family of codes remains a main obstacle to their adoption in practical applications. In this work, a new low-complexity variant of the Min-Log-MAP algorithm is proposed. Thanks to the introduction of a bubble sorter for the different metrics used in the Min-Log-MAP decoder, the number of required computations is significantly reduced. A reduction by a factor of 6 in the number of additions and compare-select operations can be achieved with only a minor impact on error rate performance. With the use of an appropriate quantization, the resulting decoder paves the way for a future hardware implementation.

关键词： Non-binary turbo codes decoding algorithm bubble check complexity reduction

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：