Log in

Relevant bibliographies by topics / Decoding performance / Journal articles

To see the other types of publications on this topic, follow the link: Decoding performance.

Journal articles on the topic 'Decoding performance'

Author: Grafiati

Published: 6 September 2023

Last updated: 25 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Decoding performance.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Ravi Kumar, Ch, and K. Padmaraju. "Hard Decision Decoding Performance Improved Using Turbo Product Codes." International Journal of Engineering & Technology 7, no. 3.12 (2018): 228. http://dx.doi.org/10.14419/ijet.v7i3.12.16030.

Full text

Abstract:

The performance of soft decision decoding, whose for which the design is complex, is superior to the performance of hard decision decoding. In this paper, we propose a turbo product code with a bit flip algorithm to improve the performance of hard decision decoding. The performance of hard decision decoding is improved with low complexity using multidimensional turbo product codes. The reliability of decoding in a communication system to detect and correct errors is discussed .Maximum a posterior probability (MAP) decoding is employed to improve the hard decision performance of turbo product c

APA, Harvard, Vancouver, ISO, and other styles

2

Liu, Hengyan, Limin Zhang, Wenjun Yan, and Qing Ling. "Neural-Network-Assisted Polar Code Decoding Schemes." Applied Sciences 12, no. 24 (2022): 12700. http://dx.doi.org/10.3390/app122412700.

Full text

Abstract:

The traditional fast successive-cancellation (SC) decoding algorithm can effectively reduce the decoding steps, but the decoding adopts a sub-optimal algorithm, so it cannot improve the bit error performance. In order to improve the bit error performance while maintaining low decoding steps, we introduce a neural network subcode that can achieve optimal decoding performance and combine it with the traditional fast SC decoding algorithm. While exploring how to combine neural network node (NNN) with R1, R0, single-parity checks (SPC), and Rep, we find that the decoding failed sometimes when the

APA, Harvard, Vancouver, ISO, and other styles

3

Kong, Lingjun, Haiyang Liu, Wentao Hou, and Bin Dai. "Improving Decodability of Polar Codes by Adding Noise." Symmetry 14, no. 6 (2022): 1156. http://dx.doi.org/10.3390/sym14061156.

Full text

Abstract:

This paper presents an online perturbed and directed neural-evolutionary (Online-PDNE) decoding algorithm for polar codes, in which the perturbation noise and online directed neuro-evolutionary noise sequences are sequentially added to the received sequence for re-decoding if the standard polar decoding fails. The new decoding algorithm converts uncorrectable received sequences into error-correcting regions of their decoding space for correct decoding by adding specific noises. To reduce the decoding complexity and delay, the PDNE decoding algorithm and sole neural-evolutionary (SNE) decoding

APA, Harvard, Vancouver, ISO, and other styles

4

Mu, Xiao Dong, Xiao Lin Niu, Shao Wang Shi, and Wei Song. "GPU-Based High Performance Terrain Compression." Applied Mechanics and Materials 321-324 (June 2013): 1234–37. http://dx.doi.org/10.4028/www.scientific.net/amm.321-324.1234.

Full text

Abstract:

It has been well accepted that compression is essential to the real-time visualization of large-terrain elevation data. To achieve efficient performance, a terrain compression method featuring high decoding speed is proposed in this paper. A combined prediction scheme is applied in the prediction stage. Golomb-Rice coding is then used to encode the residuals after the prediction stage. The style of the codeword is tailored to make the decoding process amenable to a GPU implementation. Then batching is used to further improve the decoding speed. The proposed method is easy to implement and simp

APA, Harvard, Vancouver, ISO, and other styles

5

Zhang, Yingxian, Aijun Liu, Xiaofei Pan, Shi He, and Chao Gong. "A Generalization Belief Propagation Decoding Algorithm for Polar Codes Based on Particle Swarm Optimization." Mathematical Problems in Engineering 2014 (2014): 1–10. http://dx.doi.org/10.1155/2014/606913.

Full text

Abstract:

We propose a generalization belief propagation (BP) decoding algorithm based on particle swarm optimization (PSO) to improve the performance of the polar codes. Through the analysis of the existing BP decoding algorithm, we first introduce a probability modifying factor to each node of the BP decoder, so as to enhance the error correcting capacity of the decoding. Then, we generalize the BP decoding algorithm based on these modifying factors and drive the probability update equations for the proposed decoding. Based on the new probability update equations, we show the intrinsic relationship of

APA, Harvard, Vancouver, ISO, and other styles

6

Yao, Hanwen, Arman Fazeli, and Alexander Vardy. "List Decoding of Arıkan’s PAC Codes." Entropy 23, no. 7 (2021): 841. http://dx.doi.org/10.3390/e23070841.

Full text

Abstract:

Polar coding gives rise to the first explicit family of codes that provably achieve capacity with efficient encoding and decoding for a wide range of channels. However, its performance at short blocklengths under standard successive cancellation decoding is far from optimal. A well-known way to improve the performance of polar codes at short blocklengths is CRC precoding followed by successive-cancellation list decoding. This approach, along with various refinements thereof, has largely remained the state of the art in polar coding since it was introduced in 2011. Recently, Arıkan presented a

