Modified algebraic decoding of the binary (47, 24, 11) quadratic residue code

A modified algebraic decoding algorithm (ADA) is presented to decode up to five possible errors in a binary systematic (47, 24, 11) quadratic residue (QR) code. The main key points of the proposed ADA are to modify the erroneous conditions in Case 3, Case 4, and Case 5 of the ADA given in He et al....

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2011 International Conference on Consumer Electronics, Communications and Networks s. 5056 - 5059
Hlavní autoři: Hung-Peng Lee, Hsin-Chiu Chang
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.04.2011
Témata:
algebraic decoding algorithm
Decoding
error locator polynomial
Galois fields
Helium
Polynomials
quadratic residue codes
Silicon
Simulation
syndrome
Systematics
ISBN:1612844588, 9781612844589
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:A modified algebraic decoding algorithm (ADA) is presented to decode up to five possible errors in a binary systematic (47, 24, 11) quadratic residue (QR) code. The main key points of the proposed ADA are to modify the erroneous conditions in Case 3, Case 4, and Case 5 of the ADA given in He et al. (2001) and to find out the true conditions from Case 2 to Case 5. The new conditions can also be applied to the ADA given in Lin et al. (2010). A simulation result shows that the decoding time of the proposed ADA is faster than that of ADA given in Lin et al. (2010).
ISBN:1612844588
9781612844589
DOI:10.1109/CECNET.2011.5768172