/usr/share/octave/packages/communications-1.2.0/comms.m is in octave-communications-common 1.2.0-1build1.
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 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 | ## Copyright (C) 2003 David Bateman
##
## 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} {} comms ("help")
## @deftypefnx {Function File} {} comms ("info")
## @deftypefnx {Function File} {} comms ("info", @var{mod})
## @deftypefnx {Function File} {} comms ("test")
## @deftypefnx {Function File} {} comms ("test", @var{mod})
##
## Manual and test code for the Octave Communications toolbox. There are
## 5 possible ways to call this function.
##
## @table @code
## @item comms ("help")
## Display this help message. Called with no arguments, this function also
## displays this help message
## @item comms ("info")
## Open the Communications toolbox manual
## @item comms ("info", @var{mod})
## Open the Communications toolbox manual at the section specified by
## @var{mod}
## @item comms ("test")
## Run all of the test code for the Communications toolbox.
## @item comms ("test", @var{mod})
## Run only the test code for the Communications toolbox in the module
## @var{mod}.
## @end table
##
## Valid values for the variable @var{mod} are
##
## @table @asis
## @item "all"
## All of the toolbox
## @item "random"
## The random signal generation and analysis package
## @item "source"
## The source coding functions of the package
## @item "block"
## The block coding functions
## @item "convol"
## The convolution coding package
## @item "modulation"
## The modulation package
## @item "special"
## The special filter functions
## @item "galois"
## The Galois fields package
## @end table
##
## Please note that this function file should be used as an example of the
## use of this toolbox.
## @end deftypefn
function retval = comms (typ, tests)
if (nargin < 1)
help ("comms");
elseif (nargin < 2)
tests = "all";
endif
if (strcmp (tests, "all"))
nodename = "Top";
elseif (strcmp (tests, "random"))
nodename = "Random Signals";
elseif (strcmp (tests, "source"))
nodename = "Source Coding";
elseif (strcmp (tests, "block"))
nodename = "Block Coding";
elseif (strcmp (tests, "convol"))
nodename = "Convolutional Coding";
elseif (strcmp (tests, "modulation"))
nodename = "Modulations";
elseif (strcmp (tests, "special"))
nodename = "Special Fields";
elseif (strcmp (tests, "galois"))
nodename = "Galois Fields";
else
error ("comms: unrecognized package");
endif
if (strcmp (typ, "help"))
help ("comms");
elseif (strcmp (typ, "info"))
infopaths = ["."];
if (!isempty (char (strsplit (path, ":"))))
infopaths = [infopaths; char(strsplit (path, ":"))];
endif
if (!isempty (char (strsplit (DEFAULT_LOADPATH, ":"))))
infopaths = [infopaths; char(strsplit (DEFAULT_LOADPATH, ":"))];
endif
for i = 1:size (infopaths, 1)
infopath = deblank (infopaths(i,:));
len = length (infopath);
if (len)
if (len > 1 && strcmp (infopath([len-1, len]), "//"))
[status, showfile] = system (["find '", infopath(1:len-1), ...
"' -name ", infofile]);
else
[status, showfile] = system (["find '", infopath, "' -name ", ...
infofile, " -maxdepth 1"]);
endif
if (length (showfile))
break;
endif
endif
endfor
if (!exist ("showfile") || !length (showfile))
error ("comms: info file not found");
endif
if (showfile(length (showfile)) == "\n")
showfile = showfile(1:length (showfile)-1);
endif
if (exist ("INFO_PROGAM"))
[testret, testout] = system (["'", INFO_PROGRAM, "' --version"]);
if (testret)
error ("comms: info command not found");
else
system (["'", INFO_PROGRAM, "' --file '", showfile, "' --node '", ...
nodename, "'"]);
endif
else
[testret, testout] = system ("info --version");
if (testret)
error ("comms: info command not found");
else
system (["info --file '", showfile, "' --node '", nodename, "'"]);
endif
endif
elseif (strcmp (typ, "test"))
pso = page_screen_output ();
unwind_protect
page_screen_output (0);
if (strcmp (tests, "random") || strcmp (tests, "all"))
fprintf ("\n<< Random Signals Package >>\n");
fprintf (" Signal Creation: ");
n = 10;
m = 32;
x = randint (n, n, m);
if (any (size (x) != [10, 10]) || (max (x(:)) >= m) || (min (x(:) < 0)))
error ("FAILED");
endif
x = randsrc (n, n, [1, 1i, -1, -1i,]);
if (any (size (x) != [10, 10]) || ...
!all (all ((x == 1) | (x == 1i) | (x == -1) | (x == -1i))))
error ("FAILED");
endif
x = randerr (n, n);
if (any (size (x) != [10, 10]) || any (sum (x') != ones (1, n)))
error ("FAILED");
endif
nse_30dBm_1Ohm = wgn (10000, 1, 30, 1, "dBm");
nse_0dBW_1Ohm = wgn (10000, 1, 0, 1, "dBW");
nse_1W_1Ohm = wgn (10000, 1, 1, 1, "linear");
## Standard deviations should be about 1... If it is greater than
## some value flag an error
dev = [std(nse_30dBm_1Ohm), std(nse_0dBW_1Ohm), std(nse_1W_1Ohm)];
if (any (dev > 1.5))
error ("FAILED");
endif
x = [0:0.1:2*pi];
y = sin (x);
noisy = awgn (y, 10, "dB", "measured");
if (any (size (y) != size (noisy)))
error ("FAILED");
endif
## This is a pretty arbitrary test, but should pick up gross errors
if (any (abs (y - noisy) > 1))
error ("FAILED");
endif
fprintf ("PASSED\n");
fprintf (" Signal Analysis: ");
## Protect!! Since bitxor might not be installed
try
n = 10;
m = 8;
msg = randint (n, n, 2^m);
noisy = bitxor (msg, diag (3*ones (1, n)));
[berr, brate] = biterr (msg, noisy, m);
if ((berr != 2*n) || (brate != 2/(n*m)))
error ("FAILED");
endif
[serr, srate] = symerr (msg, noisy);
if ((serr != n) || (srate != 1/n))
error ("FAILED");
endif
catch
end_try_catch
## Can not easily test eyediagram, scatterplot!!
fprintf ("PASSED\n");
endif
if (strcmp (tests, "source") || strcmp (tests, "all"))
fprintf ("\n<< Source Coding Package >>\n");
fprintf (" PCM Functions: ");
fprintf ("Not tested\n");
fprintf (" Quantization Functions: ");
x = [0:0.1:2*pi];
y = sin (x);
[tab, cod] = lloyds (y, 16);
[i, q, d] = quantiz (y, tab, cod);
if (abs (d) > 0.1)
error ("FAILED");
endif
mu = 0.1;
V = 1;
x = sin ([0:0.1:2*pi]);
y = compand (x, mu, V, "mu/compressor");
z = compand (x, mu, V, "mu/expander");
## Again this is a pretty arbitrary test
if (max (abs (x-z)) > 0.1)
error ("FAILED");
endif
fprintf ("PASSED\n");
endif
if (strcmp (tests, "block") || strcmp (tests, "all"))
fprintf ("\n<< Block Coding Package >>\n");
fprintf (" Cyclic Coding: ");
nsym = 100;
m = 4;
n = 2^m-1; # [15,11] Hamming code
k = n - m;
p = cyclpoly (n, k);
if (bi2de (p) != primpoly (m, "nodisplay"))
error ("FAILED");
endif
[par, gen] = cyclgen (n, p);
if (any (any (gen2par (par) != gen)))
error ("FAILED");
endif
if (gfweight (gen) != 3)
error ("FAILED");
endif
msg = randint (nsym, k);
code = encode (msg, n, k, "cyclic");
noisy = mod (code + randerr (nsym, n), 2);
dec = decode (noisy, n, k, "cyclic");
if (any (any (dec != msg)))
error ("FAILED");
endif
try # Protect! If bitshift isn't install!!
msg = randint (nsym, 1, n);
code = encode (msg, n, k, "cyclic/decimal");
noisy = mod (code + bitshift (1, randint (nsym, 1, n)), n+1);
dec = decode (noisy, n, k, "cyclic/decimal");
if (any (dec != msg))
error ("FAILED");
endif
catch
end_try_catch
fprintf ("PASSED\n");
fprintf (" Hamming Coding: ");
nsym = 100;
m = 4;
[par, gen, n, k] = hammgen (m);
if (any (any (gen2par (par) != gen)))
error ("FAILED");
endif
if (gfweight (gen) != 3)
error ("FAILED");
endif
msg = randint (nsym, k);
code = encode (msg, n, k, "hamming");
noisy = mod (code + randerr (nsym, n), 2);
dec = decode (noisy, n, k, "hamming");
if (any (any (dec != msg)))
error ("FAILED");
endif
try # Protect! If bitshift isn't install!!
msg = randint (nsym, 1, n);
code = encode (msg, n, k, "hamming/decimal");
noisy = mod (code + bitshift (1, randint (nsym, 1, n)), n+1);
dec = decode (noisy, n, k, "hamming/decimal");
if (any (dec != msg))
error ("FAILED");
endif
catch
end_try_catch
fprintf ("PASSED\n");
fprintf (" BCH Coding: ");
## Setup
m = 5;
nsym = 100;
p = bchpoly (2^m - 1);
## Pick a BCH code from the list at random
l = ceil (size (p, 1) * rand (1, 1));
n = p(l,1);
k = p(l,2);
t = p(l,3);
## Symbols represented by rows of binary matrix
msg = randint (nsym, k);
code = encode (msg, n, k, "bch");
noisy = mod (code + randerr (nsym, n), 2);
dec = decode (noisy, n, k, "bch");
if (any (any (dec != msg)))
error ("FAILED");
endif
try # Protect! If bitshift isn't install!!
msg = randint (nsym, 1, n);
code = encode (msg, n, k, "bch/decimal");
noisy = mod (code + bitshift (1, randint (nsym, 1, n)), n+1);
dec = decode (noisy, n, k, "bch/decimal");
if (any (dec != msg))
error ("FAILED");
endif
catch
end_try_catch
fprintf ("PASSED\n");
fprintf (" Reed-Solomon Coding: ");
## Test for a CCSDS like coder, but without dual-basis translation
mrs = 8;
nrs = 2^mrs -1;
krs = nrs - 32;
prs = 391;
fcr = 112;
step = 11;
## CCSDS generator polynomial
ggrs = rsgenpoly (nrs, krs, prs, fcr, step);
## Code two blocks
msg = gf (floor (2^mrs*rand (2, krs)), mrs, prs);
cde = rsenc (msg, nrs, krs, ggrs);
## Introduce errors
noisy = cde + [255, 0, 255, 0, 255, zeros(1, 250); ...
0, 255, 0, 255, zeros(1, 251)];
## Decode (better to pass fcr and step rather than gg for speed)
dec = rsdec (noisy, nrs, krs, fcr, step);
if (any (dec != msg))
error ("FAILED");
endif
fprintf ("PASSED\n");
endif
if (strcmp (tests, "convol") || strcmp (tests, "all"))
fprintf ("\n<< Convolutional Coding Package >>\n");
fprintf (" Utility functions: ");
## create a trellis, use poly2trellis and test with istrellis
fprintf ("Not tested\n");
fprintf (" Coding: ");
## use convenc, puncturing??
fprintf ("Not tested\n");
fprintf (" Viterbi: ");
## use vitdec
fprintf ("Not tested\n");
endif
if (strcmp (tests, "modulation") || strcmp (tests, "all"))
fprintf ("\n<< Modulation Package >>\n");
fprintf (" Analog Modulation: ");
Fs = 100;
t = [0:1/Fs:2];
x = sin (2*pi*t);
xq = x + 1i * cos (2*pi*t);
## Can not test FM as it doesn't work !!!
if ((max (abs (x - ademodce (amodce (x, Fs, "pm"), Fs, "pm"))) > 0.001) || ...
(max (abs (x - ademodce (amodce (x, Fs, "am"), Fs, "am"))) > 0.001) || ...
(max (abs (xq - ademodce (amodce (xq, Fs, "qam"), Fs, "qam/cmplx"))) > 0.001))
error ("FAILED");
endif
fprintf ("PASSED\n");
fprintf (" Digital Mapping: ");
m = 32;
n = 100;
x = randint (n, n, 32);
if ((x != demodmap (modmap (x, 1, 1, "ask", m), 1, 1, "ask", m)) || ...
(x != demodmap (modmap (x, 1, 1, "fsk", m), 1, 1, "fsk", m)) || ...
(x != demodmap (modmap (x, 1, 1, "msk"), 1, 1, "msk")) || ...
(x != demodmap (modmap (x, 1, 1, "psk", m), 1, 1, "psk", m)) || ...
(x != demodmap (modmap (x, 1, 1, "qask", m), 1, 1, "qask", m)) || ...
(x != demodmap (modmap (x, 1, 1, "qask/cir", ...
[floor(m/2), m - floor(m/2)]), 1, 1, "qask/cir", ...
[floor(m/2), m - floor(m/2)])))
error ("FAILED");
endif
fprintf ("PASSED\n");
fprintf (" Digital Modulation: ");
fprintf ("Not tested\n");
endif
if (strcmp (tests, "special") || strcmp (tests, "all"))
fprintf ("\n<< Special Filters Package >>\n");
fprintf (" Hankel/Hilbert: ");
## use hank2sys, hilbiir
fprintf ("Not tested\n");
fprintf (" Raised Cosine: ");
## use rcosflt, rcosiir rcosine, rcosfir
fprintf ("Not tested\n");
endif
if (strcmp (tests, "galois") || strcmp (tests, "all"))
fprintf ("\n<< Galois Fields Package >>\n");
## Testing of the Galois Fields package
m = 3; ## must be greater than 2
fprintf (" Find primitive polynomials: ");
prims = primpoly (m, "all", "nodisplay");
for i = 2^m:2^(m+1) - 1
if (find (prims == i))
if (!isprimitive (i))
error ("Error in primitive polynomials");
endif
else
if (isprimitive (i))
error ("Error in primitive polynomials");
endif
endif
endfor
fprintf ("PASSED\n");
fprintf (" Create Galois variables: ");
n = 2^m-1;
gempty = gf ([], m);
gzero = gf (0, m);
gone = gf (1, m);
gmax = gf (n, m);
grow = gf (0:n, m);
gcol = gf ([0:n]', m);
matlen = ceil (sqrt (2^m));
gmat = gf (reshape (mod ([0:matlen*matlen-1], 2^m), matlen, matlen), m);
fprintf ("PASSED\n");
fprintf (" Access Galois structures: ");
if (gcol.m != m || gcol.prim_poly != primpoly (m, "min", ...
"nodisplay"))
error ("FAILED");
endif
fprintf ("PASSED\n");
fprintf (" Miscellaneous functions: ");
if (size (gmat) != [matlen, matlen])
error ("FAILED");
endif
if (length (grow) != 2^m)
error ("FAILED");
endif
if (!any (grow) || all (grow) || any (gzero) || !all (gone))
error ("FAILED");
endif
if (isempty (gone) || !isempty (gempty))
error ("FAILED");
endif
tmp = diag (grow);
if (size (tmp, 1) != 2^m || size (tmp, 2) != 2^m)
error ("FAILED");
endif
for i = 1:2^m
for j = 1:2^m
if ((i == j) && (tmp(i,j) != grow(i)))
error ("FAILED");
elseif ((i != j) && (tmp(i,j) != 0))
error ("FAILED");
endif
endfor
endfor
tmp = diag (gmat);
if (length (tmp) != matlen)
error ("FAILED");
endif
for i = 1:matlen
if (gmat(i,i) != tmp(i))
error ("FAILED");
endif
endfor
tmp = reshape (gmat, prod (size (gmat)), 1);
if (length (tmp) != prod (size (gmat)))
error ("FAILED");
endif
if (exp (log (gf ([1:n], m))) != [1:n])
error ("FAILED");
endif
tmp = sqrt (gmat);
if (tmp .* tmp != gmat)
error ("FAILED");
endif
fprintf ("PASSED\n");
fprintf (" Unary operators: ");
tmp = - grow;
if (tmp != grow)
error ("FAILED");
endif
tmp = !grow;
if (tmp(1) != 1)
error ("FAILED");
endif
if (any (tmp(2:length (tmp))))
error ("FAILED");
endif
tmp = gmat';
for i = 1:size (gmat, 1)
for j = 1:size (gmat, 2)
if (gmat(i,j) != tmp(j,i))
error ("FAILED");
endif
endfor
endfor
fprintf ("PASSED\n");
fprintf (" Arithmetic operators: ");
if (any (gmat + gmat))
error ("FAILED");
endif
multbl = gcol * grow;
elsqr = gcol .* gcol;
elsqr2 = gcol .^ gf (2, m);
for i = 1:length (elsqr)
if (elsqr(i) != multbl(i,i))
error ("FAILED");
endif
endfor
for i = 1:length (elsqr)
if (elsqr(i) != elsqr2(i))
error ("FAILED");
endif
endfor
tmp = grow(2:length (grow)) ./ gcol(2:length (gcol))';
if (length (tmp) != n || any (tmp != ones (1, length (grow) - 1)))
error ("FAILED");
endif
fprintf ("PASSED\n");
fprintf (" Logical operators: ");
if (grow(1) != gzero || grow(2) != gone || grow(2^m) != n)
error ("FAILED");
endif
if (!(grow(1) == gzero) || any (grow != gcol'))
error ("FAILED");
endif
fprintf ("PASSED\n");
fprintf (" Polynomial manipulation: ");
poly1 = gf ([2, 4, 5, 1], 3);
poly2 = gf ([1, 2], 3);
sumpoly = poly1 + [0, 0, poly2]; ## Already test "+"
mulpoly = conv (poly1, poly2); ## multiplication
poly3 = [poly, remd] = deconv (mulpoly, poly2);
if (!isequal (poly1, poly3))
error ("FAILED");
endif
if (any (remd))
error ("FAILED");
endif
x0 = gf ([0, 1, 2, 3], 3);
y0 = polyval (poly1, x0);
alph = gf (2, 3);
y1 = alph * x0.^3 + alph.^2 * x0.^2 + (alph.^2+1) *x0 + 1;
if (!isequal (y0, y1))
error ("FAILED");
endif
roots1 = roots (poly1);
ck1 = polyval (poly1, roots1);
if (any (ck1))
error ("FAILED");
endif
b = minpol (alph);
bpoly = bi2de (b.x, "left-msb");
if (bpoly != alph.prim_poly)
error ("FAILED");
endif
c = cosets (3);
c2 = c{2};
mpol = minpol (c2(1));
for i = 2:length (c2)
if (mpol != minpol (c2(i)))
error ("FAILED");
endif
endfor
fprintf ("PASSED\n");
fprintf (" Linear Algebra: ");
[l, u, p] = lu (gmat);
if (any (l*u - p*gmat))
error ("FAILED");
endif
g1 = inv (gmat);
g2 = gmat ^ -1;
if (any (g1*gmat != eye (matlen)))
error ("FAILED");
endif
if (any (g1 != g2))
error ("FAILED");
endif
matdet = 0;
while (!matdet)
granmat = gf (floor (2^m*rand (matlen)), m);
matdet = det (granmat);
endwhile
matrank = rank (granmat);
smallcol = gf ([0:matlen-1], m)';
sol1 = granmat \ smallcol;
sol2 = smallcol' / granmat;
if (any (granmat * sol1 != smallcol))
error ("FAILED");
endif
if (any (sol2 * granmat != smallcol'))
error ("FAILED");
endif
fprintf ("PASSED\n");
fprintf (" Signal Processing functions: ");
b = gf ([1, 0, 0, 1, 0, 1, 0, 1], m);
a = gf ([1, 0, 1, 1], m);
x = gf ([1, zeros(1, 99)], m);
y0 = filter (b, a, x);
y1 = conv (grow+1, grow);
y2 = grow * convmtx (grow+1, length (grow));
if (any (y1 != y2))
error ("FAILED");
endif
[y3, remd] = deconv (y2, grow+1);
if (any (y3 != grow))
error ("FAILED");
endif
if (any (remd))
error ("FAILED");
endif
alph = gf (2, m);
x = gf (floor (2^m*rand (n, 1)), m);
fm = dftmtx (alph);
ifm = dftmtx (1/alph);
y0 = fft (x);
y1 = fm * x;
if (any (y0 != y1))
error ("FAILED");
endif
z0 = ifft (y0);
z1 = ifm * y1;
if (any (z0 != x))
error ("FAILED");
endif
if (any (z1 != x))
error ("FAILED");
endif
fprintf ("PASSED\n");
endif
fprintf ("\n");
unwind_protect_cleanup
page_screen_output (pso);
end_unwind_protect
else
print_usage ();
endif
endfunction
%!test
%! try comms ("test");
%! catch disp (lasterr ()); end_try_catch
|