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

Optimization of LDPC decoding algorithm in semi-conductor storage based on artificial neural networks

INTERNATIONAL JOURNAL OF ELECTRONICS 2025年

作者： Xiong, Chunru Li, Qiang Tianjin Univ Sch Microelect 92 Weijin Rd Tianjin 300072 Peoples R China

Low-density parity check digit is a linear block code, which is applied to semiconductor storage to achieve effective information storage. However, in semiconductor storage, the existing ways have weak decoding performance and high bit error rate. Therefore, the decoding algorithm in the existing low-density parity check digit is optimised. Then, a semiconductor storage decoding optimisation algorithm based on artificial neural networks is designed to improve decoding performance. In addition, a multi-layer perceptron neural network is introduced to construct an optimised decoding method. The experimental results showed that when the threshold was 5, the throughput of the low-density parity check decoding algorithm based on the multi-layer perceptron decreased slowly with the increase in the signal-to-noise ratio. The minimum throughput rate was 1.18. The proposed semiconductor storage decoding optimisation algorithm based on artificial neural networks has better decoding performance. In summary, the proposed decoding optimisation method for semiconductor storage has good performance, which can effectively achieve information decoding in semiconductor storage.

关键词： Artificial neural network semiconductor storage LDPC multi-layer perceptron neural network decoding algorithm

来源：评论

学校读者我要写书评

暂无评论

Multiple-Insertion-Correcting Non-Binary Quantum Codes and decoding algorithm

引用

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2025年第2期E108A卷 123-128页

作者： Nakamura, Ken Nozaki, Takayuki Yamaguchi Univ Dept Informat Div Fundamental Sci Grad Sch Sci & Technol Innovat Yamaguchi 7538512 Japan Yamaguchi Univ Res Inst Time Studies Yamaguchishi 7538511 Japan

This paper investigates non-binary quantum codes correcting multiple insertion errors. This paper provides an insertion-correcting procedure of the deletion-correcting non-binary codes constructed by Matsumoto and Hag... 详细信息

关键词： decoding algorithm insertion error non-binary codes quantum codes

来源：评论

学校读者我要写书评

暂无评论

decoding algorithm for DEC RS codes

引用

ELECTRONICS LETTERS 2000年第6期36卷 546-548页

作者： Lu, EH Lee, CY Tsai, RL Chang Gung Univ Dept Elect Engn Tao Yuan 333 Taiwan Chang Gung Univ Dept Informat Management Tao Yuan 333 Taiwan Chunghwa Telecom Lab Yangmei Taiwan

A step-by-step decoding algorithm is proposed for double-error-correcting Reed-Solomon codes of length n = 2(m)-1. Since the decoding algorithm can directly find the error value at the highest-order position in a received vector without determining the error location polynomial, the decoding procedure is very simple and regular;therefore it is suitable for hardware implementation.

关键词： Regular Reed-Solomon codes decoding algorithm

来源：评论

学校读者我要写书评

暂无评论

decoding algorithm Based on LDPC for UAV MISO Ultraviolet Communication System

引用

IEEE COMMUNICATIONS LETTERS 2024年第5期28卷 974-978页

作者： Xue, Xingle Ji, Junyang Su, Ping Ma, Jianshe Xia, Bizhong Li, Xingguang Tsinghua Univ Shenzhen Int Grad Sch Shenzhen 518055 Peoples R China

Unmanned aerial vehicle (UAV) ultraviolet (UV) communication has garnered significant attention due to its broad range of applications. Currently, there are few decoding algorithms specifically tailored for UAV UV multiple-input-single-output (MISO) communication scenarios. We propose an enhanced maximum a posteriori (MAP) and log-likelihood ratio belief propagation (LLRBP) algorithm for MISO UV communication systems. This algorithm strategically ranks interference signals based on the signal-to-interference plus noise ratio (SINR), effectively eliminates errors in transmitter information recovery, and is named the SINR-MAP-LLRBP algorithm. Building upon this algorithm, we establish the optimal quantitative relationship for the signal-to-noise ratio (SNR) in the MISO UVC system. Additionally, we introduce an enhanced decoding algorithm for MISO UV communication systems, leveraging the residual-based loop iteration methodology, named as the Res-SINR-MAP-LLRBP algorithm. This algorithm provides an additional decoding gain compared to the SINR-MAP-LLRBP algorithm.

