Automatic generation of streaming datapaths for arbitrary fixed permutations

Abstract—This paper presents a technique to perform arbitrary fixed permutations on streaming data. We describe a parameterized architecture that takes as input n data points streamed at a rate of w per cycle, performs a permutation over all n points, and outputs the result in the same streaming format. We describe the system and its requirements mathematically and use this mathematical description to show that the datapaths resulting from our technique can sustain a full throughput of w words per cycle without stalling. Additionally, we provide an algorithm to configure the datapath for a given permutation and streaming width. Using this technique, we have constructed a full synthesis system that takes as input a permutation and a streaming width and outputs a register-transfer level Verilog description of the datapath. We present an evaluation of our generated designs over varying problem sizes and streaming widths, synthesized for a Xilinx Virtex-5 FPGA.

• Type: Conference
• Year: 2009
• Where: DATE
• Authors: Peter A. Milder, James C. Hoe, Markus Püschel
• Keywords: Arbitrary fixed Permutations, DATE 2009, Hardware, Permutation, Streaming Data