Optimized Algebraic Decoding Algorithm for (47, 24, 11) QR Code

A fast decoding algorithm scheme is proposed for the quadratic residue code with code length of 47 and large error-correcting capacity of 5 errors in this paper, called optimized algebraic decoding algorithm (OADA). The main contributions of this article are to deduce a method to quickly compute the...

Full description

Saved in:
Bibliographic Details
Main Authors: Luo, Chunlan, Zhu, Xiaoxia
Format: Conference Proceeding
Language:English
Subjects:
algebraic decoding algorithm
Analytical models
channel coding
Codes
Computational modeling
error pattern
Memory management
QR codes
quadratic residue code
Signal processing algorithms
Simulation
syndrome
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A fast decoding algorithm scheme is proposed for the quadratic residue code with code length of 47 and large error-correcting capacity of 5 errors in this paper, called optimized algebraic decoding algorithm (OADA). The main contributions of this article are to deduce a method to quickly compute the related unknown syndrome of (47,24,11) QR code and a simpler discriminant condition to detect whether four errors occurred in the received word. The decoding algorithm scheme needs lower memory requirement compared with the algorithm based on the full hard decision algebraic decoding algorithm. For exhaustive simulation test of all the error patterns shows that the proposed algorithm of (47, 24, 11) QR code improves the decoding performance and decoding efficiency.
ISSN:2770-792X
DOI:10.1109/ICICSP55539.2022.10050587