Search for dissertations about: "belief propagation decoding"
Showing result 1 - 5 of 6 swedish dissertations containing the words belief propagation decoding.
-
1. Simplified Graphical Approaches for CDMA Multi-User Detection, Decoding and Power Control
Abstract : The individual optimal detector for code-division multiple-access (CDMA) systems is based on the marginal a posteriori distribution of the transmitted bits. The marginalization is in general hard since a summation is required, which grows exponentially in scope with the number of active users. READ MORE
-
2. Finite-Length Scaling Laws for Spatially-Coupled LDPC Codes
Abstract : This thesis concerns predicting the finite-length error-correcting performance of spatially-coupled low-density parity-check (SC-LDPC) code ensembles over the binary erasure channel. SC-LDPC codes are a very powerful class of codes; their use in practical communication systems, however, requires the system designer to specify a considerable number of code and decoder parameters, all of which affect both the code’s error-correcting capability and the system’s memory, energy, and latency requirements. READ MORE
-
3. On Probabilistic Shaping and Learned Decoders with Application to Fiber-Optic Communications
Abstract : We live in an ubiquitously connected world whose backbone are optical fibers. Achieving high spectral efficiencies and hence high transmission rates requires a careful combination of forward error correction (FEC) and higher-order modulation. This is referred to as coded modulation. READ MORE
-
4. Sparse Codes on Graphs with Convolutional Code Constraints
Abstract : Modern coding theory is based on the foundation of the sparse codes on graphs, such as the low-density parity-check (LDPC) codes, and the turbo-like codes (TCs) with component convolutional codes. The success of the LDPC codes and the TCs lies in their ability to perform low-complexity iterative message passing decoding procedures. READ MORE
-
5. Spatially Coupled Turbo-Like Codes
Abstract : The focus of this thesis is on proposing and analyzing a powerful class of codes on graphs---with trellis constraints---that can simultaneously approach capacity and achieve very low error floor. In particular, we propose the concept of spatial coupling for turbo-like code (SC-TC) ensembles and investigate the impact of coupling on the performance of these codes. READ MORE