APA, Harvard, Vancouver, ISO, and other styles

7

Li, Huan, Jingxuan Huang, and Ce Sun. "Improved Belief Propagation List Decoding for Polar Codes." Electronics 11, no. 15 (2022): 2458. http://dx.doi.org/10.3390/electronics11152458.

Full text

Abstract:

Polar codes have become the channel coding scheme for control channel of enhanced mobile broadband in the 5G communication systems. Belief propagation (BP) decoding of polar codes has advantages of low decoding latency and high parallelism but achieves worse bit error ratio (BER) performance compared with the successive cancellation list (SCL) decoding scheme. In this paper, an improved BP list (IBPL) decoding algorithm is proposed with comparable BER performance to SCL algoritm. Firstly, the optimal permuted factor graph is analyzed for polar codes, which improves the performance of the BP de

APA, Harvard, Vancouver, ISO, and other styles

8

Gautam, Abhilasha, Prabhat Thakur, and Ghanshyam Singh. "Analysis of Universal Decoding Techniques for 6G Ultra-Reliable and Low-Latency Communication Scenario." Future Internet 17, no. 4 (2025): 181. https://doi.org/10.3390/fi17040181.

Full text

Abstract:

Ultra-reliable and low-latency communication (URLLC) in 6G networks is characterized by very high reliability and very low latency to enable mission-critical applications. The ability of a coding scheme to support diverse use cases requires flexibility on the part of the decoder. High reliability and low latency require decoders with improved error rate performance and reduced complexity. This article investigates candidate universal decoding algorithms for 6G communication scenarios. Universal decoders work on a wide range of error-correcting codes, making them scalable for different communic

APA, Harvard, Vancouver, ISO, and other styles

9

Minja, Aleksandar, Dušan Dobromirov, and Vojin Šenk. "Bidirectional stack decoding of polar codes." Vojnotehnicki glasnik 69, no. 2 (2021): 405–15. http://dx.doi.org/10.5937/vojtehg69-29858.

Full text

Abstract:

Introduction/purpose: The paper introduces a reduced latency stack decoding algorithm of polar codes, inspired by the bidirectional stack decoding of convolutional codes and based on the folding technique. Methods: The stack decoding algorithm (also known as stack search) that is useful for decoding tree codes, the list decoding technique introduced by Peter Elias and the folding technique for polar codes which is used to reduce the latency of the decoding algorithm. The simulation was done using the Monte Carlo procedure. Results: A new polar code decoding algorithm, suitable for parallel imp

APA, Harvard, Vancouver, ISO, and other styles

10

Wang, Xiumin, Jinlong He, Jun Li, and Liang Shan. "Reinforcement Learning for Bit-Flipping Decoding of Polar Codes." Entropy 23, no. 2 (2021): 171. http://dx.doi.org/10.3390/e23020171.

Full text

Abstract:

A traditional successive cancellation (SC) decoding algorithm produces error propagation in the decoding process. In order to improve the SC decoding performance, it is important to solve the error propagation. In this paper, we propose a new algorithm combining reinforcement learning and SC flip (SCF) decoding of polar codes, which is called a Q-learning-assisted SCF (QLSCF) decoding algorithm. The proposed QLSCF decoding algorithm uses reinforcement learning technology to select candidate bits for the SC flipping decoding. We establish a reinforcement learning model for selecting candidate b

APA, Harvard, Vancouver, ISO, and other styles

11

Jan, Qasim, Shahid Hussain, Muhammad Furqan, Zhiwen Pan, Nan Liu, and Xiaohu You. "A Novel Flip-List-Enabled Belief Propagation Decoder for Polar Codes." Electronics 10, no. 18 (2021): 2302. http://dx.doi.org/10.3390/electronics10182302.

Full text

Abstract:

Due to the design principle of parallel processing, belief propagation (BP) decoding is attractive, and it provides good error-correction performance compared with successive cancellation (SC) decoding. However, its error-correction performance is still inferior to that of successive cancellation list (SCL) decoding. Consequently, this paper proposes a novel flip-list- (FL)-enabled belief propagation (BP) method to improve the error-correction performance of BP decoding for polar codes with low computational complexity. The proposed technique identifies the vulnerable channel log-likelihood ra

APA, Harvard, Vancouver, ISO, and other styles

12

Shibue, Ryohei, and Fumiyasu Komaki. "Firing rate estimation using infinite mixture models and its application to neural decoding." Journal of Neurophysiology 118, no. 5 (2017): 2902–13. http://dx.doi.org/10.1152/jn.00818.2016.

Full text

Abstract:

Neural decoding is a framework for reconstructing external stimuli from spike trains recorded by various neural recordings. Kloosterman et al. proposed a new decoding method using marked point processes (Kloosterman F, Layton SP, Chen Z, Wilson MA. J Neurophysiol 111: 217–227, 2014). This method does not require spike sorting and thereby improves decoding accuracy dramatically. In this method, they used kernel density estimation to estimate intensity functions of marked point processes. However, the use of kernel density estimation causes problems such as low decoding accuracy and high computa

