Comparing fast implementations of bit permutation instructions

Yedidya Hilewitz, Zhijie Jerry Shi, Ruby B. Lee

Research output: Contribution to journalConference articlepeer-review

35 Scopus citations


Recently, a number of candidate instructions have been proposed to efficiently compute arbitrary bit permutations. Among these, GRP is the most attractive, having utility for other applications in addition to permutation such as sorting and having good inherent cryptographic properties. However, the current implementation of GRP is the slowest of the candidates; BFLY, on the other hand, is the fastest. In this paper, we examine the possibility of executing GRP on a butterfly or an inverse butterfly network.

Original languageEnglish (US)
Pages (from-to)1856-1863
Number of pages8
JournalConference Record - Asilomar Conference on Signals, Systems and Computers
StatePublished - 2004
EventConference Record of the Thirty-Eighth Asilomar Conference on Signals, Systems and Computers - Pacific Grove, CA, United States
Duration: Nov 7 2004Nov 10 2004

All Science Journal Classification (ASJC) codes

  • Signal Processing
  • Computer Networks and Communications


Dive into the research topics of 'Comparing fast implementations of bit permutation instructions'. Together they form a unique fingerprint.

Cite this