Linear-Time Bit-Reversed Sorting

0

0

0

0

0

0

1

1

1

1

1

0

n2

m0

n1

m1

n0

m2

Normal

order

1

x[n2 n1 n0]

Bit-reversed

order

X[m2 m1 m0]

x[0 0 0]

x[0 0 1]

x[1 1 1]

X[0 0 0]

X[1 0 0]

X[1 1 1]

C6x bit operations

Previous slide

Next slide

Back to first slide

View graphic version