Paper
24 August 2010 On decoding (31, 16, 7) quadratic residue code up to its error correcting capacity with bit-error probability estimates
Tsung-Ching Lin, Pei-Yu Shih, Wen-Ku Su, Trieu-Kien Truong
Author Affiliations +
Abstract
The quadratic residue codes are a class of the error correcting codes with interesting mathematics. Among them, the (31, 16, 7) quadratic residue code is the code with reducible generator polynomial and three-error-correcting capacity. The algebraic decoding algorithm for the (32, 16, 8) quadratic residue code is developed by Reed et al. (1990). In this paper, a simplified decoding algorithm is proposed. The algorithm uses bit-error probability estimates, which is first developed by Reed MIT Lincoln Laboratory Report (1959), to cancel the third error and then uses the algebraic decoding algorithm mentioned above to correct the remaining two errors. Simulation results show that this modified decoding algorithm slightly reduces the decoding complexity for correcting the third error while maintaining the same BER performance in additive white Gaussian noise (AWGN). Also, the flowchart of the above decoding algorithm is illustrated with Fig. 1.
© (2010) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Tsung-Ching Lin, Pei-Yu Shih, Wen-Ku Su, and Trieu-Kien Truong "On decoding (31, 16, 7) quadratic residue code up to its error correcting capacity with bit-error probability estimates", Proc. SPIE 7814, Free-Space Laser Communications X, 781415 (24 August 2010); https://doi.org/10.1117/12.861076
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Error analysis

Algorithm development

Algorithms

Receivers

Computer simulations

Silicon

Binary data

Back to Top