A fast parallel decoding algorithm for general one-point AG codes with a systolic array architecture

We propose a fast parallel decoding algorithm for general one-point algebraic geometric (1-pt AG) codes with a systolic array architecture (SAA). This algorithm is able to correct up to half the Feng-Rao (see IEEE Trans. IT, vo1.39, no.1, p.37-45, 1993) bound and the time complexity is O(n) by using...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Proceedings 1995 IEEE International Symposium on Information Theory s. 99
Hlavní autoři: Kurihara, M., Sakata, S.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 1995
Témata:
Concurrent computing
Cost accounting
Decoding
Error correction
Galois fields
Polynomials
Reed-Solomon codes
Systolic arrays
ISBN:0780324536, 9780780324534
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í:We propose a fast parallel decoding algorithm for general one-point algebraic geometric (1-pt AG) codes with a systolic array architecture (SAA). This algorithm is able to correct up to half the Feng-Rao (see IEEE Trans. IT, vo1.39, no.1, p.37-45, 1993) bound and the time complexity is O(n) by using a series of O(n) processors where n is the code length and each processor is composed of /spl tau/ cells for the smallest non-zero and non-gap value /spl tau/.
ISBN:0780324536
9780780324534
DOI:10.1109/ISIT.1995.531303