F[x]-lattice basis reduction algorithm and multisequence synthesis

被引：2
|
作者：
王丽萍
祝跃飞
机构：
来源：
Science in China(Series F:Information Sciences) | 2001年 / 05期
基金：
中国国家自然科学基金;
关键词：
multisequence shift-register synthesis; F[x]-lattice basis reduction algorithm; reduced basis; normal reduced basis;
D O I：
暂无
中图分类号：
O241 [数值分析];
学科分类号：
摘要：
By means of F[x]-lattice basis reduction algorithm, a new algorithm is presented for synthesizing minimum length linear feedback shift registers (or minimal polynomials) for the given mul-tiple sequences over a field F. Its computational complexity is O(N2) operations in F where N is the length of each sequence. A necessary and sufficient condition for the uniqueness of minimal polynomi-als is given. The set and exact number of all minimal polynomials are also described when F is a finite field.
引用
收藏
页码：321 / 328
页数：8
相关论文
共 50 条
12345