APA, Harvard, Vancouver, ISO, and other styles

13

AlMahamdy, Mohammed, and Naser Al-Falahy. "Combining serial and parallel decoding for turbo codes." Indonesian Journal of Electrical Engineering and Computer Science 24, no. 2 (2021): 896. http://dx.doi.org/10.11591/ijeecs.v24.i2.pp896-903.

Full text

Abstract:

Reducing the decoding latency of the turbo codes is important to real-time applications. Conventionally, the decoding of the turbo codes (TC) runs in serial fashion, which means only one of the constituent soft decoders runs at a time. Parallel decoding (PD) refers to running the soft decoders in parallel. Although it delivers the output faster (compared to the serial decoding (SD)), it affects the bit- and frame-error rates. This paper proposes a decoding procedure that combines both PD and SD. It bridges the two decoding modes to determine the best combination scheme to achieve the required

APA, Harvard, Vancouver, ISO, and other styles

14

AlMahamdy, Mohammed, and Naser Al-Falahy. "Combining serial and parallel decoding for turbo codes." Indonesian Journal of Electrical Engineering and Computer Science 24, no. 2 (2021): 896–903. https://doi.org/10.11591/ijeecs.v24.i2.pp896-903.

Full text

Abstract:

Reducing the decoding latency of the turbo codes is important to real-time applications. Conventionally, the decoding of the turbo codes (TC) runs in serial fashion, which means only one of the constituent soft decoders runs at a time. Parallel decoding (PD) refers to running the soft decoders in parallel. Although it delivers the output faster (compared to the serial decoding (SD)), it affects the bit- and frame-error rates. This paper proposes a decoding procedure that combines both PD and SD. It bridges the two decoding modes to determine the best combination scheme to achieve the required

APA, Harvard, Vancouver, ISO, and other styles

15

Wang, Zhong Xun, and Xing Long Gao. "Design of Modified Minsum Decoder of LDPC Code in the Simplified Difference-Domain." Applied Mechanics and Materials 385-386 (August 2013): 1576–81. http://dx.doi.org/10.4028/www.scientific.net/amm.385-386.1576.

Full text

Abstract:

