Object/Trait

chisel3.util.random

LFSR

Related Docs: trait LFSR | package random

Permalink

object LFSR

Utilities related to psuedorandom number generation using Linear Feedback Shift Registers (LFSRs).

For example, to generate a pseudorandom 16-bit UInt that changes every cycle, you can use:

val pseudoRandomNumber = LFSR(16)
Source
LFSR.scala
Linear Supertypes
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. LFSR
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  4. def apply(width: Int, increment: Bool = true.B, seed: Option[BigInt] = Some(1)): UInt

    Permalink

    Return a pseudorandom UInt generated using a FibonacciLFSR.

    Return a pseudorandom UInt generated using a FibonacciLFSR. If you require a Galois LFSR, use GaloisLFSR.maxPeriod.

    width

    the width of the LFSR

    increment

    when asserted, the LFSR will increment

    seed

    an initial seed (this cannot be zero)

    returns

    a UInt that is the output of a maximal period LFSR of the requested width

  5. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  6. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  7. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  8. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  9. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  10. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  11. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  12. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  13. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  14. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  15. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  16. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  17. lazy val tapsMaxPeriod: Map[Int, Seq[Set[Int]]]

    Permalink

    A mapping of widths to a sequence of known LFSR taps that produce a maximal period LFSR.

    A mapping of widths to a sequence of known LFSR taps that produce a maximal period LFSR. These work for either a Fibonacci LFSR or a Galois LFSR. Taps are available for bit widths of 2--786, 1024, 2048, and 4096.

    Users can automatically generate LFSRs using these taps with LFSR.apply for a maximum period Fibonacci XOR LFSR or with MaxPeriodGaloisLFSR/GaloisLFSR.maxPeriod or MaxPeriodFibonacciLFSR/FibonacciLFSR.maxPeriod for more configuration options.

    See also

    https://www.xilinx.com/support/documentation/application_notes/xapp052.pdf

    http://courses.cse.tamu.edu/walker/csce680/lfsr_table.pdf

  18. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  19. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  20. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  21. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped