A New Algorithm of Multiplex Problem for Delayed m-Sequence
DOI:
CSTR:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    The algebra algorithm solving the linear combination characteristic of delayed m-sequence is discussed. Based on analysis of linear relationship between status of the central m-sequence and the delayed sequence, a new algorithm, which solves the multiplex problem of delayed m-sequence is given by taking advantage of linear equations over binary finite field. Application of this algorithm in the design of the mask of the N-CDMA mobile communication system is discussed. This algorithm provides a convenient way in solving the multiplex problem of long m-sequence in engineering calculation.

    Reference
    Related
    Cited by
Get Citation

Chen Dehong, Liu Mei. A New Algorithm of Multiplex Problem for Delayed m-Sequence[J].,2014,29(3):439-444.

Copy
Related Videos

Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:
  • Revised:
  • Adopted:
  • Online: June 25,2014
  • Published:
Article QR Code