AFF3CT Documentation

Introduction

AFF3CT is a toolbox dedicated to the Forward Error Correction (FEC or channel coding). It is written in C++ and it supports a large range of codes: from the well-spread Turbo codes to the new Polar codes including the Low-Density Parity-Check (LDPC) codes. AFF3CT includes many tools but the most important ones are:

a standalone simulator to simulate communication chains (c.f. Fig. 1.1) based on a Monte Carlo method,

a toolbox or a library that can be used through a well-documented API.

The communication chain.

The simulator targets high speed simulations and extensively uses parallel techniques like SIMD, multi-threading and multi-nodes programming models. Below, a list of the features that motivated the creation of the simulator:

1. reproduce state-of-the-art decoding performances,
2. explore various channel code configurations, find new trade-offs,
3. prototype hardware implementation (fixed-point receivers, hardware in the loop tools),
4. reuse tried and tested modules and add yours,
5. alternative to MATLAB, if you seek to reduce simulations time.

AFF3CT was first intended to be a simulator but as it developed, the need to reuse sub-parts of the code intensified: the library was born. Below is a list of possible applications for the library:

1. build custom communication chains that are not possible with the simulator,
2. facilitate hardware prototyping,
3. enable various modules to be used in SDR contexts.

Installation Guide

Get the Source Code

Important

If you do not plan to modify the AFF3CT source code and you want to use the simulator/library as is, you can download one of the latest builds from the download page of the AFF3CT website and skip this section.

This project uses Git as the version-control system to manage the source code. The AFF3CT repository is hosted on GitHub. To get the source code, first install the Git software and secondly clone the AFF3CT repository locally.

Git Installation

Windows/macOS

Download Git from the official web page and launch the install. Just press the Next button until the installation is over.

Warning

On Windows, Git comes with the Git Bash terminal which is, to our mind, better suitable that the traditional Windows Console. We encourage you to use Git Bash instead of the Windows Command Prompt for the following steps.

Warning

It is recommended to add Git to your system PATH during the installation.

Note

On Windows, during the installation you may want to check the Linux symbolic links support.

Linux

Install Git from the package manager:

sudo apt install git

Note

On CentOS-like systems you have to replace apt by yum.

Clone AFF3CT from GitHub

Get the source code from GitHub:

git clone --recursive https://github.com/aff3ct/aff3ct.git
cd aff3ct

The AFF3CT repository contains some dependencies to other repositories. Technically those dependencies are managed by the Git submodule feature. By default the submodules are not downloaded during the git clone process this is why the --recursive option has been added.

Danger

On the AFF3CT repository you may want to directly download the source code without making a git clone. This will get you an archive without the AFF3CT dependencies and the build process will fail. Do not directly download AFF3CT from GitHub and please make a clone!

If you want to manually get or update the AFF3CT submodules, you can use the following command:

git submodule update --init --recursive

Warning

When git pull is used to get the last commits from the repository, the submodules are not automatically updated and it is required to call the previous git submodule command.

Compilation

Important

If you do not plan to modify the AFF3CT source code and you want to use the simulator/library as is, you can download one of the latest builds from the download page of the AFF3CT website and skip this section.

This project uses CMake in order to generate any type of projects (Makefile, Visual Studio, Eclipse, CLion, XCode, etc.).

AFF3CT is portable and can be compiled on Windows, macOS and Linux. Of course it works on traditional x86 architectures like Intel and AMD CPUs but it also works on embedded architectures like ARM CPUs.

AFF3CT supports many C++11 compliant compilers, until now the following compilers have been tested: GNU (g++), Clang (clang++), Intel (icpc) and Microsoft (MSVC). In this section, a focus is given to compile AFF3CT with:

1. the GNU compiler on Windows and Linux (Makefile project),
2. the Microsoft compiler on Windows (Visual Studio 2017 solution),
3. the Clang compiler on macOS (Makefile project).

CMake Installation

Windows/macOS

Download CMake from the official web page and launch the installer. Just press the Next button until the installation is over.

Important

On Windows, if you plan to build AFF3CT from the Visual Studio IDE you can skip the CMake installation and directly go to the Compilation with Visual Studio section.

Note

On Windows, it is recommended to download a version of CMake with an installer: it looks like cmake-x.x.x-win64-x64.msi.

Warning

It is recommended to add CMake to your system PATH during the installation.

Danger

The CMake minimal version requirement is 3.0.2.

Linux

Install Make and CMake from the package manager:

sudo apt install make cmake

Note

On CentOS-like systems you have to replace apt by yum.

C++ GNU Compiler Installation

Windows

Download the latest MinGW build from the official web page (tested with MinGW x86_64-6.2.0). Unzip the archive. Copy the extracted mingw64 folder in the C:\Programs\Git\ folder (overwrite all the duplicated files).

Note

We suppose that you have installed Git for Windows has explained in the Git Installation on Windows section and consequently you have Git Bash installed.

macOS

The instructions to install the C++ GNU compiler are not given for macOS because the native Clang compiler will be used instead in the next steps. Directly go to the Compilation with a Makefile project on macOS section.

Linux

Install the C++ GNU compiler from the package manager:

sudo apt install g++

Note

On CentOS-like systems you have to replace apt by yum.

Compilation with a Makefile Project

Go into the directory where you cloned AFF3CT, this directory will be refereed as $AFF3CT_ROOT.

Windows

Generate the Makefile from CMake:

mkdir build
cd build
cmake .. -G"MinGW Makefiles"

This last command line should fail but you can ignore it, continue with:

cmake .. -DCMAKE_CXX_COMPILER="g++.exe" -DCMAKE_BUILD_TYPE="Release" -DCMAKE_CXX_FLAGS="-funroll-loops -march=native"

Build AFF3CT with the Makefile:

mingw32-make -j4

Once finished, the AFF3CT executable should be located in the $AFF3CT_ROOT/build/bin folder.

Danger

Run the previous commands on Git Bash (Start Menu > Git > Git Bash) and not on the Windows Command Prompt. If you try to run the previous commands on the Windows Command Prompt, CMake will not find the GNU compiler (g++.exe and gcc.exe commands) because it has not been added to the system PATH, same for the mingw32-make command.

macOS

Generate the Makefile from CMake:

mkdir build
cd build
cmake .. -G"Unix Makefiles" -DCMAKE_CXX_COMPILER="clang++" -DCMAKE_BUILD_TYPE="Release" -DCMAKE_CXX_FLAGS="-funroll-loops -march=native"

Build AFF3CT with the Makefile:

make -j4

Once finished, the AFF3CT executable should be located in the $AFF3CT_ROOT/build/bin folder.

Linux

Generate the Makefile from CMake:

mkdir build
cd build
cmake .. -G"Unix Makefiles" -DCMAKE_CXX_COMPILER="g++" -DCMAKE_BUILD_TYPE="Release" -DCMAKE_CXX_FLAGS="-funroll-loops -march=native"

Build AFF3CT with the Makefile:

make -j4

Once finished, the AFF3CT executable should be located in the $AFF3CT_ROOT/build/bin folder.

Compilation with a Visual Studio 2017 Solution

Since Microsoft Visual Studio 2017, Visual natively supports CMake. To generate the AFF3CT solution, open the $AFF3CT_ROOT folder from the IDE.

Select the Release target and press the green play button aff3ct.exe to start the compilation.

Once AFF3CT is compiled you can browse the build by right clicking on CMakeList.txt > Cache > Open Cache Folder.

Note

Visual Studio should not be mixed up with Visual Studio Code. Visual Studio is the Windows native IDE and Visual Studio Code is a portable code editor.

Note

Visual Studio 2017 Community is free for Open-source contributors, students and freelance developers.

Warning

The Visual Studio default compiler (MSVC) is known to generate significantly slower AFF3CT executable than the GNU compiler. If you target an high speed executable it is recommended to use the GNU compiler.

The compilation can also be started from the command line after calling the %VS_PATH%\VC\Auxiliary\Build\vcvars64.bat batch script (where %VS_PATH% is the location of Visual Studio on your system):

devenv /build Release aff3ct.sln

CMake Options

CMake allows to define project specific options. AFF3CT takes advantage of this feature and provides the following options:

Option	Type	Default	Description
AFF3CT_COMPILE_EXE	BOOLEAN	ON	Compile the executable.
AFF3CT_COMPILE_STATIC_LIB	BOOLEAN	OFF	Compile the static library.
AFF3CT_COMPILE_SHARED_LIB	BOOLEAN	OFF	Compile the shared library.
AFF3CT_LINK_GSL	BOOLEAN	OFF	Link with the GSL library (used in the channels).
AFF3CT_LINK_MKL	BOOLEAN	OFF	Link with the MKL library (used in the channels).
AFF3CT_SYSTEMC_SIMU	BOOLEAN	OFF	Enable the SystemC simulation (incompatible with the library compilation).
AFF3CT_SYSTEMC_MODULE	BOOLEAN	OFF	Enable the SystemC support (only for the modules).
AFF3CT_MPI	BOOLEAN	OFF	Enable the MPI support.
AFF3CT_POLAR_BIT_PACKING	BOOLEAN	ON	Enable the bit packing technique for Polar code SC decoding.
AFF3CT_COLORS	BOOLEAN	ON	Enable the colors in the terminal.
AFF3CT_BACKTRACE	BOOLEAN	ON	Enable the backtrace display when and exception is raised. On Windows and macOS this option is not available and automatically set to OFF.
AFF3CT_EXT_STRINGS	BOOLEAN	ON	Enable external strings for the help documentation. If ON the help doc will be parsed from the strings.rst external file. If OFF the strings will be self-contained in the binary. On MSVC this option is not available and automatically set to ON.
AFF3CT_PREC	STRING	MULTI	Select the precision in bits (can be ‘8’, ‘16’, ‘32’, ‘64’ or ‘MULTI’).

Considering an option AFF3CT_OPTION we want to set to ON, here is the syntax to follow:

cmake .. -DAFF3CT_OPTION="ON"

Compiler Options

Build Type

CMake allows to select the type of build through the CMAKE_BUILD_TYPE built-in variable. Release and Debug are the common values that the variable can get. For instance, to compile in release mode:

cmake .. -DCMAKE_BUILD_TYPE="Release"

Note

In CMake it is recommended to not explicitly set the compiler optimization level flags (-O0, -O1, -O2, -O3, etc.). Those compiler options will be set automatically by the CMAKE_BUILD_TYPE built-in variable. For instance, with the GNU compiler, if CMAKE_BUILD_TYPE is set to Release, the code will be compiled with the -O3 flag.

Note

If you need to develop in AFF3CT it is recommended to compile in the Debug mode (or eventually RelWithDebInfo mode) during the development process to add the debug symbols in the binary files. It will certainly ease the debug process but be careful, the execution speed will be seriously affected in this mode, be sure to switch to the Release mode when the code is stable.

Note

In Visual Studio solutions, the CMAKE_BUILD_TYPE built-in variable has no effect and the build type is directly managed by Visual.

Specific Options

CMake has a built-in variable you can set to specify the compiler options: CMAKE_CXX_FLAGS. For instance, it can be used like this:

cmake .. -DCMAKE_CXX_FLAGS="-funroll-loops -march=native"

Many parts of the AFF3CT code use the SIMD parallelism and this type of instructions often requires additional compiler options to be enabled:

Option	Description
-msse2	Enable the SSE2 set of instructions on x86 CPUs (128-bit vector size, required for 32-bit and 64-bit data).
-mssse3	Enable the SSSE3 set of instructions on x86 CPUs (128-bit vector size, specifically required for 32-bit data and the SC FAST decoder, see the --dec-type, -D and --dec-implem parameters).
-msse4.1	Enable the SSE4.1 set of instructions on x86 CPUs (128-bit vector size, required for 8-bit and 16-bit data).
-mavx	Enable the AVX set of instructions on x86 CPUs (256-bit vector size, required for 32-bit and 64-bit data).
-mavx2	Enable the AVX2 set of instructions on x86 CPUs (256-bit vector size, required for 8-bit and 16-bit data).
-mavx512f	Enable the AVX-512F set of instructions on x86 CPUs (512-bit vector size, required for 32-bit and 64-bit data).
-mavx512bw	Enable the AVX-512BW set of instructions on x86 CPUs (512-bit vector size, required for 8-bit and 16-bit data).
-mfpu=neon	Enable the NEON set of instructions on ARMv7 and ARMv8 CPUs (128-bit vector size, required for 8-bit, 16-bit data and 32-bit data).
-march=native	Let the compiler choose the best set of instructions available on the current architecture (it does not work for ARMv7 architectures since the NEON instruction set is not IEEE 754 compliant).

Warning

Previous options are only valid for the GNU and the Clang compilers but it exists similar options for the other compilers like the Microsoft compiler (MSVC) or the Intel compiler (icpc).

Danger

Some AFF3CT routines require the floating-point operations to be IEEE-compliant: numerical instabilities has been reported when compiling with the --ffast-math flag. Be aware that the -Ofast option is the combination of -O3 and --ffast-math. We recommend to avoid the --ffast-math option unless you know what you are doing.

Installation

Important

If you do not plan to modify the AFF3CT source code and you want to use the simulator/library as is, you can download one of the latest builds from the download page of the AFF3CT website and skip this section.

Once AFF3CT has been compiled, it is possible (not mandatory) to install it on your system. On Unix-like systems, traditionally, the fresh build is installed in the /usr/local directory (this is the CMake default installation path). This location can be changed by setting the CMAKE_INSTALL_PREFIX built-in variable with an other path. For instance, to install AFF3CT in the current build:

cmake .. -DCMAKE_INSTALL_PREFIX="install"

This command do not install AFF3CT. It only prepares the project to be installed in the selected location.

Makefile Project

To install AFF3CT, call the install target on the current Makefile:

make install

Note

Depending on the chosen CMAKE_INSTALL_PREFIX location, the administrator privileges (sudo) can be required.

Visual Studio Solution

In case of a Visual Studio Solution, an INSTALL project is defined and ensures the installation when triggered. This can be done from the Visual Studio IDE or from the command line after calling the %VS_PATH%\VC\Auxiliary\Build\vcvars64.bat batch script (where %VS_PATH% is the location of Visual Studio on your system):

devenv /build Release aff3ct.sln /project INSTALL

Details

The installed package is organized as follow:

• bin/

  • aff3ct-M.m.p the AFF3CT executable binary.

• include/

  • aff3ct-M.m.p/ contains all the includes required by AFF3CT.

• lib/

  • libaff3ct-M.m.p.a the AFF3CT static library.

  • libaff3ct-M.m.p.so the AFF3CT shared library.

  • cmake/

    • aff3ct-M.m.p/ contains the CMake configuration files required to link with AFF3CT.

• share/

  • aff3ct-M.m.p

    • conf/ contains some input files to configure the AFF3CT simulator.
    • refs/ many results from AFF3CT simulations.
    • doc/ contains the AFF3CT documentation.

M stands for the major number of the version, m the minor number and p the id of the last patch.

Simulation

In this section, first an overview of the simulator capabilities is given, secondly the parameters of the simulator are describe and finally PyBER, a GUI tool dedicated to the display of BER/FER curves, is presented.

Overview

The AFF3CT toolbox comes with a simulator dedicated to the communication chains. The simulator focuses on the channel coding level. It can be used to reproduce/validate state-of-the-art BER/FER performances as well as an exploration tool to bench various configurations.

The AFF3CT simulator is based on a Monte Carlo method: the transmitter emits frames that are randomly noised by the channel and then the receiver try to decode the noised frames. The transmitter continues to emit frames until a fixed number of frame errors in achieved (typically 100 frame errors). A frame error occurs when the original frame from the transmitter differs from the the receiver decoded frame. As a consequence, when the SNR decreases, the number of frames to simulate increases as well as the simulation time.

Basic Arguments

The AFF3CT simulator is a command line program which can take many different arguments. The command line interface make possible to write scripts that run a battery of simulations for instance. Here is a minimalist command line using AFF3CT:

aff3ct -C "POLAR" -K 1723 -N 2048 -m 1.0 -M 4.0 -s 1.0

-C is a required parameter that defines the type of channel code that will be used in the communication chain (see the --sim-cde-type, -C section). -K is the number of information bits and -N is the frame size (bits transmitted over the channel). The Fig. 3.1 illustrates those parameters in a simplified communication chain.

Code-related parameters in the communication chain.

The simulator computes the BER and the FER for a SNR range (by default the SNR is \(E_b/N_0\) in dB). -m is the first SNR value to simulate with and -M is the last one (see the --sim-noise-min, -m and --sim-noise-max, -M sections for more information). -s is the step between each SNR (c.f. section --sim-noise-step, -s). The Fig. 3.2 shows the output BER for each simulated SNR values.

SNR-related parameters in the communication chain.

Output

The output of following command will look like:

aff3ct -C "POLAR" -K 1723 -N 2048 -m 1.0 -M 4.0 -s 1.0
# ----------------------------------------------------
# ---- A FAST FORWARD ERROR CORRECTION TOOLBOX >> ----
# ----------------------------------------------------
# Parameters :
# [...]
#
# The simulation is running...
# ---------------------||------------------------------------------------------||---------------------
#  Signal Noise Ratio  ||   Bit Error Rate (BER) and Frame Error Rate (FER)    ||  Global throughput
#         (SNR)        ||                                                      ||  and elapsed time
# ---------------------||------------------------------------------------------||---------------------
# ----------|----------||----------|----------|----------|----------|----------||----------|----------
#     Es/N0 |    Eb/N0 ||      FRA |       BE |       FE |      BER |      FER ||  SIM_THR |    ET/RT
#      (dB) |     (dB) ||          |          |          |          |          ||   (Mb/s) | (hhmmss)
# ----------|----------||----------|----------|----------|----------|----------||----------|----------
       0.25 |     1.00 ||      104 |    16425 |      104 | 9.17e-02 | 1.00e+00 ||    4.995 | 00h00'00
       1.25 |     2.00 ||      104 |    12285 |      104 | 6.86e-02 | 1.00e+00 ||   13.678 | 00h00'00
       2.25 |     3.00 ||      147 |     5600 |      102 | 2.21e-02 | 6.94e-01 ||   14.301 | 00h00'00
       3.25 |     4.00 ||     5055 |     2769 |      100 | 3.18e-04 | 1.98e-02 ||   30.382 | 00h00'00
# End of the simulation.

All the line beginning by the # character are intended present the simulation but there are not computational results. On the top, there is the list of the simulation parameters (above the # Parameters : line). After that, the simulation results are shown, each line corresponds to the decoding performance considering a given SNR. Each line is composed by the following columns:

• Es/N0: the SNR expressed as \(E_s/N_0\) in dB (c.f. the --sim-noise-type, -E section),
• Eb/N0: the SNR expressed as \(E_b/N_0\) in dB (c.f. the --sim-noise-type, -E section),
• FRA: the number of simulated frames,
• BE: the number of bit errors,
• FE: the number of frame errors (see the --mnt-max-fe, -e section if you want to modify it),
• BER: the bit error rate (\(BER = \frac{BE}{FRA \times K}\)),
• FER: the frame error rate (\(FER = \frac{FE}{FRA}\)),
• SIM_THR: the simulation throughput (\(SIM_{THR} = \frac{K \times FRA}{T}\) where \(T\) is the simulation time),
• ET/RT: during the computation of the point, this column displays an estimation of the remaining time (RT), once the computations are done this is the total elapsed time (ET).

Note

You may notice slightly different values in BER and FER columns if you run the command line on your computer. This is because the simulation is multi-threaded by default: the order of threads execution is not predictable. If you want to have reproducible results you can launch AFF3CT in mono-threaded mode (see the --sim-threads, -t section).

Philosophy

To understand the organization of the parameters in the simulator, it is important to be aware of the simulator structure. As illustrated in the Fig. 3.3, a simulation contains a set of modules (Source, Codec, Modem, Channel and Monitor in the example). A module can contain one or more tasks. For instance, the Source module contains only one task: generate(). In contrast, the Modem module contains two tasks: modulate() and demodulate(). A task can be assimilated to a process which is executed at runtime.

Modules and tasks of in the simulation.

Each module or task has its own set of arguments. Still, some of the arguments are common to several modules and tasks:

• --xxx-type is often used to define the type of each module: the type of modulation, channel or channel decoder,
• --xxx-implem specifies the type of implementation used. The keywords NAIVE or STD are often used to denote a readable but unoptimized source code, whereas FAST stands for a source code that is optimized for a high throughput and/or low latency.

Parameters

The AFF3CT simulator is highly customizable and contains many arguments classified in three categories:

Required:identified by the image, they are needed to launch a simulation. Optional:set up the simulation in many ways instead of the default configuration. Advanced:identified by the image, they lead to a more extensive use of the simulator.

Simulation parameters

The simulation parameters allow to customize the communication chain from an high level point of view. Various communication chain skeletons are available and can be selected as well as the channel code family to simulate, it is also possible to enable debug and benchmarking tools.

--sim-type

Type:text Allowed values:BFER BFERI EXIT Default:BFER Examples:--sim-type BFERI

Select the type of simulation (or communication chain skeleton).

Description of the allowed values:

Value	Description
BFER	The standard BER/FER chain (Fig. 3.4).
BFERI	The iterative BER/FER chain (Fig. 3.5).
EXIT	The EXIT chart simulation chain (not documented at this time).

