Share Email Print

Proceedings Paper

On decoding (31, 16, 7) quadratic residue code up to its error correcting capacity with bit-error probability estimates
Author(s): Tsung-Ching Lin; Pei-Yu Shih; Wen-Ku Su; Trieu-Kien Truong
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper 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.

Paper Details

Date Published: 24 August 2010
PDF: 7 pages
Proc. SPIE 7814, Free-Space Laser Communications X, 781415 (24 August 2010); doi: 10.1117/12.861076
Show Author Affiliations
Tsung-Ching Lin, I-Shou Univ. (Taiwan)
Pei-Yu Shih, I-Shou Univ. (Taiwan)
Wen-Ku Su, I-Shou Univ. (Taiwan)
Trieu-Kien Truong, I-Shou Univ. (Taiwan)

Published in SPIE Proceedings Vol. 7814:
Free-Space Laser Communications X
Arun K. Majumdar; Christopher C. Davis, Editor(s)

© SPIE. Terms of Use
Back to Top