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 20 of 23 for “"Iterative Decoders"”.

  1. Convergence Improvement Of Iterative Decoders

    Iterative decoding techniques shaked the waters of the error correction and communications field in general. Their amazing compromise between complexity and performance offered much more freedom in code design and made highly complex codes, that were being considered undecodable until recently, …

    plymouth Repository record for Convergence Improvement Of Iterative Decoders (opens in a new tab)

  2. Timing-error-tolerant iterative decoders

    Iterative decoders such as Low-Density Parity-Check (LDPC) and turbo decoders have an inherent capability to correct the transmission errors that originate during communication over a hostile wireless channel. This capability has engendered the widespread use of LDPC and turbo decoders in current …

    soton Download PDF for Timing-error-tolerant iterative decoders (opens in a new tab)

  3. Complexity and Power Consumption in Stochastic Iterative Decoders

    Stochastic iterative decoding is a novel method to decode the bits received at the end of a communication channel and to control the rate of error happening in the message bits due to noise being injected into the channel. This decoder uses stochastic computation that is based on manipulation of …

    utahstate Repository record for Complexity and Power Consumption in Stochastic Iterative Decoders (opens in a new tab)

  4. Dual domain decoding of high rate convolutional codes for iterative decoders

    This thesis addresses the problem of decoding high rate convolutional codes directly without resorting to puncturing. High rate codes are necessary for applications which require high bandwidth efficiency, like high data rate communication systems and magnet recording systems. Convolutional (rate …

    adelaide Repository record for Dual domain decoding of high rate convolutional codes for iterative decoders (opens in a new tab)

  5. Trapping Sets of Iterative Decoders for Quantum and Classical Low-Density Parity-Check Codes

    … computation. Error correction codes and their decoders perform this step by adding redundant information that aids the decoder to recover or protect the logical information even in the presence of noise. Low-density parity-check (LDPC) codes have been one of the most popular error correction …

    arizona-thes Repository record for Trapping Sets of Iterative Decoders for Quantum and Classical Low-Density Parity-Check Codes (opens in a new tab)

  6. Iterative Decoding of Codes on Graphs

    … can be attributed to the low complexity of the iterative decoders, and their potential to achieve performance very close to the Shannon capacity. This makes them an attractive candidate for ECC applications in communication systems. This report proposes methods to systematically construct …

    arizona-thes Repository record for Iterative Decoding of Codes on Graphs (opens in a new tab)

  7. Iterative decoding in analog VLSI

    … explores theoretical and practical aspects of iterative decoding algorithms when they are implemented on analog continuous-time platforms. Analog continuous-time iterative decoding was proposed a few years ago to improve the power/speed ratio of decoder chips that decode capacity achieving …

    carleton Repository record for Iterative decoding in analog VLSI (opens in a new tab)

  8. Low Complexity Iterative Algorithms in Channel Coding and Compressed Sensing

    Iterative algorithms are now widely used in all areas of signal processing and digital communications. In modern communication systems, iterative algorithms are notably used for decoding low-density parity-check (LDPC) codes, a popular class of error-correction codes known to have exceptional …

    arizona-thes Repository record for Low Complexity Iterative Algorithms in Channel Coding and Compressed Sensing (opens in a new tab)

  9. A multistage scheduled decoder for short block length low-density parity-check codes

    … can be related to their relatively simple iterative decoders and their potential to achieve high performance close to shannon limit. These make them an attractive candidate for error correcting application in communication systems. In this thesis, we focus our research on the iterative …

    concordia Download PDF for A multistage scheduled decoder for short block length low-density parity-check codes (opens in a new tab)

  10. Low-complexity iterative decoding for bit-interleaved coded modulation

    … of this work is on the design and analysis of iterative decoding schemes employing hard-decision feedback. Although suboptimum by nature, hard-decision feedback allows for low-complexity iterative decoders, which renders this approach advantageous for practical implementations. Two particular …

    ubc Repository record for Low-complexity iterative decoding for bit-interleaved coded modulation (opens in a new tab) Download PDF for Low-complexity iterative decoding for bit-interleaved coded modulation (opens in a new tab)

  11. Generalized space-time block coding for co-located and cooperative MIMO systems

    … Serial Concatenated Codes (SCCs) using iterative decoders. The application of irregular LDCs is investigated in the context of co-located Multiple-Input Multiple-Output (MIMO) elements using coherent detection. We provide the detailed mathemat ical representation of various Space-Time …

    soton Download PDF for Generalized space-time block coding for co-located and cooperative MIMO systems (opens in a new tab)

  12. Capacity Approaching Strategies for the Uncoordinated Gaussian Multiple Access Channel

    … performance of such random access schemes with iterative collision resolution or Successive Interference Cancellation (SIC) for the interference-limited channel has been studied in previous works and the results show that the through put efficiency of random access schemes can be as high as …

    tamu Repository record for Capacity Approaching Strategies for the Uncoordinated Gaussian Multiple Access Channel (opens in a new tab)

  13. Concatenated coding and equalization for data transmission and storage

    … by an interleaver, and is decoded using two iterative decoders that implement the it a posteriori probability (APP) algorithm. One of the weaknesses of this scheme is that its error rate curves tend to hit an error rate floor near P(b) = 10⁻⁶. The level of the floors have been found to depend …

    arizona-thes Repository record for Concatenated coding and equalization for data transmission and storage (opens in a new tab)

  14. LDPC Coding for Magnetic Storage: Low Floor Decoding Algorithms, System Design and Performance Analysis

    … floor phenomenon associated with their iterative decoders. By delineating the fundamental principles, we extend to partial response channels algorithms for predicting the error rate performance in the floor region for the binary-input AWGN channel. We develop three classes of decoding …

    arizona-thes Repository record for LDPC Coding for Magnetic Storage: Low Floor Decoding Algorithms, System Design and Performance Analysis (opens in a new tab)

  15. Analysis of Failures of Decoders for LDPC Codes

    … low complexity sub-optimal decoding algorithms. Iterative decoders are one such class of decoders that work on a graphical representation of a code known as the Tanner graph. Their properties have been well understood in the asymptotic limit of the code length going to infinity. However, the …

    arizona-thes Repository record for Analysis of Failures of Decoders for LDPC Codes (opens in a new tab)

  16. Finite tree-based decoding of low-density parity-check codes

    … parity-check codes are commonly decoded using iterative message-passing decoders, such as the min-sum and sum-product decoders. Computer simulations demonstrate that these suboptimal decoders are capable of achieving low probability of bit error at signal-to-noise ratios close to capacity. …

    nebraska Repository record for Finite tree-based decoding of low-density parity-check codes (opens in a new tab)

  17. Αρχιτεκτονικές και υλοποίηση κωδίκων διόρθωσης λαθών

    … complex and time consuming procedure of iterative decoding. Recent analog implementations of small iterative decoders exploit the nonlinear nature of transistors used in CMOS or BiCMOS technologies and outperform their digital counterparts in terms of power consumption and decoding speed. …

    greece Repository record for Αρχιτεκτονικές και υλοποίηση κωδίκων διόρθωσης λαθών (opens in a new tab)

  18. Graph-based decoders and divergence-rate estimators for data-hiding problems

    … filtering, and show that the graph-based iterative decoders perform almost as well as if they had exact knowledge of the distortion channel parameters. Other desirable features of the graph-based decoders include the flexibility to adapt to other types of distortions and the ability to …

    uiuc Repository record for Graph-based decoders and divergence-rate estimators for data-hiding problems (opens in a new tab)

  19. Codes on Graphs and Analysis of Iterative Algorithms for Reconstructing Sparse Signals and Decoding of Check-Hybrid GLDPC Codes

    … processing have led to developing low-complexity iterative algorithms. In the fields of compressed sensing and channel coding, which are the main focus of this dissertation, designing low-complexity iterative algorithms with excellent performance has been of interest for many years. Recently, …

    arizona-thes Repository record for Codes on Graphs and Analysis of Iterative Algorithms for Reconstructing Sparse Signals and Decoding of Check-Hybrid GLDPC Codes (opens in a new tab)

Page 1 of 2