Baseband demodulator for analog signals.
Compute the amplitude demodulation of the signal S with a carrier frequency of FC and a sample frequency of FS.
Create the AM modulation of the signal x with carrier frequency fs.
Baseband modulator for analog signals.
Plots a ASK/PSK signal constellation.
Add white Gaussian noise to a voltage signal.
Decodes the coded message CODE using a BCH coder.
Encodes the message MSG using a [N,K] BCH coding.
Calculates the generator polynomials for a BCH coder.
Convert bit matrix to a vector of integers
Compares two matrices and returns the number of bit errors and the bit error rate.
Send DATA into a binary symetric channel with probability P of error one each symbol.
Manual and test code for the Octave Communications toolbox.
Compresses and expanding the dynamic range of a signal using a mu-law or or A-law algorithm.
Finds the elements of GF(2^M) with primitive polynomial PRIM, that share the same minimum polynomial.
Produce the parity check and generator matrix of a cyclic code.
This function returns the cyclic generator polynomials of the code [N,K].
Convert a non-negative integer to bit vector.
Top level block decoder.
Restore elements of DATA according to ELEMENTS.
Demapping of an analog signal to a digital signal.
Given R, the received Extended Golay code, this function tries to decode R using the Extended Golay code parity check matrix.
Given M, encode M using the Extended Golay code.
Returns the Extended Golay code (24,12) generator matrix, which can correct upto 3 errors.
Top level block encoder.
Plot the eye-diagram of a signal.
Returns the decoded fibonacci value from the binary vectors CODE.
Returns the cell-array of encoded fibonacci value from the column vectors NUM.
Returns the split data stream at the word boundaries.
Create the FM demodulation of the signal x with carrier frequency fs.
Create the FM modulation of the signal x with carrier frequency fs.
Convolve two Galois vectors.
Create matrix to perform repeated convolutions with the same vector in a Galois Field.
Deconvolve two Galois vectors.
Compute the determinant of the Galois array A.
Form a matrix, that can be used to perform Fourier transforms in a Galois Field.
Return a diagonal matrix with Galois vector V on diagonal K.
Converts binary generator matrix GEN to the parity chack matrix PAR and visa-versa.
Compute the general quadrature amplitude demodulation of y.
Compute the general quadrature amplitude demodulation of y.
Modulates an information sequence of intergers X in the range `[0 ... M-1]' onto a quadrature amplitude modulated signal Y, where `M = length(c) - 1' and C is a 1D vector specifing the signal constellation mapping to be used.
Compute the anti-logarithm for each element of X for a Galois array.
Creates a Galois field array GF(2^M) from the matrix X.
If X is a column vector, finds the FFT over the primitive element of the Galois Field of X.
Digital filtering of vectors in a Galois Field.
This function exists for compatiability with matlab.
Calculate the minimum weight or distance of a linear block code.
If X is a column vector, finds the IFFT over the primitive element of the Galois Field of X.
Compute the inverse of the square matrix A.
See ginv.
Return true if all of X1, X2, ... are equal.
Compute the natural logarithm for each element of X for a Galois array.
Compute the LU decomposition of A in a Galois Field.
Returns the Golomb decoded signal vector using CODE and M.
Returns the Golomb coded signal as cell array.
Product of elements along dimension DIM of Galois array.
Compute the rank of the Galois array A by counting the independent rows and columns.
Return a matrix with M rows and N columns whose elements are taken from the Galois array A.
For a vector V with N components, return the roots of the polynomial over a Galois Field
Compute the square root of X, element by element, in a Galois Field.
Sum of elements along dimension DIM of Galois array.
Sum of squares of elements along dimension DIM of Galois array.
Produce the parity check and generator matrices of a Hamming code.
Returns the original signal that was Huffman encoded signal using `huffmanenco'.
Builds a Huffman code, given a probability list.
Returns the Huffman encoded signal using DICT.
Interleaved elements of DATA according to ELEMENTS.
Return 1 if the value of the expression EXPR is a Galois Field.
Returns 1 is the polynomial represented by A is a primitive polynomial of GF(2).
Optimize the quantization table and codes to reduce distortion.
Lempel-Ziv 77 source algorithm decoding implementation.
Lempel-Ziv 77 source algorithm implementation.
Compute the Marcum Q function.
Restore elements of DATA with a tempory matrix of size NROWS-by-NCOLS.
Interleaved elements of DATA with a tempory matrix of size NROWS-by-NCOLS.
Finds the minimum polynomial for elements of a Galois Field.
Mapping of a digital signal to an analog signal.
Convert octal to decimal values.
Demodulates a pulse amplitude modulated signal X into an information sequence of integers in the range `[0 ... M-1]'.
Modulates an information sequence of integers X in the range `[0 ... M-1]' onto a pulse amplitude modulated signal Y.
Finds the primitive polynomials in GF(2^M).
Demodulates a complex-baseband phase shift keying modulated signal into an information sequence of integers in the range `[0 ... M-1]'.
Modulates an information sequence of integers X in the range `[0 ... M-1]' onto a complex baseband phase shift keying modulated signal Y.
Create the QAM demodulation of x with a size of alphabet m.
Create the QAM modulation of x with a size of alphabet m.
Demaps an analog signal using a square QASK constellation.
Map a digital signal using a square QASK constellation.
Compute the Q function.
Compute the inverse Q function.
Quantization of an arbitrary signal relative to a paritioning.
Restore elements of DATA with a random permutation.
Generate a matrix of random bit errors.
Generate a matrix of random binary numbers.
Interleaves elements of DATA with a random permutation.
Generate a matrix of random symbols.
Decode the received code word VV using the RM-generator matrix G, of order R, M, returning the code-word C.
Definition type construction of Reed Muller code, of order R, length 2^M.
Definition type construction of Reed Muller code, of order R, length 2^M.
Returns the Rice decoded signal vector using CODE and K.
Returns the Rice encoded signal using K or optimal K .
Returns decoded run-length MESSAGE.
Returns run-length encoded MESSAGE.
Decodes the message contained in CODE using a [N,K] Reed-Solomon code.
Decodes an ascii file using a Reed-Solomon coder.
Encodes the message MSG using a [N,K] Reed-Solomon coding.
Encodes an ascii file using a Reed-Solomon coder.
Creates a generator polynomial for a Reed-Solomon coding with message length of K and codelength of N.
Display the scatter plot of a signal.
Returns the original signal that was Shannonfano encoded.
Returns the code dictionary for source using shanno fano algorithm.
Returns the Shannon Fano encoded signal using DICT.
Compares two matrices and returns the number of symbol errors and the symbol error rate.
Create the syndrome decoding table from the parity check matrix H.
Given G, extract P partiy check matrix.
Converts the vector V into a C column matrix with row priority arrangement and with the final column padded with the value D to the correct length.
Returns a M-by-N matrix Y of white Gaussian noise.
