Back to main page

Code generator for bit permutations

Back to main page

Please enter an index vector (0..31 or $0..$1f, or * for don't care):

origin base indexes refer

Options: Allow using cycles

Actual connections

Best method found: Reordered Beneš network (about 40 cycles on superscalar processors):

x = bit_permute_step(x, 0x0000f0ba, 16);  // Butterfly, stage 4
x = bit_permute_step(x, 0x00620010, 8);  // Butterfly, stage 3
x = bit_permute_step(x, 0x00020804, 4);  // Butterfly, stage 2
x = bit_permute_step(x, 0x03021203, 2);  // Butterfly, stage 1
x = bit_permute_step(x, 0x40100155, 1);  // Butterfly, stage 0
x = bit_permute_step(x, 0x0e02010d, 4);  // Butterfly, stage 2
x = bit_permute_step(x, 0x00890084, 8);  // Butterfly, stage 3
x = bit_permute_step(x, 0x00009c31, 16);  // Butterfly, stage 4

See documentation to bit_permute_step, bit_permute_step_simple, rol.
pext and pdep can be emulated with compress_right and expand_right.
This result is not necessarily the best possible, but at least several methods have been challenged. The given cycles are only estimated and may vary significantly depending on the used processor. Thus, the selected method might not be the best one for your application. You can however influence the choice by using the options above.
See also some notes on the inner workings.
There is an even better permutation code calculator calcperm.* which is usable for various word sizes (Pascal and C++ sources).

Error reports, comments or questions? E-mail:

You may bookmark this page as
Last change: 2015-11-10