Author Login Editor-in-Chief Peer Review Editor Work Office Work

Computer Engineering ›› 2009, Vol. 35 ›› Issue (5): 59-60,8. doi: 10.3969/j.issn.1000-3428.2009.05.020

• Software Technology and Database • Previous Articles     Next Articles

Algorithm for Generating de Bruijn Sequence by Removing an Element

XIE Shen-quan   

  1. (College of Information and Engineering, Xiangtan University, Xiangtan 411105)
  • Received:1900-01-01 Revised:1900-01-01 Online:2009-03-05 Published:2009-03-05

生成de Bruijn序列的消元算法

谢深泉   

  1. (湘潭大学信息工程学院,湘潭 411105)

Abstract: Algorithm by removing an element is presented in this paper, which is to calculate m-ary de Bruijn sequences by removing element of m+1-ary de Bruijn sequence. The implementing method is by means of finding the Look-up table labels of m+1-ary n stage de Bruijn sequences from m+1-ary n stage de Bruijn sequences and finding m-ary n stage Look-up table labels by ameliorating the m+1-ary n stage Look-up table labels, then generating m-ary n stage de Bruijn sequences by using the relative Look-up table. The algorithm is effective while a de Bruijn sequence is given.

Key words: de Bruijn sequence, Look-up table, Look-up table label, removing an element, node chain

摘要: 提出一种生成de Bruijn序列的消元算法,通过一个m+1元n级de Bruijn序列找出其Look-up表和Look-up表标签,基于该Look-up表标签进行修正,找出m元n级的Look-up表和Look-up表标签,并由其产生m元n级de Bruijn序列。该算法在已知一个de Bruijn序列的情况下有效。

关键词: de Bruijn序列, Look-up表, Look-up表标签, 消元, 节点链

CLC Number: