Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2001, Vol. 24 ›› Issue (4): 11-15.

Previous Articles     Next Articles

Minimum Polynomial of Multiple Sampling Sequence

ZHANG Chun-qi1, YANG Yi-xian1, YOU Lin2   

  1. 1.Information Engineering School, Beijing University of Posts and Telecommunications, Beijing 100876, China;
    2.Department of Applied Mathematics, Dalian University of Science and Technology, Dalian 116023, China
  • Received:2001-02-19 Online:2001-12-10
  • Supported by:
     

Abstract: We present mosaic theorem for binary sequence and multiple sampling sequence. Main conclusion includes: multiple sampling sequence has nothing to do with its original state, and g(x<sup>N1) is one of itsgenerator polynomial, and there is a SSCO that its minimum polynomial mc(x)=g(x<sup>N1); When the number of “1” is power of 2 in the controlled sequence, the minimum polynomial of multiple sampling sequence is gt(x), its period is 2r(2n-1); Specially, When the controlled sequence is m-Sequence and (m,n)=1,m≤n/2, the minimum polynomial of multiple sampling sequence is mc(x)=gt(x), its period is 2m-1(2n-1),2m-2<t≤2m-1.

Key words: mosaic theorem, period, minimum polynomial, trace