Table Of Contents

MT Generate Bits (poly) (MT Generate Bits (Galois, PN Order)) (G Dataflow)

Version:
    Last Modified: February 7, 2018

    Generates Galois pseudonoise (PN) bit sequences. The node repeats the selected pattern until it generates the number of total bits that you specify. Use this node to specify a PN sequence order based on which the node selects a primitive polynomial that returns an m-sequence.

    connector_pane_image
    datatype_icon

    total bits

    Total number of pseudorandom bits to be generated.

    Default: 128

    datatype_icon

    PN sequence order

    Order of the PN bit sequence to be generated. Valid values are 5 to 31, inclusive.

    Default: 9

    datatype_icon

    seed in

    Initial state of the PN generator shift register.

    Default: -692093454

    datatype_icon

    error in

    Error conditions that occur before this node runs.

    The node responds to this input according to standard error behavior.

    Standard Error Behavior

    Many nodes provide an error in input and an error out output so that the node can respond to and communicate errors that occur while code is running. The value of error in specifies whether an error occurred before the node runs. Most nodes respond to values of error in in a standard, predictable way.

    error in does not contain an error error in contains an error
    If no error occurred before the node runs, the node begins execution normally.

    If no error occurs while the node runs, it returns no error. If an error does occur while the node runs, it returns that error information as error out.

    If an error occurred before the node runs, the node does not execute. Instead, it returns the error in value as error out.

    Default: No error

    datatype_icon

    reset?

    A Boolean that determines whether to continue generating bits using the previous iteration states.

    TRUE The PN generator has been initiated with a new PN seed.
    FALSE The PN sequence generator has resumed from where it had stopped during the previous iteration.

    Default: TRUE

    datatype_icon

    output bit stream

    The generated pseudorandom data bits.

    If the PN sequence order is N, the output data is periodic with period T = 2 N -1. For example, if N = 7, the output sequence repeats after every T = 127 bits.

    datatype_icon

    seed out

    A seed for use in the seed in parameter during the next call to this node when reset? is set to FALSE.

    datatype_icon

    error out

    Error information.

    The node produces this output according to standard error behavior.

    Standard Error Behavior

    Many nodes provide an error in input and an error out output so that the node can respond to and communicate errors that occur while code is running. The value of error in specifies whether an error occurred before the node runs. Most nodes respond to values of error in in a standard, predictable way.

    error in does not contain an error error in contains an error
    If no error occurred before the node runs, the node begins execution normally.

    If no error occurs while the node runs, it returns no error. If an error does occur while the node runs, it returns that error information as error out.

    If an error occurred before the node runs, the node does not execute. Instead, it returns the error in value as error out.

    Definition of Pseudorandom Sequences

    Though deterministic in nature, seudorandom or pseudonoise (PN) sequences satisfy many properties of random numbers, such as autocorrelation, crosscorrelation, and so on. PN sequences are used in many applications and standards such as 802.11a and DVB. Some examples of PN sequences are maximal length shift register sequences, or m-sequences, Gold sequences, and Kasami sequences. An m-sequence generates a periodic sequence of length L = 2 m 1 bits and is generated by linear feedback shift registers (LFSRs). Two well known implementations of m-sequences are the Fibonacci implementation and the Galois implementation.

    The preceding figure shows the Fibonacci and Galois implementations of m-sequences. As can be seen in these figures, m-sequences contain m shift registers. The shift register set is filled with an m-bit initial seed that can be any value except 0. If the m bits in the m shift registers are all zero, then it is a degenerate case and the output of the generator is 0.

    Examples of Fibonacci and Galois Implementation of Pseudorandom Sequences

    The following examples demonstrate bit generation:

    1. The first example depicts the Fibonacci implementation. This structure is used in different standards, including DVB. Inputs are specified as follows:

      Primitive polynomial: 1 + X 14 + X 15

      Initial seed: 000000010101001

      The following figure shows the circuitry:

      Seed Output
      000000010101001 0+0=0
      000000101010010 0+0=0
      000001010100100 0+0=0
      000010101001000 0+0=0
      000101010010000 0+0=0
      001010100100000 0+0=0
      010101001000000 0+1=1
      101010010000001 1+0=1
    2. The second example depicts the Galois implementation. Inputs are specified as follows:

      Primitive polynomial: 1 + X 14 + X 15

      Initial seed: 000000010101001

      The circuitry is shown in the following figure:

      Seed Output
      000000010101001 0
      000000101010010 0
      000001010100100 0
      000010101001000 0
      000101010010000 0
      001010100100000 0
      010101001000000 0
      101010010000000 1
      110100100000001 1
      001001000000011 0
      010010000000110 0
      100100000001100 1
      101000000011001 1
      110000000110011 1
      000000001100111 0
      000000011001110 0

    Where This Node Can Run:

    Desktop OS: Windows

    FPGA: Not supported

    Web Server: Not supported in VIs that run in a web application


    Recently Viewed Topics