摘要
本文给出了生成k元M序列的一种新的算法.该算法不再采用“主圈并一个圈”的经典并圈法,而是利用了“主圈并一组共轭圈”的新的并圈方法.这样减少了选择桥状态的次数,进而加快了并圈速度.
A new algorithm for generating k-ary M sequences is given. Not the classical method that the main cycle is extended by joining to it one cycle but a new method that the main cycle is exended by joining to it a subset of cycles is used in the algorithm. The algorithm reduces the time of choosing bridging states, and accelerates the speed of joining cycles.
基金
信息安全国家重点实验室基金
合肥工大科研基金
