| Procedure | Location | Procedure Type | Description |
|---|---|---|---|
| check_llr | ldpc_decoder | Function | Check the array of LLRs (or LAPPRs) against the syndrome |
| decode | ldpc_decoder | Subroutine | Iteratively decode array of LLR (or LAPPRs) based on syndrome |
| destructor | ldpc_decoder | Subroutine | Destructor method for the TDecoder object It will just deallocate whatever was allocated. |
| destructor | ldpc_edge_list | Subroutine | Should be called automatically |
| edge_to_node_convert_table | ldpc_decoder | Subroutine | Build node-to-node connection list from node-to-edge and edge-to-other-node |
| f_plus_add | ldpc_decoder | Function | Real sum |
| f_plus_box | ldpc_decoder | Function | Box-plus sum |
| invert_table | ldpc_decoder | Subroutine | Create an array which contains, in each location, the list of edges connected to the node corresponding to that location |
| llr_to_word | ldpc_decoder | Function | Binarize the LLRs (or LAPPRs) |
| print_decoder | ldpc_decoder | Subroutine | |
| process_cnode | ldpc_decoder | Subroutine | Variable node A Posteriori Probability (APP) processing function |
| process_vnode | ldpc_decoder | Subroutine | Variable node A Posteriori Probability (APP) processing function |
| process_xnode | ldpc_decoder | Subroutine | Generic processing function, it works both for variable- and for check- nodes - for variable nodes, f_plus_kind is a simple addition routine - for check nodes, f_plus_kind can be: + the "box plus" for exact message passing + the min abs with sign product for the min-sum algorithm + whatever you want for your approximation |
| TDecoder | ldpc_decoder | Interface | |
| TDecoderConstructor | ldpc_decoder | Function | |
| TEdgeList | ldpc_edge_list | Interface | |
| TEdgeListConstructor | ldpc_edge_list | Function | Constructor of TEdgeList |
| word_to_synd | ldpc_decoder | Function | Evaluate the syndrome from a word |