Index Transformation Algorithms in a Linear Algebra Framework

@article{Edelman1994IndexTA,
  title={Index Transformation Algorithms in a Linear Algebra Framework},
  author={Alan Edelman and Steve Heller and S. Lennart Johnsson},
  journal={IEEE Trans. Parallel Distrib. Syst.},
  year={1994},
  volume={5},
  pages={1302-1309}
}
We present a linear algebraic formulation for a class of index transformations such as Gray code encoding and decoding, matrix transpose, bit reversal, vector reversal, shuffles, and other index or dimension permutations. This formulation unifies, simplifies, and can be used to derive algorithms for hypercube multiprocessors. We show how all the widely known properties of Gray codes, and some not so well-known properties as well, can be derived using this framework. Using this framework, we… CONTINUE READING

Similar Papers

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 28 CITATIONS

Multiplexer and Memory-Efficient Circuits for Parallel Bit Reversal

  • IEEE Transactions on Circuits and Systems II: Express Briefs
  • 2019
VIEW 4 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Optimum Circuits for Bit-Dimension Permutations

  • IEEE Transactions on Very Large Scale Integration (VLSI) Systems
  • 2019
VIEW 3 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

A Vector Space Framework for Parallel Stable Permutations

VIEW 4 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Software for Parallel Computation

VIEW 6 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

An Optimum Architecture for Continuous-Flow Parallel Bit Reversal

  • IEEE Signal Processing Letters
  • 2015
VIEW 2 EXCERPTS
CITES BACKGROUND

Optimum Circuits for Bit Reversal

  • IEEE Transactions on Circuits and Systems II: Express Briefs
  • 2011
VIEW 1 EXCERPT
CITES BACKGROUND