FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W295513270> ?p ?o ?g. }

• W295513270 abstract "Low-density parity-check (LDPC) codes have been the focus of much research over the past decade thanks to their near Shannon limit performance and to their efficient message- passing (MP) decoding algorithms. However, the error floor phenomenon observed in MP decoding, which manifests itself as an abrupt change in the slope of the error-rate curve, has hindered the adoption of LDPC codes and MP decoders in some applications requiring very low error rates. As an alternative to MP decoding, linear programming (LP) decoding is an approximation to maximum-likelihood decoding by relaxing the optimal decoding problem into a linear optimization problem. It has been noticed that, when the symbols error probability in channel output is low, LP decoding has superior error correction performance. However, due to the inefficiency of general- purpose LP solvers which are not optimized for solving LP problems, LP decoding is computationally more complex than MP decoding, especially for codes of large block size. In this dissertation, we first design an efficient exhaustive search algorithm to find all small error-prone substructures, some of which are commonly blamed for certain decoding failures of MP decoding. Then, we investigate the cause of error floors in LDPC codes from the perspective of the MP decoder implementation, with special attention to limitations that decrease the numerical accuracy of messages passed during decoding, and propose a quantization method for fixed-point implementation of MP decoding which significantly improves the error-floor performance by overcoming the limitations of standard quantization rules. For LP decoding, we improve the error-correcting capability of LP decoding by using an effective algorithm to generate additional redundant parity-check constraints which eliminate certain undesired solutions to LP decoding problem. We further propose an efficient message-passing algorithm to solve the LP decoding problem. This algorithm is based on the alternating direction method of multipliers (ADMM), a classic technique in convex optimization theory, and our key contribution is a novel, efficient projection algorithm that can improve the decoding speed of the ADMM- based LP decoder. The last part of this dissertation is a separate piece of work on optimizing video transmission over distributed cognitive radio network" @default.
• W295513270 created "2016-06-24" @default.
• W295513270 creator A5058305195 @default.
• W295513270 date "2012-01-01" @default.
• W295513270 modified "2023-09-24" @default.
• W295513270 title "LDPC Codes--Structural Analysis and Decoding Techniques." @default.
• W295513270 hasPublicationYear "2012" @default.
• W295513270 type Work @default.
• W295513270 sameAs 295513270 @default.
• W295513270 citedByCount "1" @default.
• W295513270 countsByYear W2955132702016 @default.
• W295513270 crossrefType "book-chapter" @default.
• W295513270 hasAuthorship W295513270A5058305195 @default.
• W295513270 hasConcept C103088060 @default.
• W295513270 hasConcept C11413529 @default.
• W295513270 hasConcept C132727834 @default.
• W295513270 hasConcept C157125643 @default.
• W295513270 hasConcept C193969084 @default.
• W295513270 hasConcept C204397858 @default.
• W295513270 hasConcept C33923547 @default.
• W295513270 hasConcept C41008148 @default.
• W295513270 hasConcept C57273362 @default.
• W295513270 hasConcept C67692717 @default.
• W295513270 hasConcept C78944582 @default.
• W295513270 hasConceptScore W295513270C103088060 @default.
• W295513270 hasConceptScore W295513270C11413529 @default.
• W295513270 hasConceptScore W295513270C132727834 @default.
• W295513270 hasConceptScore W295513270C157125643 @default.
• W295513270 hasConceptScore W295513270C193969084 @default.
• W295513270 hasConceptScore W295513270C204397858 @default.
• W295513270 hasConceptScore W295513270C33923547 @default.
• W295513270 hasConceptScore W295513270C41008148 @default.
• W295513270 hasConceptScore W295513270C57273362 @default.
• W295513270 hasConceptScore W295513270C67692717 @default.
• W295513270 hasConceptScore W295513270C78944582 @default.
• W295513270 hasLocation W2955132701 @default.
• W295513270 hasOpenAccess W295513270 @default.
• W295513270 hasPrimaryLocation W2955132701 @default.
• W295513270 hasRelatedWork W1525329328 @default.
• W295513270 hasRelatedWork W2018412470 @default.
• W295513270 hasRelatedWork W2021390232 @default.
• W295513270 hasRelatedWork W2038267747 @default.
• W295513270 hasRelatedWork W2050465020 @default.
• W295513270 hasRelatedWork W2103330154 @default.
• W295513270 hasRelatedWork W2120548933 @default.
• W295513270 hasRelatedWork W2168555066 @default.
• W295513270 hasRelatedWork W228711149 @default.
• W295513270 hasRelatedWork W2308132558 @default.
• W295513270 hasRelatedWork W2518725629 @default.
• W295513270 hasRelatedWork W2527704188 @default.
• W295513270 hasRelatedWork W2546697521 @default.
• W295513270 hasRelatedWork W2783199716 @default.
• W295513270 hasRelatedWork W2806479847 @default.
• W295513270 hasRelatedWork W2808656523 @default.
• W295513270 hasRelatedWork W2808706726 @default.
• W295513270 hasRelatedWork W2963770356 @default.
• W295513270 hasRelatedWork W3045828085 @default.
• W295513270 hasRelatedWork W3173488874 @default.
• W295513270 isParatext "false" @default.
• W295513270 isRetracted "false" @default.
• W295513270 magId "295513270" @default.
• W295513270 workType "book-chapter" @default.