关键词： Transmitters MISO communication decoding Signal to noise ratio Receivers Iterative decoding Autonomous aerial vehicles Ultraviolet communication UAV LDPC decoding algorithm

来源：评论

学校读者我要写书评

暂无评论

A space-efficient Huffman decoding algorithm and its parallelism

引用

THEORETICAL COMPUTER SCIENCE 2000年第1-2期246卷 227-238页

作者： Lin, YK Chung, KL Natl Taiwan Univ Sci & Technol Dept Informat Management Taipei 10672 Taiwan Natl Taiwan Univ Sci & Technol Inst Informat Engn Taipei 10672 Taiwan

This paper first transforms the Huffmann tree into a single-side growing Huffman tree, then presents a memory-efficient data structure to represent the single-side growing Huffman tree, which requires (n + d)[log(2)n]-bits memory space, where n is the number of source symbols and d is the depth of the Huffman tree. Based on the proposed data structure, we present an O(d)-time Huffman decoding algorithm. Using the same example, the memory required in our decoding algorithm is much less than that of [3], We finally modify our proposed data structure to design an O(1)-time parallel Huffman decoding algorithm on a concurrent read exclusive write parallel random-access machine (CREW PRAM) using d processors. (C) 2000 Elsevier Science B.V. All rights reserved.

关键词： data structure decoding algorithm Huffman code parallel algorithm single-side growing Huffman tree

来源：评论

学校读者我要写书评

暂无评论

decoding algorithm of LDPC codes for Cascaded BSC-AWGN channels

Decoding Algorithm of LDPC codes for Cascaded BSC-AWGN chann...

引用

Annual Summit and Conference of Asia-Pacific-Signal-and-Information-Processing-Association (APSIPA)

作者： Phakphisut, Watid Supnithi, Pornchai King Mongkuts Inst Technol Ladkrabang Fac Engn Bangkok 10520 Thailand

ISBN: (纸本)9786163618238

The written-in errors in bit patterned media (BPM) recording systems cause the erroneous bits during the writing process, leading to performance degradation. In previous works, the BPM read/write channel is modeled as a binary symmetric channel (BSC) with an additive white Gaussian noise (AWGN) channel or the cascaded BSC-AWGN channels. The initial channel information including the written-in errors probability has been proposed for low-density parity check (LDPC) decoder. However, the decoding algorithm remains the same as in the case of AWGN channels. In this work, we show that the crossover probability of BSC channels will affect the check node processing of LDPC codes. Therefore, we modify the check node computation that takes into account of the crossover probability of BSC channels. The simulation results show that the proposed LDPC decoder outperforms the ones with the conventional and modified likelihood function in terms of the bit error rate performance.

关键词： AWGN channels error statistics parity check codes probability LDPC codes additive white Gaussian noise binary symmetric channel bit error rate bit patterned media recording systems cascaded BSC-AWGN channels channel information crossover probability decoding algorithm erroneous bits low-density parity check decoder modified likelihood function written-in errors Decision support systems decoding Degradation Error probability Media Parity check codes Writing

来源：评论

学校读者我要写书评

暂无评论

decoding algorithm and BER Performance of Interference Alignment and Cancellation System in MIMO Networks

Decoding Algorithm and BER Performance of Interference Align...

引用

4th IET International Conference on Wireless, Mobile and Multimedia Networks (ICWMMN)

作者： Li, Yuanyuan Xiao, Yang Lee, Moon Ho Beijing Jiaotong Univ Inst Informat Sci Beijing 100044 Peoples R China Chonbuk Natl Univ Div Elect & Informat Engn Jeonju 561756 South Korea

ISBN: (纸本)9781849195072

Interference alignment and cancelation (IAC) is a new approach for decoding concurrent transmitter-receiver pairs in MIMO networks. Recent studies on IAC system are focus on the throughput. However, the decoding algorithm and BER performance of IAC system remain to be solved. In this paper, we not only provide a decoding algorithm but also evaluate the bit error rate (BER) performance of it by simulation. The good BER results verify that the proposed decoding algorithm of IAC system is surely feasible.

关键词： interference alignment and cancelation (IAC) decoding algorithm bit error rate (BER) MIMO networks

来源：评论

学校读者我要写书评

暂无评论

A New Iterative LT decoding algorithm for Binary and Nonbinary Galois Fields

引用

JOURNAL OF COMMUNICATIONS AND NETWORKS 2013年第4期15卷 411-421页

