Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
198 IEEE TRANSACTIONS ON COMPUTERS, VOL. 46, NO. 2, FEBRUARY 1997 Generating De Bruijn Sequences
 

Summary: 198 IEEE TRANSACTIONS ON COMPUTERS, VOL. 46, NO. 2, FEBRUARY 1997
Generating De Bruijn Sequences:
An Efficient Implementation
F.S. Annexstein
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 Lempel [5]. We provide code for a
function that for each pair of integers n 2 and 0 x < 2
n-2
returns a
unique De Bruijn sequence of order-n. The implementation requires
only O(2
n
) bit operations
Index Terms--Shift register sequences, De Bruijn graphs,
computational complexity, recursive algorithms, NESL programming
language.
---------------- 3 ----------------
1 INTRODUCTION
THE use of shift registers to produce sequences of zeros and ones

  

Source: Annexstein, Fred S. - Computer Science Department, University of Cincinnati

 

Collections: Computer Technologies and Information Sciences