Fast subword permutation instructions using omega and flip network stages

Xiao Yang, Ruby B. Lee

Research output: Contribution to conferencePaper

40 Scopus citations

Abstract

This paper proposes a new way of efficiently doing arbitrary n-bit permutations in programmable processors modeled on the theory of omega and flip networks. The new omflip instruction we introduce can perform any permutation of n subwords in log n instructions, with the subwords ranging from half-words down to single bits. Each omflip instruction can be done in a single cycle, with very efficient hardware implementation. The omflip instruction enhances a programmable processor's capability for handling multimedia and security applications which use subword permutations extensively.

Original languageEnglish (US)
Pages15-22
Number of pages8
StatePublished - Jan 1 2000
Event2000 International Conference on Computer Design - Austin, TX, USA
Duration: Sep 17 2000Sep 20 2000

Other

Other2000 International Conference on Computer Design
CityAustin, TX, USA
Period9/17/009/20/00

All Science Journal Classification (ASJC) codes

  • Hardware and Architecture
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Fast subword permutation instructions using omega and flip network stages'. Together they form a unique fingerprint.

  • Cite this

    Yang, X., & Lee, R. B. (2000). Fast subword permutation instructions using omega and flip network stages. 15-22. Paper presented at 2000 International Conference on Computer Design, Austin, TX, USA, .