Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Some linear-time algorithms for systolic arrays   We survey some results on linear-time algorithms for systolic arrays. In
particular, we show how the greatest common divisor (GCD) of two polynomials of
degree n over a finite field can be computed in time O(n) on a linear systolic
array of O(n) cells; similarly for the GCD of two n-bit binary numbers. We show
how n * n Toeplitz systems of linear equations can be solved in time O(n) on a
linear array of O(n) cells, each of which has constant memory size (independent
of n). Finally, we outline how a two-dimensional square array of O(n)* O(n)
cells can be used to solve (to working accuracy) the eigenvalue problem for a
symmetric real n* n matrix in time O(nS(n)). Here S(n) is a slowly growing
function of n; for practical purposes S(n) can be regarded as a constant. In
addition to their theoretical interest, these results have potential
applications in the areas of error-correcting codes, symbolic and algebraic
computations, signal processing and image processing.

0
The categories of this paper are: hep-ph
25
The categories of this paper are: patt-sol
29
The categories of this paper are: funct-an
22
The categories of this paper are: chao-dyn
7
The categories of this paper are: hep-th
13
The categories of this paper are: quant-ph
12
The categories of this paper are: nucl-th
32
The categories of this paper are: atom-ph
28
The categories of this paper are: alg-geom
8
The categories of this paper are: hep-ex
34
The categories of this paper are: chem-ph
14
The categories of this paper are: math-ph
17
The categories of this paper are: q-fin
18
The categories of this paper are: econ
36
The categories of this paper are: cmp-lg
9
The categories of this paper are: nlin