Operand access in regular topology discrete trigonometric transforms

In this paper, we consider operand access in fast algorithms for discrete trigonometric transforms having topology based on stride permutations.We show how the operand access in such algorithms can be performed with simple bit manipulations, which provides savings in application-specific implementations. In addition, 2-dimensional transforms are considered and we show that the same simple operand access methods are applicable.