作者： Mao, Yuexin Huang, Jie Wang, Bing Huang, Jianzhong Zhou, Wei Zhou, Shengli Univ Connecticut Dept Comp Sci & Engn Storrs CT 06269 USA Marvell Semicond Santa Clara CA 95054 USA LSI Corp San Jose CA 95131 USA Univ Connecticut Dept Elect & Comp Engn Storrs CT 06269 USA

Digital fountain codes are record-breaking codes for erasure channels. They have many potential applications in both wired and wireless communications. Most existing digital fountain codes operate over binary fields using an iterative belief-propagation (BP) decoding algorithm. In this paper, we propose a new iterative decoding algorithm for both binary and nonbinary fields. The basic form of our proposed algorithm considers both degree-1 and degree-2 check nodes (instead of only degree-1 check nodes as in the original BP decoding scheme), and has linear complexity. Extensive simulation demonstrates that it outperforms the original BP decoding scheme, especially for a small number of source packets. The enhanced form of the proposed algorithm combines the basic form of the algorithm and a guess-based algorithm to further improve the decoding performance. Simulation results demonstrate that it can provide better decoding performance than the guess-based algorithm with fewer guesses, and can achieve decoding performance close to that of the maximum likelihood decoder at a much lower decoding complexity. Last, we show that our nonbinary scheme has the potential to outperform the binary scheme when choosing suitable degree distributions, and furthermore it is insensitive to the size of the Galois field.

关键词： Binary erasure channel (BEC) decoding algorithm digital fountain codes Luby transform (LT) codes nonbinary

来源：评论

学校读者我要写书评

暂无评论

Bahl-Cocke-Jelinek-Raviv decoding algorithm applied to the three-user binary adder channel

引用

IET COMMUNICATIONS 2015年第7期9卷 897-902页

作者： Alcoforado, Maria de Lourdes M. G. Oliveira, Mariana C. C. da Rocha, Valdemar C., Jr. Univ Pernambuco UPE Commun Grp GCOM Telecommun Lab LABTEL BR-50750470 Recife PE Brazil Univ Fed Pernambuco Commun Res Grp CODEC Dept Elect & Syst BR-50740550 Recife PE Brazil

The Bahl-Cocke-Jelinek-Raviv (BCJR) algorithm is a well-known maximum a posteriori probability decoding algorithm which has been proposed earlier for point to point communication applications, employing block codes or convolutional codes and turbo codes. This study describes an application of the BCJR algorithm for decoding the output of a multiple-access channel called the noisy three-user binary adder channel, in the presence of additive white Gaussian noise. The computer simulation results are presented for the overall coding performance in terms of bit error rate against signal-to-noise ratio.

关键词： Multiple Access Channel Block codes AWGN COMMUNICATIONS APPLICATION adders Access Channels Worm gears Maximum a posteriori estimation a posteriori probability decoding algorithm Simulation results convolutional coding

来源：评论

学校读者我要写书评

暂无评论

A modified Viterbi decoding algorithm for high-rate convolutional codes

引用

EUROPEAN TRANSACTIONS ON TELECOMMUNICATIONS 2005年第6期16卷 527-536页

作者： Amat, AGI Benedetto, S Siegel, PH Politecn Torino Dipartimento Elettron I-10129 Turin Italy Univ Pompeu Fabra Dept Tecnol Barcelona 08003 Spain Univ Calif San Diego ECE Dept La Jolla CA 92093 USA

It is well-known that the computational complexity of the Viterbi decoding algorithm for an (n, k, V) convolutional code grows exponentially with k and the code memory v, and thus it becomes quickly impractical as the code rate increases. A solution, so far, has been to use punctured convolutional codes, which strongly reduces the decoding complexity but leads to a slightly worse performance. Recently, it has been pointed out that every non-punctured high-rate convolutional code (with 2(k) > 2(v)) can be viewed as the concatenation of a block code and a simpler convolutional code. In this paper, we exploit this property of high-rate codes to facilitate the implementation of the Viterbi algorithm. We propose a modification of the Viterbi decoding algorithm for non-punctured high-rate convolutional codes which results in very significant computational savings. Copyright (c) 2005 AEIT.

关键词： Block codes complexity classes code rate algorithms Viterbi algorithm Viterbi decoding decoding algorithm code memory convolutional coding punctured convolutional code

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：