|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
Parallel Processing with the Perfect Shuffle
February 1971 (vol. 20 no. 2)
pp. 153-161
| ASCII Text | x | ||
| H.S. Stone, "Parallel Processing with the Perfect Shuffle," IEEE Transactions on Computers, vol. 20, no. 2, pp. 153-161, February, 1971. | |||
| BibTex | x | ||
| @article{ 10.1109/T-C.1971.223205, author = {H.S. Stone}, title = {Parallel Processing with the Perfect Shuffle}, journal ={IEEE Transactions on Computers}, volume = {20}, number = {2}, issn = {0018-9340}, year = {1971}, pages = {153-161}, doi = {http://doi.ieeecomputersociety.org/10.1109/T-C.1971.223205}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - Parallel Processing with the Perfect Shuffle IS - 2 SN - 0018-9340 SP153 EP161 EPD - 153-161 A1 - H.S. Stone, PY - 1971 KW - Data paths KW - fast Fourier transform KW - interconnection patterns KW - matrix transposition KW - parallel processing KW - perfect shuffle KW - polynomial evaluation KW - sorting. VL - 20 JA - IEEE Transactions on Computers ER - | |||
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.
Index Terms:
Data paths, fast Fourier transform, interconnection patterns, matrix transposition, parallel processing, perfect shuffle, polynomial evaluation, sorting.
Citation:
H.S. Stone, "Parallel Processing with the Perfect Shuffle," IEEE Transactions on Computers, vol. 20, no. 2, pp. 153-161, Feb. 1971, doi:10.1109/T-C.1971.223205
Usage of this product signifies your acceptance of the Terms of Use.