The standard BER/FER chain.

The iterative BER/FER chain.

--sim-cde-type, -C

Type:text Allowed values:BCH LDPC POLAR RA REP RS RSC RSC_DB TURBO TURBO_DB TURBO_PROD UNCODED Examples:-C BCH

Select the channel code family to simulate.

Description of the allowed values:

Value	Description
BCH	The Bose–Chaudhuri–Hocquenghem codes [BRC60].
LDPC	The Low-Density Parity-Check codes [Gal63][MN95].
POLAR	The Polar codes [Ari09].
RA	The Repeat Accumulate codes [DHJM98].
REP	The Repetition codes [RL09].
RS	The Reed-Solomon codes [RS60].
RSC	The Recursive Systematic Convolutional codes [RL09].
RSC_DB	The Recursive Systematic Convolutional codes with double binary symbols [RL09].
TURBO	The Turbo codes [BGT93].
TURBO_DB	The Turbo codes with double binary symbols [BGT93].
TURBO_PROD	The Turbo Product codes [RL09].
UNCODED	An uncoded simulation.

Note

Only POLAR, RSC, RSC_DB, LDPC and UNCODED codes are available in BFERI simulation type.

--sim-prec, -p

Type:integer Default:32 Allowed values:8 16 32 64 Examples:--sim-prec 8

Specify the representation of the real numbers in the receiver part of the chain.

64-bit and 32-bit precisions imply a floating-point representation of the real numbers. 16-bit and 8-bit imply a fixed-point representation of the real numbers (see the Quantizer parameters to configure the quantization).

Description of the allowed values:

Value	Description
8	8-bit precision.
16	16-bit precision.
32	32-bit precision.
64	64-bit precision.

--sim-noise-type, -E

Type:text Allowed values:EBN0 ESN0 EP ROP Default:EBN0 Examples:-E EBN0

Select the type of noise used to simulate.

Description of the allowed values:

Value	Description
EBN0	SNR per information bit
ESN0	SNR per transmitted symbol
EP	Event Probability
ROP	Received Optical Power

ESN0 is automatically calculated from EBN0 and vice-versa with the following equation:

\(\frac{E_S}{N_0} = \frac{E_B}{N_0} + 10.\log(R.bps),\)

where \(R\) is the bit rate and \(bps\) the number of bits per symbol.

Note

When selecting EP the simulator runs in reverse order, ie. from the greatest event probability to the smallest one.

Hint

When selecting a BEC or BSC channel the EP noise type is automatically set except if you give another one. This is the same for the OPTICAL channel with the ROP noise type. The channel type is set with the --chn-type argument.

--sim-noise-min, -m

Type:real number Examples:-m 0.0

Set the minimal noise energy value to simulate.

Attention

This argument is another way to set the noise range to simulate. It is ignored or not required if the --sim-noise-range, -R argument is given, so you may find other piece of information in its description.

--sim-noise-max, -M

Type:real number Examples:-M 5.0

Set the maximal noise energy value to simulate.

Attention

This argument is another way to set the noise range to simulate. It is ignored or not required if the --sim-noise-range, -R argument is given, so you may find other piece of information in its description.

--sim-noise-step, -s

Type:real number Default:0.1 Examples:-s 1.0

Set the noise energy step between each simulation iteration.

Attention

This argument is another way to set the noise range to simulate. It is ignored or not required if the --sim-noise-range, -R argument is given, so you may find other piece of information in its description.

--sim-noise-range, -R

Type:MATLAB style vector Default:step of 0.1 Examples:-R "0.5:1,1:0.05:1.2,1.21"

Set the noise energy range to run in a MATLAB style vector.

The above example will run the following noise points:

0.5, 0.6, 0.7, 0.8, 0.9, 1.0, 1.05, 1.1, 1.15, 1.2, 1.21

Attention

The numerical range for a noise point is \(\left[-214.748; 213.952 \right]\) with a precision of \(10^{-7}\).

Note

If given, the --sim-noise-min, -m , --sim-noise-max, -M , and --sim-noise-step, -s parameters are ignored. But it is not required anymore if --sim-noise-min, -m and --sim-noise-max, -M are set.

--sim-pdf-path

Type:file Rights:read only Examples:--sim-pdf-path example/path/to/the/right/file

Give a file that contains PDF for different ROP.

To use with the OPTICAL channel. It sets the noise range from the given ones in the file. However, it is overwritten by --sim-noise-range, -R or limited by --sim-noise-min, -m and --sim-noise-max, -M with a minimum step of --sim-noise-step, -s between two values.

--sim-meta

Type:text Examples:--sim-meta "TITLE"

Add meta-data at the beginning of the AFF3CT standard output (INI format is used). The value of the parameter will be affected to the title meta-data and the command line will be added.

Note

PyBER, our GUI tool, can take advantage of those meta-data to enhance the display of the simulated curves.

--sim-coded

Enable the coded monitoring.

By default, in the simulation, the information bits are extracted from the decoded codewords and then they are compared to the initially generated information bits. When this parameter is enabled, the decoded codewords are directly compared with the initially encoded codewords.

Note

This parameter can have a negative impact on the BER performance.

Note

In some rare cases, to enable this parameter can reduce the simulation time.

--sim-coset, -c

Enable the coset approach.

The coset approach is a “trick” to simulate BER/FER performance without an encoder. It is based on the AZCW technique (see the --src-type parameter). In the specific case of modulation with memory effect, AZCWs can lead to erroneous BER/FER performance. The coset approach solves this problem by randomly generating N bits, those bits represent a frame but there are certainly not a codeword. Then, those random bits (or symbols) can be modulated avoiding AZCW unexpected effects. On the receiver side, the idea is to force the decoder to work on an AZCW (because the N received LLRs are not a valid codeword). Before the decoding process, knowing the initial bits sequence, when a bit is 1 then the corresponding input LLR is replaced by its opposite. This way, the decoder “believe” it is decoding an AZCW which is a valid codeword. After the decoding process, knowing the initial bits sequence, when a bit is 1, then the corresponding output bit is flipped.

--sim-dbg

Enable the debug mode. This print the input and the output frames after each task execution.

aff3ct -C "REP" -K 4 -N 8 -m 1.0 -M 1.0 --sim-dbg
# [...]
# Source_random::generate(int32 U_K[4])
# {OUT} U_K = [    1,     1,     0,     1]
# Returned status: 0
#
# Encoder_repetition_sys::encode(const int32 U_K[4], int32 X_N[8])
# {IN}  U_K = [    1,     1,     0,     1]
# {OUT} X_N = [    1,     1,     0,     1,     1,     1,     0,     1]
# Returned status: 0
#
# Modem_BPSK::modulate(const int32 X_N1[8], float32 X_N2[8])
# {IN}  X_N1 = [    1,     1,     0,     1,     1,     1,     0,     1]
# {OUT} X_N2 = [-1.00, -1.00,  1.00, -1.00, -1.00, -1.00,  1.00, -1.00]
# Returned status: 0
#
# Channel_AWGN_LLR::add_noise(const float32 X_N[8], float32 Y_N[8])
# {IN}  X_N = [-1.00, -1.00,  1.00, -1.00, -1.00, -1.00,  1.00, -1.00]
# {OUT} Y_N = [-0.29, -0.24,  1.55, -0.58, -0.33, -0.51,  0.80, -2.88]
# Returned status: 0
#
# Modem_BPSK::demodulate(const float32 Y_N1[8], float32 Y_N2[8])
# {IN}  Y_N1 = [-0.29, -0.24,  1.55, -0.58, -0.33, -0.51,  0.80, -2.88]
# {OUT} Y_N2 = [-0.73, -0.61,  3.91, -1.45, -0.84, -1.28,  2.01, -7.26]
# Returned status: 0
#
# Decoder_repetition_std::decode_siho(const float32 Y_N[8], int32 V_K[4])
# {IN}  Y_N = [-0.73, -0.61,  3.91, -1.45, -0.84, -1.28,  2.01, -7.26]
# {OUT} V_K = [    1,     1,     0,     1]
# Returned status: 0
#
# Monitor_BFER::check_errors(const int32 U[4], const int32 V[4])
# {IN}  U = [    1,     1,     0,     1]
# {IN}  V = [    1,     1,     0,     1]
# Returned status: 0
# [...]

Note

By default, the debug mode runs the simulation on one thread. It is strongly advise to remove the --sim-threads, -t parameter from your command line if you use it.

Hint

To limit the size of the debug trace, use the --mnt-max-fe, -e or --sim-max-fra, -n parameters to reduce the number of simulated frames. You may also think about using --sim-dbg-limit, -d when the frame size is too long to be display on a screen line.

--sim-dbg-hex

Enable the debug mode and print values in the hexadecimal format. This mode is useful for having a fully accurate representation of floating numbers.

aff3ct -C "REP" -K 4 -N 8 -m 1.0 -M 1.0 --sim-dbg-hex
# [...]
# Modem_BPSK::modulate(const int32 X_N1[8], float32 X_N2[8])
# {IN}  X_N1 = [0x1, 0x1, 0x0, 0x1, 0x1, 0x1, 0x0, 0x1]
# {OUT} X_N2 = [-0x1p+0, -0x1p+0, 0x1p+0, -0x1p+0, -0x1p+0, -0x1p+0, 0x1p+0, -0x1p+0]
# Returned status: 0
#
# Channel_AWGN_LLR::add_noise(const float32 X_N[8], float32 Y_N[8])
# {IN}  X_N = [-0x1p+0, -0x1p+0, 0x1p+0, -0x1p+0, -0x1p+0, -0x1p+0, 0x1p+0, -0x1p+0]
# {OUT} Y_N = [-0x1.28be1cp-2, -0x1.ec1ec8p-3, 0x1.8d242cp+0, -0x1.268a8p-1, -0x1.54c3ccp-2, -0x1.04df9ap-1, 0x1.9905f8p-1, -0x1.71132cp+1]
# Returned status: 0
# [...]

--sim-dbg-limit, -d

Type:integer Default:0 Examples:--sim-dbg-limit 1

Enable the debug mode and set the max number of elements to display per frame. 0 value means there is no dump limit.

aff3ct -C "REP" -K 4 -N 8 -m 1.0 -M 1.0 --sim-dbg-limit 3
# [...]
# Modem_BPSK::modulate(const int32 X_N1[8], float32 X_N2[8])
# {IN}  X_N1 = [    1,     1,     0, ...]
# {OUT} X_N2 = [-1.00, -1.00,  1.00, ...]
# Returned status: 0
#
# Channel_AWGN_LLR::add_noise(const float32 X_N[8], float32 Y_N[8])
# {IN}  X_N = [-1.00, -1.00,  1.00, ...]
# {OUT} Y_N = [-0.29, -0.24,  1.55, ...]
# Returned status: 0
# [...]

--sim-dbg-fra

Type:integer Default:0 Examples:--sim-dbg-fra 10

Enable the debug mode and set the max number of frames to display. 0 value means there is no frame limit. By default, a task works on one frame at a time.

This behavior can be overridden with the --src-fra, -F parameter and a task can be executed on many frames. In that case, you may want to reduce the number of displayed frames on screen:

aff3ct -C "REP" -K 4 -N 8 -m 1.0 -M 1.0 -F 8 --sim-dbg-fra 4
# [...]
# Modem_BPSK::modulate(const int32 X_N1[8x8], float32 X_N2[8x8])
# {IN}  X_N1 = [f1(    1,     1,     0,     1,     1,     1,     0,     1),
#               f2(    0,     1,     1,     0,     0,     1,     1,     0),
#               f3(    1,     0,     1,     1,     1,     0,     1,     1),
#               f4(    1,     0,     0,     0,     1,     0,     0,     0),
#               f5->f8:(...)]
# {OUT} X_N2 = [f1(-1.00, -1.00,  1.00, -1.00, -1.00, -1.00,  1.00, -1.00),
#               f2( 1.00, -1.00, -1.00,  1.00,  1.00, -1.00, -1.00,  1.00),
#               f3(-1.00,  1.00, -1.00, -1.00, -1.00,  1.00, -1.00, -1.00),
#               f4(-1.00,  1.00,  1.00,  1.00, -1.00,  1.00,  1.00,  1.00),
#               f5->f8:(...)]
# Returned status: 0
#
# Channel_AWGN_LLR::add_noise(const float32 X_N[8x8], float32 Y_N[8x8])
# {IN}  X_N = [f1(-1.00, -1.00,  1.00, -1.00, -1.00, -1.00,  1.00, -1.00),
#              f2( 1.00, -1.00, -1.00,  1.00,  1.00, -1.00, -1.00,  1.00),
#              f3(-1.00,  1.00, -1.00, -1.00, -1.00,  1.00, -1.00, -1.00),
#              f4(-1.00,  1.00,  1.00,  1.00, -1.00,  1.00,  1.00,  1.00),
#              f5->f8:(...)]
# {OUT} Y_N = [f1(-0.29, -0.24,  1.55, -0.58, -0.33, -0.51,  0.80, -2.88),
#              f2( 0.15, -0.71, -1.85,  1.69, -0.02, -0.50,  0.07,  0.79),
#              f3(-1.03,  1.39, -1.03, -2.03, -0.67,  0.91, -0.45, -0.88),
#              f4(-0.37, -1.07,  1.49,  0.94, -0.21,  1.35,  1.06,  0.97),
#              f5->f8:(...)]
# Returned status: 0
# [...]

--sim-dbg-prec

Type:integer Default:2 Examples:--sim-dbg-prec 1

Enable the debug mode and set the decimal precision (number of digits for the decimal part) of the floating-point elements.

aff3ct -C "REP" -K 4 -N 8 -m 1.0 -M 1.0 --sim-dbg-prec 4
# [...]
# Modem_BPSK::modulate(const int32 X_N1[8], float32 X_N2[8])
# {IN}  X_N1 = [      0,       0,       1,       1,       0,       0,       1,       1]
# {OUT} X_N2 = [ 1.0000,  1.0000, -1.0000, -1.0000,  1.0000,  1.0000, -1.0000, -1.0000]
# Returned status: 0
#
# Channel_AWGN_LLR::add_noise(const float32 X_N[8], float32 Y_N[8])
# {IN}  X_N = [ 1.0000,  1.0000, -1.0000, -1.0000,  1.0000,  1.0000, -1.0000, -1.0000]
# {OUT} Y_N = [ 1.4260,  0.4301, -1.5119,  0.1559,  0.0784,  1.6980, -1.6501, -0.0769]
# Returned status: 0
# [...]

--sim-seed, -S

Type:integer Default:0 Examples:--sim-seed 42

Set the PRNG seed used in the Monte Carlo simulation.

Note

AFF3CT uses PRNG to simulate the random. As a consequence the simulator behavior is reproducible from a run to another. It can be helpful to debug source code. However, when simulating in multi-threaded mode, the threads running order is not deterministic and so results will most likely be different from one execution to another.

--sim-stats

Display statistics for each task. Those statistics are shown after each simulated SNR point.

aff3ct -C "POLAR" -K 1723 -N 2048 -m 4.2 -M 4.2 -t 1 --sim-stats
# [...]
# -------------------------------------------||------------------------------||--------------------------------||--------------------------------
#        Statistics for the given task       ||       Basic statistics       ||       Measured throughput      ||        Measured latency
#     ('*' = any, '-' = same as previous)    ||          on the task         ||   considering the last socket  ||   considering the last socket
# -------------------------------------------||------------------------------||--------------------------------||--------------------------------
# -------------|-------------------|---------||----------|----------|--------||----------|----------|----------||----------|----------|----------
#       MODULE |              TASK |   TIMER ||    CALLS |     TIME |   PERC ||  AVERAGE |  MINIMUM |  MAXIMUM ||  AVERAGE |  MINIMUM |  MAXIMUM
#              |                   |         ||          |      (s) |    (%) ||   (Mb/s) |   (Mb/s) |   (Mb/s) ||     (us) |     (us) |     (us)
# -------------|-------------------|---------||----------|----------|--------||----------|----------|----------||----------|----------|----------
#      Channel |         add_noise |       * ||    14909 |     0.72 |  37.59 ||    42.17 |    20.75 |    45.52 ||    48.56 |    44.99 |    98.69
#       Source |          generate |       * ||    14909 |     0.60 |  31.13 ||    42.84 |     8.72 |    44.34 ||    40.22 |    38.86 |   197.63
#      Encoder |            encode |       * ||    14909 |     0.37 |  19.06 ||    83.17 |    16.00 |    86.10 ||    24.62 |    23.79 |   127.97
#      Decoder |       decode_siho |       * ||    14909 |     0.22 |  11.32 ||   117.80 |    36.67 |   126.75 ||    14.63 |    13.59 |    46.99
#      Monitor |      check_errors |       * ||    14909 |     0.01 |   0.42 ||  3186.81 |   120.63 |  3697.42 ||     0.54 |     0.47 |    14.28
#        Modem |        demodulate |       * ||    14909 |     0.00 |   0.25 ||  6350.57 |   160.24 |  7876.92 ||     0.32 |     0.26 |    12.78
#        Modem |          modulate |       * ||    14909 |     0.00 |   0.23 ||  6962.61 |   184.84 |  8291.50 ||     0.29 |     0.25 |    11.08
# -------------|-------------------|---------||----------|----------|--------||----------|----------|----------||----------|----------|----------
#        TOTAL |                 * |       * ||    14909 |     1.93 | 100.00 ||    13.34 |     3.38 |    14.10 ||   129.19 |   122.21 |   509.42
# [...]

Each line corresponds to a task. The tasks are sorted by execution time in the simulation (descending order). The first column group identifies the task:

• MODULE: the module type,
• TASK: the task name,
• TIMER: the name of the current task timer (it is possible to put timers inside a task to measure sub-parts of this task), * indicates that the whole task execution time is considered.

The second column group gives basic statistics:

• CALLS: the number of times this task has been executed,
• TIME: the cumulative time of all the task executions,
• PERC: the percentage of time taken by the task in the simulation.

The third column group shows the average, the minimum and the maximum throughputs. Those throughputs are calculated considering the size of the output frames. If the task does not have outputs (c.f the check_errors routine from the monitor) then the number of input bits is used instead. For instance, the encode task takes \(K\) input bits and produces \(N\) output bits, so \(N\) bits will be considered in the throughput computations.

The last column group shows the average, the minimum and the maximum latencies.

The TOTAL line corresponds to the full communication chain. For the throughput computations, the last socket of the last task determines the number of considered bits. In a standard BER/FER simulation the last task is the check_errors routine from the monitor and consequently the number of information bits (\(K\)) is considered. However, if the --sim-coded parameter is enabled, it becomes the codeword size (\(N\)).

Note

Enabling the statistics can increase the simulation time due the measures overhead. This is especially true when short frames are simulated.

Warning

In multi-threaded mode the reported time is the cumulative time of all the threads. This time is bigger than the real simulation time because it does not consider that many tasks have been executed in parallel.

Warning

The task throughputs will not increase with the number of threads: the statistics consider the performance on one thread.

--sim-threads, -t

Type:integer Default:0 Examples:--sim-threads 1

Specify the number of threads used in the simulation. The 0 default value will automatically set the number of threads to the hardware number of threads available on the machine.

Note

Monte Carlo methods are known to be embarrassingly parallel, which is why, in most cases, the simulation throughput will increase linearly with the number of threads (unless this number exceeds the number of cores available). However, in some cases, especially for large frames, when the number of threads is high, the memory footprint can exceeds the size of the CPU caches and it becomes less interesting to use a large number of threads.

--sim-crc-start

Type:integer Default:2 Examples:--sim-crc-start 1

Set the number of simulation iterations to proceed before starting the CRC checking in the turbo demodulation process. It reduces the number of false positive CRC detections.

Note

Available only for BFERI simulation type (c.f. the --sim-type parameter).

--sim-ite, -I

Type:integer Default:15 Examples:--sim-ite 10

Set the number of global iterations between the demodulator and the decoder.

Note

Available only for BFERI simulation type (c.f. the --sim-type parameter).

--sim-max-fra, -n

Type:integer Default:0 Examples:--sim-max-fra 1

Set the maximum number of frames to simulate per noise point. When a noise point reaches the maximum frame limit, the simulation is stopped. 0 value means no limit.

Note

The default behavior is to stop the simulator when the limit is reached but it is possible to override it with the --sim-crit-nostop parameter. In this case, the remaining noise points will also be simulated and the limit will be applied for each of them.

--sim-stop-time

Type:integer Default:0 Examples:--sim-stop-time 1

Set the maximum time (in seconds) to simulate per noise point. When a noise point reaches the maximum time limit, the simulation is stopped. 0 value means no limit.

Note

The default behavior is to stop the simulator when the limit is reached but it is possible to override it with the --sim-crit-nostop parameter. In this case, the remaining noise points will also be simulated and the limit will be applied for each of them.

--sim-crit-nostop

Stop only the current noise point instead of the whole simulation.

To combine with the --sim-max-fra, -n and/or the --sim-stop-time parameters.

--sim-err-trk

Track the erroneous frames. When an error is found, the information bits from the source, the codeword from the encoder and the applied noise from the channel are dumped in several files.

Tip

