Description Usage Arguments Details Value Author(s) Examples
Generates a recursive systematic convolutional (rsc) encoder.
1 | ConvGenerateRscEncoder(N, M, generators)
|
N |
Numer of output symbols per input symbol. |
M |
Memory length of the encoder. |
generators |
Vector of octal generator polynoms (one for each non-systematic output symbol and one for the recursion). |
N is an integer and gives the number of output bits per input bit.
N has to be at least two. M is an integer and gives the memory length
of the encoder (number of shift register elements in the circuit). M
has to be at least one.
The generator polynoms define how the output bits are computed for each
of the N output signals. The polynoms are octal numbers. See details of
ConvGenerateEncoder
for an example.
An rsc encoder has exactly one fixed systematic output signal.
The generator polynom for the systematic output doesn't have to be
passed as an argument. So the generators argument contains all polynoms
for non-systematic outputs and at the last position the recursion
polynom. The MSB of the recursion polynom handles the input signal,
the other bits handle the memory outputs. The MSB of the output polynoms
handle the recursion output(!), not the original input signal. The other
bits also handle the memory outputs. See 'The art of error correcting
coding' (p.92f) for a detailed definition and an example.
A convolutional encoder represented as a list containing: N, M, vector of generator polynoms, 3 matrices: nextState, previousState and output, rsc flag, termination vector
Martin Nocker
1 2 | # standard rsc encoder with code-rate = 0.5
ConvGenerateRscEncoder(2,2,c(5,7))
|
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.