Title :
Generating De Bruijn sequences: an efficient implementation
Author :
Annexstein, F.S.
Author_Institution :
Dept. of Electr. & Comput. Eng., Cincinnati Univ., OH, USA
fDate :
2/1/1997 12:00:00 AM
Abstract :
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 A. Lempel (1970). We provide code for a function that for each pair of integers n⩾2 and 0⩽x<2n-2 returns a unique De Bruijn sequence of order-n. The implementation requires only O(2n) bit operations
Keywords :
binary sequences; computational complexity; multiprocessor interconnection networks; De Bruijn sequences generation; code; recursive method; Clocks; Computational complexity; Computer languages; Parallel machines; Shift registers;
Journal_Title :
Computers, IEEE Transactions on