When working on the design of a new decoder or when improving an existing one, it can be very interesting to have a database of erroneous frames to work on (especially if those errors occur at low BER/FER when the simulation time is important). This way it is possible to focus only on those erroneous frames and quickly see if the decoder improvements have an impact on them. It is also interesting to be able to easily extract the erroneous frames from the simulator to characterize the type of errors and better understand why the decoder fails.

Note

See the --sim-err-trk-rev argument to replay the erroneous dumped frames.

--sim-err-trk-rev

Replay dumped frames. By default this option reverts the --sim-err-trk parameter by replaying the erroneous frames that have been dumped.

Tip

To play back the erroneous frames, just add -rev to the --sim-err-trk argument and change nothing else to your command line.

--sim-err-trk-path

Type:file Rights:read/write Default:error_tracker Examples:--sim-err-trk-path errors/err

Specify the base path for the --sim-err-trk and --sim-err-trk-rev parameters.

For the above example, the dumped or read files will be:

• errors/err_0.64.src
• errors/err_0.64.enc
• errors/err_0.64.chn

Note

For SNR noise type, the value used to define the filename is the noise variance \(\sigma\).

Danger

Be careful, if you give a wrong path you will not have a warning message at the beginning of the simulation. It can be frustrating when running a very long simulation…

--sim-err-trk-thold

Type:integer Default:0 Examples:--sim-err-trk-thold 1

Specify a threshold value in number of erroneous bits before which a frame is dumped.

References

[Ari09]

E. Arikan. Channel polarization: a method for constructing capacity-achieving codes for symmetric binary-input memoryless channels. IEEE Transactions on Information Theory (TIT), 55(7):3051–3073, July 2009. doi:10.1109/TIT.2009.2021379.

[BGT93]

(1, 2) C. Berrou, A. Glavieux, and P. Thitimajshima. Near Shannon limit error-correcting coding and decoding: turbo-codes. In International Conference on Communications (ICC), volume 2, 1064–1070 vol.2. IEEE, May 1993. doi:10.1109/ICC.1993.397441.

[BRC60]

R.C. Bose and D.K. Ray-Chaudhuri. On a class of error correcting binary group codes. Springer Information and Control, 3(1):68 – 79, 1960. doi:10.1016/S0019-9958(60)90287-4.

[DHJM98]

D. Divsalar, H. Jin, and R. J. McEliece. Coding theorems for “turbo-like” codes. In Allerton Conference on Communication, Control and Computing, 201–210. September 1998. URL: https://pdfs.semanticscholar.org/b5cc/c94d4f9ea6df991190f17359ddd7ac47f005.pdf.

[Gal63]

R. G. Gallager. Low-density parity-check codes. 1963. URL: http://web.mit.edu/gallager/www/pages/ldpc.pdf.

[MN95]

D. J. C. MacKay and R. M. Neal. Good codes based on very sparse matrices. In IMA International Conference on Cryptography and Coding (IMA-CCC), 100–111. UK, December 1995. Springer. doi:10.1007/3-540-60693-9_13.

[RS60]

I. Reed and G. Solomon. Polynomial codes over certain finite fields. Journal of the Society for Industrial and Applied Mathematics, 8(2):300–304, 1960. doi:10.1137/0108018.

[RL09]

(1, 2, 3, 4) W. Ryan and S. Lin. Channel codes: classical and modern. Cambridge University Press, September 2009. ISBN 978-0-511-64182-4. URL: http://www.cambridge.org/9780521848688.

Source parameters

The source generates \(K\) information bits: it is the simulation starting point.

--src-info-bits, -K

Type:integer Examples:--src-info-bits 64 -K 128

Select the number of information bits \(K\).

Warning

This argument is required only with the UNCODED simulation code type (cf. the --sim-cde-type, -C parameter).

--src-type

Type:text Allowed values:AZCW RAND USER Default:RAND Examples:--src-type AZCW

Method used to generate the \(K\) information bits.

Description of the allowed values:

Value	Description
AZCW	Set all the information bits to 0.
RAND	Generate randomly the information bits based on the MT 19937 PRNG [MN98].
USER	Read the information bits from a given file, the path can be set with the --src-path parameter.

Note

For the USER type, when the number of simulated frames exceeds the number of frames contained in the files, the frames are replayed from the beginning of the file and this is repeated until the end of the simulation.

--src-implem

Type:text Allowed values:FAST STD Default:STD Examples:--src-implem FAST

Select the implementation of the algorithm to generate the information bits.

Description of the allowed values:

Value	Description
STD	Standard implementation working for any source type.
FAST	Fast implementation, only available for the RAND source type.

--src-fra, -F

Type:integer Default:1 Examples:--src-fra 8

Set the number of frames to process for each task execution.

The default behavior is to generate one frame at a time. This parameter enables to process more than one frame when the generate task (from the source module) is called.

The number of frames consumed and produced when a task is executed is called the inter frame level or IFL. Setting the IFL in the source module will automatically affect the IFL level in all the other simulation modules (c.f. Fig. 3.6).

3-way inter frame level in the communication chain.

The IFL also allows multi-user configurations to be simulated (see Fig. 3.7). This configurations is used when using SCMA modulation (see the --mdm-type SCMA parameter).

3-way inter frame level with multi-user channel in the communication chain.

Note

For short frames, increase the IFL can increase the simulation throughput, it can hide task call overheads.

Note

For large frames, increase the IFL can decrease the simulation throughput due the CPU cache size limitation.

--src-path

Type:file Rights:read only Examples:--src-path conf/src/GSM-LDPC_2112.src

Set the path to a file containing one or more frames (informations bits), to use with the USER source type.

An ASCII file is expected:

# 'F' has to be replaced by the number of contained frames.
F

# 'K' has to be replaced by the number of information bits.
K

# a sequence of 'F * K' bits (separated by spaces)
B_0 B_1 B_2 B_3 B_4 B_5 [...] B_{(F*K)-1}

--src-start-idx

Type:integer Default:0 Examples:--src-start-idx 42

Give the start index to use in the USER source type. It is the index of the first frame to read from the given file.

References

[MN98]

M. Matsumoto and T. Nishimura. Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator. ACM Transactions on Modeling and Computer Simulation (TOMACS), 8(1):3–30, 1998. doi:10.1145/272991.272995.

CRC parameters

The following parameters concern the Cyclic Redundancy Check (CRC) module. CRC bits can be concatenated to the information bits in order to help the decoding process to know if the decoded bit sequence is valid or not.

Note

The CRC is only available for some specific decoders that have been designed to take advantage of the CRC like in [LST12][TLLeGal+16].

Warning

Using a CRC does not guarantee to know if the decoded frame is the good one, it can be a false positive. It is important to adapt the size of the CRC with the frame size and the targeted FER.

--crc-type, --crc-poly

Type:text Default:NO Examples:

--crc-type "32-GZIP"

--crc-poly "0x04C11DB7" --crc-size 32

Select the CRC type you want to use among the predefined (or not) polynomials.

Table 3.1 shows a list of the predefined polynomials. If you want a specific polynomial that it is not available in the table you can directly put the polynomial in hexadecimal. In this case you have to specify explicitly the size of the polynomial with the --crc-size parameter. The type NO deactivates the CRC.

List of the predefined CRC polynomials.

Type	Polynomial	Size
32-GZIP	0x04C11DB7	32
32-CASTAGNOLI	0x1EDC6F41	32
32-AIXM	0x814141AB	32
32-KOOPMAN	0x32583499	32
30-CDMA	0x2030B9C7	30
24-LTEA	0x864CFB	24
24-RADIX-64	0x864CFB	24
24-FLEXRAY	0x5D6DCB	24
21-CAN	0x102899	21
17-CAN	0x1685B	17
16-IBM	0x8005	16
16-CCITT	0x1021	16
16-PROFIBUS	0x1DCF	16
16-OPENSAFETY-B	0x755B	16
16-OPENSAFETY-A	0x5935	16
16-DNP	0x3D65	16
16-T10-DIF	0x8BB7	16
16-DECT	0x0589	16
16-CDMA2000	0xC867	16
16-ARINC	0xA02B	16
16-CHAKRAVARTY	0x2F15	16
15-MPT1327	0x6815	15
15-CAN	0x4599	15
14-DARC	0x0805	14
13-BBC	0x1CF5	13
12-CDMA2000	0xF13	12
12-TELECOM	0x80F	12
11-FLEXRAY	0x385	11
10-CDMA2000	0x3D9	10
10-ATM	0x233	10
8-WCDMA	0x9B	8
8-SAE-J1850	0x1D	8
8-DARC	0x39	8
8-DALLAS	0x31	8
8-CCITT	0x07	8
8-AUTOSAR	0x2F	8
8-DVB-S2	0xD5	8
7-MVB	0x65	7
7-MMC	0x09	7
6-CDMA2000-A	0x27	6
6-CDMA2000-B	0x07	6
6-DARC	0x19	6
6-ITU	0x03	6
5-ITU	0x15	5
5-EPC	0x09	5
5-USB	0x05	5
4-ITU	0x3	4
1-PAR	0x1	1

--crc-size

Type:integer Range:\(]0 \to \infty[\) Examples:--crc-size 8

Size the CRC (divisor size in bits minus one), required if you selected an unknown CRC.

--crc-implem

Type:text Allowed values:STD FAST INTER Default:FAST Examples:--crc-implem FAST

Select the CRC implementation you want to use.

Description of the allowed values:

Value	Description
STD	The standard implementation is generic and support any size of CRCs. On the other hand the throughput is limited.
FAST	This implementation is much faster than the standard one. This speedup is achieved thanks to the bit packing technique: up to 32 bits can be computed in parallel. This implementation does not support polynomials higher than 32 bits.
INTER	The inter-frame implementation should not be used in general cases. It allow to compute the CRC on many frames in parallel that have been reordered.

References

[LST12]

B. Li, H. Shen, and D. Tse. An adaptive successive cancellation list decoder for polar codes with cyclic redundancy check. IEEE Communications Letters (COMML), 16(12):2044–2047, December 2012. doi:10.1109/LCOMM.2012.111612.121898.

[TLLeGal+16]

T. Tonnellier, C. Leroux, B. Le Gal, B. Gadat, C. Jégo, and N. Van Wambeke. Lowering the error floor of turbo codes with CRC verification. IEEE Wireless Communications Letters (WCL), 5(4):404–407, August 2016. doi:10.1109/LWC.2016.2571283.

Codec parameters

Codec Common

Common Encoder parameters

This section describes the parameters common to all encoders.

--enc-type

Type:text Allowed values:NO AZCW COSET USER Examples:--enc-type AZCW

Select the encoder type.

Description of the allowed values:

Value	Description
AZCW	Select the AZCW encoder which is optimized to encode \(K\) information bits all set to 0.
COSET	Select the coset encoder (see the --sim-coset, -c parameter), this encoder add random bits from \(X_K\) to \(X_N\).
USER	Read the codewords from a given file, the path can be set with the --enc-path parameter.

Tip

The AZCW encoder allows to have a working communication chain without implementing an encoder. This technique can also reduce the simulation time especially when the encode task is time consuming.

Danger

Be careful, the AZCW technique can lead to unexpected behaviors with broken decoders.

Note

Only use the COSET encoder if know what you are doing. This encoder is set by default when the simulation is run with the --sim-coset, -c parameter.

Note

For the USER type, when the number of simulated frames exceeds the number of codewords contained in the files, the codewords are replayed from the beginning of the file and this is repeated until the end of the simulation.

--enc-path

Type:file Rights:read only Examples:--enc-path example/path/to/the/right/file

Set the path to a file containing one or more codewords, to use with the USER encoder.

An ASCII file is expected:

# 'F' has to be replaced by the number of contained frames.
F

# 'N' has to be replaced by the codeword size.
N

# a sequence of 'F * N' bits (separated by spaces)
B_0 B_1 B_2 B_3 B_4 B_5 [...] B_{(F*N)-1}

--enc-start-idx

Type:integer Examples:--enc-start-idx 1

Give the start index to use in the USER encoder. It is the index of the first codeword to read from the given file.

Common Decoder parameters

This section describes the parameters common to all decoders.

--dec-type, -D

Type:text Allowed values:CHASE ML Examples:--dec-type ML

Select the decoder algorithm.

Description of the allowed values:

Value	Description
CHASE	Select the Chase decoder from [Cha72].
ML	Select the perfect ML decoder.

Note

The Chase and the ML decoders have a very high computationnal complexity and cannot be use for large frames.

--dec-implem

Type:text Allowed values:NAIVE STD Examples:--dec-implem STD

Select the implementation of the decoder algorithm.

Description of the allowed values:

Value	Description
NAIVE	Select the naive implementation (very slow and only available for the ML decoder).
STD	Select the standard implementation.

--dec-flips

Type:integer Examples:--dec-flips 1

Set the maximum number of bit flips in the Chase decoder.

--dec-hamming

Compute the Hamming distance instead of the Euclidean distance in the ML and Chase decoders.

Note

Using the Hamming distance will heavily degrade the BER/FER performances. The BER/FER performances will be the same as an hard input decoder.

--dec-seed

Type:integer Examples:--dec-seed 1

Specify the decoder PRNG seed (if the decoder uses one).

References

[Cha72]

D. Chase. Class of algorithms for decoding block codes with channel measurement information. IEEE Transactions on Information Theory (TIT), 18(1):170–182, January 1972. doi:10.1109/TIT.1972.1054746.

Codec BCH

BCH Encoder parameters

--enc-cw-size, -N

Type:integer Examples:--enc-cw-size 127

Set the codeword size \(N\).

\(N = 2^m – 1\), where \(m\) is an integer from 3.

--enc-info-bits, -K

Type:integer Examples:--enc-info-bits 92

Set the number of information bits \(K\).

This argument is not required if --dec-corr-pow, -T is given, as it is calculated automatically.

--enc-type

Type:text Allowed values:BCH AZCW COSET USER Default:BCH Examples:--enc-type AZCW

Select the encoder type.

Description of the allowed values:

Value	Description
BCH	Select the standard BCH encoder.
AZCW	See the common --enc-type parameter.
COSET	See the common --enc-type parameter.
USER	See the common --enc-type parameter.

BCH Decoder parameters

--dec-type, -D

Type:text Allowed values:ALGEBRAIC CHASE ML Default:ALGEBRAIC Examples:--dec-type ALGEBRAIC

Select the decoder algorithm.

Description of the allowed values:

Value	Description
ALGEBRAIC	Select the Berlekamp-Massey algorithm [Ber15][Mas69] followed by a Chien search [Chi64].
CHASE	See the common --dec-type, -D parameter.
ML	See the common --dec-type, -D parameter.

--dec-implem

Type:text Allowed values:FAST GENIUS STD Default:STD Examples:--dec-implem FAST

Select the implementation of the decoder algorithm.

Description of the allowed values:

Value	Description
STD	A standard implementation of the BCH.
FAST	Select the fast implementation optimized for SIMD architectures.
GENIUS	A really fast implementation that compare the input to the original codeword and correct it only when the number of errors is less or equal to the BCH correction power.

Note

In the STD implementation, the Chien search finds roots of the error location polynomial. If the number of found roots does not match the number of found errors by the BM algorithm, then the frame is not modified.

However, in the FAST implementation the correction of the bits is done at the same time as the execution of the Chien search. Then when the latter fails, the frame can be modified.

Note

When a frame is very corrupted and when the above STD and FAST implementations can be wrong in the correction by converging to another codeword, the GENIUS implementation cannot fail. Results may then differ from a real word implementation.

--dec-corr-pow, -T

Type:integer Default:5 Examples:--dec-corr-pow 18

Set the correction power of the BCH decoder. This value corresponds to the number of errors that the decoder is able to correct.

References

[Ber15]

E. R. Berlekamp. Algebraic Coding Theory (Revised Edition). World Scientific, May 2015. First edition from 1968. doi:10.1142/9407.

[Chi64]

R. Chien. Cyclic decoding procedures for bose- chaudhuri-hocquenghem codes. IEEE Transactions on Information Theory (TIT), 10(1):357–363, October 1964. doi:10.1109/TIT.1964.1053699.

[Mas69]

J. Massey. Shift-register synthesis and bch decoding. IEEE Transactions on Information Theory (TIT), 15(1):122–127, January 1969. doi:10.1109/TIT.1969.1054260.

Codec LDPC

LDPC Encoder parameters

--enc-cw-size, -N

Type:integer Examples:--enc-cw-size 1024

Set the codeword size \(N\).

Note

This parameter value is automatically deduced if the \(H\) parity matrix is given with the --dec-h-path parameter or if the \(G\) generator matrix is given with the --enc-g-path parameter.

--enc-info-bits, -K

Type:integer Examples:--enc-info-bits 512

Set the number of information bits \(K\).

Note

This parameter value is automatically deduced if the \(G\) generator matrix is given with the --enc-g-path parameter.

Note

In some cases, this parameter value can be automatically deduced if the \(H\) parity matrix is given with the --dec-h-path parameter. For regular matrices, \(K = N - M\) where \(N\) and \(M\) are the \(H\) parity matrix dimensions. For non-regular matrices, \(K\) has to be given.

--enc-type

Type:text Allowed values:LDPC LDPC_H LDPC_DVBS2 LDPC_IRA LDPC_QC AZCW COSET USER Default:AZCW Examples:--enc-type AZCW

Select the encoder type.

Description of the allowed values:

Value	Description
LDPC	Select the generic encoder that encode from a given \(G\) generator matrix (to use with the --enc-g-path parameter).
LDPC_H	Build the \(G\) generator matrix from the given \(H\) parity matrix and then encode with the LDPC method (to use with the --dec-h-path parameter).
LDPC_DVBS2	Select the optimized encoding process for the DVB-S2 \(H\) matrices (to use with the --enc-cw-size, -N and --enc-info-bits, -K parameters).
LDPC_IRA	Select the optimized encoding process for the IRA \(H\) parity matrices (to use with the --dec-h-path parameter).
LDPC_QC	Select the optimized encoding process for the QC \(H\) parity matrices (to use with the --dec-h-path parameter).
AZCW	See the common --enc-type parameter.
COSET	See the common --enc-type parameter.
USER	See the common --enc-type parameter.

Note

The LDPC_DVBS2 encoder type allow the simulation of the DVB-S2 standard but without the BCH code. All matrices described by the standard (Tables 5a/5b page 22-23) are available. You just need to give to the arguments --enc-info-bits, -K and --enc-cw-size, -N the real \(K\) and \(N\) LDPC dimensions, respectively.

--enc-g-path

Type:file Rights:read only Examples:--enc-g-path example/path/to/the/G_matrix.alist

Give the path to the \(G\) generator matrix in an AList or QC formated file.

--enc-g-method

Type:text Allowed values:IDENTITY LU_DEC Default:IDENTITY Examples:--enc-g-method IDENTITY

Specify the method used to build the \(G\) generator matrix from the \(H\) parity matrix when using the LDPC_H encoder.

Description of the allowed values:

Value	Description
IDENTITY	Generate an identity on \(H\) to get the parity part.
LU_DEC	Generate a hollow \(G\) thanks to the LU decomposition with a guarantee to have the systematic identity. Do not work with irregular matrices.

LU_DEC method is faster than IDENTITY.

--enc-g-save-path

Type:file Rights:write only Examples:--enc-g-save-path example/path/to/the/generated/G_matrix.alist

Set the file path where the \(G\) generator matrix will be saved (AList file format). To use with the LDPC_H encoder.

Hint

When running the LDPC_H encoder, the generation of the \(G\) matrix can take a non-negligible part of the simulation time. With this option the \(G\) matrix can be saved once for all and used in the standard LDPC decoder after.

Warning

This option is not thread-safe, please run it on a single thread with the --sim-threads, -t parameter.

LDPC Decoder parameters

--dec-h-path

Type:file Rights:read only Examples:--dec-h-path conf/dec/LDPC/AR4JA_4096_8192.qc --dec-h-path conf/dec/LDPC/MACKAY_504_1008.alist

Give the path to the \(H\) parity matrix. Support the AList and the QC formats.

This argument is not required if the encoder type --enc-type is LDPC_DVBS2.

For the AList format, an ASCII file composed by positive integers is expected:

# -- Part 1 --
# 'nVN' is the total number of variable nodes and 'nCN' is the total number of check nodes
nVN nCN
# 'dmax_VN' is the higher variable node degree and 'dmax_CN' is the higher check node degree
dmax_VN dmax_CN
# list of the degrees for each variable nodes
d_VN_{1} d_VN_{2} [...] d_VN_{nVN}
# list of the degrees for each check nodes
d_CN_{1} d_CN_{2} [...] d_CN_{nCN}
#
# -- Part 2 --
# each following line describes the check nodes connected to a variable node, the first
# check node index is '1' (and not '0')
# variable node '1'
VN_{1}_CN_{idx_1} [...] VN_{1}_CN_{idx_d_VN_{1}}
# variable node '2'
VN_{2}_CN_{idx_1} [...] VN_{2}_CN_{idx_d_VN_{2}}
[...]
# variable node 'nVN'
VN_{nVN}_CN_{idx_1} [...] VN_{nVN}_CN_{idx_d_VN_{nVN}}
#
# -- Part 3 --
# each following line describes the variables nodes connected to a check node, the first
# variable node index is '1' (and not '0')
# check node '1'
CN_{1}_VN_{idx_1} [...] CN_{1}_VN_{idx_d_CN_{1}}
# check node '2'
CN_{2}_VN_{idx_1} [...] CN_{2}_VN_{idx_d_CN_{2}}
[...]
# check node 'nCN'
CN_{nCN}_VN_{idx_1} [...] CN_{nCN}_VN_{idx_d_CN_{nCN}}

