Generating De Bruijn Sequences: An Efficient Implementation
نویسنده
چکیده
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 returns a unique De Bruijn sequence of order-n. The implementation requires only O(2 n ) bit operations
منابع مشابه
An Efficient Implementation of the D-Homomorphism for Generation of de Bruijn Sequences
In this correspondence, an efficient implementation of the D-homomorphism for generating de Bruijn sequences is presented. The number of exclusive–or operations required to generate the next bit for de Bruijn sequences of order n from a de Bruijn function of order k is shown to be approximately k(2 (n k) 1), where W (r) is the number of one’s in the binary representation of r: therefore, the nu...
متن کاملGenerating (n, 2) De Bruijn Sequences with Some Balance and Uniformity Properties
This paper presents two new algorithms for generating (n,2) de Bruijn sequences which possess certain properties. The sequences generated by the proposed algorithms may be useful for experimenters to systematically investigate intertrial repetition effects. Characteristics are compared with those of randomly sampled (n,2) de Bruijn sequences.
متن کاملOn cross joining de Bruijn sequences
We explain the origins of Boolean feedback functions of nonlinear feedback shift registers (NLFSRs) of fixed order n generating de Bruijn binary sequences. They all come into existence by cross joining operations starting from one maximum period feedback shift register, e.g., a linear one which always exists for any order n. The result obtained yields some constructions of NLFSRs generating max...
متن کاملOn Binary de Bruijn Sequences from LFSRs with Arbitrary Characteristic Polynomials
We propose a construction of de Bruijn sequences by the cycle joining method from linear feedback shift registers (LFSRs) with arbitrary characteristic polynomial f(x). We study in detail the cycle structure of the set Ω(f(x)) that contains all sequences produced by a specific LFSR on distinct inputs and provide an efficient way to find a state of each cycle. Our structural results lead to an e...
متن کاملConstruction for de Bruijn Sequences with Large Orders
Sequences generated by maximum-period nonlinear feedback shift registers are known as de Bruijn sequences. The problem of designing de Bruijn sequences has received considerable attention. There is only one full cycle in the state graph of de Bruijn sequences. Most popular algorithms for generating de Bruijn sequences start from a nonsingular linear feedback shift register producing several sho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Computers
دوره 46 شماره
صفحات -
تاریخ انتشار 1997