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

Universal decoding algorithm for binary quadratic residue codes using syndrome-weight determination

ELECTRONICS LETTERS 2009年第13期45卷 692-694页

作者： Jing, M. -H. Chang, Y. Chen, Z. -H. Chen, J. -H. I Shou Univ Dept Informat Engn Kaohsiung Taiwan I Shou Univ Dept Appl Math Kaohsiung Taiwan

A novel decoding scheme, called syndrome-weight determination, was proposed by Chang et al. in 2008 for the Golay code, or the (23, 12, 7) quadratic residue code. This method is not only very simple in principle but also suitable for parallel hardware design. Presented is a modified version for any binary quadratic residue codes which has been developed. Because of its regular property, the proposed decoder is suitable for both software design and hardware development.

关键词： residue codes Codes Quadratic residue Golay codes decoding algorithm computer hardware design Binary

来源：评论

学校读者我要写书评

暂无评论

Class of nested linear block codes and their decoding algorithm

引用

IEE PROCEEDINGS-COMMUNICATIONS 2000年第4期147卷 216-220页

作者： Jennings, S Hashim, A S Bank Univ Sch Comp Informat Syst & Math London SE1 0AA England

A new class of nested linear block code is introduced. The codes of this class, referred to as nested codes. cover a wide range of code length and rates. The parity check matrix of a nested code is constructed from two other linear block codes. Although the rates of the resulting codes are not optimal. the codes nevertheless exhibit some useful properties: in particular. they have a well-defined mathematical structure. which leads to a fast and simple decoding algorithm.

关键词： error correcting capability block codes nested code linear codes decoding algorithm well-defined mathematical structure Codes error correction codes parity check matrix decoding nested linear block codes

来源：评论

学校读者我要写书评

暂无评论

Fast Error and Erasure decoding algorithm for Reed-Solomon Codes

引用

IEEE COMMUNICATIONS LETTERS 2024年第4期28卷 759-762页

作者： Tang, Nianqi Chen, Chao Han, Yunghsiang S. Univ Elect Sci & Technol China Shenzhen Inst Adv Study Shenzhen 518110 Peoples R China Xidian Univ State Key Lab ISN Xian Peoples R China

Reed-Solomon (RS) codes are widely used to correcter rors and erasures. This letter proposes a fast error and erasurede coding algorithm for RS codes. It achieves the best-known complexity O(nlog(n-k)+(n-k) log(2)(n-k)), wheren, kare the code length and dimension, respectively. Furthermore, the proposed method is efficient for practical codes. For decoding RS(255,223), compared with the existing method, the newalgorith m saves32%field operations

关键词： Reed-Solomon codes Fast Fourier transforms decoding algorithm fast Fourier transform

来源：评论

学校读者我要写书评

暂无评论

FAST SEQUENTIAL-decoding algorithm-BASED ON DYNAMIC SEARCHING STRATEGY

引用

IEE PROCEEDINGS-COMMUNICATIONS 1994年第5期141卷 312-316页

作者： LEE, CY YANG, WW JENG, LF Dept. of Electron. Eng. Nat. Chiao Tung Univ. Hsinchu Taiwan

The authors present a new sequential decoding algorithm based on dynamic searching strategy to improve decoding efficiency. The searching strategy is to exploit both 'sorting' and 'path recording' techniques. By means of sorting, it is possible to identify the correct path in a very fast way and then, by the recording, the bit sequence can be recovered without degrading decoding performance. The authors also develop a conditional resetting scheme to overcome the buffer overflow problem encountered in conventional sequential decoding algorithms. Simulation results show that, for a given code, the decoding efficiency remains the same as that obtained from maximum likelihood function by appropriately selecting sorting length and decoding depth. In addition, this algorithm can easily be mapped onto an area-efficient VLSI architecture to implement long constraint length convolutional decoders for high-speed digital communications.

关键词： decoding algorithm decoding EFFICIENCY DYNAMIC SEARCHING STRATEGY

来源：评论

学校读者我要写书评

暂无评论

A memory-efficient and fast Huffman decoding algorithm

引用

INFORMATION PROCESSING LETTERS 1999年第3期69卷 119-122页

作者： Chen, HC Wang, YL Lan, YF Natl Taiwan Univ Sci & Technol Dept Informat Management Taipei 106 Taiwan

To reduce the memory size and speed up the process of searching for a symbol in a Huffman tree, we propose a memory-efficient array data structure to represent the Huffman tree. Then, we present a fast Huffman decoding algorithm, which takes O(log n) time and uses [3n/2] + [n/2 log n] + 1 memory space, where it is the number of symbols in a Huffman tree. (C) 1999 Elsevier Science B.V. All rights reserved.