In the part 2 and 3, it is possible to pad, at the end of the indexes list, with zeros when the current node degree is smaller than the maximum node degree. AFF3CT will be able to read the file even if it is padded with zeros.

For the QC format, an ASCII file composed by integers is expected:

# 'C' is the number of columns (there is 'C * Z' variable nodes)
# 'R' is the number of rows (there is 'R * Z' check nodes)
# 'Z' is the expansion factor
C R Z

# each 'B_r_{y}_c_{x}' is a sub-matrix bloc of size 'Z * Z'
# 'B_r_{y}_c_{x} = -1' means a zero matrix
# 'B_r_{y}_c_{x} = 0' means an identity matrix
# 'B_r_{y}_c_{x} = s' with 's' between '1' and 'Z-1' means an identity matrix shifted 's' times
#                     to the right
B_r_{1}_c_{1} B_r_{1}_c_{2} [...] B_r_{1}_c_{C}
B_r_{2}_c_{1} B_r_{2}_c_{2} [...] B_r_{2}_c_{C}
[...]
B_r_{R}_c_{1} B_r_{R}_c_{2} [...] B_r_{R}_c_{C}

# puncturing pattern (optional)
# 'T_c_{x}' can be '0' or '1'
#  - if 'T_c_{x} = 0', does not transmit the 'Z' consecutive bits
#  - if 'T_c_{x} = 1', transmits the 'Z' consecutive bits
T_c_{1} T_c_{2} [...] T_c_{C}

--dec-type, -D

Type:text Allowed values:BIT_FLIPPING BP_PEELING BP_FLOODING BP_HORIZONTAL_LAYERED BP_VERTICAL_LAYERED CHASE ML Default:BP_FLOODING Examples:--dec-type BP_HORIZONTAL_LAYERED

Select the decoder algorithm.

Description of the allowed values:

Value	Description
BIT_FLIPPING	Select the BF category of algorithms.
BP_PEELING	Select the BP-P algorithm from [Spi01].
BP_FLOODING	Select the BP-F algorithm from [MN95].
BP_HORIZONTAL_LAYERED	Select the BP-HL algorithm from [YPNA01].
BP_VERTICAL_LAYERED	Select the BP-VL algorithm from [ZF02].
CHASE	See the common --dec-type, -D parameter.
ML	See the common --dec-type, -D parameter.

--dec-implem

Type:text Allowed values:STD GALA GALB GALE WBF PPBF SPA LSPA AMS MS NMS OMS Default:SPA Examples:--dec-implem AMS

Select the implementation of the decoder algorithm.

Description of the allowed values:

Value	Description
STD	Select the STD implementation.
GALA	Select the GALA algorithm [RL09].
GALB	Select the GALB algorithm [DDB14] with majority vote.
GALE	Select the GALE algorithm [DDB14] with extended alphabet.
PPBF	Select the PPBF algorithm [LGK+19].
WBF	Select the WBF algorithm [WNY+10].
SPA	Select the SPA update rules [MN95].
LSPA	Select the LSPA update rules [MN95].
AMS	Select the AMS update rule.
MS	Select the MS update rule [FMI99].
NMS	Select the NMS update rule [CF02].
OMS	Select the OMS update rule [CF02].

Table 3.2 shows the different decoder types and their corresponding available implementations.

LDPC decoder types and available implementations.

Decoder	STD	GALA	GALB	GALE	PPBF	WBF	SPA	LSPA	AMS	MS	NMS	OMS
BF					\(\checkmark\)	\(\checkmark\)
BP-P	\(\checkmark\)
BP-F		\(\checkmark\)	\(\checkmark\)	\(\checkmark\)			\(\checkmark^{**+}\)	\(\checkmark^{**}\)	\(\checkmark^{**}\)	\(\checkmark^{**}\)	\(\checkmark^{**}\)	\(\checkmark^{**}\)
BP-HL							\(\checkmark^{**}\)	\(\checkmark^{**}\)	\(\checkmark^{**}\)	\(\checkmark^{*}\)	\(\checkmark^{*}\)	\(\checkmark^{*}\)
BP-VL							\(\checkmark^{**}\)	\(\checkmark^{**}\)	\(\checkmark^{**}\)	\(\checkmark^{**}\)	\(\checkmark^{**}\)	\(\checkmark^{**}\)

\(^{*}/^{**}\): compatible with the --dec-simd INTER parameter.

\(^{**}\): require the C++ compiler to support the dynamic memory allocation for over-aligned data, see the P0035R4 paper. This feature is a part of the C++17 standard (working on the C++ GNU compiler version 8.1.0). When compiling with the GNU compiler in C++11 mode, the -faligned-new option enables specifically the required feature.

\(^{+}\): compatible with the --dec-simd INTRA parameter.

--dec-simd

Type:text Allowed values:INTER Examples:--dec-simd INTER

Select the SIMD strategy.

Table 3.2 shows the decoders and implementations that support SIMD.

Description of the allowed values:

Value	Description
INTRA	Select the intra-frame strategy.
INTER	Select the inter-frame strategy.

Note

In the intra-frame strategy, SIMD units process several LLRs in parallel within a single frame decoding. In the inter-frame strategy, SIMD units decodes several independent frames in parallel in order to saturate the SIMD unit. This approach improves the throughput of the decoder but requires to load several frames before starting to decode, increasing both the decoding latency and the decoder memory footprint.

Note

When the inter-frame SIMD strategy is set, the simulator will run with the right number of frames depending on the SIMD length. This number of frames can be manually set with the --src-fra, -F parameter. Be aware that running the simulator with the --src-fra, -F parameter set to 1 and the --dec-simd parameter set to INTER will completely be counterproductive and will lead to no throughput improvements.

--dec-h-reorder

Type:text Allowed values:ASC DSC NONE Default:NONE Examples:--dec-h-reorder ASC

Specify the order of execution of the CNs in the decoding process depending on their degree.

The degree of a CN is the number of VNs that are connected to it.

Description of the allowed values:

Value	Description
ASC	Reorder from the smallest CNs degree to the biggest CNs degree.
DSC	Reorder from the biggest CNs degree to the smallest CNs degree.
NONE	Do not change the order.

--dec-ite, -i

Type:integer Default:10 Examples:--dec-ite 30

Set the maximal number of iterations in the LDPC decoder.

Note

By default, in order to speedup the decoding time, the decoder can stop the decoding process if all the parity check equations are verified (also called the syndrome detection). In that case the decoder can perform less decoding iterations than the given number. To force the decoder to make all the iterations, use the --dec-no-synd parameter.

--dec-min

Type:text Allowed values:MIN MINL MINS Default:MINL Examples:--dec-min MIN

Define the \(\min^*\) operator approximation used in the AMS update rule.

Description of the allowed values:

Value	Description
MINS	\(\min^*(a,b) = \min(a,b) + \log(1 + \exp(-(a + b))) - \log(1 + \exp(-|a - b|))\).
MINL	\(\min^*(a,b) \approx \min(a,b) + corr(a + b) - corr(|a + b|)\) with \(corr(x) = \begin{cases} 0 & \text{if } x >= 2.625\\ -0.375 x + 0.6825 & \text{if } x < 1.0 \\ -0.1875 x + 0.5 & \text{else} \end{cases}\).
MIN	\(\min^*(a,b) \approx \min(a,b)\).

MINS for Min Star is the exact \(\min^*\) operator. MINL for Min Linear is a linear approximation of the \(\min^*\) function. MIN for Min is the simplest approximation with only a \(\min\) function.

--dec-norm

Type:real number Default:1.0 Examples:--dec-norm 0.75

Set the normalization factor used in the NMS update rule.

--dec-off

Type:real number Default:0.0 Examples:--dec-off 0.25

Set the offset used in the OMS update rule.

--dec-mwbf

Type:real number Default:0.0 Examples:--dec-mwbf 1.0

Give the factor used in the modified WBF algorithm. Set to 0 for basic WBF algorithm.

--dec-synd-depth

Type:integer Default:1 Examples:--dec-synd-depth 2

Set the number of iterations to process before enabling the syndrome detection. In some cases, it can help to avoid false positive detections.

--dec-ppbf-proba

Type:list of real numbers Examples:--dec-ppbf-proba "0,0.001,0.1,0.3,1,1,1"

Give the probabilities of the Bernouilli distribution of the PPBF. The number of given values must be equal to the biggest variable node degree plus two.

Thus, with a parity matrix that has its largest variable node at 5, you must give 7 values. Each value corresponds to an energy level as described in [LGK+19].

--dec-no-synd

Disable the syndrome detection, all the LDPC decoding iterations will be performed.

References

[CF02]

(1, 2) J. Chen and M. P. C. Fossorier. Density evolution for two improved bp-based decoding algorithms of ldpc codes. IEEE Communications Letters (COMML), 6(5):208–210, May 2002. doi:10.1109/4234.1001666.

[DDB14]

(1, 2) M. Fossorier D. Declerq and E. Biglieri. Channel Coding: Theory, Algorithms, and Applications. Academic Press, 2014. ISBN 978-0-12-396499-1. doi:10.1016/C2011-0-07211-3.

[FMI99]

M. P. C. Fossorier, M. Mihaljevic, and H. Imai. Reduced complexity iterative decoding of low-density parity check codes based on belief propagation. IEEE Transactions on Communications (TCOM), 47(5):673–680, May 1999. doi:10.1109/26.768759.

[LGK+19]

(1, 2) K. Le, F. Ghaffari, L. Kessal, D. Declercq, E. Boutillon, C. Winstead, and B. Vasić. A probabilistic parallel bit-flipping decoder for low-density parity-check codes. IEEE Transactions on Circuits and Systems I: Regular Papers, 66(1):403–416, Jan 2019. doi:10.1109/TCSI.2018.2849679.

[MN95]

(1, 2, 3) D. J. C. MacKay and R. M. Neal. Good codes based on very sparse matrices. In IMA International Conference on Cryptography and Coding (IMA-CCC), 100–111. UK, December 1995. Springer. doi:10.1007/3-540-60693-9_13.

[RL09]

W. Ryan and S. Lin. Channel codes: classical and modern. Cambridge University Press, September 2009. ISBN 978-0-511-64182-4. URL: http://www.cambridge.org/9780521848688.

[Spi01]

M.G. Luby ; M. Mitzenmacher ; M.A. Shokrollahi ; D.A. Spielman. Efficient erasure correcting codes. IEEE Transactions on Information Theory (TIT), 47(2):569 – 584, February 2001. doi:10.1109/18.910575.

[WNY+10]

T. Wadayama, K. Nakamura, M. Yagita, Y. Funahashi, S. Usami, and I. Takumi. Gradient descent bit flipping algorithms for decoding ldpc codes. IEEE Transactions on Communications (TCOM), 58(6):1610–1614, June 2010. doi:10.1109/TCOMM.2010.06.090046.

[YPNA01]

E. Yeo, P. Pakzad, B. Nikolic, and V. Anantharam. High throughput low-density parity-check decoder architectures. In Global Communications Conference (GLOBECOM), volume 5, 3019–3024 vol.5. IEEE, 2001. doi:10.1109/GLOCOM.2001.965981.

[ZF02]

J. Zhang and M. Fossorier. Shuffled belief propagation decoding. In Asilomar Conference on Signals, Systems, and Computers (ACSSC), volume 1, 8–15 vol.1. IEEE, November 2002. doi:10.1109/ACSSC.2002.1197141.

LDPC Puncturer parameters

--pct-fra-size, -N

Type:integer Examples:--pct-fra-size 912

Set the frame size \(N\). This is not necessarily the codeword size if a puncturing pattern is used.

--pct-type

Type:text Allowed values:LDPC NO Default:LDPC Examples:--pct-type LDPC

Select the puncturer type.

Description of the allowed values:

Value	Description
NO	Disable the puncturer.
LDPC	Puncture the LDPC codeword.

--pct-pattern

Type:binary vector Examples:--pct-pattern "1,1,1,0"

Give the puncturing pattern following the LDPC code.

The number \(P\) of values given in this pattern must be as \(N_{cw} = P \times Z\) where \(Z\) is the number of bits represented by a single value in the pattern.

This LDPC puncturer behavior is such as, for the above example, the first three quarter bits are kept and the last quarter is removed from the frame.

Codec Polar

Polar Encoder parameters

--enc-type

Type:text Allowed values:POLAR AZCW COSET USER Default:POLAR Examples:--enc-type AZCW

Select the encoder type.

Description of the allowed values:

Value	Description
POLAR	Select the standard Polar encoder.
AZCW	See the common --enc-type parameter.
COSET	See the common --enc-type parameter.
USER	See the common --enc-type parameter.

--enc-no-sys

Enable non-systematic encoding. By default the encoding process is systematic.

--enc-fb-gen-method

Type:text Allowed values:FILE GA TV Examples:--enc-fb-gen-method FILE

Select the frozen bits generation method.

Description of the allowed values:

Value	Description
GA	Select the GA method from [Tri12].
TV	Select the TV method which is based on Density Evolution (DE) approach from [TV13], to use with the --enc-fb-awgn-path parameter.
FILE	Read the best channels from an external file, to use with the --enc-fb-awgn-path parameter.

Note

By default, when using the GA or the TV method, the frozen bits are optimized for each SNR point. To override this behavior you can use the --enc-fb-sigma parameter.

Note

When using the FILE method, the frozen bits are always the same regardless of the SNR value.

--enc-fb-awgn-path

Type:path Rights:read only Examples:--enc-fb-awgn-path example/path/to/the/right/place/

Set the path to a file or a directory containing the best channels to select the frozen bits.

An ASCII file is expected, for instance, the following file describes the most reliable channels optimized for a codeword of size \(N = 8\) and for an AWGN channel where the noise variance is \(\sigma = 0.435999\):

8
awgn
0.435999
7 6 5 3 4 2 1 0

Given the previous file, if we suppose a Polar code of size \(N = 8\) with \(K = 4\) information bits, the frozen bits are at the 0, 1, 2, 4 positions in the codeword. The strategy is to freeze the less reliable channels.

Warning

The FILE frozen bits generator expects a file and not a directory.

Warning

The TV frozen bits generator expects a directory and not a file. AFF3CT comes with input configuration files, a part of those configuration files are a set of best channels pre-generated with the TV method (see conf/cde/awgn_polar_codes/TV/).

--enc-fb-sigma

Type:real number Examples:--enc-fb-sigma 1.0

Selects the noise variance \(\sigma\) for which the frozen bits will be optimized. All the noise points in the simulation will use the same frozen bits configuration.

References

[TV13]

I. Tal and A. Vardy. How to construct polar codes. IEEE Transactions on Information Theory (TIT), 59(10):6562–6582, October 2013. doi:10.1109/TIT.2013.2272694.

[Tri12]

P. Trifonov. Efficient design and decoding of polar codes. IEEE Transactions on Communications (TCOM), 60(11):3221–3227, November 2012. doi:10.1109/TCOMM.2012.081512.110872.

Polar Decoder parameters

--dec-type, -D

Type:text Allowed values:SC SCAN SCL SCL_MEM ASCL ASCL_MEM CHASE ML Default:SC Examples:--dec-type ASCL

Select the decoder algorithm.

Description of the allowed values:

Value	Description
SC	Select the original SC algorithm from [Ari09].
SCAN	Select the SCAN algorithm from [FB14].
SCL	Select the SCL algorithm from [TV11], also support the improved CA-SCL algorithm.
SCL_MEM	Select the SCL algorithm, same as the previous one but with an implementation optimized to reduce the memory footprint.
ASCL	Select the A-SCL algorithm from [LST12], PA-SCL and FA-SCL variants from [LeonardonCL+17] are available (see the --dec-partial-adaptive parameter).
ASCL_MEM	Select the A-SCL algorithm, same as the previous one but with an implementation optimized to reduce the memory footprint.
CHASE	See the common --dec-type, -D parameter.
ML	See the common --dec-type, -D parameter.

--dec-implem

Type:text Allowed values:NAIVE FAST Default:FAST Examples:--dec-implem FAST

Select the implementation of the decoder algorithm.

Description of the allowed values:

Value	Description
NAIVE	Select the naive implementation which is typically slow (not supported by the A-SCL decoders).
FAST	Select the fast implementation, available only for the SC, SCL, SCL-MEM, A-SCL and A-SCL-MEM decoders.

Warning

FAST implementations only support systematic encoding of Polar codes.

Note

The SC FAST implementation has been presented in [LeGalLJego15][CLeGalL+15][CAL+16].

Note

The SCL, CA-SCL and A-SCL FAST implementations have been presented in [LeonardonCL+17].

--dec-simd

Type:text Allowed values:INTER INTRA Examples:--dec-simd INTER

Select the SIMD strategy.

Description of the allowed values:

Value	Description
INTER	Select the inter-frame strategy, only available for the SC FAST decoder (see [LeGalLJego15][CLeGalL+15][CAL+16]).
INTRA	Select the intra-frame strategy, only available for the SC (see [CLeGalL+15][CAL+16]), SCL and A-SCL decoders (see in [LeonardonCL+17]).

Note

In the intra-frame strategy, SIMD units process several LLRs in parallel within a single frame decoding. This approach is efficient in the upper layers of the tree and in the specialized nodes, but more limited in the lowest layers where the computation becomes more sequential. In the inter-frame strategy, SIMD units decodes several independent frames in parallel in order to saturate the SIMD unit. This approach improves the throughput of the decoder but requires to load several frames before starting to decode, increasing both the decoding latency and the decoder memory footprint.

Note

When the inter-frame SIMD strategy is set, the simulator will run with the right number of frames depending on the SIMD length. This number of frames can be manually set with the --src-fra, -F parameter. Be aware that running the simulator with the --src-fra, -F parameter set to 1 and the --dec-simd parameter set to INTER will completely be counterproductive and will lead to no throughput improvements.

--dec-ite, -i

Type:integer Examples:--dec-ite 1

Set the number of decoding iterations in the SCAN decoder.

--dec-lists, -L

Type:integer Examples:--dec-lists 1

Set the number of lists to maintain in the SCL and A-SCL decoders.

--dec-partial-adaptive

Select the partial adaptive (PA-SCL) variant of the A-SCL decoder (by default the FA-SCL is selected).

--dec-polar-nodes

Type:text Default:"{R0,R1,R0L,REP,REPL,SPC}" Examples:--dec-polar-nodes "{R0,R1}"

Set the rules to enable in the tree simplifications process. This parameter is compatible with the SC FAST, the SCL FAST, SCL-MEM FAST, the A-SCL FAST and the the A-SCL-MEM FAST decoders.

Here are the available node types (or rules):

• R0: Rate 0, all the bits are frozen,
• R0L: Rate 0 left, the next left node in the tree is a R0,
• R1: Rate 1, all the bits are information bits,
• REP: Repetition code,
• REPL: Repetition left, the next left node in the tree is REP,
• SPC: SPC code.

Those node types are well explained in [SGV+14][CLeGalL+15]. It is also possible to specify the level in the tree where the node type will be recognized. For instance, the following value "{R0,R1,R0L,REP_2-8,REPL,SPC_4+}" matches:

• R0: all the Rate 0 nodes,
• R0L: all the Rate 0 left nodes,
• R1: all the Rate 1 nodes,
• REP_2-8: the repetition nodes with a size between 2 and 8 (including 2 and 8),
• REPL: all the repetition left nodes (will be automatically limited by the REP_2-8 rule),
• SPC_4+: the SPC nodes with a size equal or higher than 4.

To disable the tree cuts you can use the following value: "{R0_1,R1_1}".

References

[Ari09]

E. Arikan. Channel polarization: a method for constructing capacity-achieving codes for symmetric binary-input memoryless channels. IEEE Transactions on Information Theory (TIT), 55(7):3051–3073, July 2009. doi:10.1109/TIT.2009.2021379.

[CAL+16]

(1, 2, 3) A. Cassagne, O. Aumage, C. Leroux, D. Barthou, and B. Le Gal. Energy consumption analysis of software polar decoders on low power processors. In European Signal Processing Conference (EUSIPCO), 642–646. IEEE, August 2016. doi:10.1109/EUSIPCO.2016.7760327.

[CLeGalL+15]

(1, 2, 3, 4) A. Cassagne, B. Le Gal, C. Leroux, O. Aumage, and D. Barthou. An efficient, portable and generic library for successive cancellation decoding of polar codes. In International Workshop on Languages and Compilers for Parallel Computing (LCPC). Springer, September 2015. doi:10.1007/978-3-319-29778-1_19.

[FB14]

U. U. Fayyaz and J. R. Barry. Low-complexity soft-output decoding of polar codes. IEEE Journal on Selected Areas in Communications (JSAC), 32(5):958–966, May 2014. doi:10.1109/JSAC.2014.140515.

[LST12]

