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 9 of 9 for “"Graph-based codes"”.
-
On performance analysis and implementation issues of iterative decoding for graph based codes
… its excellent distance spectrum. However, these codes remain useless in practical applications due to the lack of decoders rendering good performance at an acceptable complexity. The invention of turbo code marks a milestone progress in channel coding theory in that it achieves near Shannon limit …
-
Design and Analysis of Graph-based Codes Using Algebraic Lifts and Decoding Networks
Error-correcting codes seek to address the problem of transmitting information efficiently and reliably across noisy channels. Among the most competitive codes developed in the last 70 years are low-density parity-check (LDPC) codes, a class of codes whose structure may be represented by sparse …
-
Theory and Design of Graph-Based Codes for Improved Iterative and Windowed Decoding
… noisy channels. This dissertation focuses on graph-based codes, which are codes whose representation, encoding, and/or decoding can be visualized using a sparse graph. We examine a variety of problems for understanding and improving low density parity check (LDPC) codes. While iterative …
-
Applications of graph-based codes in networks: analysis of capacity and design of improved algorithms
The conception of turbo codes by Berrou et al. has created a renewed interest in modern graph-based codes. Several encouraging results that have come to light since then have fortified the role these codes shall play as potential solutions for present and future communication problems. This work …
-
Graph-based and algebraic codes for error-correction and erasure recovery
Expander codes are sparse graph-based codes with good decoding algorithms. We present a linear-time decoding algorithm for (C,D, alpha, gamma) expander codes based on graphs with any expansion factor given that the minimum distances of the inner codes are bounded below. We also design graph-based …
-
Applications of Sparse Signal Recovery: 2D-Pattern Matching and Sparse Walsh-Hadamard Transform Computation
… locations where sub-image appears. We use sparse graph based codes Fourier transform computation to compute the peaks in the 2-D correlation to determine the matching positions in a computationally efficient manner. We then design a 2-D pattern that can facilitate vision based positioning by …
-
Codes on Graphs and More
… Hence, efficient low-complexity channel codes providing low probabilities for erroneous receptions are needed. Interpreting codes as graphs and graphs as codes opens new perspectives for constructing such channel codes. Low-density parity-check (LDPC) codes are one of the most recent …
-
On Coding for Partial Erasure Channels
Error correcting codes have been essential to the technology we use in everyday life in digital storage, wireless communication, barcodes, and much more. Different channel models are used for different types of communication (for example, if information is sent to one person or to many people) and …
-
Capacity Approaching Coding Strategies for Machine-to-Machine Communication in IoT Networks
… joint BP decoder employs the associated Tanner graphs of the parity check matrices to iteratively recover the erasures in the received combined codewords. Specifically, the joint decoder performs two steps in each decoding iteration: 1) simultaneously and independently runs the BP decoding …