产生<em>k</em>元M序列的一种新算法

Abstract
Figure/Table
References
Related Citation (3)

Download: PDF (647 KB)
Export: BibTeX | EndNote (RIS)

Abstract 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.

Key words： M sequences State graph Bridging state

Received: 29 May 1992

	Service

	E-mail this article
	Add to my bookshelf
	Add to citation manager
	E-mail Alert
	RSS
	Articles by authors

	Zhu Shixin

Cite this article:

Zhu Shixin. A NEW ALGORITHM FOR GENERATING k-ARY M SEQUENCES[J]. , 1993, 15(5): 523-526 .

URL:

http://jeit.ie.ac.cn/EN/ OR http://jeit.ie.ac.cn/EN/Y1993/V15/I5/523