Content deleted Content added
Citation bot (talk | contribs) Added bibcode. | Use this bot. Report bugs. | Suggested by Dominic3203 | Category:Combinatorial algorithms | #UCB_Category 12/24 |
|||
| (3 intermediate revisions by 3 users not shown) | |||
Line 30:
==Generalizations==
The generalization to [[radix]] <math>b</math> representations, for <math>b > 2</math>, and to <math>n=b^k</math>, is a '''digit-reversal permutation''', in which the base-<math>b</math> digits of the index of each element are reversed to obtain the permuted index. The same idea can also been generalized to [[mixed radix]] number systems. In such cases, the digit-reversal permutation should simultaneously
| last = Elster | first = Anne C.
| contribution = Fast bit-reversal algorithms
Line 125:
}}.</ref>
| last1 = Zhang | first1 = Zhao
| last2 = Zhang | first2 = Xiaodong
| |||