Data Routing Networks for Systolic/Pipeline Realization of Prime Factor Mapping

Authors:
Kar-Lik Wong;Wan-Chi Siu
Affiliations:
-;-
Venue:
IEEE Transactions on Computers
Year:
1991

Citing 3
Cited 1

Number theory in science and communication

Number theory in science and communication
Designing efficient algorithms for parallel computers

Designing efficient algorithms for parallel computers
A Pipeline Design of a Fast Prime Factor DFT on a Finite Field

IEEE Transactions on Computers

A Pipeline Design for the Realization of the Prime Factor Algorithm Using the Extended Diagonal Structure

IEEE Transactions on Computers

Quantified Score

Hi-index	14.98

Visualization

Abstract

It is pointed out that transformed data computed by systolic/pipeline processors using the data shuffling network recently proposed by T.K. Troung et al. cannot be unscrambled by simply reversing the cyclic row and cyclic column shufflings. This can be amended by the proposed restoration scheme. In addition, efficient architectures for the data routing networks with low circuit complexities are proposed. These form useful building blocks for very-high-throughput hardware realizations.