RSC Coding

A Python wrapper around the AFF3CT [1] project, transferring the Recursive Systematic Convolutional BCJR [2] implementations to the Hermes forward error correction pipeline structure.

class RSCCoding(self: hermespy.fec.aff3ct.rsc.RSCCoding, arg0: SupportsInt | SupportsIndex, arg1: SupportsInt | SupportsIndex, arg2: bool, arg3: SupportsInt | SupportsIndex, arg4: SupportsInt | SupportsIndex)

Bases: pybind11_object

Parameters:

• bit_block_size (int) – Number of data bits per block to be encoded.

• code_block_size (int) – Number of code bits per encoded block.

• buffered_coding (bool) – Enable bufferd coding.

• poly_a (int) – Trellis graph polynomial dimension alpha.

• poly_b (int) – Trellis graph polynomial dimension beta.

decode(self: hermespy.fec.aff3ct.rsc.RSCCoding, arg0: Annotated[numpy.typing.ArrayLike, numpy.int8]) → numpy.typing.NDArray[numpy.int8]

Decode a block of code bits to data bits.

Parameters:

code (numpy.ndarray) – The code bit block to be decoded.

Returns:

The data bit block after decoding.

encode(self: hermespy.fec.aff3ct.rsc.RSCCoding, arg0: Annotated[numpy.typing.ArrayLike, numpy.int8]) → numpy.typing.NDArray[numpy.int8]

Encode a block of data bits to code bits.

Parameters:

data (numpy.ndarray) – The data bit block to be encoded.

Returns:

The code bit block after encoding.

property bit_block_size

Number of bits within a data block to be encoded.

property code_block_size

Number of bits within a code block to be decoded.

enabled = True

property rate

The coding rate.

[1]

A. Cassagne, O. Hartmann, M. Léonardon, K. He, C. Leroux, R. Tajan, O. Aumage, D. Barthou, T. Tonnellier, V. Pignoly, B. Le Gal, and C. Jégo. Aff3ct: a fast forward error correction toolbox! Elsevier SoftwareX, 10:100345, October 2019. URL: http://www.sciencedirect.com/science/article/pii/S2352711019300457, doi:https://doi.org/10.1016/j.softx.2019.100345.

[2]

L. Bahl, J. Cocke, F. Jelinek, and J. Raviv. Optimal decoding of linear codes for minimizing symbol error rate (corresp.). IEEE Transactions on Information Theory, 20(2):284–287, 1974. doi:10.1109/TIT.1974.1055186.