The Hilbert curve is a way of mapping the multidimensional space into the one-dimensional space. Such mappings are of interest in a number of application domains including image processing and the indexing of multidimensional data. However

little has been discussed on its high dimensional algorithms due to the complexity. In this paper

a novel algorithm is presented for generating an N-dimensional Hilbert curve

which analyzes a Hilbert curve from bottom to top

based on a static evolvement rule table. The experimental results show that our method is easier to implement and faster in computation than other methods.