Jump to content

Kasami code

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Budisin srdjan (talk | contribs) at 00:55, 24 February 2007 (Created page with 'Kasami sequences are binary sequences of length 2<small>N</small> where N is an even integer. Kasami sequences have good cross-correlation values approaching th...'). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Kasami sequences are binary sequences of length 2N where N is an even integer. Kasami sequences have good cross-correlation values approaching the Welch lower bound. There are two classes of Kasami sequences - the small set and the large set.

The small set

The process of generating a Kasami sequence starts by generating a PN sequence s(n), n=1..2N-1;

References

  • T. Kasami, \Weight Distribution Formula for Some Class of Cyclic Codes," Tech. Report No. R-285, Univ. of Illinois, 1966.
  • L. Welch, “Lower Bounds on the Maximum Cross Correlation of Signals,” IEEE Trans. on Info. Theory, vol. 20, no. 3, pp. 397–399, May 1974.