By Topic

A systolic array architecture for implementing a fast parallel decoding algorithm of one-point AG codes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Sakata, S. ; Dept. of Comput. Sci. & Inf. Math., Univ. of Electro-Commun., Tokyo, Japan ; Kurihara, M.

Previously we proposed a fast parallel decoding algorithm for general one-point algebraic geometric (AG) codes with a systolic array architecture. But, designing the detailed structure of the systolic array and scheduling the relevant procedures remained to be given explicitly, because the proper discontinuities (i.e., gaps) accompanied with a pole-order (nongap) sequence make the problem very complicated. Based on a version of the fast decoding algorithm expressed in terms of matrices with univariate polynomials as entities, we present a method of complete scheduling on a revised architecture of systolic array for implementing this algorithm in parallel. For the size m of input data, i.e. the syndrome, and the first nongap ρ, the time complexity is O(m) and the space complexity is O(ρ2 m), where the time complexity O(ρm2) was required by the serial algorithm

Published in:

Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on

Date of Conference:

29 Jun-4 Jul 1997