Issue No.02 - February (1971 vol.20)
H.S. Stone , IEEE
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.
Data paths, fast Fourier transform, interconnection patterns, matrix transposition, parallel processing, perfect shuffle, polynomial evaluation, sorting.
H.S. Stone, "Parallel Processing with the Perfect Shuffle", IEEE Transactions on Computers, vol.20, no. 2, pp. 153-161, February 1971, doi:10.1109/T-C.1971.223205