| 摘要: |
| 基于de Bruijn序列反馈函数真值表的特性和反演公式的原理,提出了一种用于计算M序列可解长度的算法,通过该算法能确定生成M序列的最短非线性移位寄存器,有效地解决了非线性序列的综合问题。 |
| 关键词: 数字通信系统,de Bruijn序列,伪随机序列,移位寄存器,线性复杂度 |
| DOI： |
|
| 基金项目: |
|
| A Method for Computing Decodable Length of de Bruijn Sequences |
|
| () |
| Abstract: |
| Based on the characteristics of the feedback functions' truth table of de Bruijn sequences and the principle of inversion formula,an algorithm is proposed to calculate the decodable length of M sequences.The shortest non-linear feedback registers of M sequence can be achieved through this algorithm.The algorithm solves the synchronization problem of nonlinear sequence effectively. |
| Key words: digital communication system,de Bruijn sequences,pseudo random sequence,shift register,linear complexity |