B. Li, H. Shen, and D. Tse. An adaptive successive cancellation list decoder for polar codes with cyclic redundancy check. IEEE Communications Letters (COMML), 16(12):2044–2047, December 2012. doi:10.1109/LCOMM.2012.111612.121898.

[LeonardonCL+17]

(1, 2, 3) M. Léonardon, A. Cassagne, C. Leroux, C. Jégo, L.-P. Hamelin, and Y. Savaria. Fast and flexible software polar list decoders. CoRR, 2017. URL: http://arxiv.org/abs/1710.08314, arXiv:1710.08314.

[SGV+14]

G. Sarkis, P. Giard, A. Vardy, C. Thibeault, and W. J. Gross. Fast polar decoders: algorithm and implementation. IEEE Journal on Selected Areas in Communications (JSAC), 32(5):946–957, May 2014. doi:10.1109/JSAC.2014.140514.

[TV11]

I. Tal and A. Vardy. List decoding of polar codes. In International Symposium on Information Theory (ISIT), 1–5. IEEE, July 2011. doi:10.1109/ISIT.2011.6033904.

[LeGalLJego15]

(1, 2) B. Le Gal, C. Leroux, and C. Jégo. Multi-Gb/s software decoding of polar codes. IEEE Transactions on Signal Processing (TSP), 63(2):349–359, January 2015. doi:10.1109/TSP.2014.2371781.

Polar Puncturer parameters

--pct-fra-size, -N

Type:integer Examples:--pct-fra-size 1

Set the frame size \(N\). This is not necessarily the codeword size if a puncturing pattern is used.

--pct-info-bits, -K

Type:integer Examples:--pct-info-bits 1

Set the number of information bits \(K\).

--pct-type

Type:text Allowed values:NO SHORTLAST Default:NO Examples:--pct-type NO

Select the puncturer type.

Description of the allowed values:

Value	Description
NO	Disable the puncturer.
SHORTLAST	Select the short last puncturing strategy from [NCL13][WL14][Mil15].

References

[Mil15]

V. Miloslavskaya. Shortened polar codes. IEEE Transactions on Information Theory (TIT), 61(9):4852–4865, September 2015. doi:10.1109/TIT.2015.2453312.

[NCL13]

K. Niu, K. Chen, and J. R. Lin. Beyond turbo codes: rate-compatible punctured polar codes. In International Conference on Communications (ICC), 3423–3427. IEEE, June 2013. doi:10.1109/ICC.2013.6655078.

[WL14]

R. Wang and R. Liu. A novel puncturing scheme for polar codes. IEEE Communications Letters (COMML), 18(12):2081–2084, December 2014. doi:10.1109/LCOMM.2014.2364845.

Codec RA

RA Encoder parameters

--enc-cw-size, -N

Type:integer Examples:--enc-cw-size 1

Set the codeword size \(N\).

--enc-info-bits, -K

Type:integer Examples:--enc-info-bits 1

Set the number of information bits \(K\).

--enc-type

Type:text Allowed values:RA AZCW COSET USER Default:RA Examples:--enc-type AZCW

Select the encoder type.

Description of the allowed values:

Value	Description
RA	Select the standard RA encoder.
AZCW	See the common --enc-type parameter.
COSET	See the common --enc-type parameter.
USER	See the common --enc-type parameter.

RA Decoder parameters

--dec-type, -D

Type:text Allowed values:RA CHASE ML Default:RA Examples:--dec-type CHASE

Select the decoder algorithm.

Description of the allowed values:

Value	Description
RA	Select the RA decoder based on the MS update rule in the CNs.
CHASE	See the common --dec-type, -D parameter.
ML	See the common --dec-type, -D parameter.

--dec-implem

Type:text Allowed values:STD Default:STD Examples:--dec-implem STD

Select the implementation of the decoder algorithm.

Description of the allowed values:

Value	Description
STD	Select the STD implementation.

--dec-ite, -i

Type:integer Examples:--dec-ite 1

Set the number of iterations to perform in the decoder.

Codec Repetition

Repetition Encoder parameters

--enc-cw-size, -N

Type:integer Examples:--enc-cw-size 1

Set the codeword size \(N\).

\(N\) has to be divisible by K.

--enc-info-bits, -K

Type:integer Examples:--enc-info-bits 1

Set the number of information bits \(K\).

--enc-type

Type:text Allowed values:REP AZCW COSET USER Examples:--enc-type AZCW

Select the encoder type.

Description of the allowed values:

Value	Description
REP	Select the standart repetition decoder.
AZCW	See the common --enc-type parameter.
COSET	See the common --enc-type parameter.
USER	See the common --enc-type parameter.

--enc-no-buff

Disable the buffered encoding.

Without the buffered encoding, considering \(K\) information bits \(U_0, U_1, [...], U_{K-1}\), the corresponding sequence of bits in the codeword is organized as follow: \(X_0^0, X_0^1, [...], X_0^{rep-1}, X_1^0, X_1^1, [...], X_1^{rep-1}, [[...]], X_{K-1}^0, X_{K-1}^1, [...], X_{K-1}^{rep-1},\) with \(rep = N / K.\)

With the buffered encoding, considering \(K\) information bits \(U_0, U_1, [...], U_{K-1}\), the corresponding sequence of bits in the codeword is organized as follow: \(X_0^0, X_1^0, [...], X_{K-1}^0, X_0^1, X_1^1, [...], X_{K-1}^1, [[...]], X_0^{rep-1}, X_1^{rep-1}, [...], X_{K-1}^{rep-1},\) with \(rep = N / K.\)

Repetition Decoder parameters

--dec-type, -D

Type:text Allowed values:REPETITION CHASE ML Default:REPETITION Examples:--dec-type CHASE

Select the decoder algorithm.

Description of the allowed values:

Value	Description
REPETITION	Select the repetition decoder.
CHASE	See the common --dec-type, -D parameter.
ML	See the common --dec-type, -D parameter.

--dec-implem

Type:text Allowed values:STD FAST Default:STD Examples:--dec-implem FAST

Select the implementation of the decoder algorithm.

Description of the allowed values:

Value	Description
STD	Select the STD implementation.
FAST	Select the fast implementation, much more faster without the --enc-no-buff parameter.

Codec RS

RS Encoder parameters

--enc-cw-size, -N

Type:integer Examples:--enc-cw-size 127

Set the codeword size \(N\).

\(N = 2^m – 1\), where \(m\) is an integer from 3 that represents also the number of bits per symbol. Thus, the binary codeword size is \(N \times m\).

--enc-info-bits, -K

Type:integer Examples:--enc-info-bits 1

Set the number of information bits \(K\).

This argument is not required if the correction power \(T\) is given with --dec-corr-pow, -T, as it is calculated automatically with the formula \(K = N - 2.T\).

--enc-type

Type:text Allowed values:RS AZCW COSET USER Default:RS Examples:--enc-type AZCW

Select the encoder type.

Description of the allowed values:

Value	Description
RS	Select the standard RS encoder.
AZCW	See the common --enc-type parameter.
COSET	See the common --enc-type parameter.
USER	See the common --enc-type parameter.

RS Decoder parameters

The RS decoder was described by Reed and Solomon in 1960 [ISR60].

--dec-type, -D

Type:text Allowed values:ALGEBRAIC CHASE ML Default:ALGEBRAIC Examples:--dec-type ALGEBRAIC

Select the decoder algorithm.

Description of the allowed values:

Value	Description
ALGEBRAIC	Select the Berlekamp-Massey algorithm [Ber15][Mas69] followed by a Chien search [Chi64].
CHASE	See the common --dec-type, -D parameter.
ML	See the common --dec-type, -D parameter.

--dec-implem

Type:text Allowed values:STD GENIUS Default:STD Examples:--dec-implem GENIUS

Select the implementation of the decoder algorithm.

Description of the allowed values:

Value	Description
STD	A standard implementation of the RS.
GENIUS	A really fast implementation that compare the input to the original codeword and correct it only when the number of symbols errors is less or equal to the RS correction power.

Note

In the STD implementation, the Chien search finds roots of the error location polynomial. If the number of found roots does not match the number of found errors by the Berlekamp–Massey algorithm, then the frame is not modified.

When a frame is very corrupted and when the above algorithms can be wrong in the correction by converging to another codeword, the GENIUS implementation cannot fail. Results may then differ from a real word implementation.

--dec-corr-pow, -T

Type:integer Default:5 Examples:-T 18

Set the correction power of the RS decoder. This value corresponds to the number of symbols errors that the decoder is able to correct.

It is automatically calculated from the input and codeword sizes. See also the argument --enc-info-bits, -K .

References

[Ber15]

E. R. Berlekamp. Algebraic Coding Theory (Revised Edition). World Scientific, May 2015. First edition from 1968. doi:10.1142/9407.

[Chi64]

R. Chien. Cyclic decoding procedures for bose- chaudhuri-hocquenghem codes. IEEE Transactions on Information Theory (TIT), 10(4):357–363, October 1964. doi:10.1109/TIT.1964.1053699.

[ISR60]

G. Solomon I. S. Reed. Polynomial codes over certain finite fields. Society for Industrial and Applied Mathematics, 8(2):300–304, June 1960. doi:10.1137/0108018.

[Mas69]

J. Massey. Shift-register synthesis and bch decoding. IEEE Transactions on Information Theory (TIT), 15(1):122–127, January 1969. doi:10.1109/TIT.1969.1054260.

Codec RSC

RSC Encoder parameters

--enc-info-bits, -K

Type:integer Examples:--enc-info-bits 1

Set the number of information bits \(K\).

The codeword size \(N\) is automatically deduced: \(N = 2 \times (K + \log_2(ts))\) where \(ts\) is the trellis size.

--enc-type

Type:text Allowed values:RSC AZCW COSET USER Default:RSC Examples:--enc-type AZCW

Select the encoder type.

Description of the allowed values:

Value	Description
RSC	Select the standard RSC encoder.
AZCW	See the common --enc-type parameter.
COSET	See the common --enc-type parameter.
USER	See the common --enc-type parameter.

--enc-no-buff

Disable the buffered encoding.

Without the buffered encoding, considering the following sequence of \(K\) information bits: \(U_0, U_1, [...], U_{K-1}\), the encoded bits will be organized as follow: \(X_0^s, X_0^p, X_1^s, X_1^p, [...], X_{K-1}^s, X_{K-1}^p, X_{0}^{s^t}, X_{0}^{p^t}, X_{1}^{s^t}, X_{1}^{p^t}, [...], X_{\log_2(ts)-1}^{s^t}, X_{\log_2(ts)-1}^{p^t}\), where \(s\) and \(p\) are respectively systematic and parity bits, \(t\) the tail bits and \(ts\) the trellis size.

With the buffered encoding, considering the following sequence of \(K\) information bits: \(U_0, U_1, [...], U_{K-1}\), the encoded bits will be organized as follow: \(X_0^s, X_1^s, [...], X_{K-1}^s, X_{0}^{s^t}, X_{1}^{s^t}, [...], X_{\log_2(ts)-1}^{s^t}, X_0^p, X_1^p, [...], X_{K-1}^p, X_{0}^{p^t}, X_{1}^{p^t}, [...], X_{\log_2(ts)-1}^{p^t}\), where \(s\) and \(p\) are respectively systematic and parity bits, \(t\) the tail bits and \(ts\) the trellis size.

--enc-poly

Type:text Default:"{013,015}" Examples:--enc-poly "{023, 033}"

Set the polynomials that define the RSC code (or the trellis structure). The expected form is \(\{A,B\}\) where \(A\) and \(B\) are given in octal.

--enc-std

Type:text Allowed values:CCSDS LTE Examples:--enc-std CCSDS

Select a standard: set automatically some parameters (can be overwritten by user given arguments).

Description of the allowed values:

Value	Description
CCSDS	Set the --enc-poly parameter to {023,033} according to the CCSDS standard (16-stage trellis).
LTE	Set the --enc-poly parameter to {013,015} according to the LTE standard (8-stage trellis).

RSC Decoder parameters

--dec-type, -D

Type:text Allowed values:BCJR CHASE ML Examples:--dec-type BCJR

Select the decoder algorithm.

Description of the allowed values:

Value	Description
BCJR	Select the BCJR algorithm from [BCJR74].
CHASE	See the common --dec-type, -D parameter.
ML	See the common --dec-type, -D parameter.

--dec-implem

Type:text Allowed values:GENERIC STD FAST VERY_FAST Default:STD Examples:--dec-implem FAST

Select the implementation of the decoder algorithm.

Description of the allowed values:

Value	Description
GENERIC	Select the generic BCJR implementation that can decode any trellis (slow compared to the other implementations).
STD	Select the STD BCJR implementation, specialized for the {013,015} polynomials (c.f. the --enc-poly parameter).
FAST	Select the fast BCJR implementation, specialized for the {013,015} polynomials (c.f. the --enc-poly parameter).
VERY_FAST	Select the very fast BCJR implementation, specialized for the {013,015} polynomials (c.f. the --enc-poly parameter).

--dec-simd

Type:text Allowed values:INTER INTRA Examples:--dec-simd INTER

Select the SIMD strategy.

Description of the allowed values:

Value	Description
INTER	Select the inter-frame strategy, only available for the BCJR STD, FAST and VERY_FAST implementation (see [CTL+16]).
INTRA	Select the intra-frame strategy, only available for the BCJR STD and FAST implementations (see [WWY+13]).

Note

In the intra-frame strategy, SIMD units process several LLRs in parallel within a single frame decoding. In the inter-frame strategy, SIMD units decodes several independent frames in parallel in order to saturate the SIMD unit. This approach improves the throughput of the decoder but requires to load several frames before starting to decode, increasing both the decoding latency and the decoder memory footprint.

Note

When the inter-frame SIMD strategy is set, the simulator will run with the right number of frames depending on the SIMD length. This number of frames can be manually set with the --src-fra, -F parameter. Be aware that running the simulator with the --src-fra, -F parameter set to 1 and the --dec-simd parameter set to INTER will completely be counterproductive and will lead to no throughput improvements.

--dec-max

Type:text Allowed values:MAXS MAXL MAX Examples:--dec-max MAX

Select the approximation of the \(\max^*\) operator used in the trellis decoding.

Description of the allowed values:

Value	Description
MAXS	\(\max^*(a,b) = \max(a,b) + \log(1 + \exp(-|a - b|))\).
MAXL	\(\max^*(a,b) \approx \max(a,b) + \max(0, 0.301 - (0.5 |a - b|))\).
MAX	\(\max^*(a,b) \approx \max(a,b)\).

MAXS for Max Star is the exact \(\max^*\) operator. MAXL for Max Linear is a linear approximation of the \(\max^*\) function. MAX for Max is the simplest \(\max^*\) approximation with only a \(\max\) function.

Note

The BCJR with the \(\max\) approximation is also called the max-log-MAP algorithm.

References

[BCJR74]

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 (TIT), 20(2):284–287, March 1974. doi:10.1109/TIT.1974.1055186.

[CTL+16]

A. Cassagne, T. Tonnellier, C. Leroux, B. Le Gal, O. Aumage, and D. Barthou. Beyond Gbps turbo decoder on multi-core CPUs. In International Symposium on Turbo Codes and Iterative Information Processing (ISTC), 136–140. IEEE, September 2016. doi:10.1109/ISTC.2016.7593092.

[WWY+13]

M. Wu, G. Wang, B. Yin, C. Studer, and J. R. Cavallaro. HSPA+/LTE-A turbo decoder on GPU and multicore CPU. In Asilomar Conference on Signals, Systems, and Computers (ACSSC), 824–828. IEEE, November 2013. doi:10.1109/ACSSC.2013.6810402.

Codec RSC DB

RSC DB Encoder parameters

--enc-info-bits, -K

Type:integer Examples:--enc-info-bits 1

Set the number of information bits \(K\).

The codeword size \(N\) is automatically deduced: \(N = 2 \times K\).

--enc-type

Type:text Allowed values:RSC_DB AZCW COSET USER Default:RSC_DB Examples:--enc-type AZCW

Select the encoder type.

Description of the allowed values:

Value	Description
RSC_DB	Select the standard RSC DB encoder.
AZCW	See the common --enc-type parameter.
COSET	See the common --enc-type parameter.
USER	See the common --enc-type parameter.

--enc-no-buff

Disable the buffered encoding.

--enc-std

Type:text Allowed values:DVB-RCS1 DVB-RCS2 Default:DVB-RCS1 Examples:--enc-std DVB-RCS2

Select a standard.

Description of the allowed values:

Value	Description
DVB-RCS1	Select the configuration of the DVB-RCS1 standard.
DVB-RCS2	Select the configuration of the DVB-RCS2 standard.

RSC DB Decoder parameters

--dec-type, -D

Type:text Allowed values:BCJR CHASE ML Default:BCJR Examples:--dec-type BCJR

Select the decoder algorithm.

Description of the allowed values:

Value	Description
BCJR	Select the BCJR DB decoder [BCJR74].
CHASE	See the common --dec-type, -D parameter.
ML	See the common --dec-type, -D parameter.

--dec-implem

Type:text Allowed values:GENERIC DVB-RCS1 DVB-RCS2 Default:DVB-RCS1 Examples:--dec-implem DVB-RCS1

Select the implementation of the decoder algorithm.

Description of the allowed values:

Value	Description
GENERIC	Select a generic implementation that works on any trellis.
DVB-RCS1	Select an implementation dedicated to the DVB-RCS1 trellis (faster than the GENERIC implementation).
DVB-RCS2	Select an implementation dedicated to the DVB-RCS2 trellis (faster than the GENERIC implementation).

--dec-max

Type:text Allowed values:MAXS MAXL MAX Examples:--dec-max MAX

Select the approximation of the \(\max^*\) operator used in the trellis decoding.

Description of the allowed values:

Value	Description
MAXS	\(\max^*(a,b) = \max(a,b) + \log(1 + \exp(-|a - b|))\).
MAXL	\(\max^*(a,b) \approx \max(a,b) + \max(0, 0.301 - (0.5 |a - b|))\).
MAX	\(\max^*(a,b) \approx \max(a,b)\).

MAXS for Max Star is the exact \(\max^*\) operator. MAXL for Max Linear is a linear approximation of the \(\max^*\) function. MAX for Max is the simplest \(\max^*\) approximation with only a \(\max\) function.

Note

The BCJR with the \(\max\) approximation is also called the max-log-MAP algorithm.

References

[BCJR74]

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 (TIT), 20(2):284–287, March 1974. doi:10.1109/TIT.1974.1055186.

Codec Turbo

Turbo Encoder parameters

--enc-info-bits, -K

Type:integer Examples:--enc-info-bits 1

Set the number of information bits \(K\).

The codeword size \(N\) is automatically deduced: \(N = 3 \times K + 4 \times \log_2(ts)\) where \(ts\) is the trellis size.

--enc-type

Type:text Allowed values:TURBO AZCW COSET USER Default:TURBO Examples:--enc-type AZCW

Select the encoder type.

Description of the allowed values:

Value	Description
TURBO	Select the standard Turbo encoder.
AZCW	See the common --enc-type parameter.
COSET	See the common --enc-type parameter.
USER	See the common --enc-type parameter.

--enc-sub-type

Please refer to the RSC --enc-type parameter.

--enc-json-path

Type:file Rights:write only Examples:--enc-json-path example/path/to/the/right/file

Select the file path to dump the encoder and decoder internal values (in JSON format).

Those values can be observed with the dedicated Turbo Code Reader available on the AFF3CT website: http://aff3ct.github.io/turbo_reader.html.

Note

Using this parameter will slowdown considerably the encoder and decoder throughputs.

--enc-sub-no-buff

Disable the buffered encoding.

Without the buffered encoding, considering the following sequence of \(K\) information bits: \(U_0, U_1, [...], U_{K-1}\), the encoded bits will be organized as follow: \(X_0^{sn}, X_0^{pn}, X_0^{pi}, [...], X_{K-1}^{sn}, X_{K-1}^{pn}, X_{K-1}^{pi}, X_{0}^{sn^t}, X_{0}^{pn^t}, [...], X_{\log_2(ts)-1}^{sn^t}, X_{\log_2(ts)-1}^{pn^t}, X_{0}^{si^t}, X_{0}^{pi^t}, [...], X_{\log_2(ts)-1}^{si^t}, X_{\log_2(ts)-1}^{pi^t}\), where \(sn\) and \(pn\) are respectively systematic and parity bits in the natural domain, \(si\) and \(pi\) are respectively systematic and parity bits in the interleaved domain, \(t\) the tail bits and and \(ts\) the trellis size.

With the buffered encoding, considering the following sequence of \(K\) information bits: \(U_0, U_1, [...], U_{K-1}\), the encoded bits will be organized as follow: \(X_0^{sn}, [...], X_{K-1}^{sn}, X_{0}^{sn^t}, [...], X_{\log_2(ts)-1}^{sn^t}, X_0^{pn}, [...], X_{K-1}^{pn}, X_{0}^{pn^t}, [...], X_{\log_2(ts)-1}^{pn^t}, X_{0}^{si^t}, [...], X_{\log_2(ts)-1}^{si^t}, X_0^{pi}, [...], X_{K-1}^pi, X_{0}^{pi^t}, [...], X_{\log_2(ts)-1}^{pi^t}\), where \(sn\) and \(pn\) are respectively systematic and parity bits in the natural domain, \(si\) and \(pi\) are respectively systematic and parity bits in the interleaved domain, \(t\) the tail bits and and \(ts\) the trellis size.

