Advertisement

The m-Sequence

  • R. K. Rao Yarlagadda
  • John E. Hershey
Chapter
  • 216 Downloads
Part of the The Springer International Series in Engineering and Computer Science book series (SECS, volume 383)

Abstract

A recursion that has been of exceptional value to the electrical engineering discipline as a whole and to the specific arts of communications, radar and signal processing in specific, is
$$x(m) = x(m - {{\delta }_{1}}) \cdot x(m - {{\delta }_{2}}) \cdots x(m - {{\delta }_{r}}) \cdot x(m - n) $$
(217)
where the {x(i)} ∈ {±1} and the {δ i } are integers with 0 < {δ i } < n. It is clear that the sequence produced. {x(m)} , m = 0,1,2,... is periodic and can be extended forwards and backwards as far as desired. Under certain conditions, the sequence period will be 2 n — 1.

Keywords

Characteristic Sequence Sequence Period Circulant Matrix Primitive Polynomial Maximal Length Sequence 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 1997

Authors and Affiliations

  • R. K. Rao Yarlagadda
    • 1
  • John E. Hershey
    • 2
  1. 1.Oklahoma State UniversityUSA
  2. 2.General Electric Corporate Research & Development CenterUSA

Personalised recommendations