| TR#: | CS0315 |
| Class: | CS |
| Title: | An Efficient Algorithm for Generating Linear Transformations in a Shufflf-Exchange Network |
| Authors: | T. Etzion and A. Lempel |
| CS0315.pdf | |
| Abstract: | This paper presents an algorithm for generating all the permutations defined by linear transformations on a shutffle-exchange network og 2^n processors in 2n -1 passes. The proposed algorithm generates any such permutation in O(n*(logn)^2) elementry steps. The subclass of bit-permutations is generated in O(n) steps. |
| Copyright | The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information |
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1984/CS/CS0315), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the CS technical reports of 1984
To the main CS technical reports page