An address generator of an N-dimensional Hilbert scan

There are several algorithms for N-dimensional Hilbert (1891) scanning, such as the Butz algorithm and the Quinqueton algorithm. The Butz (1969) algorithm is a mapping function using several bit operations such as shifting, exclusive OR, etc. On the other hand, the Quinqueton (1981) algorithm computes all addresses of this curve using recursive functions, but takes time to compute a one-to-one mapping correspondence. Both algorithms are complex to compute and both are difficult to implement in hardware. We propose a new, simple, non-recursive algorithm for N-dimensional Hilbert scanning using lookup tables. The merit, of our algorithm is that the computation is fast and the hardware implementation is much easier than previous ones