Showing 1-25 of 41,164 resultsfor "Index Terms":Decoding Algorithm
"Index Terms":Decoding Algorithm
- Sort
Get notified when new research is published matching your search criteria.
Sort By
Results
An Adaptive Decoding Algorithm Based on CE Criterion for BICM-ID
2012 International Conference on Computer Science and Electronics Engineering
Year: 2012 | Conference Paper |
Bit-interleaved coded modulation with iterative decoding (BICM-ID) can achieve better performance than BICM in both AWGN and Rayleigh fading channels because of the feedback algorithm. However, some existing decoding schemes in BICM-ID cannot perform well in both computational complexity and decoding performance. The Max-Log-MAP algorithm has lower computational complexity with worse decoding perf...Show More
Soft-cancellation (SCAN) is a soft output iterative algorithm widely used in polar decoding. This algorithm has better decoding performance than reduced latency soft-cancellation (RLSC) algorithm, which can effectively reduce the decoding delay of SCAN algorithm by 50% but has obvious performance loss. A modified reduced latency soft-cancellation (MRLSC) algorithm is presented in the paper. Compar...Show More
A Low Complexity Sequential Decoding Algorithm for Rateless Spinal Codes
IEEE Communications Letters
Cited by: Papers (24)
A forward stack decoding (FSD) algorithm for rateless spinal codes is proposed in this letter. This decoding algorithm divides the decoding tree of the spinal code into several layers, and then searches the decoding paths in each single layer. Compared with the bubble decoder, which was initially designed for spinal codes, the proposed FSD algorithm can decrease the complexity significantly withou...Show More
A new hybrid decoding algorithm for LDPC codes based on the improved variable multi weighted bit-flipping and BP algorithms
2013 21st Iranian Conference on Electrical Engineering (ICEE)
Year: 2013 | Conference Paper |
Cited by: Papers (4)
In this paper, a new two-stage hybrid algorithm for decoding Low-Density Parity-Check (LDPC) codes is proposed that incorporates two iterative decoding. For the first stage of decoding, we offer a new decoding algorithm called Improved Variable Multi Weighted Bit-Flipping (IVMWBF) algorithm. Since the IVMWBF algorithm is based on the idea of flipping variable multi bits in each iteration, both imp...Show More
Iterative algebraic soft-decision list decoding of Reed-Solomon codes
In this paper, we present an iterative soft-decision decoding algorithm for Reed-Solomon (RS) codes offering both complexity and performance advantages over previously known decoding algorithms. Our algorithm is a list decoding algorithm which combines two powerful soft-decision decoding techniques which were previously regarded in the literature as competitive, namely, the Koetter-Vardy algebraic...Show More
Hybrid iterative decoding for LDPC codes based on gradient descent bit-flipping algorithm
2016 8th International Conference on Wireless Communications & Signal Processing (WCSP)
Year: 2016 | Conference Paper |
Gradient descent bit-flipping (GDBF) decoding for low-density parity-check (LDPC) codes has gained great attentions because of low complexity and relatively good performance. However, the performance of the GDBF decoding is still much poorer than that of the MS algorithm. To further improve the performance, the iterative decoding process is introduced to GDBF decoding in this paper. At the end of ...Show More
Iterative Soft-Input Soft-Output Bit-Level Reed-Solomon Decoder Based on Information Set Decoding
SAIEE Africa Research Journal
Cited by: Papers (2)
In this paper, a bit-level decoder is presented for soft-input soft-output iterative decoding of Reed-Solomon (RS) codes. The main aim for the development of the proposed algorithm is to reduce the complexity of the decoding process, while yielding a relatively good error correction performance, for the efficient use of RS codes. The decoder utilises information set decoding techniques to reduce t...Show More
An adaptive hybrid list decoding and chase-like algorithm for reed-solomon codes
This paper presents an adaptive hybrid Chase-like algorithm for Reed-Solomon codes, which is based on the list decoding algorithm. The adaptive hybrid algorithm is based on the reliability threshold to exclude the more reliable bits from being processed by the list decoding algorithm and reduce the complexity of the hybrid algorithm. Simulation results show that the decoding complexities of the ad...Show More
Performance analysis of metaheuristic technique based decoding algorithms for block codes
Harish Kolisetty;Sai Vamsi Krishna Vadlamudi;Vamsi Krishna Chennam;R. Reddy Raju;S. Bhargav Anand Reddy
2017 International Conference on Communication and Signal Processing (ICCSP)
Year: 2017 | Conference Paper |
Metaheuristic algorithms are widely used to obtain optimal solutions for problems where only partial data is available or when computational capacity is limited. This feature of metaheuristic algorithms facilitates their introduction into channel decoding problem which is actually a search for the most likely transmitted codeword from a search space of 2n codewords in the case of binary codes and ...Show More
Reliability-based schedule for bit-flipping decoding of low-density Parity-check codes
A reliability-based message-passing schedule for iterative decoding of low-density parity-check codes is proposed. Simulation results for bit-flipping algorithms (with binary messages) show that a reliability-based schedule can provide considerable improvement in performance and decoding speed over the so-called flooding (parallel) schedule, as well as the existing graph-based schedules. The cost ...Show More
Reliability-based schedule for decoding low-density parity-check codes
2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577)
Year: 2004 | Conference Paper |
A reliability-based message-passing schedule for iterative decoding of low-density parity-check codes is proposed. Simulation results for bit-flipping algorithms (with binary messages) show that reliability-based schedule can provide considerable improvement in performance and decoding speed over the so-called flooding (parallel) schedule as well as the existing graph-based schedules. The cost ass...Show More
A novel simplified Log-MAP algorithm suitable for hardware implementation of turbo decoding
Krishnamohan Thangarajah;Behnam Shahrrava;Mohammed A. S. Khalid
2011 24th Canadian Conference on Electrical and Computer Engineering(CCECE)
Year: 2011 | Conference Paper |
In this paper, we propose a simplified Log-MAP algorithm that is equivalent to the Log-MAP algorithm in terms of the bit-error-rate (BER) performance, but without its implementation difficulties. The proposed algorithm is based on a linear approximation of the correction function in the Log-MAP algorithm over different signal-to-noise ratio (SNR) regions. This approximation is simple to implement ...Show More
Adaptive SNR estimation based decoding algorithm for block turbo codes
2009 Fourth International Conference on Communications and Networking in China
Year: 2009 | Conference Paper |
Cited by: Papers (2)
The SNR values in conventional Turbo decoding with the adaptive Chase algorithm are pre-fixed, which is not practical in applications. To get rid of the deficiency, a novel decoding algorithm for block Turbo codes was proposed, in which the channel levels of different SNR values were adaptively estimated. The proposed algorithm could tune the decoding complexity by using the relationship between t...Show More
A Turbo-Like Iterative Decoding Algorithm for Network Coded HARQ
SCC 2013; 9th International ITG Conference on Systems, Communication and Coding
Year: 2013 | Conference Paper |
Cited by: Papers (1)
This paper proposes a turbo-like decoding algorithm for network coded HARQ (NC-HARQ) retransmission scheme. Instead of retransmission erroneous packets individually, we send a network coded packet formed by XOR of two incorrectly received packets in the NC-HARQ retransmission. With respect to the two initial packets and one network coded packet, this retransmission scheme can be viewed as a produc...Show More
Simple improvements of bit-flipping decoding
2010 The 12th International Conference on Advanced Communication Technology (ICACT)
Year: 2010 | Conference Paper |
Cited by: Papers (2)
A bit-flipping (BF) algorithm is a decoding algorithm for LDPC codes that can be efficiently implemented by electronic circuits. Although its error correcting performance is rather poor, we show that a BF algorithm with bias terms has good error correcting performance. We also introduce two more parameters to improve the performance further. We also propose a variant of candidate bit based BF (CBB...Show More
Iterative joint source-channel decoding of VLC exploiting source semantics over realistic radio-mobile channels
Joint source-channel decoding of variable length codes (VLC) for image and video transmission over wireless links is a subject of increasing interest. This paper proposes an optimum decoder of VLC sequences which exploits inherent redundancy in source data, namely the VLC syntax and source constraints. The proposed decoder is able to deliver both Maximum Likelihood optimum hard-output and soft-out...Show More
Using self-correction for min-sum based decoding algorithms of LDPC codes
2015 4th Mediterranean Conference on Embedded Computing (MECO)
Year: 2015 | Conference Paper |
Cited by: Papers (2)
The reliability ratio weighted based bit-flipping (RRWBF) algorithm for decoding low-density parity-check (LDPC) codes has recently been developed to provide the best performance among all existing bit-flipping based algorithms. The implementation efficient reliability ratio weighted based bit-flipping (IERRWBF) algorithm speedup the original algorithm to decrease the processing time used. A drawb...Show More
Min-sum algorithm-structure based decoding algorithms for LDPC codes
2014 3rd Mediterranean Conference on Embedded Computing (MECO)
Year: 2014 | Conference Paper |
Cited by: Papers (7)
Review of various reduced-complexity min-sum based decoding algorithms for LDPC codes are presented. New BP-based approach for LDPC decoding was proposed, and one new a-min∗-min decoding algorithm was presented. Complexity, effectiveness, and average number of iteration for each algorithm are shown.Show More
Successive Cancellation List Decoder with Adaptive List Length
2019 11th International Conference on Wireless Communications and Signal Processing (WCSP)
Year: 2019 | Conference Paper |
Cited by: Papers (1)
Successive cancellation list decoder, which is generalized from successive cancellation decoder by increasing list size, is an effective decoding algorithm for polar codes. However, the list length is invariant throughout the decoding process which leads to redundant computation. To avoid this redundant computation, we propose an innovative and heuristic method to adjust the list length according ...Show More
A Turbo-Decoding Message-Passing Algorithm for Sparse Parity-Check Matrix Codes
A turbo-decoding message-passing (TDMP) algorithm for sparse parity-check matrix (SPCM) codes such as low-density parity-check, repeat-accumulate, and turbo-like codes is presented. The main advantages of the proposed algorithm over the standard decoding algorithm are 1) its faster convergence speed by a factor of two in terms of decoding iterations, 2) improvement in coding gain by an order of ma...Show More
Modified Earliest Decoding in Networks that Implement Random Linear Network Coding
In this paper we present a formalised description of Modified Earliest Decoding. We simulate the performance of the method in comparison with Earliest Decoding in networks that implement random linear network coding. We show that Modified Earliest Decoding has a smaller decoding complexity than Earliest Decoding and Gaussian Elimination as well as a smaller decoding delay.Show More
An improved LDPC decoding algorithm based on min-sum algorithm
2011 11th International Symposium on Communications & Information Technologies (ISCIT)
Year: 2011 | Conference Paper |
Cited by: Papers (8)
Low density parity check code is a kind of high-performance linear block code. It has excellent performance which is near the Shannon limit. LDPC has low decoding complexity, free structure and receives extensive attention. The typical decoding algorithm of LDPC is LLR BP algorithm, which is also called “sum-product algorithm”. LLR BP algorithm is the best algorithm at present. But it needs comple...Show More
Lowered-Complexity Decoding Algorithms of LDPC Codes for Agricultural-WSNs
2019 Eleventh International Conference on Ubiquitous and Future Networks (ICUFN)
Year: 2019 | Conference Paper |
Cited by: Papers (1)
This paper proposes a pattern based Low-density parity-check (LDPC) codes scheme to reduce the decoding complexity using logical XOR. New approaches to this paper describe the pattern based encoder which using logical XOR operation. The proposed scheme can reduce iteration, complexity and packet errors while decoding procedures. It can obtain enhanced throughput performance and at receiver sides i...Show More
Overlapped time domain multiplexing (OvTDM) is an innovative encoding scheme that can obtain high spectral efficiency. However, the intentional inter-symbol interference (ISI) caused by OvTDM will make the decoding process more complex. The computational complexity of maximum likelihood sequence detection increases exponentially with the growth of spectral efficiency in OvTDM. As a consequence of ...Show More
IEEE Account
Purchase Details
Profile Information
Need Help?
- US & Canada: +1 800 678 4333
- Worldwide: +1 732 981 0060
- Contact & Support
- About IEEE Xplore
- Contact Us
- Help
- Accessibility
- Terms of Use
- Nondiscrimination Policy
- Sitemap
- Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest technical professional organization dedicated to advancing technology for the benefit of humanity.
© Copyright 2025 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.