--enc-sub-poly

Please refer to the RSC --enc-poly parameter.

--enc-sub-std

Type:text Allowed values:CCSDS LTE Examples:--enc-sub-std CCSDS

Select a standard: set automatically some parameters (can be overwritten by user given arguments).

Description of the allowed values:

Value	Description
CCSDS	Set the --enc-sub-poly parameter to {023,033} according to the CCSDS standard (16-stage trellis) and select the CCSDS interleaver (see the --itl-type parameter).
LTE	Set the --enc-sub-poly parameter to {013,015} according to the LTE standard (8-stage trellis) and select the LTE interleaver (see the --itl-type parameter).

Turbo Decoder parameters

--dec-type, -D

Type:text Allowed values:TURBO CHASE ML Default:TURBO Examples:--dec-type CHASE

Select the decoder algorithm.

Description of the allowed values:

Value	Description
TURBO	Select the Turbo decoder, the two sub-decoders are from the RSC code family.
CHASE	See the common --dec-type, -D parameter.
ML	See the common --dec-type, -D parameter.

--dec-implem

Type:text Allowed values:STD FAST Default:FAST Examples:--dec-implem FAST

Select the implementation of the decoder algorithm.

Description of the allowed values:

Value	Description
STD	Select the STD implemenation.
FAST	Select the fast implemenation from [CTL+16].

--dec-sub-type, -D

Please refer to the RSC --dec-type, -D parameter.

--dec-sub-implem

Please refer to the RSC --dec-implem parameter.

--dec-sub-simd

Please refer to the RSC --dec-simd parameter.

--dec-crc-start

Type:integer Default:2 Examples:--dec-fnc-crc-ite 1

Set the first iteration to start the CRC checking.

Note

This parameter requires the Turbo code to be concatenated with a CRC to work, see the CRC parameters.

--dec-fnc

Enable the FNC post processing technique.

Note

The FNC post processing technique is detailed in [TLLeGal+16].

Note

This parameter requires the Turbo code to be concatenated with a CRC to work, see the CRC parameters.

--dec-fnc-ite-m

Type:integer Default:3 Examples:--dec-fnc-ite-m 2

Set the first iteration at which the FNC is used.

See the --dec-fnc parameter.

--dec-fnc-ite-M

Type:integer Default:10 Examples:--dec-fnc-ite-M 6

Set the last iteration at which the FNC is used.

See the --dec-fnc parameter.

--dec-fnc-ite-s

Type:integer Default:1 Examples:--dec-fnc-ite-s 2

Set the iteration step for the FNC technique.

See the --dec-fnc parameter.

--dec-fnc-q

Type:integer Default:10 Examples:--dec-fnc-q 6

Set the search space for the FNC technique.

See the --dec-fnc parameter.

--dec-ite, -i

Type:integer Default:6 Examples:--dec-ite 8

Set the maximal number of iterations in the Turbo decoder.

If the Turbo code is concatenated with a CRC and if the CRC is checked, the decoder can stop before making all the iterations.

--dec-sc

Enable the Self-Corrected (SC) decoder.

Note

The SC decoder is detailed in [Ton17] (in French).

Note

This parameter requires the Turbo code to be concatenated with a CRC to work, see the CRC parameters.

--dec-sf-type

Type:text Allowed values:ADAPTIVE ARRAY CST LTE LTE_VEC Examples:

--dec-sf-type ADAPTIVE

--dec-sf-type CST 0.5

Select a scaling factor (SF) to be applied to the extrinsic values after each half iteration.

This is especially useful with the max-log-MAP sub-decoders (BCJR with the \(\max\) approximation): the SF helps to recover a part of the decoding performance loss compare to the MAP algorithm (BCJR with the \(\max^*\) operator).

Note

The SF technique is detailed in [VF00].

Description of the allowed values:

Value	Description
ADAPTIVE	Select the adaptive SF, for the first and second iterations a SF of 0.5 is applied, for the other iterations the SF is 0.85.
ARRAY	Select an hard-coded array of SFs (c.f. Table 3.3).
CST	Set the same SF to be applied for each iterations.
LTE	Select a 0.75 SF.
LTE_VEC	Select a 0.75 vectorized SF (faster than LTE), used in [CTL+16].

Hard-coded array of SFs.

Iteration	Value
1	0.15
2	0.25
3	0.30
4	0.40
5	0.70
6	0.80
7	0.90
8	0.95

--dec-sub-max

Please refer to the RSC --dec-max parameter.

References

[CTL+16]

(1, 2) A. Cassagne, T. Tonnellier, C. Leroux, B. Le Gal, O. Aumage, and D. Barthou. Beyond Gbps turbo decoder on multi-core CPUs. In International Symposium on Turbo Codes and Iterative Information Processing (ISTC), 136–140. IEEE, September 2016. doi:10.1109/ISTC.2016.7593092.

[Ton17]

T. Tonnellier. Contribution to the Improvement of the Decoding Performance of Turbo Codes : Algorithms and Architecture. PhD thesis, Université de Bordeaux, 2017. URL: https://tel.archives-ouvertes.fr/tel-01580476.

[TLLeGal+16]

T. Tonnellier, C. Leroux, B. Le Gal, B. Gadat, C. Jégo, and N. Van Wambeke. Lowering the error floor of turbo codes with CRC verification. IEEE Wireless Communications Letters (WCL), 5(4):404–407, August 2016. doi:10.1109/LWC.2016.2571283.

[VF00]

J. Vogt and A. Finger. Improving the max-log-MAP turbo decoder. IET Electronics Letters, 36(23):1937–1939, November 2000. doi:10.1049/el:20001357.

Turbo Puncturer parameters

--pct-type

Type:text Allowed values:NO TURBO Default:NO Examples:--pct-type NO

Select the puncturer type.

Description of the allowed values:

Value	Description
NO	Disable the puncturer.
TURBO	Enable the puncturing patterns.

Note

The frame size will be automatically set from the given puncturing pattern (c.f. the --pct-pattern parameter).

--pct-pattern

Type:list of (list of (boolean:including set={0|1}):limited length [1;inf]):limited length [3;3], elements of same length Examples:--pct-pattern "11,10,01"

Define the puncturing pattern.

Considering the "11,10,01" puncturing pattern, the first sub-pattern 11 defines the emitted systematic bits, the second sub-pattern 10 defines the emitted parity bits in the natural domain and the third sub-pattern 01 defines the emitted parity bits in the interleaved domain. 1 means that the bit has to be transmitted and 0 means that the bit transmission has to be erased.

Given the following frame: \(X_0^{sn},X_1^{pn},\underline{X_2^{pi}},X_3^{sn},\underline{X_4^{pn}},X_5^{pi},X_6^{sn},X_7^{pn},\underline{X_8^{pi}}\), with the "11,10,01" puncturing pattern, the underlined bits will not be emitted. In the previous example, tail bits are not taken into account but in reality they are always emitted.

Codec Turbo DB

Turbo DB Encoder parameters

--enc-info-bits, -K

Type:integer Examples:--enc-info-bits 40

Set the number of information bits \(K\).

The codeword size \(N\) is automatically deduced: \(N = 3 \times K\).

--enc-type

Type:text Allowed values:TURBO_DB AZCW COSET USER Default:TURBO_DB Examples:--enc-type AZCW

Select the encoder type.

Description of the allowed values:

Value	Description
TURBO_DB	Select the standard Turbo DB encoder.
AZCW	See the common --enc-type parameter.
COSET	See the common --enc-type parameter.
USER	See the common --enc-type parameter.

--enc-sub-type

Please refer to the RSC DB --enc-type parameter.

--enc-sub-std

Type:text Allowed values:DVB-RCS1 DVB-RCS2 Default:DVB-RCS1 Examples:--enc-sub-std DVB-RCS2

Select a standard.

Description of the allowed values:

Value	Description
DVB-RCS1	Set the DVB-RCS1 trellis and select the DVB-RCS1 interleaver (see the --itl-type parameter).
DVB-RCS2	Set the DVB-RCS2 trellis and select the DVB-RCS2 interleaver (see the --itl-type parameter).

Turbo DB Decoder parameters

--dec-type, -D

Type:text Allowed values:TURBO_DB CHASE ML Default:TURBO_DB Examples:--dec-type CHASE

Select the decoder algorithm.

Description of the allowed values:

Value	Description
TURBO_DB	Select the standard Turbo decoder.
CHASE	See the common --dec-type, -D parameter.
ML	See the common --dec-type, -D parameter.

--dec-implem

Type:text Allowed values:STD Default:STD Examples:--dec-implem STD

Select the implementation of the decoder algorithm.

Description of the allowed values:

Value	Description
STD	Select the STD implementation.

--dec-sub-type, -D

Please refer to the RSC DB --dec-type, -D parameter.

--dec-sub-implem

Please refer to the RSC DB --dec-implem parameter.

--dec-crc-start

Type:integer Default:2 Examples:--dec-fnc-crc-ite 1

Set the first iteration to start the CRC checking.

Note

This parameter requires the Turbo code to be concatenated with a CRC to work, see the CRC parameters.

--dec-fnc

Enable the FNC post processing technique.

Note

The FNC post processing technique is detailed in [TLLeGal+16].

Note

This parameter requires the Turbo code to be concatenated with a CRC to work, see the CRC parameters.

--dec-fnc-ite-m

Type:integer Default:3 Examples:--dec-fnc-ite-m 2

Set the first iteration at which the FNC is used.

See the --dec-fnc parameter.

--dec-fnc-ite-M

Type:integer Default:10 Examples:--dec-fnc-ite-M 6

Set the last iteration at which the FNC is used.

See the --dec-fnc parameter.

--dec-fnc-ite-s

Type:integer Default:1 Examples:--dec-fnc-ite-s 2

Set the iteration step for the FNC technique.

See the --dec-fnc parameter.

--dec-fnc-q

Type:integer Default:10 Examples:--dec-fnc-q 6

Set the search space for the FNC technique.

See the --dec-fnc parameter.

--dec-ite, -i

Type:integer Default:6 Examples:--dec-ite 8

Set the maximal number of iterations in the Turbo decoder.

If the Turbo code is concatenated with a CRC and if the CRC is checked, the decoder can stop before making all the iterations.

--dec-sf-type

Type:text Allowed values:ADAPTIVE ARRAY CST LTE LTE_VEC Examples:

--dec-sf-type ADAPTIVE

--dec-sf-type CST 0.5

Select a scaling factor (SF) to be applied to the extrinsic values after each half iteration.

This is especially useful with the max-log-MAP sub-decoders (BCJR with the \(\max\) approximation): the SF helps to recover a part of the decoding performance loss compare to the MAP algorithm (BCJR with the \(\max^*\) operator).

Note

The SF technique is detailed in [VF00].

Description of the allowed values:

Value	Description
ADAPTIVE	Select the adaptive SF, for the first and second iterations a SF of 0.5 is applied, for the other iterations the SF is 0.85.
ARRAY	Select an hard-coded array of SFs (c.f. Table 3.3).
CST	Set the same SF to be applied for each iterations.
LTE	Select a 0.75 SF.
LTE_VEC	Select a 0.75 vectorized SF (faster than LTE).

Hard-coded array of SFs.

Iteration	Value
1	0.15
2	0.25
3	0.30
4	0.40
5	0.70
6	0.80
7	0.90
8	0.95

--dec-sub-max

Please refer to the RSC --dec-max parameter.

References

[TLLeGal+16]

T. Tonnellier, C. Leroux, B. Le Gal, C. Jégo, B. Gadat, and N. Van Wambeke. Lowering the error floor of double-binary turbo codes: the flip and check algorithm. In International Symposium on Turbo Codes and Iterative Information Processing (ISTC), 156–160. IEEE, September 2016. doi:10.1109/ISTC.2016.7593096.

[VF00]

J. Vogt and A. Finger. Improving the max-log-MAP turbo decoder. IET Electronics Letters, 36(23):1937–1939, November 2000. doi:10.1049/el:20001357.

Turbo DB Puncturer parameters

--pct-type

Type:text Allowed values:NO TURBO_DB Default:NO Examples:--pct-type NO

Select the puncturer type.

Description of the allowed values:

Value	Description
NO	Disable the puncturer.
TURBO_DB	Enable the puncturer.

--pct-fra-size, -N

Type:integer Examples:--pct-fra-size 1

Set the frame size \(N\). This is not necessarily the codeword size if a puncturing pattern is used.

The puncturer supports \(R = 2/5\), \(R = 1/2\), \(R = 2/3\) and \(R = 4/5\) with \(R = K/N\).

Codec TPC

The TPC is an alliance of two crossed BCH codes. The same BCH code is used for columns and rows.

TPC Encoder parameters

--enc-sub-cw-size, -N

Type:integer Examples:--enc-sub-cw-size 127

Set the codeword size \(N\).

Give the sub-encoder code codeword size. You can extend this codeword with a parity bit with the --enc-ext option. Then the codeword size of the TPC is the square of this value.

--enc-sub-info-bits, -K

Type:integer Examples:--enc-sub-info-bits 120

Set the number of information bits \(K\).

Give the sub-encoder code input size (number of information bits). Then the number of information bits of the TPC is the square of this value.

--enc-type

Type:text Allowed values:TPC AZCW COSET USER Default:TPC Examples:--enc-type AZCW

Select the encoder type.

Description of the allowed values:

Value	Description
TPC	The TPC encoder.
AZCW	See the common --enc-type parameter.
COSET	See the common --enc-type parameter.
USER	See the common --enc-type parameter.

--enc-sub-type

Please refer to the BCH --enc-type parameter.

--enc-ext

Extend the sub-encoder codeword with a parity bit in order to increase the distance of the code.

TPC Decoder parameters

The TPC decoder first decodes columns once with the Chase-Pyndiah algorithm, then rows, and columns again then rows again and so on.

Let’s say \(C\) is the \(N \times N\) a priori matrix from the demodulator.

Let’s say \(R_{i+1}^c\) is the \(N \times N\) a posteriori matrix computed by this decoder after the \(i^{th}\) iteration on the columns. Initially, \(R_0^c = C\).

Let’s say \(R_{i+1}^r\) is the \(N \times N\) a posteriori matrix computed by this decoder after the \(i^{th}\) iteration on the rows, with \(R_i^r = R_{i+1}^c\).

The process of the columns for the \(i^{th}\) iteration gives:

\(R_{i+1}^c = alpha_{2i+0}.W_i^c + C\)

with \(W_i^c\) the extrinsic from the Chase-Pyndiah decoder computed on \(R_{i}^c\).

The process of the rows for the \(i^{th}\) iteration gives:

\(R_{i+1}^r = alpha_{2i+1}.W_i^r + C\)

with \(W_i^r\) the extrinsic from the Chase-Pyndiah decoder computed on \(R_{i}^r\).

Parameter \(alpha\) is set with the argument --dec-alpha.

--dec-sub-cw-size, -N

Type:integer Examples:--dec-sub-cw-size 1

Set the codeword size \(N\).

--dec-sub-info-bits, -K

Type:integer Examples:--dec-sub-info-bits 1

Set the number of information bits \(K\).

--dec-type, -D

Type:text Allowed values:CHASE CP ML Default:CP Examples:--dec-type CP

Select the decoder algorithm.

This algorithm will decode each column and row of the TPC.

Description of the allowed values:

Value	Description
CP	Decode with the Chase-Pyndiah algorithm of the TPC
CHASE	See the common --dec-type, -D parameter.
ML	See the common --dec-type, -D parameter.

The CP algorithm is the implementation of [Pyn98] but in a more generic way in order to let the user chose its configuration:

• Chase step: find the more reliable codeword \(D\):

  • Take hard decision \(H\) on input \(R\).
  • Select the \(p\) (set with --dec-p) least reliable positions from \(R\) to get a metric set \(P\) of \(p\) elements.
  • Create \(t\) (set with --dec-t) test vectors from test patterns.
  • Hard decode with the sub-decoder to get the competitors with good syndrome set \(C\).
  • Remove competitors from \(C\) to keep \(c\) of them (set with --dec-c).
  • Compute the metrics \(C_m\) (euclidean distance) of each competitor compared to \(H\).
  • Select the competitors with the smallest metric to get the decided word \(D\) with a metric \(D_m\) and where \(D_j = \begin{cases} +1 & \text{when } H_j = 0 \\ -1 & \text{when } H_j = 1 \end{cases}\)

• Pyndiah step: compute reliabilities of each bit of \(D\)

  • \(a, b, c, d\) and \(e\) are simulation constants changeable by the user with --dec-cp-coef

  • Compute the reliability \(F\) of \(D\) for each bit \(D_j\) of the word:

    • Find \(C^s\) the competitor with the smallest metric \(C_m\) that have \(C_j^s \neq D_j\).

    • when \(C^s\) exists:

      \(F_j = b . D_j . [C_m - D_m]\)

    • when \(C^s\) does not exist and if --dec-beta is given:

      \(F_j = D_j . beta\)

    • else:

      \(F_j = D_j . \left[ \displaystyle\sum_{i=0}^{e} P_i - c . D_m + d . |R_j| \right]\) where \(P\) is considered sorted, \(0 < e < p\), and when \(e == 0 \implies e = p - 1\).

  • Compute extrinsic \(W = F - a . R\)

--dec-implem

Type:text Allowed values:STD Default:STD Examples:--dec-implem STD

Select the implementation of the decoder algorithm.

Description of the allowed values:

Value	Description
STD	A standard implementation

--dec-ite, -i

Type:integer Default:4 Examples:--dec-ite 8

Set the number of iterations in the turbo decoding process.

--dec-alpha

Type:list of real numbers Default:all at 0.5 Examples:--dec-alpha "0.1,0.1,0.2,0.25,0.3,0.35,.5,.5,1.2"

Give the weighting factor alpha, one by half iteration (so twice more than the number of iterations).

The first one is for the first columns process, the second for the first rows process, the third for the second columns process, the fourth for the second rows process, and so on.

If there are not enough values, then the last one given is automatically extended to the rest of the half-iterations. Conversely, if there are too many, the surplus is truncated.

--dec-beta

Type:list of real numbers Examples:--dec-beta "0.1,0.1,0.2,0.25,0.3,0.35,.5,.5,1.2"

Give the reliability factor beta, one by half iteration (so twice more than the number of iterations).

The first one is for the first columns process, the second for the first rows process, the third for the second columns process, the fourth for the second rows process, and so on.

If there are not enough values, then the last one given is automatically extended to the rest of the half-iterations. Conversely, if there are too many, the surplus is truncated.

If not given, then beta is dynamically computed as described in --dec-type, -D.

--dec-c

Type:integer Default:0 Examples:--dec-c 3

Set the number of competitors. A value of 0 means that the latter is set to the number of test vectors, 1 means only the decided word.

--dec-p

Type:integer Default:2 Examples:--dec-p 1

Set the number of least reliable positions.

--dec-t

Type:integer Default:0 Examples:--dec-t 1

Set the number of test vectors. A value of 0 means equal to \(2^p\) where \(p\) is the number of least reliable positions.

--dec-cp-coef

Type:list of real numbers Default:"1,1,1,1,0" Examples:--dec-cp-coef "0,0.25,0,0,3"

Give the 5 CP constant coefficients \(a, b, c, d, e\).

See the --dec-type, -D parameter.

--dec-sub-type, -D

Please refer to the BCH --dec-type, -D parameter.

--dec-sub-corr-pow, -T

Please refer to the BCH --dec-corr-pow, -T parameter.

--dec-sub-implem

Please refer to the BCH --dec-implem parameter.

References

[Pyn98]

R.M. Pyndiah. Near-optimum decoding of product codes: block turbo codes. IEEE Transactions on Communications (TCOM), 46(8):1003–1010, August 1998. doi:10.1109/26.705396.

Codec Uncoded

Uncoded Encoder parameters

There is no encoder when running an uncoded simulation.

Uncoded Decoder parameters

--dec-type, -D

Type:text Allowed values:NONE CHASE ML Default:NONE Examples:--dec-type CHASE

Select the decoder algorithm.

Description of the allowed values:

Value	Description
NONE	Select the NONE decoder.
CHASE	See the common --dec-type, -D parameter.
ML	See the common --dec-type, -D arameter.

--dec-implem

Type:text Allowed values:HARD_DECISION default:HARD_DECISION Examples:--dec-implem HARD_DECISION

Select the implementation of the decoder algorithm.

Description of the allowed values:

Value	Description
HARD_DECISION	Take the hard decision on the input LLRs.

Interleaver parameters

The interleaving process is frequent in coding schemes. It can be found directly in the code definition (for instance in Turbo or Turbo Product codes) or in larger schemes like for the turbo demodulation in the receiver (see the iterative BER/FER chain in Fig. 3.5).

--itl-type

Type:text Allowed values:CCSDS COL_ROW DVB-RCS1 DVB-RCS2 GOLDEN LTE NO RANDOM RAND_COL ROW_COL USER Default:RANDOM Examples:--itl-type RANDOM

Select the interleaver type.

Description of the allowed values:

