摘要
本文给出了两种基于背包函数控制的钟控序列的实现方法,并证明了在一般条件下,它们的极小多项式均为h(x^q),复杂度为qn,周期为q(2~n-1),其中h(x)为GF(2)上某—n级本原不可约多项式,q为某一二元序列的周期。
Two methods are given in order to generate a class of sequences controlled by a clock and a knapsack function. It is shown that, under some simple assumptions, this class of sequences has minimum polynomial h(xq), complexity nq and period (2n-1)q, where h(x) is a primitive polynomial of order n over GF(2) and q is the period of a binary sequence.
关键词
背包函数
钟控序列
通信
电信数字
LSR sequence
Knapsack function
Sequence controlled by a clock and a knapsack function