In this paper, we propose the modified minsum decoding algorithm of LDPC(Low-Density Parity-Check) code in the simplified difference-domain on the basis of detailed analysis of LDPC decoding algorithm in difference-domain. The simulation indicates that the proposed decoding algorithm offers almost no performance degradation compared with the BP(Belief Propagation) decoding algorithm in log-domain and the decoding algorithm in difference-domain and offers better performance than minsum decoding algorithm in log-domain and greatly reduces the computation complexity in AWGN(Additive White Gaussia

APA, Harvard, Vancouver, ISO, and other styles

16

Zhu, Kun, and Hongwen Yang. "Two-Phase Globally Coupled Low-Density Parity Check Decoding Aided with Early Termination and Forced Convergence." Sensors 24, no. 21 (2024): 6893. http://dx.doi.org/10.3390/s24216893.

Full text

Abstract:

To enhance the decoding efficiency of Globally Coupled (GC) LDPC codes, we incorporated Early Termination (ET) and Forced Convergence (FC) into the local/global two-phase decoding algorithm to expedite the decoding process. The two-phase decoding scheme integrates the ET technique to halt unnecessary iterations in the local decoding phase while employing the FC technique to accelerate convergence in the global phase decoding. The application of ET technology in the local decoding of GC-LDPC codes will not cause performance loss as in traditional block codes and will cause considerable complexi

APA, Harvard, Vancouver, ISO, and other styles

17

Gao, Hua Meng, and He Liu. "Study on the Performance of CCSDS Standard Convolution Codes through Simulation." Applied Mechanics and Materials 651-653 (September 2014): 1949–52. http://dx.doi.org/10.4028/www.scientific.net/amm.651-653.1949.

Full text

Abstract:

the (15, 1/6) standard convolution codes of CCSDS is powerful and is often used for satellite communication, and it is also the fundamental of designing channel code for deep space communication. After analyzing the channel encoding and decoding solutions in previous spacecrafts, the performance of CCSDS (15, 1/6) standard convolution codes is researched. The encoding efficiency is get by simulating (15, 1/6) standard convolution codes’ encoding system in C translation environment. The decoding performance and encoding gain are get by simulating (15, 1/6) standard convolution codes’ decoding s

APA, Harvard, Vancouver, ISO, and other styles

18

Zhu, Peng, Jun Zhu, and Xiang Liu. "A Study on Turbo Code Performance Based on AWGN Channel." Applied Mechanics and Materials 347-350 (August 2013): 1720–26. http://dx.doi.org/10.4028/www.scientific.net/amm.347-350.1720.

Full text

Abstract:

Turbo codes have a wide range of applications in 3G mobile communications, deep-sea communications, satellite communications and other power constrained fields. In the paper, the Turbo Code Decoding Principle and several major decoding methods are introduced. Simulations of Turbo code performance under different parameters of AWGN channel are made and the effects of the different interleaving length, the number of iterations, and the decoding algorithm to Turbo code performance are also discussed in AWGN channel. Simulation results show that under the same signal-to-noise ratio, the more the n

APA, Harvard, Vancouver, ISO, and other styles

19

Sujethaa, N. J., and P. Sivagamasundhari. "Performance Analysis of Overloaded Mimo-Ofdm Systems Using Iterative Joint Turbo Decoding." Journal of Analog and Digital Communications 3, no. 3 (2018): 14–22. https://doi.org/10.5281/zenodo.1493006.

Full text

Abstract:

<em>The Third Generation Partnership Project (3GPP) Long Term Evolution (LTE) employs turbo codes as its Forward Error Correction (FEC) standard along with multiple input, multiple output (MIMO) systems is used for achieving an excellent error correcting capability and higher throughput. Even if turbo decoding scheme gives adequate performance in ideal MIMO systems, but there is a significant performance degradation in an overloaded MIMO system when the number of transmit antennas is larger than that of receive antennas. In joint turbo decoding, controls of soft information be located accompan

APA, Harvard, Vancouver, ISO, and other styles

20

Wang, Zhong-xun, Yang Xi, and Zhan-kai Bao. "Nonbinary Low-Density Parity Check Decoding Algorithm Research-Based Majority Logic Decoding." International Journal of Pattern Recognition and Artificial Intelligence 34, no. 12 (2020): 2058016. http://dx.doi.org/10.1142/s0218001420580161.

Full text

Abstract:

In the nonbinary low-density parity check (NB-LDPC) codes decoding algorithms, the iterative hard reliability based on majority logic decoding (IHRB-MLGD) algorithm has poor error correction performance. The essential reason is that the hard information is used in the initialization and iterative processes. For the problem of partial loss of information, when the reliability is assigned during initialization, the error correction performance is improved by modifying the assignment of reliability at initialization. The initialization process is determined by the probability of occurrence of the

APA, Harvard, Vancouver, ISO, and other styles

21

Liao, Siyu, Chunhua Deng, Miao Yin, and Bo Yuan. "Doubly Residual Neural Decoder: Towards Low-Complexity High-Performance Channel Decoding." Proceedings of the AAAI Conference on Artificial Intelligence 35, no. 10 (2021): 8574–82. http://dx.doi.org/10.1609/aaai.v35i10.17040.

Full text

Abstract:

Recently deep neural networks have been successfully applied in channel coding to improve the decoding performance. However, the state-of-the-art neural channel decoders cannot achieve high decoding performance and low complexity simultaneously. To overcome this challenge, in this paper we propose doubly residual neural (DRN) decoder. By integrating both the residual input and residual learning to the design of neural channel decoder, DRN enables significant decoding performance improvement while maintaining low complexity. Extensive experiment results show that on different types of channel c

APA, Harvard, Vancouver, ISO, and other styles

22

Tan, Xianhan, Yu Qi, and Yueming Wang. "DeCorrNet: Enhancing Neural Decoding Performance by Eliminating Correlations in Noise." Proceedings of the AAAI Conference on Artificial Intelligence 39, no. 13 (2025): 14396–404. https://doi.org/10.1609/aaai.v39i13.33577.

Full text

Abstract:

Neural decoding, which transforms neural signals into motor commands, plays a key role in brain-computer interfaces (BCIs). Existing neural decoding approaches mainly rely on the assumption of independent noises, which could perform poorly in case the assumption is invalid. However, correlations in noises have been commonly observed in neural signals. Specifically, noise in different neural channels can be similar or highly related, which could degrade the performance of those neural decoders. To tackle this problem, we propose the DeCorrNet, which explicitly removes noise correlation in neura

APA, Harvard, Vancouver, ISO, and other styles

23

Zhang, Xianwen, Ming Jiang, Mingyang Zhu, Kailin Liu, and Chunming Zhao. "CRC-Aided Adaptive BP Decoding of PAC Codes." Entropy 24, no. 8 (2022): 1170. http://dx.doi.org/10.3390/e24081170.

Full text

Abstract:

Although long polar codes with successive cancellation decoding can asymptotically achieve channel capacity, the performance of short blocklength polar codes is far from optimal. Recently, Arıkan proposed employing a convolutional pre-transformation before the polarization network, called polarization-adjusted convolutional (PAC) codes. In this paper, we focus on improving the performance of short PAC codes concatenated with a cyclic redundancy check (CRC) outer code, CRC-PAC codes, since error detection capability is essential in practical applications, such as the polar coding scheme for the

APA, Harvard, Vancouver, ISO, and other styles

24

Kumar, H., Udupi Sripati, K. Shetty, and B. Shankarananda. "Soft Decision Fano Decoding of Block Codes Over Discrete Memoryless Channel Using Tree Diagram." Journal of Electrical Engineering 63, no. 1 (2012): 59–64. http://dx.doi.org/10.2478/v10187-012-0009-y.

Full text

Abstract:

Soft Decision Fano Decoding of Block Codes Over Discrete Memoryless Channel Using Tree DiagramA novel low complexity soft decision technique which allows the decoding of block codes with tree structure is proposed. These codes are shown to have a convenient tree structure that allows Fano decoding techniques to be used to decode them. The Fano algorithm searches through the tree structure of the block code for a path which has the optimal value of the Fano metric function. When a new candidate codeword is found, an optimality check is performed on it by using the threshold. If checked successf

APA, Harvard, Vancouver, ISO, and other styles

25

Deng, Li, Zhiping Shi, Yixin Wang, Xiaoxi Yu, Yong Liang Guan, and Zhiping Xu. "Hybrid Window Decoding for Joint Source Channel Anytime Coding System." Entropy 26, no. 11 (2024): 940. http://dx.doi.org/10.3390/e26110940.

Full text

Abstract:

Joint source channel anytime coding (JSCAC) is a kind of joint source channel coding (JSCC) systems based on the causal spatially coupled coding and joint expanding window decoding (JEWD) techniques. JSCAC demonstrates greatly improved error correction performance, as well as higher decoding complexity. This work proposes a joint hybrid window decoding (JHWD) algorithm for JSCAC systems, aiming to reduce the decoding complexity while maintaining comparable error correction performance with the state of the art. Unlike the traditional JEWD technique and its variants, the proposed JHWD algorithm

APA, Harvard, Vancouver, ISO, and other styles

26

Yan, Biao, Jia Min Wang, Ding Ping Guo, and Sai Yan Cai. "Analysis of MMSE-Based Anti-Interference Performance for MIMO-UWB Systems." Applied Mechanics and Materials 347-350 (August 2013): 1748–52. http://dx.doi.org/10.4028/www.scientific.net/amm.347-350.1748.

Full text

Abstract:

The combinations of MIMO (Multiple-Input-Multiple-Output) and UWB (Ultra-Wide-Band) systems greatly improve the performance of the UWB system. For the MIMO-UWB system, a new decoding scheme is proposed based on the STF (Space-Time-Frequency) coding and it can reduce the decoding complexity. The simulation results show that under the same SNR, the new method can obtain better performance of the bit error rate than the traditional ML decoding method.

APA, Harvard, Vancouver, ISO, and other styles

27

Chen, Rui Ping, Zhong Xun Wang, and Xin Qiao Yu. "A Min-Sum Algorithm Suitable for Hardware Implementation Based on LDPC Codes." Advanced Materials Research 271-273 (July 2011): 458–63. http://dx.doi.org/10.4028/www.scientific.net/amr.271-273.458.

Full text

Abstract:

Decoding algorithms with strong practical value not only have good decoding performance, but also have the computation complexity as low as possible. For this purpose, the paper points out the modified min-sum decoding algorithm(M-MSA). On the condition of no increasing in the decoding complexity, it makes the error-correcting performance improved by adding the appropriate scaling factor based on the min-sum algorithm(MSA), and it is very suitable for hardware implementation. Simulation results show that this algorithm has good BER performance, low complexity and low hardware resource utilizat

APA, Harvard, Vancouver, ISO, and other styles

28

Park, Jinsoo, Gangsan Kim, Hong-Yeop Song, Chanki Kim, Jong-Seon No, and Suil Kim. "Analysis of Iterative Erasure Insertion and Decoding of FH/MFSK Systems without Channel State Information." Security and Communication Networks 2018 (2018): 1–12. http://dx.doi.org/10.1155/2018/7318043.

Full text

Abstract:

We analyze the symbol measures for iterative erasure insertion and decoding of a Reed-Solomon coded SFH/MFSK system over jamming channels. In contrast to conventional erasure insertion schemes, iterative schemes do not require any preoptimized threshold or channel state information at the receiver. We confirm the performance improvement using a generalized minimum distance (GMD) decoding method with three different symbol measures. To analyze performance, we propose a new analysis framework considering the “trapped-error” probability. From analysis and the simulation results, we show that rati

APA, Harvard, Vancouver, ISO, and other styles

29

Wang, Li Na, and Wei Tang. "Decoding Improvement for LT Codes." Applied Mechanics and Materials 394 (September 2013): 499–504. http://dx.doi.org/10.4028/www.scientific.net/amm.394.499.

Full text

Abstract:

In this paper the performance of LT codes is analyzed. And then, for the remaining part of information which can be decoded still exists when decoding failure, an improved message passing decoding algorithm which retains the original algorithm framework is proposed. The simulation results have shown that the improved message passing decoding algorithm improves the decoding rate and reduces decoding overhead on the premise of appropriately increasing decoding complexity.

APA, Harvard, Vancouver, ISO, and other styles

30

A. Zikry, Abdel Halim, Ashraf Y. Hassan, Wageda I. Shaban, and Sahar F. Abdel-Momen. "Performance Analysis of LDPC Decoding Techniques." International Journal of Recent Technology and Engineering 9, no. 5 (2021): 17–26. http://dx.doi.org/10.35940/ijrte.e5067.019521.

Full text

Abstract:

Low density parity checking codes (LDPC) are one of the most important issues in coding theory at present. LDPC-code are a type of linear-block LDPC-codes. Channel coding might be considered as the finest conversant and most potent components of cellular communications systems, that was employed for transmitting errors corrections imposed by noise, fading and interfering. LDPC-codes are advanced coding gain, i.e., new area in coding. the performances of LDPC-code are similar to the Shannon-limiting, this led to the usage of decoding in several applications in digital communications systems, li

APA, Harvard, Vancouver, ISO, and other styles

31

Sato-Reinhold, J., J. L. Sy, K. Das, J. C. Elliott, M. P. Eckstein, and B. Giesbrecht. "Neural decoding during continuous task performance." Journal of Vision 11, no. 11 (2011): 197. http://dx.doi.org/10.1167/11.11.197.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Wei Yu and Yun He. "A high performance cabac decoding architecture." IEEE Transactions on Consumer Electronics 51, no. 4 (2005): 1352–59. http://dx.doi.org/10.1109/tce.2005.1561867.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Zhou, Fan, Linlin Niu, and Binghe Tian. "Performance analysis of LDPC decoding algorithm." Journal of Physics: Conference Series 1453 (January 2020): 012026. http://dx.doi.org/10.1088/1742-6596/1453/1/012026.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Lubomir Kostal, Petr Lansky, and Stevan Pilarski. "Performance breakdown in optimal stimulus decoding." Journal of Neural Engineering 12, no. 3 (2015): 036012. http://dx.doi.org/10.1088/1741-2560/12/3/036012.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Abdel, Halim A. Zikry, Y. Hassan Ashraf, I. Shaban Wageda, and F. Abdel-Momen Sahar. "Performance Analysis of LDPC Decoding Techniques." International Journal of Recent Technology and Engineering (IJRTE) 9, no. 5 (2021): 17–26. https://doi.org/10.35940/ijrte.E5067.019521.

Full text

Abstract:

<strong>Abstract:</strong> Low density parity checking codes (LDPC) are one of the most important issues in coding theory at present. LDPC-code are a type of linear-block LDPC-codes. Channel coding might be considered as the finest conversant and most potent components of cellular communications systems, that was employed for transmitting errors corrections imposed by noise, fading and interfering. LDPC-codes are advanced coding gain, i.e., new area in coding. the performances of LDPC-code are similar to the Shannon-limiting, this led to the usage of decoding in several applications in digital

APA, Harvard, Vancouver, ISO, and other styles

36

Zhou, Lingxia, Meixiang Zhang, Satya Chan, and Sooyoung Kim. "Review and Evaluation of Belief Propagation Decoders for Polar Codes." Symmetry 14, no. 12 (2022): 2633. http://dx.doi.org/10.3390/sym14122633.

Full text

Abstract:

The polar code has become one of the most popular and important forward error correction (FEC) coding schemes due to its symmetric characteristics of channel polarization. This paper reviews various decoding schemes for polar codes and discusses their advantages and disadvantages. After reviewing the existing performance-enhancing techniques such as belief propagation decoding with list, a new method is proposed to further improve the performance. In addition, a new complexity reduction technique based on the constituent codes is proposed, and a new scheduling scheme is introduced to reduce th

APA, Harvard, Vancouver, ISO, and other styles

37

Wang, Haidong, Jianhua Zhang, Qia Shan, Pengfei Xiao, and Ao Liu. "Visual Information Decoding Based on State-Space Model with Neural Pathways Incorporation." Electronics 14, no. 11 (2025): 2245. https://doi.org/10.3390/electronics14112245.

Full text

Abstract:

In contemporary visual decoding models, traditional neural network-based methods have made some advancements; however, their performance in addressing complex visual tasks remains constrained. This limitation is primarily due to the restrictions of local receptive fields and their inability to effectively capture visual information, resulting in the loss of essential contextual details. Visual processing in the brain initiates in the retina, where information is transmitted via the optic nerve to the lateral geniculate nucleus (LGN) and subsequently progresses along the ventral pathway for lay

APA, Harvard, Vancouver, ISO, and other styles

38

Zhang, Meng, Zhuo Li, Lijuan Xing, and Xin Liao. "Higher-Order Belief Propagation Correction Decoder for Polar Codes." Entropy 24, no. 4 (2022): 534. http://dx.doi.org/10.3390/e24040534.

Full text

Abstract:

Belief propagation (BP) decoding for polar codes has been extensively studied because of its inherent parallelism. However, its performance remains inferior to that of successive cancellation list decoding (SCL) due to the structure of the decoding graph. To improve the block error rate (BLER) performance, the BP correction (BPC) decoding, a post-processing scheme that corrects prior knowledge of the identified code bit, improves convergence by executing additional iterations on the failed BP decoder. Moreover, the BPC decoder demonstrates a better decoding performance than the BP-based bit-fl

APA, Harvard, Vancouver, ISO, and other styles

39

Tian, Kairui, He Sun, Yukai Liu, and Rongke Liu. "Quasi-Optimal Path Convergence-Aided Automorphism Ensemble Decoding of Reed–Muller Codes." Entropy 27, no. 4 (2025): 424. https://doi.org/10.3390/e27040424.

Full text

Abstract:

By exploiting the rich automorphisms of Reed–Muller (RM) codes, the recently developed automorphism ensemble (AE) successive cancellation (SC) decoder achieves a near-maximum-likelihood (ML) performance for short block lengths. However, the appealing performance of AE-SC decoding arises from the diversity gain that requires a list of SC decoding attempts, which results in a high decoding complexity. To address this issue, this paper proposes a novel quasi-optimal path convergence (QOPC)-aided early termination (ET) technique for AE-SC decoding. This technique detects strong convergence between

APA, Harvard, Vancouver, ISO, and other styles

40

Wang, Zhong Xun, Fang Qiang Zhu, Li Liu, and Juan Wang. "Loop Detection Based on Bit-Flipping Decoding Algorithm for LDPC Codes." Advanced Materials Research 271-273 (July 2011): 452–57. http://dx.doi.org/10.4028/www.scientific.net/amr.271-273.452.

Full text

Abstract:

In this paper, we introduce a new bit-flipping decoding algorithm for low-density parity-check codes based on loop detection mechanism, which is an extension to soft-decision decoding. This decoding algorithm's performance has been significantly improved by introducing a loop detection mechanism for the failed flipping bit and leading into the soft-decision about the reliability measure of the received symbols. Theoretical analysis shows that the complexity of this algorithm is lower. Some simulation results are given, which show that compared with other known kinds of bit-flipping decoding al

APA, Harvard, Vancouver, ISO, and other styles

41

Xu, Jin, Ying Zhao, and Shu Qiang Duan. "Research and Realization by FPGA of Turbo Codes." Advanced Materials Research 588-589 (November 2012): 765–68. http://dx.doi.org/10.4028/www.scientific.net/amr.588-589.765.

Full text

Abstract:

Turbo Code is a channel coding with excellent error-correcting performance in the condition of low noise-signal ratio.It has a superior decoding performance approaching the Shannon limit by adopting the random coding and decoding. This paper focuses on Turbo code and its implementation with FPGA and deeply analyzes the decoding theory and algorithm of Turbo code. Firstly, it analyzes the decoding theory of Turbo code. Then, it discusses key issues in the process of implementation with the most excellent and complicated Max—log—MAP algorithm. At last, it ends up with the Turbo encoder and decod

APA, Harvard, Vancouver, ISO, and other styles

42

Jin Ren. "Complexity/Performance Tradeoff: Asymmetrical Poly-diagonalization and Trellis Decoding & Sphere Decoding." International Journal of Digital Content Technology and its Applications 6, no. 23 (2012): 261–70. http://dx.doi.org/10.4156/jdcta.vol6.issue23.30.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Wang, Desheng, Jihang Yin, Yonggang Xu, Xuan Yang, Jiaqi Yan, and Gang Hua. "Shift Pruning-Based SCL Decoding for Polar Codes." Mathematics 12, no. 18 (2024): 2937. http://dx.doi.org/10.3390/math12182937.

Full text

Abstract:

In the context of the high-speed development of 5G communications, high-performance decoding schemes for polar codes are a hot spot in channel coding research. Shift pruning successive cancellation list (SP-SCL) decoding aims to recover the correct path by shift pruning in the extra SCL decoding. However, the current SP-SCL decoding is inflexible in determining the shift positions. In this paper, a flexible shift pruning SCL (FSP-SCL) decoding is proposed. Firstly, the reasons for movement and the eliminated states of the correct path are analyzed in detail using the path metric range (PMR), a

APA, Harvard, Vancouver, ISO, and other styles

44

Wu, Qingle, Benjamin K. Ng, Chan-Tong Lam, Xiangyu Cen, Yuanhui Liang, and Yan Ma. "Shared Graph Neural Network for Channel Decoding." Applied Sciences 13, no. 23 (2023): 12657. http://dx.doi.org/10.3390/app132312657.

Full text

Abstract:

With the application of graph neural network (GNN) in the communication physical layer, GNN-based channel decoding algorithms have become a research hotspot. Compared with traditional decoding algorithms, GNN-based channel decoding algorithms have a better performance . GNN has good stability and can handle large-scale problems; GNN has good inheritance and can generalize to different network settings. Compared with deep learning-based channel decoding algorithms, GNN-based channel decoding algorithms avoid a large number of multiplications between learning weights and messages. However, the a

APA, Harvard, Vancouver, ISO, and other styles

45

Roshidi, Din, Bakar Rosmadi, Sabirah Sabri Raihan, Yusof Darus Mohamad, and Jamel Elias Shamsul. "Performance analysis on secured data method in natural language steganography." Bulletin of Electrical Engineering and Informatics 8, no. 1 (2019): 298–304. https://doi.org/10.11591/eei.v8i1.1441.

Full text

Abstract:

The rapid amount of exchange information that causes the expansion of the internet during the last decade has motivated that a research in this field. Recently, steganography approaches have received an unexpected attention. Hence, the aim of this paper is to review different performance metric; covering the decoding, decrypting and extracting performance metric. The process of data decoding interprets the received hidden message into a code word. As such, data encryption is the best way to provide a secure communication. Decrypting take an encrypted text and converting it back into an origina

APA, Harvard, Vancouver, ISO, and other styles

46

Chen, Deguang, Ziping Ma, Lin Wei, Jinlin Ma, and Yanbin Zhu. "MTQA: Text-Based Multitype Question and Answer Reading Comprehension Model." Computational Intelligence and Neuroscience 2021 (February 18, 2021): 1–12. http://dx.doi.org/10.1155/2021/8810366.

Full text

Abstract:

Text-based multitype question answering is one of the research hotspots in the field of reading comprehension models. Multitype reading comprehension models have the characteristics of shorter time to propose, complex components of relevant corpus, and greater difficulty in model construction. There are relatively few research works in this field. Therefore, it is urgent to improve the model performance. In this paper, a text-based multitype question and answer reading comprehension model (MTQA) is proposed. The model is based on a multilayer transformer encoding and decoding structure. In the

APA, Harvard, Vancouver, ISO, and other styles

47

Yeom, Hong Gi, Wonjun Hong, Da-Yoon Kang, Chun Kee Chung, June Sic Kim, and Sung-Phil Kim. "A Study on Decoding Models for the Reconstruction of Hand Trajectories from the Human Magnetoencephalography." BioMed Research International 2014 (2014): 1–8. http://dx.doi.org/10.1155/2014/176857.

Full text

Abstract:

Decoding neural signals into control outputs has been a key to the development of brain-computer interfaces (BCIs). While many studies have identified neural correlates of kinematics or applied advanced machine learning algorithms to improve decoding performance, relatively less attention has been paid to optimal design of decoding models. For generating continuous movements from neural activity, design of decoding models should address how to incorporate movement dynamics into models and how to select a model given specific BCI objectives. Considering nonlinear and independent speed character

APA, Harvard, Vancouver, ISO, and other styles

48

McGlade, Nicola, Caragh Behan, Judy Hayden, et al. "Mental state decoding v. mental state reasoning as a mediator between cognitive and social function in psychosis." British Journal of Psychiatry 193, no. 1 (2008): 77–78. http://dx.doi.org/10.1192/bjp.bp.107.044198.

Full text

Abstract:

SummaryTheory of mind deficits in schizophrenia have been parsed into mental state reasoning and mental state decoding components. We report that mental state decoding as measured by the ‘Eyes task’ better predicted social function than mental state reasoning as measured by the ‘Hinting task’ in 73 out-patients with chronic schizophrenia. Mental state decoding task performance also partly mediated the influence of basic neuropsychological performance on social function. We discuss these findings in terms of the accumulating evidence that mental state decoding has particular relevance for under

APA, Harvard, Vancouver, ISO, and other styles

49

Catarman, Marylyn B., and Ma Gloria E. Liquido. "Pedagogical Competence in Brigada Pagbasa: Basis for A Proposed Training Manual." Randwick International of Education and Linguistics Science Journal 6, no. 2 (2025): 245–71. https://doi.org/10.47175/rielsj.v6i2.1166.

Full text

Abstract:

This study investigated the pedagogical competence of teachers in decoding, phonics instruction, and contextual understanding and its relationship with the FLAT performance of Grades 1, 2, and 3 learners in Las Nieves District 1. The study utilized secondary data from the FLAT performances during the 1st and 2nd quarters of SY 2023-2024, involving 250 Grade 1, 100 Grade 2, and 100 Grade 3 pupils. A researcher-made instrument validated by experts and tested for reliability was used to assess the pedagogical competence of teachers. The results showed that teachers' competence in developing decod

APA, Harvard, Vancouver, ISO, and other styles

50

Cui, Lanlan, Fei Wu, Xiaojian Liu, Meng Zhang, Renzhi Xiao, and Changsheng Xie. "Improving LDPC Decoding Performance for 3D TLC NAND Flash by LLR Optimization Scheme for Hard and Soft Decision." ACM Transactions on Design Automation of Electronic Systems 27, no. 1 (2022): 1–20. http://dx.doi.org/10.1145/3473305.

Full text

Abstract:

Low-density parity-check (LDPC) codes have been widely adopted in NAND flash in recent years to enhance data reliability. There are two types of decoding, hard-decision and soft-decision decoding. However, for the two types, their error correction capability degrades due to inaccurate log-likelihood ratio (LLR) . To improve the LLR accuracy of LDPC decoding, this article proposes LLR optimization schemes, which can be utilized for both hard-decision and soft-decision decoding. First, we build a threshold voltage distribution model for 3D floating gate (FG) triple level cell (TLC) NAND flash. T

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!