Issue No. 04 - April (1994 vol. 43)

ISSN: 0018-9340

pp: 443-459

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.278482

ABSTRACT

<p>A new class of general-base matrices, named sampling matrices, which are meant to bridge the gap between algorithmic description and computer architecture is proposed. "Poles," "zeros," "pointers," and "spans" are among the terms introduced to characterize properties of this class of matrices. A formalism for the decomposition of a general matrix in terms of general-base sampling matrices is proposed. "Span" matrices are introduced to measure the dependence of a matrix span on algorithm parameters and, among others, the interaction between this class of matrices and the general-base perfect shuffle permutation matrix previously introduced. A classification of general-base parallel "recirculant" and parallel pipelined processors based on memory topology, access uniformity and shuffle complexity is proposed. The matrix formalism is then used to guide the search for algorithm factorizations leading to optimal parallel and pipelined processor architecture.</p>

INDEX TERMS

pipeline processing; parallel architectures; matrix algebra; pipelined processing; matrices; parallel processing; general-base matrices; sampling matrices; computer architecture; Poles; zeros; pointers; spans; algorithm parameters; parallel pipelined processors; memory topology; access uniformity; shuffle complexity; algorithm factorizations; pipelined architecture; matrix theory; generalized perfect shuffle; Chrestenson generalized Walsh transform; generalized spectral analysis.

CITATION

M.J. Corinthios, "Optimal Parallel and Pipelined Processing Through a New Class of Matrices with Application to Generalized Spectral Analysis",

*IEEE Transactions on Computers*, vol. 43, no. , pp. 443-459, April 1994, doi:10.1109/12.278482