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

7th International Conference on Advances in Computing and Communications (ICACC)

作者： Prasad, M. N. Giri Reddy, C. Chinnapu Babu, J. Chinna JNTU Univ Anantapuramu Andhra Pradesh India Oo 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. (C) 2017 The Authors. Published by Elsevier B.V.

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

来源：评论

学校读者我要写书评

暂无评论

Construction and decoding algorithms for Polar Codes based on 2 x 2 Non-Binary Kernels 10

Construction and Decoding Algorithms for Polar Codes based o...

引用

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

作者： Yuan, Peihong Steiner, Fabian Tech Univ Munich Inst Commun Engn Munich Germany

ISBN: (纸本)9781538670484

Polar codes based on 2 x 2 non-binary kernels are discussed in this work. The kernel over GF(q) is selected by maximizing the polarization effect and using Monte-Carlo simulation. Belief propagation (BP) and successive cancellation (SC) based decoding algorithms are extended to non-binary codes. Additionally, a successive cancellation list (SCL) decoding with a pruned tree is proposed. Simulation results show that the proposed decoder performs very close to a conventional SCL decoder with significantly lower complexity.

关键词： non-binary polar codes kernel selection decoding algorithm

来源：评论

学校读者我要写书评

暂无评论

Comparison of Various decoding algorithms for EG-Low Density Parity Check Codes 1st

Comparison of Various Decoding Algorithms for EG-Low Density...

引用

International Conference on Emerging Trends and Advances in Electrical Engineering and Renewable Energy (ETAEERE)

作者： Babu, J. Chinna Reddy, C. Chinnapu Prasad, M. N. Giri JNTUA Anantapur Andhra Pradesh India TEQIP II SPFU AP Oo CTE Vijayawada Andhra Pradesh India JNTUA Dept ECE Anantapur Andhra Pradesh India

ISBN: (纸本)9789811047626;9789811047619

he latest advancements in low-density parity-check (LDPC) codes have been resulted in reducing the decoding complexity. Hence, these codes have excelled over turbo codes, BCH codes, and linear block codes in terms of evaluating the performance in higher decoding rate;hence, these decodable codes are the trending topic in coding theory of signals. Construction of LDPC codes is being elaborated in this proposed paper which further helps to study decoding and encoding of these binary and non-binary low-density parity-check codes, respectively. In this proposed design architecture, we have considered the SBF and MLDD algorithms employed here utilize reliability estimation to improve error performance and it has advantages over bit flipping (BF) algorithms. This algorithm can be improved with still more security level by having a trade-off between performance and data transmission. It can also be enhanced by implementing it in real-time applications for data decoding and correction, for smaller-size datum.

关键词： LDPC codes decoding algorithm Shannon limit Delay SBF MLDD

来源：评论

学校读者我要写书评

暂无评论

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

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

来源：评论

学校读者我要写书评

暂无评论

A Detection decoding of Adaptive Iterative algorithm Based on MIMO System

A Detection Decoding of Adaptive Iterative Algorithm Based o...

引用

2019 4th International Workshop on Materials Engineering and Computer Sciences(IWMECS 2019)

作者： Fang Weiwei Feng Wen Siping Hu Nanyang Institute of Technology Hubei University of Science and Technology

In this paper,the MIMO system and multi-user detection theory are firstly *** to the signal model,the estimation algorithm based on the minimum mean square error criterion and the zero-forcing criterion is *** on this theory,the algorithm is combined with the decision feedback and the optimal ranking *** this paper,an adaptive length spherical iterative decoding algorithm is proposed to improve the BER performance of the system,which can improve the channel capacity and improve the channel reliability and reduce the bit error ***,the performance of various algorithms is compared by *** experimental results show that the spherical decoding algorithm has great advantages for wireless communication.

关键词： Signal Model decoding algorithm MIMO Wireless Communication

来源：评论

学校读者我要写书评

暂无评论

ERROR-ERASURE decoding OF BINARY CYCLIC CODES, UP TO A PARTICULAR INSTANCE OF THE HARTMANN-TZENG BOUND

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 1990年第5期36卷 1144-1149页

作者： STEVENS, P Department of Information Services Generale Bank Brussels Belgium

It is shown that error-erasure decoding for a cyclic code allows the correction of a combination of t errors and r erasures when 2t+r> sigma /sub 0/; the parameter sigma /sub 0/ denotes a particular instance of the Hartmann-Tzeng bound. This procedure is an improvement on the error-erasure decoding algorithm developed by G.D. Forney (1965), which works when 2t+r> sigma , where sigma denotes the BCH-bound of the code.

关键词： decoding Codes cyclic binary code cyclic codes decoding algorithm Bound Binary

来源：评论

学校读者我要写书评

暂无评论

A New decoding Method for ReedSolomon Codes Based on FFT and Modular Approach

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2022年第12期70卷 7790-7801页

作者： Tang, Nianqi Han, Yunghsiang S. Huawei Technol Co Ltd Shenzhen 518129 Peoples R China Univ Elect Sci & Technol China Shenzhen Inst Adv Study Shenzhen 518110 Peoples R China