Value	Description
NO	Disable the interleaving process: the output is the input (Fig. 3.8).
COL_ROW	Fill the interleaver by column, read it by row (can be customized with the --itl-read-order parameter) (Fig. 3.9).
ROW_COL	Fill the interleaver by row, read it by column (can be customized with the --itl-read-order parameter) (Fig. 3.10).
RANDOM	Generate a random sequence for the entire frame (based on the MT 19937 PRNG [MN98]) (Fig. 3.11).
RAND_COL	Generate multiple random sequences decomposed in independent columns (based on the MT 19937 PRNG [MN98]) (Fig. 3.12).
GOLDEN	Select the interleaver described in [CLGH99].
CCSDS	Select the interleaver defined in the CCSDS standard.
LTE	Select the interleaver defined in the LTE standard.
DVB-RCS1	Select the interleaver defined in the DVB-RCS1 standard.
DVB-RCS2	Select the interleaver defined in the DVB-RCS2 standard.
USER	Select the interleaver sequence (LUT) from an external file (to use with the --itl-path parameter) (Fig. 3.13).

Interleaver NO.

Interleaver COL_ROW.

Interleaver ROW_COL.

Interleaver RANDOM.

Interleaver RAND_COL.

Interleaver USER.

--itl-cols

Type:integer Default:4 Examples:--itl-cols 1

Specify the number of columns used for the RAND_COL, ROW_COL or COL_ROW interleavers.

--itl-path

Type:file Rights:read only Examples:--itl-path conf/itl/GSM-LDPC_4224.itl

Set the file path to the interleaver LUT (to use with the USER interleaver).

An ASCII file is expected:

# the number of LUTs contained in the file (only one LUT here)
1

# the frame size 'N'
16

# the LUT definition (here the frame is reversed, 0 becomes 15, 1 becomes 14, etc.)
15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0

If there is more than one interleaved sequence then for each new frame a new LUT is used in the natural order given by the file. Here is an example with two LUTs:

# the number of LUTs contained in this file
2

# the frame size 'N'
16

# first and second LUTs definition
15 14 13 12 11 10 9 8  7  6  5  4  3  2 1 0
 7  6  5  4  3  2 1 0 15 14 13 12 11 10 9 8

Note

When the number of simulated frames exceeds the number of LUT contained in the files, the LUTs from the beginning of the file are reused and this is repeated until the end of the simulation.

--itl-read-order

Type:text Allowed values:BOTTOM_LEFT BOTTOM_RIGHT TOP_LEFT TOP_RIGHT Examples:--itl-read-order BOTTOM_LEFT

Change the read order of the COL_ROW and ROW_COL interleavers.

The read starts from the given corner of the array to the diagonally opposite one. The read is made row by row for the COL_ROW interleaver and column by column for the ROW_COL one.

Description of the allowed values (see also the figures just bellow):

Value	Description
TOP_LEFT	Read is down from the top left corner to the bottom right corner.
TOP_RIGHT	Read is down from the top right corner to the bottom left corner.
BOTTOM_LEFT	Read is down from the bottom left corner to the top right corner.
BOTTOM_RIGHT	Read is down from the bottom right corner to the top left corner.

Fig. 3.14 depicts the read order options on the COL_ROW interleaver.

Interleaver COL_ROW read orders.

Fig. 3.15 depicts the read order options on the ROW_COL interleaver.

Interleaver ROW_COL read orders.

--itl-uni

Enable to generate a new LUT for each new frame (i.e. uniform interleaver).

By default, if this parameter is not used, the random interleavers generate the LUT only once for the whole simulation.

Note

This parameter has no effect if the selected interleaver is not randomly generated.

References

[CLGH99]

S. Crozier, J. Lodge, P. Guinand, and A. Hunt. Performance of turbo codes with relative prime and golden interleaving strategies. In International Mobile Satellite Conference (IMSC), 268–275. 1999. URL: https://www.tib.eu/en/search/id/BLCP%3ACN033129464/Performance-of-Turbo-Codes-with-Relative-Prime/.

[MN98]

(1, 2) M. Matsumoto and T. Nishimura. Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator. ACM Transactions on Modeling and Computer Simulation (TOMACS), 8(1):3–30, 1998. doi:10.1145/272991.272995.

Modem parameters

AFF3CT comes with a set of predefined modems. A modem transforms a sequence of bits into a suitable form for the transmission on a physical medium. In the AFF3CT “philosophy”, the modem is a module containing three tasks: modulate, filter and demodulate (read the Philosophy section for more information about modules and tasks).

--mdm-type

Type:text Allowed values:BPSK CPM OOK PAM PSK QAM SCMA USER Default:BPSK Examples:--mdm-type SCMA

Select the modulation type.

Description of the allowed values:

Value	Description
BPSK	Select a BPSK modulation.
CPM	Select a Continuous Phase Modulation (CPM) [AS81][ARS81].
OOK	Select an On-Off Keying (OOK) modulation.
PAM	Select a Pulse-Amplitude Modulation (PAM).
PSK	Select a Phase-Shift Keying (PSK) modulation.
QAM	Select a rectangular Quadrature-Amplitude Modulation (QAM).
SCMA	Select a Sparse Code Multiple Access (SCMA) modulation [NB13].
USER	Select a user defined constellation (to use with the --mdm-const-path parameter).

--mdm-implem

Type:text Allowed values:FAST STD Default:STD Examples:--mdm-implem FAST

Select the modem implementation.

Description of the allowed values:

Value	Description
STD	Select a standard implementation working for any modem.
FAST	Select a fast implementation, only available for the BPSK modem at this time.

--mdm-bps

Type:integer Default:1 Examples:--mdm-bps 1

Set the number of bits used to generate a symbol (BPS).

This parameter has no effect on the BPSK and OOK modems where the BPS is forced to 1. This is the same for the SCMA modem where the BPS is forced to 3.

Note

For the QAM modem, only even BPS values are supported.

--mdm-const-path

Type:file Rights:read/write Examples:--mdm-const-path conf/mod/16QAM_ANTI_GRAY.mod

Give the path to the ordered modulation symbols (constellation), to use with the USER modem.

An ASCII file is expected, for instance here is the definition of a 16-QAM with an anti-Gray mapping (the lines starting with a # are ignored):

# 0000
 3  3
# 0001
-3 -3
# 0010
-1  3
# 0011
 1 -3
# 0100
-3  1
# 0101
 3 -1
# 0110
 1  1
# 0111
-1 -1
# 1000
 1 -1
# 1001
-1  1
# 1010
-3 -1
# 1011
 3  1
# 1100
-1 -3
# 1101
 1  3
# 1110
 3 -3
# 1111
-3  3

Note

The number of bits per symbol is automatically computed from the number of given symbols. The latter has to be a power of 2.

--mdm-max

Type:text Allowed values:MAXS MAXSS MAXL MAX Examples:--mdm-max MAX

Select the approximation of the \(\max^*\) operator used in the PAM, QAM, PSK, CPM and user demodulators.

Description of the allowed values:

Value	Description
MAXS	\(\max^*(a,b) = \max(a,b) + \log(1 + \exp(-|a - b|))\).
MAXSS	\(\max^*(a,b) \approx \max(a,b) + d\) with \(d = \begin{cases} 0 & \text{if } d >= 37\\ \exp(-|a - b|) & \text{if } 9 <= d < 37 \\ \log(1 + \exp(-|a - b|)) & \text{else} \end{cases}\).
MAXL	\(\max^*(a,b) \approx \max(a,b) + \max(0, 0.301 - (0.5 |a - b|))\).
MAX	\(\max^*(a,b) \approx \max(a,b)\).

MAXS for Max Star is the exact \(\max^*\) operator. MAXSS for Max Star Safe allows to avoid numeric instabilities due the exponential operation and the limited precision of the floating-point representation. MAXL for Max Linear is a linear approximation of the \(\max^*\) function. MAX for Max is the simplest \(\max^*\) approximation with only a \(\max\) function.

--mdm-no-sig2

Turn off the division by \(\sigma^2\) in the demodulator where \(\sigma\) is the Gaussian noise variance.

--mdm-cpm-k

Type:integer Default:1 Examples:--mdm-cpm-k 1

Set the CPM index numerator.

--mdm-cpm-p

Type:integer Default:2 Examples:--mdm-cpm-p 1

Set the CPM index denominator.

--mdm-cpm-L

Type:integer Default:2 Examples:--mdm-cpm-L 1

Set the CPM pulse width (also called memory depth).

--mdm-cpm-upf

Type:integer Default:1 Examples:--mdm-cpm-upf 1

Select the symbol upsampling factor in the CPM.

--mdm-cpm-map

Type:text Allowed values:GRAY NATURAL Default:NATURAL Examples:--mdm-cpm-map GRAY

Select the CPM symbols mapping layout.

Description of the allowed values:

Value	Description
GRAY	Gray code switching only one bit at a time from a symbol to the following.
NATURAL	The natural binary code incrementing the value from a symbol to the next one.

--mdm-cpm-ws

Type:text Allowed values:GMSK RCOS REC Default:GMSK Examples:--mdm-cpm-ws GMSK

Select the CPM wave shape.

Description of the allowed values:

Value	Description
GMSK	Gaussian Minimum Shift Keying.
RCOS	Raised COSinus.
REC	RECtangular.

--mdm-cpm-std

Type:text Allowed values:GSM Examples:--mdm-cpm-std GSM

Set the CPM parameters according to a standard.

Description of the allowed values:

Value	Parameter	Value	Description
GSM	--mdm-bps --mdm-cpm-upf --mdm-cpm-k --mdm-cpm-p --mdm-cpm-L --mdm-cpm-map --mdm-cpm-ws	1 5 1 2 3 NATURAL GMSK	Bit per symbol. Upsampling factor. Modulation index numerator. Modulation index denominator. Memory depth. Mapping layout. Wave shape.

Note

When this parameter is used, if you set any of the other modem parameters, it will override the configuration from the standard.

--mdm-ite

Type:integer Default:1 Examples:--mdm-ite 5

Set the number of iterations in the SCMA demodulator.

--mdm-psi

Type:text Allowed values:PSI0 PSI1 PSI2 PSI3 Examples:--mdm-psi PSI0

Select the \(\psi\) function used in the SCMA demodulator.

Description of the allowed values:

Value	Description
PSI0	\(\psi_0 = \exp\left(-\frac{|d|}{n_0}\right)\)
PSI1	\(\psi_1 \approx \psi_0 \approx \frac{1}{|d| + n_0}\)
PSI2	\(\psi_2 \approx \psi_0 \approx \frac{1}{8. |d|^2 + n_0}\)
PSI3	\(\psi_3 \approx \psi_0 \approx \frac{1}{4. |d|^2 + n_0}\)

Where \(n_0 = \begin{cases} 1 & \text{if } \sigma^2 \text{ is disabled}\\ 4 \sigma^2 & \text{else} \end{cases}\).

See the --mdm-no-sig2 parameter to disable the division by \(\sigma^2\).

--mdm-codebook

Type:file Rights:read/write Examples:--mdm-codebook conf/mod/SCMA/CS1.cb

Give the path to the codebook, to use with the SCMA modem.

Note

Only 3 BPS codebook symbols are supported at this time.

Codebook format

A codebook is designed for a number_of_users \(V\), a number_of_orthogonal_resources \(K\) and codebook_size \(M\).

The codebook file then looks as a table of \(V \times K\) rows and \(2.M\) columns (real and imaginary parts):

V K M

Re(User 1, Resource 1, Code 1)    Im(User 1, Resource 1, Code 1)    ...    Re(User 1, Resource 1, Code M)    Im(User 1, Resource 1, Code M)
...                               ...                               ...    ...                               ...
Re(User 1, Resource K, Code 1)    Im(User 1, Resource K, Code 1)    ...    Re(User 1, Resource K, Code M)    Im(User 1, Resource K, Code M)
Re(User 2, Resource 1, Code 1)    Im(User 2, Resource 1, Code 1)    ...    Re(User 2, Resource 1, Code M)    Im(User 2, Resource 1, Code M)
...                               ...                               ...    ...                               ...
Re(User 2, Resource K, Code 1)    Im(User 2, Resource K, Code 1)    ...    Re(User 2, Resource K, Code M)    Im(User 2, Resource K, Code M)
...                               ...                               ...    ...                               ...
Re(User V, Resource 1, Code 1)    Im(User V, Resource 1, Code 1)    ...    Re(User V, Resource 1, Code M)    Im(User V, Resource 1, Code M)
...                               ...                               ...    ...                               ...
Re(User V, Resource K, Code 1)    Im(User V, Resource K, Code 1)    ...    Re(User V, Resource K, Code M)    Im(User V, Resource K, Code M)

Descriptions of the codebooks of the configuration files

Codebooks are normalized, so the average power of signal will be equal to 1.

Codebook Set	Description
CS1	From [Pro]
CS2	LDS based on QPSK constellation
CS3	Based on [CWC15] and own optimization for AWGN channel
CS4	From [ZXX+16]
CS5	From [SWC17]
CS6	From [KS17]
CS7	From [KS17]
CS8	From [WZC15]

The simulation results for CS1-CS7 (AWGN and Rayleigh fading channels) can be found in [KS17]. The simulation results for CS8 can be found in [KS16] (defined as CS2 in the paper).

--mdm-rop-est

Type:integer Default:0 Examples:--mdm-rop-est 256

Set the number of known bits for the ROP estimation in the OOK demodulator on an optical channel.

The estimation is done from a known set of bits that is the output of the modulation. If left to 0, the demodulation is done with the exact applied ROP in the channel.

References

[ARS81]

T. Aulin, N. Rydbeck, and C. -. Sundberg. Continuous phase modulation - part ii: partial response signaling. IEEE Transactions on Communications (TCOM), 29(3):210–225, March 1981. doi:10.1109/TCOM.1981.1094985.

[AS81]

T. Aulin and C. Sundberg. Continuous phase modulation - part i: full response signaling. IEEE Transactions on Communications (TCOM), 29(3):196–209, March 1981. doi:10.1109/TCOM.1981.1095001.

[NB13]

H. Nikopour and H. Baligh. Sparse Code Multiple Access. In International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC), volume, 332–336. Sept 2013. doi:10.1109/PIMRC.2013.6666156.

[CWC15]

M. Cheng, Y. Wu, and Y. Chen. Capacity analysis for non-orthogonal overloading transmissions under constellation constraints. In International Conference on Wireless Communications Signal Processing (WCSP), 1–5. Oct 2015. doi:10.1109/WCSP.2015.7341294.

[KS16]

V. P. Klimentyev and A. B. Sergienko. Detection of scma signal with channel estimation error. In Conference of Open Innovations Association and Seminar on Information Security and Protection of Information Technology (FRUCT-ISPIT), 106–112. April 2016. doi:10.1109/FRUCT-ISPIT.2016.7561515.

[KS17]

(1, 2, 3) V. P. Klimentyev and A. B. Sergienko. Scma codebooks optimization based on genetic algorithm. In European Wireless Conference, 1–6. May 2017. doi:.

[Pro]

Altera University Program. The 1st 5g algorithm innovation competition-scma.

[SWC17]

G. Song, X. Wang, and J. Cheng. Signature design of sparsely spread code division multiple access based on superposed constellation distance analysis. IEEE Access, 5:23809–23821, 2017. doi:10.1109/ACCESS.2017.2765346.

[WZC15]

Y. Wu, S. Zhang, and Y. Chen. Iterative multiuser receiver in sparse code multiple access systems. In IEEE International Conference on Communications (ICC), 2918–2923. June 2015. doi:10.1109/ICC.2015.7248770.

[ZXX+16]

S. Zhang, K. Xiao, B. Xiao, Z. Chen, B. Xia, D. Chen, and S. Ma. A capacity-based codebook design method for sparse code multiple access systems. In International Conference on Wireless Communications Signal Processing (WCSP), 1–5. Oct 2016. doi:10.1109/WCSP.2016.7752620.

Channel parameters

The channel represents the physical support such as optical fiber, space, water, air, etc. It is during the passage in the channel that the frames are altered/noised and errors can occur. The channel coding theory has been invented to correct errors induced by the channel (or at least reduce the number of errors to an acceptable rate).

--chn-type

Type:text Allowed values:NO BEC BSC AWGN RAYLEIGH RAYLEIGH_USER OPTICAL USER USER_ADD USER_BEC USER_BSC Default:AWGN Examples:--chn-type AWGN

Select the channel type.

Description of the allowed values:

Value	Description
NO	Disable the channel noise: \(Y = X\).
BEC	Select the Binary Erasure Channel (BEC): \(Y_i = \begin{cases} erased & \text{if } e = 1 \\ X_i & \text{else} \end{cases}, \text{with } P(e = 1) = p_e \text{ and } P(e = 0) = 1 - p_e\).
BSC	Select the Binary Symmetric Channel (BSC): \(Y_i = \begin{cases} !X_i & \text{if } e = 1 \\ X_i & \text{else} \end{cases}, \text{with } P(e = 1) = p_e \text{ and } P(e = 0) = 1 - p_e\).
AWGN	Select the Additive White Gaussian Noise (AWGN) channel: \(Y = X + Z \text{ with } Z \sim \mathcal{N}(0,\sigma^2)\).
RAYLEIGH	Select the Rayleigh fading channel with an AWGN gain: \(Y = X.H + Z \text{ with } Z \sim \mathcal{N}(0,\sigma) \text{ and } H \sim \mathcal{N}(0,\frac{1}{\sqrt 2})\).
RAYLEIGH_USER	Select the Rayleigh fading channel with the gain given in a file: \(Y = X.H + Z \text{ with } Z \sim \mathcal{N}(0,\sigma) \text{ and } H \text{ given by the user}\) (to use with the --chn-path parameter).
OPTICAL	Select the optical channel: \(Y_i = \begin{cases} CDF_0(x) & \text{ when } X_i = 0 \\ CDF_1(x) & \text{ when } X_i = 1 \end{cases}, \text{ with } x \sim \mathcal{U}(0,1)\), and the \(CDF_0\) and \(CDF_1\) are given by the user and selected in function of the current ROP (to use with the --sim-pdf-path parameter).
USER	Select the noised frame from a file: \(Y = Z \text{ with } Z \text{ given by the user}\) (to use with the --chn-path parameter).
USER_ADD	Select the noise to add to the frame from a given file: \(Y = X + Z \text{ with } Z \text{ given by the user}\) (to use with the --chn-path parameter).
USER_BEC	Select the event draw of the BEC from a file: \(Y_i = \begin{cases} erased & \text{if } e = 1 \\ X_i & \text{else} \end{cases}, \text{ with } e \text{ given by the user}\) (to use with the --chn-path parameter).
USER_BSC	Select the event draw of the BSC from a file: \(Y_i = \begin{cases} !X_i & \text{if } e = 1 \\ X_i & \text{else} \end{cases}, \text{ with } e \text{ given by the user}\) (to use with the --chn-path parameter).

Where:

• \(\sigma\) is the Gaussian noise variance, \(p_e\) is the event probability and ROP is the Received optical power of the simulated noise points. They are given by the user through the --sim-noise-range, -R argument.
• \(X\) is the original modulated frame and \(Y\) the noisy output.
• \(\mathcal{N}(\mu,\sigma^2)\) is the Normal or Gaussian distribution.
• \(\mathcal{U}(a,b)\) is the Uniform distribution.

For the OPTICAL channel, the CDF are computed from the given PDF with the --sim-pdf-path argument. This file describes the latter for the different ROP. There must be a PDF for a bit transmitted at 0 and another for a bit transmitted at 1.

Note

The NO, AWGN and RAYLEIGH channels handle complex modulations.

Warning

The BEC, BSC and OPTICAL channels work only with the OOK modulation (see the --mdm-type parameter).

--chn-implem

Type:text Allowed values:STD FAST GSL MKL Default:STD Examples:--chn-implem FAST

Select the implementation of the algorithm to generate the noise.

Description of the allowed values:

Value	Description
STD	Select the standard implementation based on the C++ standard library.
FAST	Select the fast implementation (handwritten and optimized for SIMD architectures).
GSL	Select an implementation based of the GSL.
MKL	Select an implementation based of the MKL (only available for x86 architectures).

Note

All the proposed implementations are based on the MT 19937 PRNG algorithm [MN98]. The Gaussian distribution \(\mathcal{N}(\mu,\sigma^2)\) is implemented with the Box-Muller method [BM+58] except when using the GSL where the Ziggurat method [MT00] is used instead.

Attention

To enable the GSL or the MKL implementations, you need to have those libraries installed on your system and to turn on specific CMake Options.

The Table 3.5, Table 3.6 and Table 3.7 present the throughputs of the different channel implementations depending on the frame size. The testbed for the experiments is an Intel(R) Xeon(R) CPU E3-1270 v5 @ 3.60GHz 8 threads CPU.

Comparison of the AWGN channel implementations (throughputs are in Mb/s).

Frame size	STD	FAST	MKL	GSL
16	31,80	99,12	29,80	41,39
32	30,05	134,94	53,72	46,76
64	30,78	165,92	93,80	52,79
128	31,24	188,06	148,31	54,77
256	31,41	199,14	204,53	55,38
512	31,52	199,43	267,74	55,49
1024	31,79	199,71	331,71	56,15
2048	31,61	200,16	342,06	56,32
4096	31,88	198,88	343,40	57,42
8192	30,43	195,78	342,59	56,92

