Search Results - Fast Chase decoding algorithms
-
1
Fast Chase Decoding Algorithms and Architectures for Reed-Solomon Codes
ISSN: 0018-9448, 1557-9654Published: New York, NY IEEE 01.01.2012Published in IEEE transactions on information theory (01.01.2012)“… (or patterns for nonbinary case). In this paper, we devise a one-pass Chase decoding algorithm of Reed-Solomon codes such that the desired error locator polynomial by flipping an error pattern is obtained in one pass…”
Get full text
Journal Article -
2
Fast Syndrome-Based Chase Decoding of Binary BCH Codes Through Wu List Decoding
ISSN: 0018-9448, 1557-9654Published: New York IEEE 01.08.2023Published in IEEE transactions on information theory (01.08.2023)“…We present a new fast Chase decoding algorithm for binary BCH codes. The new algorithm reduces the complexity in comparison to a recent fast Chase decoding algorithm for Reed-Solomon (RS…”
Get full text
Journal Article -
3
A Gröbner-Bases Approach to Syndrome-Based Fast Chase Decoding of Reed-Solomon Codes
ISSN: 0018-9448, 1557-9654Published: New York IEEE 01.04.2022Published in IEEE transactions on information theory (01.04.2022)“…We present a simple syndrome-based fast Chase decoding algorithm for Reed-Solomon (RS) codes…”
Get full text
Journal Article -
4
Fast Chase algorithm with an application in turbo decoding
ISSN: 0090-6778, 1558-0857Published: New York IEEE 01.10.2001Published in IEEE transactions on communications (01.10.2001)“… Taking motivation from efficient forced erasure decoders, this implementation re-orders the Chase algorithm's repeated decodings such that the inherent computational redundancy is greatly reduced…”
Get full text
Journal Article -
5
Fast chase algorithms for decoding Reed-Solomon codes
ISSN: 2378-8593Published: IEEE 01.05.2014Published in International Symposium on Next-Generation Electronics (Online) (01.05.2014)“…This paper presented the modified Chase algorithms to improve the decoding time by reducing the number of candidate codewords…”
Get full text
Conference Proceeding -
6
Fast syndrome-based Chase decoding of binary BCH codes through Wu list decoding
ISSN: 2331-8422Published: Ithaca Cornell University Library, arXiv.org 24.05.2022Published in arXiv.org (24.05.2022)“…We present a new fast Chase decoding algorithm for binary BCH codes. The new algorithm reduces the complexity in comparison to a recent fast Chase decoding algorithm for Reed--Solomon (RS…”
Get full text
Paper -
7
Low-Complexity Chase Decoding of Hermitian Codes With Improved Interpolation and Root-Finding
ISSN: 0090-6778, 1558-0857Published: New York IEEE 01.08.2025Published in IEEE transactions on communications (01.08.2025)“…This paper proposes the low-complexity Chase (LCC) decoding for Hermitian codes, which is facilitated by both the improved interpolation and root-finding…”
Get full text
Journal Article -
8
A Groebner-bases approach to syndrome-based fast Chase decoding of Reed--Solomon codes
ISSN: 2331-8422Published: Ithaca Cornell University Library, arXiv.org 03.01.2022Published in arXiv.org (03.01.2022)“…We present a simple syndrome-based fast Chase decoding algorithm for Reed--Solomon (RS) codes…”
Get full text
Paper -
9
Fast and Low-Complexity Soft-Decision Generalized Integrated Interleaved Decoder
ISSN: 2641-8770, 2641-8770Published: Piscataway IEEE 2023Published in IEEE journal on selected areas in information theory (2023)“… Among existing soft-decision decoding algorithms of BCH codes, the Chase algorithm that carries out decoding trials on multiple test vectors can achieve a better trade-off on the coding gain and complexity…”
Get full text
Journal Article -
10
To sort or not to sort: the impact of spike-sorting on neural decoding performance
ISSN: 1741-2552, 1741-2552Published: England 01.10.2014Published in Journal of neural engineering (01.10.2014)“… It is not known, however, how much decoding information might be lost by ignoring spike identity…”
Get more information
Journal Article -
11
Cascaded Channel Model, Analysis, and Hybrid Decoding for Spin-Torque Transfer Magnetic Random Access Memory
ISSN: 0018-9464, 1941-0069Published: New York IEEE 01.11.2017Published in IEEE transactions on magnetics (01.11.2017)“… In this paper, we first propose a novel cascaded channel model for STT-MRAM that facilitates fast error rate simulations and more importantly the theoretical design and analysis of memory sensing…”
Get full text
Journal Article -
12
Design of a Fast Chase Algorithm based High Speed Turbo Product Code Decoder
Published: IEEE 21.10.2021Published in 2021 International Conference on Advances in Computing and Communications (ICACC) (21.10.2021)“…In this paper a high speed turbo product code (TPC) decoder based on fast Chase algorithm is proposed…”
Get full text
Conference Proceeding -
13
Fast Kaneko Algorithm for Linear Block Codes
Published: IEEE 01.12.2019Published in 2019 7th International Japan-Africa Conference on Electronics, Communications, and Computations, (JAC-ECC) (01.12.2019)“…This paper introduces a fast implementation of the Kaneko algorithm for decoding single error correcting linear block codes…”
Get full text
Conference Proceeding -
14
Algebraic decoding of the (71, 36, 11) quadratic residue code
ISSN: 1751-8628, 1751-8636Published: The Institution of Engineering and Technology 14.04.2016Published in IET communications (14.04.2016)“… Moreover, while using the proposed algorithm, if uses the channel measurement information proposed by Chase to sequentially invert the bits of the received word until one of the errors is cancelled…”
Get full text
Journal Article -
15
Real-time turbo decoding of block turbo codes using the Hartmann-Nazarov algorithm on the DSP Texas TMS320C6201
ISBN: 0780374002, 9780780374003Published: IEEE 2002Published in 2002 IEEE International Conference on Communications (2002)“… The decoding process can use different algorithms. After first implementing the Chase algorithm, we present another decoding process including the Hartmann-Nazarov (1976, 1998…”
Get full text
Conference Proceeding -
16
Fast decoding of the (23, 12, 7) Golay code with four-error-correcting capability
ISSN: 1124-318X, 1541-8251Published: Chichester, UK John Wiley & Sons, Ltd 01.11.2011Published in European transactions on telecommunications (01.11.2011)“…ABSTRACT In this paper, a fast and efficient decoding algorithm for correcting the (23, 12, 7) Golay code up to four errors is presented…”
Get full text
Journal Article -
17
Performance analysis of metaheuristic technique based decoding algorithms for block codes
Published: IEEE 01.04.2017Published in ICCSP : 2017 International Conference on Communication and Signal Processing : 6-8 April 2017 (01.04.2017)“… 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 2 n…”
Get full text
Conference Proceeding -
18
Low-complexity architecture for Chase soft-decision Reed-Solomon decoding
Published: IEEE 01.04.2014Published in Technical Papers of 2014 International Symposium on VLSI Design, Automation and Test (01.04.2014)“… Among various soft-decision algorithms, the Chase algorithm has moderate performance and rational complexity and hence is usually designed for hardware implementation…”
Get full text
Conference Proceeding -
19
Efficient decoding of the (23, 12, 7) Golay code up to five errors
ISSN: 0020-0255, 1872-6291Published: Elsevier Inc 20.12.2013Published in Information sciences (20.12.2013)“… Consequently, two methods of fast searching candidate codewords are proposed, both of which only perform the algebraic hard decision decoder once, rather than iterative decoding of Chase-like algorithm…”
Get full text
Journal Article -
20
A Low-Complexity Decoder for Turbo Product Codes Based on Extended Hamming Codes
ISSN: 2576-7828Published: IEEE 01.10.2018Published in Proceedings (International Conference on Communication Technology. Online) (01.10.2018)“…) and the corresponding hardware architecture are proposed. The proposed decoding algorithm is based on a low-complexity Fast Chase algorithm proposed in [1…”
Get full text
Conference Proceeding

