/usr/share/octave/packages/communications-1.2.1/prbs_generator.m is in octave-communications-common 1.2.1-2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 | ## Copyright (C) 2006 Muthiah Annamalai <muthiah.annamalai@uta.edu>
##
## This program is free software; you can redistribute it and/or modify it under
## the terms of the GNU General Public License as published by the Free Software
## Foundation; either version 3 of the License, or (at your option) any later
## version.
##
## This program is distributed in the hope that it will be useful, but WITHOUT
## ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
## FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more
## details.
##
## You should have received a copy of the GNU General Public License along with
## this program; if not, see <http://www.gnu.org/licenses/>.
## -*- texinfo -*-
## @deftypefn {Function File} {@var{prbs} =} prbs_generator (@var{polynomial}, @var{connections}, @var{initstate})
## Implement book keeping for a Pseudo-Random Binary Sequence ( PRBS )
## also called as a Linear Feedback Shift Register.
##
## Given a polynomial create a PRBS structure for that polynomial.
## Now all we need is to just create this polynomial and make it work.
## polynomial must be a vector containing the powers of x and an optional
## value 1. eg: x^3 + x^2 + x + 1 must be written as [3 2 1 0]
## all the coefficients are either 1 or 0. It generates only a Binary \
## sequence, and the generator polynomial need to be only a binary
## polynomial in GF(2).
##
## connections, contains a struct of vectors where each vector is the
## connection list mapping its vec(2:end) elements to the vec(1) output.
##
## Example: If you had a PRBS shift register like the diagram
## below with 4 registers we use representation by polynomial
## of [ 1 2 3 4], and feedback connections between [ 1 3 4 ].
## The output PRBS sequence is taken from the position 4.
##
## @example
## @group
## +---+ +----+ +---+ +---+
## | D |----| D |---| D |---| D |
## +---+ +----+ +---+ +---+
## | | |
## \ / /
## [+]---------------+------+
## 1 + 0.D + 1.D^2 + 1.D^3
## @end group
## @end example
##
## The code to implement this PRBS with a start state of [1 0 1 1]
## will be:
##
## @example
## @group
## prbs = prbs_generator ([1 3 4], @{[1 3 4]@}, [1 0 1 1]);
## x = prbs_sequence (prbs)
## @result{} x = 15
## prbs_iterator (prbs, 15)
## @result{} [1 1 0 1 0 1 1 1 1 0 0 0 1 0 0]
## @end group
## @end example
## @seealso{prbs_iterator, prbs_sequence}
## @end deftypefn
function prbs = prbs_generator (polynomial, connections, initstate)
prbs.reglen = max (polynomial);
prbs.polynomial = polynomial;
prbs.sregs = initstate;
prbs.connections = connections;
prbs.conlen = length (connections);
endfunction
|