Abstract: The structure of de Bruijn sequences is a look-up table whose kernel is their look-up table labels.So it is very important for generating de Bruijn sequences to construct their look-up table labels.This paper presents an algorithm for constructing m+1-ary n stage look-up table labels using fixed value，i.e.setting a fixed value label for most of nodes and specifying or random choosing value label for some few nodes according to some necessary conditions of look-up table labels.The increasing speed of the amount of look-up table labels constructed by the algorithm is exponential by m，n.It seems that the algorithm is efficient，but the speed is not worth to say when comparing with the rapid increasing speed of the amount of look-up table labels themselves.Whatever the algorithm is most efficient now for lack of more efficient algorithms.