关键词： data structures decoding algorithm Huffman code

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Low-Complexity decoding algorithm Utilizing Degeneracy for Quantum LDPC Codes

Low-Complexity Decoding Algorithm Utilizing Degeneracy for Q...

引用

41st IEEE Military Communications Conference (IEEE MILCOM) - Communications Supporting Military Operations in a Contested Environment

作者： Kim, Jaemin Jung, Hyunwoo Ha, Jeongseok Korea Adv Inst Sci & Technol Sch Elect Engn Daejeon South Korea

ISBN: (纸本)9798350321814

Quantum low-density parity-check (QLDPC) codes have been considered as a promising solution for the fault-tolerant quantum computing. However, the belief propagation (BP) decoding for QLDPC codes does not take into account the degeneracy, resulting in certain performance degradation. Recently, various post-processing algorithms have been proposed to address this issue but they in return require excessive additional complexity and/or long decoding latency. Motivated by this, in this paper, we propose an efficient decoding algorithm that takes reduced decoding complexity for the post-processing. In particular, the proposed algorithm performs the post-processing in such a way that it first selects a variable node based on a proposed metric, and the depolarizing channel model for the selected variable node is reinitialized according to the BP decoding results. Then, the BP decoding is performed for the depolarizing channel model in which the selected node follows the reinitialized channel characteristics. The process of selection, reinitialization and BP decoding, say a trial, is iterated until it reaches a predetermined value or all syndromes are met. The main ideas of this work lie in formulating the metric for selection and reinitialization to minimize the number of trials until the degeneracy is resolved. Finally, simulation results show that the proposed decoding algorithms can significantly reduce the decoding complexity with similar decoding performance to that of an existing algorithm.

关键词： Quantum error correction codes low-density parity-check codes degeneracy decoding algorithm

来源：评论

学校读者我要写书评

暂无评论

decoding algorithm with multiple features based on optical camera communication system

引用

Optoelectronics Letters 2023年第2期19卷 65-71页

作者： ZHANG Junming SHI Wenxiao WANG Qiang LIU Anqi LIU Wei Department of Communications Engineering Jilin UniversityChangchun 130012China

The performance of decoding algorithm is one of the important influential factors to determine the communication quality of optical camera communication(OCC) system. In this paper, we first propose a decoding algorithm with adaptive thresholding based on the captured pixel values under an ideal environment, and then we further propose a decoding algorithm with multiple features, which is more suitable under the existence of the interference of light sources. The algorithm firstly determines the light-emitting diode(LED) array profile information by removing the interfering light sources through geometric features, and then identifies the LED state by calculating two grayscale features, the average gray ratio(AGR) and the gradient radial inwardness(GRI) of the LEDs, and finally obtains the LED state matrix. The experimental results show that the bit error ratio(BER) of the decoding algorithm with multiple features decreases from 1×10^(-2) to 5×10^(-4) at 80 m.

关键词： decoding algorithm multiple features camera communication system

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

SCAN: An Efficient decoding algorithm for RAID-6 Codes

SCAN: An Efficient Decoding Algorithm for RAID-6 Codes

引用

10th IEEE International Symposium on Network Computing and Applications (NCA)

作者： Luo, Jianqiang Xu, Lihao Wayne State Univ Dept Comp Sci Detroit MI 48202 USA

ISBN: (纸本)9780769544892

Recent studies show hard disk drives fail much more often in real systems than specified in their data-sheets, and RAID-5 may not be able to provide necessary reliability for practical systems. It is desirable to have disk arrays and clustered storage systems with higher data redundancy, such as RAID-6. Meanwhile, latest research also indicates that sector failures become a threat to data reliability in storage systems. As a result, disk failures in RAID-6 systems become complex, and call for efficient decoding approaches to recover data when disk failures take place. This paper proposes a simple and efficient decoding algorithm to reconstruct data from disk failures for RAID-6 systems. First, for many well known RAID-6 codes, we provide the conditions to determine the recoverability of disk failures by using Tanner graph. The covered RAID-6 codes include X-code, EVENODD, and RDP. Then, a generic failure decoding algorithm called SCAN algorithm is derived. The SCAN algorithm is able to efficiently reconstruct data for any recoverable disk failures. Extensive performance evaluation shows the SCAN algorithm achieves higher performance than Matrix Method, another general decoding algorithm. Hence, the SCAN algorithm is an attractive decoding algorithm to be integrated into RAID-6 systems.

关键词： algorithm design and analysis decoding EVENODD Encoding Equations Iterative decoding RAID RAID-6 codes RDP Reliability SCAN algorithm Tanner graph X-code clustered storage system data reconstruction data recovery data reliability decoding decoding algorithm disk arrays disk failure recoverability generic failure decoding algorithm graph theory hard discs hard disk drives redundancy system recovery

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：