Permuting streaming data using RAMs
Abstract
This article presents a method for constructing hardware structures that perform a fixed permutation on streaming data. The method applies to permutations that can be represented as linear mappings on the bit-level representation of the data locations. This subclass includes many important permutations such as stride permutations (corner turn, perfect shuffle, etc.), the bit reversal, the Hadamard reordering, and the Gray code reordering.
Document Details
- Document Type
- Pub Defense Publication
- Publication Date
- Apr 01, 2009
- Source ID
- 10.1145/1502793.1502799
Entities
People
- James C. Hoe
- Markus Püschel
- Peter A. Milder
Organizations
- Carnegie Mellon University
- Defense Advanced Research Projects Agency
- National Science Foundation