Bit Reversed Sorting on the C6x

• In-place computations using discrete transforms

  • Input or output value at index 10102 at index 01012
  • Emulate bit-reversed addressing on C6x: in transform-domain filtering, avoid by permuting filter coefficients

• Linear-time constant-space algorithm

  • Chad Courtney, “Bit-Reverse and Digit-Reverse: Linear-Time Small Lookup Table Implementation for the TMS320C6000,” TI Application Note SPRA440, 5/98
  • Higher radix transforms use digit-reversed addressing
  • Divide-and-conquer approach augmented by lookup tables for short bit lengths
  • Avoid swapping values twice

Previous slide

Next slide

Back to first slide

View graphic version