Share Email Print

Proceedings Paper

Fast subword permutation instructions based on butterfly network
Author(s): Xiao Yang; Manish Vachharajani; Ruby B. Lee
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

Many contemporary microprocessor architectures incorporate multimedia extensions to accelerate media-rich applications using subword arithmetic. While these extensions significantly improve the performance of most multimedia applications, the lack of subword rearrangement support potentially limits performance gain. Several means of adding architectural support for subword rearrangement were proposed and implemented but none of them provide a fully general solution. In this paper, a new class of permutation instructions based on the butterfly interconnection network is proposed to address the general subword rearrangement problem. It can be used to perform arbitrary permutation (without repetition) of n subwords within log n cycles regardless of the subword size. The instruction coding and the low-level implementation for the instructions are quite simple. An algorithm is also given to derive an instruction sequence for any arbitrary permutation.

Paper Details

Date Published: 29 December 1999
PDF: 7 pages
Proc. SPIE 3970, Media Processors 2000, (29 December 1999); doi: 10.1117/12.375241
Show Author Affiliations
Xiao Yang, Princeton Univ. (United States)
Manish Vachharajani, Princeton Univ. (United States)
Ruby B. Lee, Princeton Univ. (United States)

Published in SPIE Proceedings Vol. 3970:
Media Processors 2000
Sethuraman Panchanathan; V. Michael Bove; Subramania I. Sudharsanan, Editor(s)

© SPIE. Terms of Use
Back to Top