Abstract :
Given a vector of N elements, the perfect shuffle of this vector is a permutation of the elements that are identical to a perfect shuffle of a deck of cards. Elements of the first half of the vector are interlaced with elements of the second half in the perfect shuffle of the vector.
Keywords :
Data paths, fast Fourier transform, interconnection patterns, matrix transposition, parallel processing, perfect shuffle, polynomial evaluation, sorting.; Application software; Concurrent computing; Data structures; Fast Fourier transforms; Parallel algorithms; Parallel processing; Polynomials; Registers; Sorting; Symmetric matrices; Data paths, fast Fourier transform, interconnection patterns, matrix transposition, parallel processing, perfect shuffle, polynomial evaluation, sorting.;
