Digital Communications, Error Correcting Codes (Channel Code), Source Code functions, Modulation and Galois Fields

Select category:

Add white Gaussian noise to a voltage signal.

Compares two matrices and returns the number of bit errors and the bit error rate.

Plot the eye-diagram of a signal.

Generate a matrix of random bit errors.

Generate a matrix of random binary numbers.

Generate a matrix of random symbols.

Display the scatter plot of a signal.

Compares two matrices and returns the number of symbol errors and the symbol error rate.

Returns a M-by-N matrix Y of white Gaussian noise.

Send DATA into a binary symmetric channel with probability P of error one each symbol.

Not implemented.

Not implemented.

Compresses and expanding the dynamic range of a signal using a mu-law or or A-law algorithm.

Decode using differential pulse code modulation (DPCM).

Encode using differential pulse code modulation (DPCM).

Optimize the DPCM parameters and codebook.

Decode signal encoded by `huffmanenco'.

Builds a Huffman code, given a probability list.

Returns the Huffman encoded signal using DICT.

Optimize the quantization table and codes to reduce distortion.

Lempel-Ziv 77 source algorithm decoding implementation.

Lempel-Ziv 77 source algorithm implementation.

Quantization of an arbitrary signal relative to a partitioning.

Returns the code dictionary for source using Shannon-Fano algorithm.

Returns the Shannon-Fano encoded signal using DICT.

Returns the original signal that was Shannon-Fano encoded.

Returns run-length encoded MESSAGE.

Returns decoded run-length MESSAGE.

Returns the Rice encoded signal using K or optimal K .

Returns the Rice decoded signal vector using CODE and K.

Returns the cell-array of encoded Fibonacci value from the column vectors NUM.

Returns the decoded Fibonacci value from the binary vectors CODE.

Returns the split data stream at the word boundaries.

Returns the Golomb coded signal as cell array.

Returns the Golomb decoded signal vector using CODE and M.

Interleaved elements of DATA according to ELEMENTS.

Not implemented.

NROWS-by-NCOLS.

Interleaved elements of DATA with a temporary matrix of size NROWS-by-NCOLS.

Interleaves elements of DATA with a random permutation.

Restore elements of DATA according to ELEMENTS.

Restore elements of DATA with a temporary matrix of size NROWS-by-NCOLS.

Restore elements of DATA with a random permutation.

Not implemented.

Not implemented.

Calculates the generator polynomials for a BCH coder.

Encode the binary vector MSG with the convolutional encoder described by the trellis structure T.

Not implemented.

Not implemented.

Top level block decoder.

Top level block encoder.

Decode Extended Golay code.

Encode with Extended Golay code.

Extended Golay code generator matrix.

Converts binary generator matrix GEN to the parity check matrix PAR and visa-versa.

Produce the parity check and generator matrices of a Hamming code.

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.

Creates a generator polynomial for a Reed-Solomon coding with message length of K and codelength of N.

Not implemented.

Decodes an ASCII file using a Reed-Solomon coder.

Not implemented.

Encodes an ASCII file using a Reed-Solomon coder.

Given G, extract P parity check matrix.

Not implemented.

Not implemented.

Not implemented.

Baseband demodulator for analog signals.

Not implemented.

Baseband modulator for analog signals.

Create the AM modulation of the signal x with carrier frequency fs.

Compute the amplitude demodulation of the signal S with a carrier frequency of FC and a sample frequency of FS.

Plots a ASK/PSK signal constellation.

Not implemented.

Not implemented.

Demapping of an analog signal to a digital signal.

Not implemented.

Not implemented.

Create the FM modulation of the signal x with carrier frequency fs.

Create the FM demodulation of the signal x with carrier frequency fs.

Modulates an information sequence of integers X in the range `[0 ...

Not implemented.

Mapping of a digital signal to an analog signal.

Demodulates a pulse amplitude modulated signal X into an information sequence of integers in the range `[0 ...

Modulates an information sequence of integers X in the range `[0 ...

Demodulates a complex-baseband phase shift keying modulated signal into an information sequence of integers in the range `[0 ...

Modulates an information sequence of integers X in the range `[0 ...

Demaps an analog signal using a square QASK constellation.

Map a digital signal using a square QASK constellation.

Create the QAM modulation of x with a size of alphabet m.

Create the QAM demodulation of x with a size of alphabet m.

Not implemented.

Not implemented.

Not implemented.

Not implemented.

Not implemented.

Not implemented.

For a vector argument, return true (logical 1) if all elements of the vector are nonzero.

For a vector argument, return true (logical 1) if any element of the vector is nonzero.

Finds the elements of GF(2^M) with primitive polynomial PRIM, that share the same minimum polynomial.

Convolve two vectors A and B.

If A is a column vector and X is a column vector of length N, then

Deconvolve two vectors.

Compute the determinant of A.

If N is a scalar, produces a N-by-N matrix D such that the Fourier transform of a column vector of length N is given by `dftmtx(N) * x' and the inverse Fourier transform is given by `inv(dftmtx(N)) *

Return a diagonal matrix with vector V on diagonal K.

Compute `e^x' for each element of X.

Not implemented.

Compute the discrete Fourier transform of A using a Fast Fourier Transform (FFT) algorithm.

Return the solution to the following linear, time-invariant difference equation:

This function exists for compatibility with matlab.

Calculate the minimum weight or distance of a linear block code.

Compute the inverse discrete Fourier transform of A using a Fast Fourier Transform (FFT) algorithm.

Compute the inverse of the square matrix A.

Compute the inverse of the square matrix A.

Return true if all of X1, X2, ...

Compute the natural logarithm, `ln (X)', for each element of X.

Compute the LU decomposition of A.

Product of elements along dimension DIM.

Compute the square root of each element of X.

Compute the rank of matrix A, using the singular value decomposition.

Return a matrix with the specified dimensions (M, N, ...) whose elements are taken from the matrix A.

For a vector V with N components, return the roots of the polynomial

Sum of elements along dimension DIM.

Sum of squares of elements along dimension DIM.

Return true if A is an empty matrix (any one of its dimensions is zero).

Not implemented.

Not implemented.

Return the length of the object A.

Finds the minimum polynomial for elements of a Galois Field.

Evaluate the polynomial P at the specified values of X.

Not implemented.

Return the number of rows and columns of A.

Not implemented.

Not implemented.

Not implemented.

Not implemented.

Not implemented.

Not implemented.

Not implemented.

Not implemented.

Not implemented.

Not implemented.

Not implemented.

Not implemented.

Not implemented.

Not implemented.

Not implemented.

Not implemented.

Not implemented.

Not implemented.

Not implemented.

Manual and test code for the Octave Communications toolbox.

Convert bit matrix to a vector of integers

Convert a non-negative integer to bit vector.

Convert octal to decimal values.

Return true if T is a valid trellis structure.

Convert convolutional code generator polynomials into trellis form.

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.

Compute the Q function.

Compute the inverse Q function.

Package: communications