decoding algorithms for Reed-Solomon (RS) codes are of great interest for both practical and theoretical reasons. In this paper, an efficient algorithm, called the modular approach (MA), is devised for solving the Welch-Berlekamp (WB) key equation. By taking the MA as the key equation solver, we propose a new decoding algorithm for systematic RS codes. For (n, k) RS codes, where n is the code length and k is the code dimension, the proposed decoding algorithm has both the best asymptotic computational complexity O(n log (n - k) + (n - k) log(2) (n - k)) and the smallest constant factor achieved to date. By comparing the number of field operations required, we show that when decoding practical RS codes, the new algorithm is significantly superior to the existing methods in terms of computational complexity. When decoding the (4096, 3584) RS code defined over F-212, the new algorithm is 10 times faster than a conventional syndrome-based method. Furthermore, the new algorithm has a regular architecture and is thus suitable for hardware implementation.

关键词： decoding Codes Computational complexity Kernel Mathematical models Additives Fourier transforms Modular approach Reed-Solomon codes fast Fourier transform decoding algorithm

来源：评论

学校读者我要写书评

暂无评论

List decoding of repeated codes

引用

APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING 2013年第3-4期24卷 237-253页

作者： Hernando, Fernando O'Sullivan, Michael Ruano, Diego Univ Jaume 1 Dept Math Castellon de La Plana 12071 Spain Aalborg Univ Dept Math Sci Aalborg Denmark San Diego State Univ Dept Math & Stat San Diego CA 92182 USA Aalborg Univ Dept Math Sci DK-9220 Aalborg Denmark

Assuming that we have a soft-decision list decoding algorithm of a linear code, a new hard-decision list decoding algorithm of its repeated code is proposed in this article. Although repeated codes are not used for encoding data, due to their parameters, we show that they have a good performance with this algorithm. We compare, by computer simulations, our algorithm for the repeated code of a Reed-Solomon code against a decoding algorithm of a Reed-Solomon code. Finally, we estimate the decoding capability of the algorithm for Reed-Solomon codes and show that performance is somewhat better than our estimates.

关键词： Linear codes Matrix-product codes decoding algorithm Minimum distance Quasi-cyclic codes

来源：评论

学校读者我要写书评

暂无评论

ON THE decoding OF ALGEBRAIC-GEOMETRIC CODES

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 1990年第5期36卷 1051-1060页

作者： SKOROBOGATOV, AN VLADUT, SG ACAD SCI USSR CENT ECON MATH INSTMOSCOW V-71USSR

A decoding algorithm for algebraic-geometric codes arising from arbitrary algebraic curves is presented. This algorithm corrects any number of errors up to ((d-g-1)/2), where d is the designed distance of the code and g is the genus of the curve. The complexity of decoding equals sigma (n/sup 3/) where n is the length of the code. Also presented is a modification of this algorithm, which in the case of elliptic and hyperelliptic curves is able to correct ((d-1)/2) errors. It is shown that for some codes based on plane curves the modified decoding algorithm corrects approximately d/2-g/4 errors. Asymptotically good q-ary codes with a polynomial construction and a polynomial decoding algorithm (for q<or=361 on some segment their parameters are better than the Gilbert-Varshamov bound) are obtained. A family of asymptotically good binary codes with polynomial construction and polynomial decoding is also obtained, whose parameters are better than the Blokh-Zyablov bound on the whole interval 0> sigma >1/2.

关键词： designed distance decoding Codes algebraic geometric codes Curves decoding algorithm Polynomial q-ary code

来源：评论

学校读者我要写书评

暂无评论

Knowledge-aided informed dynamic scheduling for LDPC decoding of short blocks

引用

IET COMMUNICATIONS 2018年第9期12卷 1094-1101页

作者： Healy, Cornelius Shao, Zhichao Oliveira, Robert M. de Lamare, Rodrigo C. Mendes, Luciano L. Pontifical Catholic Univ Rio de Janeiro Ctr Telecommun Studies CETUC Rio De Janeiro Brazil Univ York Dept Elect Engn York N Yorkshire England Inatel Santa Rita Do Sapucai Brazil

Low-density parity-check (LDPC) codes have excellent performance for a wide range of applications at reasonable complexity. LDPC codes with short blocks avoid the high latency of codes with large block lengths, making them potential candidates for ultra reliable low-latency applications of future wireless standards. In this work, a novel informed dynamic scheduling (IDS) strategy for decoding LDPC codes, denoted reliability-based residual belief propagation (Rel-RBP), is developed by exploiting the reliability of the message and the residuals of the possible updates to choose the messages to be used by the decoding algorithm. A different measure for each iteration of the IDS schemes is also presented, which underlies the high cost of those algorithms in terms of computational complexity and motivates the development of the proposed strategy. Simulations show that Rel-RBP speeds up the decoding at reduced complexity and results in error rate performance gains over prior work.

关键词： computational complexity decoding parity check codes telecommunication scheduling telecommunication network reliability short blocks block lengths future wireless standards dynamic scheduling strategy decoding LDPC codes Rel-RBP decoding algorithm IDS schemes computational complexity reduced complexity LDPC decoding low-density parity-check codes ultra reliable low-latency applications reliability-based residual belief propagation knowledge-aided informed dynamic scheduling

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：