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 “"Tanner Graphs"”.
-
Error -Correcting Codes on Graphs: Lexicodes, Trellises and Factor Graphs
… technique is based on decoding with factor graphs, which are smaller than trellis representations and have enjoyed much attention in the recent literature. We look at a specific type of factor graphs known as Tanner graphs, for which a decoding algorithm is known. This decoding algorithm is …
-
The Analysis of Error Floor and Graphical Structure of LDPC Codes
… efficient algorithms for counting them in the Tanner graph of LDPC codes, one for Tanner graphs of general LDPC codes, and one tailored for Tanner graphs of practically important quasi cyclic (QC) protograph LDPC codes.We show that for sparse graphs, the proposed algorithms significantly …
-
On Lowering the Error Floor of Short-to-Medium Block Length Irregular Low Density Parity Check Codes
… extrinsic message degrees (ACE) in the LDPC code graphs constructed. The aim of the present work is to find efficient means to improve on the error floor performance published for short to medium length irregular LDPC codes over AWGN channels in the literature. An efficient algorithm for …
-
Algebraic constructions of low -density parity check codes
… the codes in more detail. Using Ramanujan graphs and introducing the notion of a graph splitting, we describe a new construction to obtain families of LDPC codes. With the tools of Schubert calculus and Grassmannians we construct a new family of so-called finite geometry LDPC codes. In each …
-
Rateless Coding for Single-Source Networks with Common Information
… with BP decoders due to their sparse decoding Tanner graphs. We provide insights and solutions for the 2-terminal setting as an example that show the extraordinary power and flexibility of fountain codes to address the conflicting challenges in the design of efficient transmission protocols. …
-
Improving the Error Floor Performance of LDCP Codes with Better Codes and Better Decoders
… most commonly known as trapping sets, in the Tanner representation of a code. Since then, the study of error floor mostly consists of three major problems: 1) estimating error floor; 2) constructing LDPC codes with low error floor and 3) designing decoders that are less susceptible to error …
-
Design of LDPC codes and reliable practical decoders for standard and non-standard channels
… when redundant check nodes are added to the Tanner graph. This motivates our research on structured LDPC codes over integer residue rings, where the corresponding Tanner graphs with constant variable and check node degrees contain redundant check nodes. The original decoding algorithm …
-
Single and joint iterative decoding for higher order modulation schemes
… parity-check (LDPC) codes, iterative decoding on Tanner graphs, and their application on joint iterative receivers based on the turbo principle, previously proposed. The construction of random LDPC codes that fulfil certain desirable characteristics, such as large girth, specific p and -y values, …
-
Neural Network-Based Iterative Decoding, Code Design, and Erasure Correction of Low-Density Parity-Check Codes
… algorithm to reduce short cycles in their Tanner graphs and to construct LDPC codes with a girth of at least eight. We use masking to further reduce the number of short cycles and to adjust the column and row weights of the parity-check matrices of the constructed codes for performance …
-
Changing edges in graphical model algorithms
… nodes, or changes in weights of the links in the graphs. For example, wires in message-passing decoding circuits can be misconnected due to process variation in nanoscale manufacturing or circuit aging, the style of passes among soccer players can change based on the team's strategy, and the …
-
Complexity aware C-RAN scheduling for LDPC codes over BEC
Effective transmission of data over a noisy wireless channel is a vital part of today's high speed technology driven society. In a wireless cell network, information is sent from mobile users to base stations. The information being transmitted is protected by error-control codes. In a conventional …
-
Applications of Coding Theory to Massive Multiple Access and Big Data Problems
… multiple access and big data. Although bipartite Tanner graphs and low-complexity iterative algorithms such as peeling and message passing decoders are very popular in the channel coding literature they are not as widely used in the respective areas of study and this dissertation serves as an …
-
Capacity Approaching Coding Strategies for Machine-to-Machine Communication in IoT Networks
… the 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 …