This is the prbs Reference Manual, version 0.1.0, generated automatically by Declt version 4.0 beta 2 "William Riker" on Mon Feb 26 17:36:39 2024 GMT+0.
The main system appears first, followed by any subsystem dependency.
prbsA library of higher-order functions for generating Pseudo-Random Binary Sequences of (practically) any degree
Jason Lowdermilk <jlowdermilk@gmail.com>
MIT
0.1.0
src (module).
Modules are listed depth-first from the system components tree.
Files are sorted by type and then listed depth-first from the systems components trees.
prbs/src/taps.lispprbs/src/util.lispsrc (module).
bitbv (function).
bv->num (function).
bytes->bits (function).
num->bv (function).
prbs/src/prbs.lispsrc (module).
prbs.
bit-gen (function).
bvlist-gen (function).
byte-gen (function).
make-prbs (function).
num-gen (function).
seq-length (function).
take (function).
prbs-n (function).
prbs/src/err.lispsrc (module).
prbs-detect (function).
prbs-lock (function).
sfind (function).
sfind-all (function).
make-tracker (function).
Packages are listed by definition order.
prbsbit-gen (function).
bvlist-gen (function).
byte-gen (function).
make-prbs (function).
num-gen (function).
seq-length (function).
take (function).
prbs-n (function).
prbs.utilcommon-lisp.
bitbv (function).
bv->num (function).
bytes->bits (function).
num->bv (function).
prbs.errprbs-detect (function).
prbs-lock (function).
sfind (function).
sfind-all (function).
make-tracker (function).
Definitions are sorted by export status, category, package, and then by lexicographic order.
=> lambda (x)
Create a closure representing PRBS-‘N‘. The lambda takes a single argument which is the number of the next bits to generate from the sequence (default 1 bit). The bits will be returned as a bitvector. ‘SEED‘ can be provided as the integer value of the initial vector. If ‘START‘ is provided, the generator will be initialized to that bit offset.
Turn a 1 or 0 into a single-bit bitvector.
Convert a bitvector into an integer.
=> lambda (x)
Create a closure representing PRBS-‘N‘. The lambda takes a single argument which is the number of the next ‘N‘-bit bitvectors to generate from the sequence (default 1 value), which will be returned in a list. ‘SEED‘ can be provided as the integer value of the initial vector.
=> lambda (x)
Create a closure representing PRBS-‘N‘. The lambda takes a single argument which is the number of the next byte values to generate from the sequence (default 1 byte), which will be returned as a simple array of type (unsigned-byte 8). ‘SEED‘ can be provided as the integer value of the initial vector.
Convert a list of integer values into a single bytevector.
=> lambda ()
Create a closure representing PRBS-‘N‘. Each call to the lambda will return the next bitvector of length ‘N‘ in the prbs-‘N‘ sequence. ‘SEED‘ can be provided as the integer value of the initial vector.
Convert an integer into a bitvector. Specify ‘SIZE‘ if you want something other than 8 bits per value.
=> lambda (x)
Create a closure representing PRBS-‘N‘. The lambda takes a single argument which is the number of the next integer values to generate from the sequence (default 1 value), which will be returned in a list. ‘SEED‘ can be provided as the integer value of the initial vector.
Attempt to identify which PRBS sequences the bitvector ‘P‘ belongs to. Return a list of all candidate polynomial degrees (up to ‘MAX‘) that can generate ‘P‘.
=> lambda (x)
Attempt to lock on a PRBS-‘N‘ sequence using the bitvector ‘P‘. If successful, return a lambda that tracks bit errors for subsequent data in the sequence, or nil if unable to lock. The lambda can be repeatedly called with a bitvector containing subsequent data, and it will return the total number of bit errors detected and the total number of bits it has seen.
=> bit offset where ‘P‘ occurs in PRBS-‘N‘, or nil if not found
Brute-force search a PRBS-‘N‘ sequence for an arbitrary bit pattern.
=> list of all bit offsets where ‘P‘ occurs in PRBS-‘N‘
Brute-force search a PRBS-‘N‘ sequence for all matches of an arbitrary bit pattern.
=> ‘N‘ values from ‘GEN‘
‘GEN‘ can be a lambda returned from any of the *-gen functions.
return a list of register taps (counting from the left) for a polynomial of order n, favoring LFSR-4 taps over LFSR-2.
| Jump to: | B F M N P S T |
|---|
| Jump to: | B F M N P S T |
|---|
| Jump to: | *
S |
|---|
| Index Entry | Section | ||
|---|---|---|---|
| | |||
| * | |||
*lfsr2*: | Private special variables | ||
*lfsr4*: | Private special variables | ||
| | |||
| S | |||
Special Variable, *lfsr2*: | Private special variables | ||
Special Variable, *lfsr4*: | Private special variables | ||
| | |||
| Jump to: | *
S |
|---|
| Jump to: | E F M P S T U |
|---|
| Jump to: | E F M P S T U |
|---|