Comparison of the BEC/BSC channel implementations (throughputs are in Mb/s).

Frame size	STD	FAST	MKL	GSL
16	36,18	114,87	104,1	58,92
32	40,28	170,64	184,99	69,14
64	42,84	223,78	319,65	77,26
128	43,28	252,41	474,18	87,78
256	43,42	272,82	624,92	93,71
512	43,51	273,22	738,72	95,36
1024	43,64	275,41	865,25	97,84
2048	43,63	272,78	996,88	97,25
4096	42,78	274,71	1109,13	97,65
8192	43,67	272,71	1116,41	98,47

Comparison of the optical channel implementations (throughputs are in Mb/s).

Frame size	STD	FAST	MKL	GSL
16	6,69	7,56	6,71	6,53
32	9,89	10,98	10,28	9,56
64	12,67	14,30	14,05	12,15
128	14,40	16,33	16,33	13,88
256	15,82	17,74	18,22	15,07
512	16,52	18,46	18,29	15,79
1024	17,18	19,14	19,31	16,19
2048	16,96	18,76	20,30	16,42
4096	17,19	18,65	20,29	16,47
8192	17,26	18,98	20,58	16,63

Note

The reported values are the average throughputs given by the simulator integrated statistics tool (see the --sim-stats parameter).

--chn-blk-fad

Type:text Allowed values:NO FRAME ONETAP Default:1 Examples:--chn-gain-occur 10

Set the block fading policy for the Rayleigh channel.

Note

At this time the FRAME and ONETAP block fading are not implemented.

--chn-gain-occur

Type:integer Default:1 Examples:--chn-gain-occur 10

Give the number of times a gain is used on consecutive symbols. It is used in the RAYLEIGH_USER channel while applying gains read from the given file.

--chn-path

Type:file Rights:read Examples:--chn-path example/path/to/the/right/file

Give the path to a file containing the noise.

The expected type of noise vary depending of the channel type (see the --chn-type parameter for more details):

• USER: the file must contain frame with the noise applied on it,
• USER_ADD: the file must contain only the noise \(Z\),
• RAYLEIGH_USER: the file must contain the gain values \(H\).

The expected file format is either ASCII or binary (the format is automatically detected). Here is the file structure expected in ASCII:

 # 'F' has to be replaced by the number of contained frames.
F

# 'N' has to be replaced by the frame size.
N

# a sequence of 'F * N' floating-point values (separated by spaces)
Y_0 Y_1 Y_2 Y_3 Y_4 [...] Y_{F*N-1}

In binary mode, \(F\) and \(N\) have to be 32-bit unsigned integers. The next \(F \times N\) floating-point values can be either in 32-bit or in 64-bit.

References

[BM+58]

G. E. P. Box, M. E. Muller, and others. A note on the generation of random normal deviates. The Annals of Mathematical Statistics, 29(2):610–611, 1958. doi:10.1214/aoms/1177706645.

[MT00]

G. Marsaglia and W. W. Tsang. The ziggurat method for generating random variables. Journal of Statistical Software, 5(8):1–7, 2000. doi:10.18637/jss.v005.i08.

[MN98]

M. Matsumoto and T. Nishimura. Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator. ACM Transactions on Modeling and Computer Simulation (TOMACS), 8(1):3–30, 1998. doi:10.1145/272991.272995.

Quantizer parameters

The quantizer is a module that ensures the real numbers transformation from a floating-point representation to a fixed-point representation. This module is enabled only if the receiver part of the communication chain works on a fixed-point representation (cf. the --sim-prec, -p parameter).

Warning

Some decoders are not fixed-point ready, please refer to the decoders documentation for more details.

--qnt-type

Type:text Allowed values:CUSTOM POW2 Default:POW2 Examples:--qnt-type CUSTOM

Select the quantizer type.

Description of the allowed values (\(Y_i\) stands for a floating-point representation and \(Q_i\) for the fixed-point representation of a real number):

Value	Description
CUSTOM	\(Q_i = \begin{cases} +v_{sat} & \text{when } v_i > +v_{sat} \\ -v_{sat} & \text{when } v_i < -v_{sat} \\ v_i & \text{else} \end{cases}\), with \(v_i = \lfloor \frac{Y_i}{\Delta} \rceil \text{ and } v_{sat} = 2^{p_b - 1} - 1 \text{ and } \Delta = \frac{|p_r|}{v_{sat}}\)
POW2	\(Q_i = \begin{cases} +v_{sat} & \text{when } v_i > +v_{sat} \\ -v_{sat} & \text{when } v_i < -v_{sat} \\ v_i & \text{else} \end{cases}\), with \(v_i = \lfloor Y_i * F \rceil \text{ and } v_{sat} = 2^{p_b - 1} - 1 \text{ and } F = 2^{p_d}\)

Where \(p_r\), \(p_b\) and \(p_d\) are respectively given through the --qnt-range, --qnt-bits and --qnt-dec parameters.

--qnt-implem

Type:text Allowed values:STD FAST Default:STD Examples:--qnt-implem FAST

Select the implementation of the quantizer.

Description of the allowed values:

Value	Description
STD	Select a standard implementation.
FAST	Select a fast implementation, only available for the POW2 quantizer.

--qnt-range

Type:real number Examples:--qnt-range 1.0

Select the min/max bounds for the CUSTOM quantizer.

--qnt-bits

Type:integer Default:8 else see Table 3.8 Examples:--qnt-bits 1

Set the number of bits used in the fixed-point representation.

Note

If the amplitude of the current number exceeds the maximum amplitude that can be represented with the current quantization, then a saturation is applied (c.f. the --qnt-type parameter).

Default values of the total number of bits for the different codes.

Code	Value
LDPC	6
POLAR	6
REP	6
RSC	6
RSC_DB	6
TPC	6 on 8-bit and 8 on 16-bit
TURBO	6
TURBO_DB	6

--qnt-dec

Type:integer Default:3 else see Table 3.9 Examples:--qnt-dec 1

Set the position of the decimal point in the quantified representation.

Default values of the decimal point position for the different codes.

Code	Value
LDPC	2
POLAR	1
REP	2
RSC	1 on 8-bit and 3 on 16-bit
RSC_DB	1 on 8-bit and 3 on 16-bit
TPC	2 on 8-bit and 3 on 16-bit
TURBO	2 on 8-bit and 3 on 16-bit
TURBO_DB	2 on 8-bit and 3 on 16-bit

Monitor parameters

The monitor is the last module in the chain: it compares the decoded information bits with the initially generated ones from the source. Furthermore, it can also compute the mutual information (MI) from the demodulator output.

--mnt-max-fe, -e

Type:integer Default:100 Examples:--mnt-max-fe 25

Set the maximum number of frame errors to simulated for each noise point.

--mnt-err-hist

Type:integer Examples:--mnt-err-hist 0

Enable the construction of the errors per frame histogram. Set also the maximum number of bit errors per frame included in the histogram (0 means no limit).

The histogram is saved in CSV format:

"Number of error bits per wrong frame"; "Histogram (noise: 5.000000dB, on 10004 frames)"
0; 0
1; 7255
2; 2199
3; 454
4; 84
5; 11
6; 12

--mnt-err-hist-path

Type:file Rights:write only Default:./hist Examples:--mnt-err-hist-path my/histogram/root/path/name

Path to the output histogram. When the files are dumped, the current noise value is added to this name with the .txt extension.

An output filename example is hist_2.000000.txt for a noise value of 2 dB. For Gnuplot users you can then simply display the histogram with the following command:

gnuplot -e "set key autotitle columnhead; plot 'hist_2.000000.txt' with lines; pause -1"

--mnt-mutinfo

Enable the computation of the mutual information (MI).

Note

Only available on BFER simulation types (see the --sim-type parameter for more details).

--mnt-red-lazy

Enable the lazy synchronization between the various monitor threads.

Using this parameter can significantly reduce the simulation time, especially for short frame sizes when the monitor synchronizations happen very often.

Note

This parameter is not available if the code has been compiled with MPI.

Note

By default, if the --mnt-red-lazy-freq parameter is not specified, the interval/frequency is set to the same value than the --ter-freq parameter.

Warning

Be careful, this parameter is known to alter the behavior of the --sim-max-fra, -n parameter.

--mnt-red-lazy-freq

Type:integer Default:1000 Examples:--mnt-red-lazy-freq 200

Set the time interval (in milliseconds) between the synchronizations of the monitor threads.

Note

This parameter automatically enables the --mnt-red-lazy parameter.

Note

This parameter is not available if the code has been compiled with MPI.

--mnt-mpi-comm-freq

Type:integer Default:1000 Examples:--mnt-mpi-comm-freq 1

Set the time interval (in milliseconds) between the MPI communications. Increase this interval will reduce the MPI communications overhead.

Note

Available only when compiling with the MPI support CMake Options.

Note

When this parameter is specified, the --ter-freq parameter is automatically set to the same value except if the --ter-freq is explicitly defined.

Terminal parameters

The terminal is an observer module that reads and display the monitor informations in real time. The terminal displays two types of results: intermediate results and final results. The intermediate results are printed on the error output during the simulation of a noise point and refreshed at a defined frequency (see the --ter-freq parameter). On the other hand, the final results are printed on the standard output once the simulation of the noise point is over.

--ter-type

Type:text Allowed values:STD Default:STD Examples:--ter-type STD

Select the terminal type (the format to display the results).

Description of the allowed values:

Value	Description
STD	Select the standard format.

Note

For more details on the standard output format see the Output section).

--ter-freq

Type:integer Default:500 Examples:--ter-freq 1

Set the display frequency (refresh time) of the intermediate results in milliseconds. Setting 0 disables the display of the intermediate results.

Note

When MPI is enabled, this value is by default set to the same value than the --mnt-mpi-comm-freq parameter.

--ter-no

Disable completely the terminal report.

Other parameters

--help, -h

Print the help with all the required (denoted as {R}) and optional arguments. The latter change depending on the selected simulation type and code.

aff3ct -h

Usage: ./bin/aff3ct -C <text> [optional args...]

Simulation parameter(s):
{R} --sim-cde-type, -C <text:including set={BCH|LDPC|POLAR|RA|REP|RS|RSC|RSC_DB|TPC|TURBO|TURBO_DB|UNCODED}>
      Select the channel code family to simulate.
    --sim-prec, -p     <integer:including set={8|16|32|64}>
      Specify the representation of the real numbers in the receiver part of the
      chain.
    --sim-type         <text:including set={BFER|BFERI|EXIT}>
      Select the type of simulation (or communication chain skeleton).

Other parameter(s):
    --Help, -H
      Print the help like with the '--help, -h' parameter plus advanced
      arguments (denoted as '{A}').
    --help, -h
      Print the help with all the required (denoted as '{R}') and optional
      arguments. The latter change depending on the selected simulation type and
      code.
    --no-colors
      Disable the colors in the shell.
    --version, -v
      Print informations about the version of the source code and compilation
      options.

--Help, -H

Print the help like with the --help, -h parameter plus advanced arguments (denoted as {A}).

aff3ct -H

Usage: ./bin/aff3ct -C <text> [optional args...]

Simulation parameter(s):
{R} --sim-cde-type, -C <text:including set={BCH|LDPC|POLAR|RA|REP|RS|RSC|RSC_DB|TPC|TURBO|TURBO_DB|UNCODED}>
      Select the channel code family to simulate.
    --sim-prec, -p     <integer:including set={8|16|32|64}>
      Specify the representation of the real numbers in the receiver part of the
      chain.
    --sim-type         <text:including set={BFER|BFERI|EXIT}>
      Select the type of simulation (or communication chain skeleton).

Other parameter(s):
    --Help, -H
      Print the help like with the '--help, -h' parameter plus advanced
      arguments (denoted as '{A}').
{A} --except-a2l
      Enhance the backtrace when displaying exception. This change the program
      addresses into filenames and lines. It may take some seconds to do this
      work.
{A} --except-no-bt
      Disable the backtrace display when running an exception.
{A} --full-legend
      Display the legend with all modules details when launching the simulation.
    --help, -h
      Print the help with all the required (denoted as '{R}') and optional
      arguments. The latter change depending on the selected simulation type and
      code.
{A} --keys, -k
      Display the parameter keys in the help.
    --no-colors
      Disable the colors in the shell.
{A} --no-legend
      Disable the legend display (remove all the lines beginning by the '#'
      character).
    --version, -v
      Print informations about the version of the source code and compilation
      options.

--version, -v

Print informations about the version of the source code and compilation options.

aff3ct -v

aff3ct (Linux 64-bit, g++-5.4, AVX2) v2.1.1-48-g1c72c3d
Compilation options:
  * Precision: 8/16/32/64-bit
  * Polar bit packing: on
  * Terminal colors: on
  * Backtrace: on
  * External strings: on
  * MPI: off
  * GSL: off
  * MKL: off
  * SystemC: off
Copyright (c) 2016-2018 - MIT license.
This is free software; see the source for copying conditions.  There is NO
warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.

--keys, -k

Display the parameter keys in the help.

aff3ct -h -k

Usage: ./bin/aff3ct -C <text> [optional args...]

Simulation parameter(s):
{R} --sim-cde-type, -C <text:including set={BCH|LDPC|POLAR|RA|REP|RS|RSC|RSC_DB|TPC|TURBO|TURBO_DB|UNCODED}>
      [factory::Launcher::parameters::p+cde-type,C]
      Select the channel code family to simulate.
    --sim-prec, -p     <integer:including set={8|16|32|64}>
      [factory::Launcher::parameters::p+prec,p]
      Specify the representation of the real numbers in the receiver part of the
      chain.
    --sim-type         <text:including set={BFER|BFERI|EXIT}>
      [factory::Launcher::parameters::p+type]
      Select the type of simulation (or communication chain skeleton).

Other parameter(s):
    --Help, -H
      [factory::Launcher::parameters::Help,H]
      Print the help like with the '--help, -h' parameter plus advanced
      arguments (denoted as '{A}').
    --help, -h
      [factory::Launcher::parameters::help,h]
      Print the help with all the required (denoted as '{R}') and optional
      arguments. The latter change depending on the selected simulation type and
      code.
    --no-colors
      [factory::Launcher::parameters::no-colors]
      Disable the colors in the shell.
    --version, -v
      [factory::Launcher::parameters::version,v]
      Print informations about the version of the source code and compilation
      options.

--except-a2l

Enhance the backtrace when displaying exception. This change the program addresses into filenames and lines. It may take some seconds to do this work.

Note

This option works only on Unix based OS and if AFF3CT has been compiled with debug symbols (-g compile flag) and without NDEBUG macro (-DNDEBUG flag).

--except-no-bt

Disable the backtrace display when running an exception.

--no-legend

Disable the legend display (remove all the lines beginning by the # character).

Tip

Use this option when you want to complete an already existing simulation result file with new noise points. Pay attention to use >> instead of > to redirect the standard output in order to add results at the end of the file and not overwriting it.

--full-legend

Display the legend with all modules details when launching the simulation.

This additional information can help to understand a problem in the simulation. Data can of course be redundant from one module to another.

--no-colors

Disable the colors in the shell.

PyBER

PyBER is our Python GUI to display the AFF3CT outputs.

It can be downloaded here: https://github.com/aff3ct/PyBER.

Install Python3

Download and install Anaconda3: https://www.anaconda.com/download/ (tested on Anaconda3-4.2.0-Windows-x86_64).

Next next next… Install! Pay attention to add Python to the PATH when installing it.

Run PyBER

From your terminal, go to the folder where PyBER is located an run it:

python pyBER.py &

Library API

Work in progress…

Classes

Work in progress…

Contributing Guidelines

We’re really glad you’re reading this, because we need volunteer developers to expand this project.

Here are some important resources to communicate with us:

• The official website: http://aff3ct.github.io,
• Bugs? Report issues on GitHub: https://github.com/aff3ct/aff3ct/issues.

Submitting changes

Please send a GitHub Pull Request to AFF3CT with a clear list of what you’ve done (read more about pull requests). Please make your modifications on the development branch, any pull to the master branch will be refused (the master is dedecated to the releases).

Always write a clear log message for your commits. One-line messages are fine for small changes, but bigger changes should look like this:

git commit -m "A brief summary of the commit
>
> A paragraph describing what changed and its impact."

Regression Testing

We maintain a database of BER/FER reference simulations. Please give us some new references which solicit the code you added. We use those references in an automated regression test script. To propose new references please use our dedicated repository and send us a pull request on it.

Coding conventions

Start reading our code and you’ll get the hang of it. For the readability, we apply some coding conventions:

• we indent using tabulation (hard tabs),
• we ALWAYS put spaces after list items and method parameters ([1, 2, 3], not [1,2,3]), around operators (x += 1, not x+=1), and around hash arrows,
• we use the snake case (my_variable, not myVariable), classes start with an upper case (My_class, not my_class) and variables/methods/functions start with a lower case,
• the number of characters is limited to 120 per line of code.

This is open source software. Consider the people who will read your code, and make it look nice for them. It’s sort of like driving a car: Perhaps you love doing donuts when you’re alone, but with passengers the goal is to make the ride as smooth as possible.

Readme

AFF3CT: A Fast Forward Error Correction Toolbox!

AFF3CT is a simulator dedicated to the Forward Error Correction (FEC or channel coding). It is written in C++ and it supports a large range of codes: from the well-spread Turbo codes to the very new Polar codes including the Low-Density Parity-Check (LDPC) codes. AFF3CT is a command line program and it simulates communication chains based on a Monte Carlo method.

It is very easy to use, for instance, to estimate the BER/FER decoding performances of the (2048,1723) Polar code from 1.0 to 4.0 dB:

aff3ct -C "POLAR" -K 1723 -N 2048 -m 1.0 -M 4.0 -s 1.0

And the output will be:

# ----------------------------------------------------
# ---- A FAST FORWARD ERROR CORRECTION TOOLBOX >> ----
# ----------------------------------------------------
# Parameters :
# [...]
#
# The simulation is running...
# ---------------------||------------------------------------------------------||---------------------
#  Signal Noise Ratio  ||   Bit Error Rate (BER) and Frame Error Rate (FER)    ||  Global throughput
#         (SNR)        ||                                                      ||  and elapsed time
# ---------------------||------------------------------------------------------||---------------------
# ----------|----------||----------|----------|----------|----------|----------||----------|----------
#     Es/N0 |    Eb/N0 ||      FRA |       BE |       FE |      BER |      FER ||  SIM_THR |    ET/RT
#      (dB) |     (dB) ||          |          |          |          |          ||   (Mb/s) | (hhmmss)
# ----------|----------||----------|----------|----------|----------|----------||----------|----------
       0.25 |     1.00 ||      104 |    16425 |      104 | 9.17e-02 | 1.00e+00 ||    4.995 | 00h00'00
       1.25 |     2.00 ||      104 |    12285 |      104 | 6.86e-02 | 1.00e+00 ||   13.678 | 00h00'00
       2.25 |     3.00 ||      147 |     5600 |      102 | 2.21e-02 | 6.94e-01 ||   14.301 | 00h00'00
       3.25 |     4.00 ||     5055 |     2769 |      100 | 3.18e-04 | 1.98e-02 ||   30.382 | 00h00'00
# End of the simulation.

Features

The simulator targets high speed simulations and extensively uses parallel techniques like SIMD, multi-threading and multi-nodes programming models. Below, a list of the features that motivated the creation of the simulator:

1. reproduce state-of-the-art decoding performances,
2. explore various channel code configurations, find new trade-offs,
3. prototype hardware implementation (fixed-point receivers, hardware in the loop tools),
4. reuse tried and tested modules and add yours,
5. alternative to MATLAB, if you seek to reduce simulations time.

Installation

First make sure to have installed a C++11 compiler, CMake and Git. Then install AFF3CT by running:

git clone --recursive https://github.com/aff3ct/aff3ct.git
mkdir aff3ct/build
cd aff3ct/build
cmake .. -DCMAKE_BUILD_TYPE="Release"
make -j4

Contribute

• Source Code: https://github.com/aff3ct/aff3ct
• Contributing guidelines: https://github.com/aff3ct/aff3ct/blob/master/CONTRIBUTING.rst

Support

If you are having issues, please let us know. We have an issue tracker at: https://github.com/aff3ct/aff3ct/issues

License

The project is licensed under the MIT license.

External Links

• Official website: https://aff3ct.github.io
• Documentation: https://aff3ct.readthedocs.io

Tips

Eclipse IDE

You may encounter an issue with Eclipse IDE, which doesn’t handle C++11 as a default behavior. To solve it you have to add the followings.

In Eclipse’s symbols (C/C++ General > Path and Symbols > Symbols), add:

GXX_EXPERIMENTAL_CXX0X (or __GXX_EXPERIMENTAL_CXX0X__)

In Compiler Options (C/C++ General > Preprocessor Include Paths, Macros etc. > Providers > DCT GCC Built-in Compiler Settings > Commands to get compiler specs):

• add -std=c++11 (or -std=c++1y).
• uncheck “Use global provider shared between projects”:

License

MIT License

Copyright (c) 2017-2019 aff3ct

Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the “Software”), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:

The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.

THE SOFTWARE IS PROVIDED “AS IS”, WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.