High-speed decoding of the (71, 36, 11) quadratic residue code

Author

Lee, Hung-Peng ; Chang, Hsin-Chiu

Author_Institution

Dept. of Comput. Sci. & Inf. Eng., Fortune Inst. of Technol., Kaohsiung, Taiwan

fYear

2011

fDate

26-28 July 2011

Firstpage

3081

Lastpage

3084

Abstract

A high-speed and memory-efficient table lookup decoding algorithm (TLDA), called the syndrome and syndrome difference decoding algorithm (SSDDA), is developed to decode the long binary systematic (71, 36, 11) quadratic residue (QR) code. The essential point of the SSDDA is based on the property of the weight of syndrome and the weight of syndrome difference to reduce the memory size of the lookup table. The proposed algorithm generates a novel compact lookup table (CLT), which only consists of 7,806 syndromes and their corresponding error patterns. Consequently, the memory size of the proposed CLT is only about 38.39% of the lookup table proposed by Lin et al.

Keywords

decoding; residue codes; table lookup; CLT; QR code; SSDDA; binary systematic; compact lookup table; high-speed memory-efficient TLDA; high-speed memory-efficient table lookup decoding algorithm; memory size reduce; quadratic residue code; syndrome and syndrome difference decoding algorithm; Decoding; Generators; Noise measurement; Polynomials; Simulation; Software algorithms; Systematics; error pattern; lookup table; quadratic residue code; syndrome;

fLanguage

English

Publisher

ieee

Conference_Titel

Multimedia Technology (ICMT), 2011 International Conference on

Conference_Location

Hangzhou

Print_ISBN

978-1-61284-771-9

Type

conf

DOI

10.1109/ICMT.2011.6002082

Filename

6002082