Paper
29 December 1999 Fast subword permutation instructions based on butterfly network
Xiao Yang, Manish Vachharajani, Ruby B. Lee
Author Affiliations +
Proceedings Volume 3970, Media Processors 2000; (1999) https://doi.org/10.1117/12.375241
Event: Electronic Imaging, 2000, San Jose, CA, United States
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.
© (1999) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Xiao Yang, Manish Vachharajani, and Ruby B. Lee "Fast subword permutation instructions based on butterfly network", Proc. SPIE 3970, Media Processors 2000, (29 December 1999); https://doi.org/10.1117/12.375241
Lens.org Logo
CITATIONS
Cited by 27 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Multimedia

Multiplexers

Algorithm development

Switches

Computer architecture

Data processing

Electrical engineering

Back to Top