The Community for Technology Leaders
Green Image
Issue No. 02 - February (1997 vol. 46)
ISSN: 0018-9340
pp: 198-200
ABSTRACT
<p><b>Abstract</b>—This paper presents a concise and efficient implementation of a method of producing De Bruijn sequences. The implementation is based on a recursive method due to Lempel [<ref rid="bibt01985" type="bib">5</ref>]. We provide code for a function that for each pair of integers <it>n</it>≥ 2 and 0 ≤<it>x</it> < 2<super><it>n</it>−2</super> returns a unique De Bruijn sequence of order-<it>n</it>. The implementation requires only <it>O</it>(2<super><it>n</it></super>) bit operations</p>
INDEX TERMS
Shift register sequences, De Bruijn graphs, computational complexity, recursive algorithms, NESL programming language.
CITATION
F.s. Annexstein, "Generating De Bruijn Sequences: An Efficient Implementation", IEEE Transactions on Computers, vol. 46, no. , pp. 198-200, February 1997, doi:10.1109/12.565596
93 ms
(Ver )