Recently applications of Hilbert curves are studied in the area of ima
ge processing, image compression, computer hologram, etc. We have prop
osed a fast Hilbert scanning algorithm using lookup tables in N dimens
ional space. However, this scan is different from the one of previousl
y proposed scanning algorithms. Making the lookup tables is a problem
for the generation of several Hilbert scans. In this note, we describe
a method of making lookup tables from a given Hilbert scan which is o
btained by other scanning methods.