Abstract
De Bruijn sequences are highly important nonlinear shift register sequences. This paper presents a new algorithm for the generation ofk-ary de Bruijn sequences by juxtaposing the periodic reductions of the cycles. Its each step produces a string of elements instead of one element. Hence the algorithm reduces the time of operation, and accelerates the speed of generation.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
T. J. Etzion,Algorithms,7(1986)2, 331–340.
Yan Junhui,Systems Science and Mathematical Science,4(1991)1, 32–40.
H. Fredricksen,SIAM Review,24(1982)2, 195–221.
Gao Hongxun,ACTA Mathematicae Applicatae Sinica,2(1979)4, 316–324, (in Chinese)
Zhang Zhaozhi, Luo Qiaolin,Systems Science and Mathematical Science, (1987)7, 355–343, (in Chinese)
Xiong Ronghua,Scientia Sinica, Ser. A, (1988)8, 877–886, (in Chinese)
Zhu Shixin,Journal of Electronics,15(1993)5, 523–526, (in Chinese)
Zhu Shixin,Applied Mathematics-A, J. Chinese Universities,8(1993)3, 308–313, (in Chinese)
Author information
Authors and Affiliations
About this article
Cite this article
Shixin, Z. A fast algorithm for the generation ofk-ary De Bruijn sequences. J. of Electron.(China) 13, 153–157 (1996). https://doi.org/10.1007/BF02684757
Issue Date:
DOI: https://doi.org/10.1007/BF02684757