Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 13 of 13 for “"Message-passing decoding"”.
-
Coding Schemes for Physical Layer Network Coding Over a Two-Way Relay Channel
… signals from which a function of the transmitted messages is computed for broadcast. We consider the design of codebooks which permit the recovery of a function at the relay and derive information-theoretic bounds on the rates for reliable decoding at the relay. In the spirit of …
-
Compressive sensing based imaging via belief propagation
… with reasonable accuracy using an iterative message passing decoding algorithm commonly known as Belief Propagation (BP). The CS technique can accurately recover any compressible or sparse signal from a lesser number of non-adaptive, randomized linear projection samples than that specified by …
-
Pseudocodewords on graph covers and computation trees
The application and study of iterative message-passing decoders has exploded in recent years, due to their amazing efficiency and near-optimal performance. Much of the analysis of these decoders relies on a heuristic link between the local nature of these algorithms and certain graph structures, …
-
Bounds on the map threshold of iterative decoding systems with erasure noise
Iterative decoding and codes on graphs were first devised by Gallager in 1960, and then rediscovered by Berrou, Glavieux and Thitimajshima in 1993. This technique plays an important role in modern communications, especially in coding theory and practice. In particular, low-density parity-check …
-
Efficient decoding and application of rateless codes
… first, we consider the problem of low complexity decoding of Luby Transform (LT) and Raptor codes, which are classes of Fountain codes. We introduce a decoding method which has a significantly reduced compu tational load compared to the commonly used alternative of message-reset decoding with a …
-
Short-length Low-density Parity-check Codes: Construction and Decoding Algorithms
… by random noise. Optimal maximum likelihood decoding of LDPC codes is too complex to be practically useful even at short block lengths and so a graph-based message passing decoder known as the belief propagation algorithm is used instead. In fact, on graphs without closed paths known as …
-
Communications Through Non-Line-of-Sight Solar-Blind Ultraviolet Scattering Channels
… Practical error control coding is applied, and a message passing decoding technique is outlined in order to approach the fundamental channel rates. Finally, to improve the system performance in terms of the information rates, an array of multiple receiver elements is considered to make use of the …
-
On Lowering the Error Floor of Short-to-Medium Block Length Irregular Low Density Parity Check Codes
… were used to significantly improve the decoding performance of short to medium length irregular LDPC codes. Currently, the short to medium length LDPC codes with the lowest error floor are DE optimized irregular LDPC codes constructed using progressive edge growth (PEG) algorithm …
-
Changing edges in graphical model algorithms
… interactions in structures, such as the nodes in decoding circuits, agents in small-world networks, and neurons in our brains. These structures are often not static and can change over time, resulting in removal of edges, extra nodes, or changes in weights of the links in the graphs. For example, …
-
Trapping Sets of Iterative Decoders for Quantum and Classical Low-Density Parity-Check Codes
… parity check matrices, and efficient iterative decoding algorithms. This dissertation deals with failure configurations, known as \emph{trapping sets} of classical and quantum LDPC codes when decoded with iterative message passing decoding algorithms, and the \emph{error floor phenomenon} - the …
-
Analysis and Decoding of Linear Lee-Metric Codes with Application to Code-Based Cryptography
… channel matching to the Lee metric under the decoding rule ``decode to the nearest codeword''. The second model is a block-wise channel introducing an error of fixed Lee weight, motivated by code-based cryptography where errors of fixed weight are added intentionally. We show that both …
-
Sparse Codes on Graphs with Convolutional Code Constraints
… ability to perform low-complexity iterative message passing decoding procedures. The iterative message passing decoders that exchange messages probabilities, or beliefs, within the code graph are known as the belief propagation (BP) decoders. The BP decoders are sub-optimal, whereas …
-
Iterative decoding techniques on digital receivers
… models that can predict with high accuracy the decoding performance for particular implementations of LDPC decoders. Since unlimited LDPC codes can be constructed and used, in combination with a variety of decoding algorithms, such a model must be parameterized in terms of the implemented code …