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 15 of 15 for “"Parallel concatenated"”.

  1. Multiple Parallel Concatenated Gallager Codes and Their Applications

    … a class of error control codes known as Multiple Parallel Concatenated Gallager Codes (MPCGCs) obtained by the parallel concatenation of well-designed LDPC codes. MPCGCs are constructed by breaking a long and high complexity of conventional single LDPC code into three or four smaller and lower …

    whiterose Download PDF for Multiple Parallel Concatenated Gallager Codes and Their Applications (opens in a new tab)

  2. Multiple Parallel Concatenated Gallager Codes: High Throughput Architecture Design and Implementation

    … to coding and decoding LDPC codes based on Parallel Concatenated Gallager Code (PCGCs) using multiple constituent codes. These are a class of concatenated codes built from the direct parallel concatenation of LDPC codes without interleavers. They are characterized by a competitive BER …

    whiterose Download PDF for Multiple Parallel Concatenated Gallager Codes: High Throughput Architecture Design and Implementation (opens in a new tab)

  3. Turbo and LDPC coding for the AWGN and space-time channel

    … investigated are based upon the application of a parallel concatenated scheme to directly map the data and parity bits generated by the encoder to one of three possible antennas outputs. It is further highlighted in this case how the interleaver plays a crucial role in determining overall …

    adelaide Repository record for Turbo and LDPC coding for the AWGN and space-time channel (opens in a new tab)

  4. On Turbo Codes And Other Concatenated Schemes In Communication Systems

    … exponential decoder complexity. Turbo codes are parallel concatenated convolutional codes, decoded with a suboptimal iterative algorithm. The complexity of the iterative algorithm increases only linearly with block length, bringing previously unprecedented performance within practical limits.. …

    plymouth Repository record for On Turbo Codes And Other Concatenated Schemes In Communication Systems (opens in a new tab)

  5. Improved SOVA and APP decoding algorithms for concatenated codes

    … fading channels, and storage channels for both parallel concatenated codes (PCCs) and serial concatenated codes (SCCs)

    concordia Download PDF for Improved SOVA and APP decoding algorithms for concatenated codes (opens in a new tab)

  6. On a turbo decoder design for low power dissipation

    … Two key innovations in turbo coding are parallel concatenated encoding and iterative decoding. A soft-in soft-out component decoder can be implemented using the maximum a posteriori (MAP) or the maximum likelihood (ML) decoding algorithm. While the MAP algorithm offers better performance …

    vt Repository record for On a turbo decoder design for low power dissipation (opens in a new tab)

  7. Implementation of Parallel and Serial Concatenated Convolutional Codes

    Parallel concatenated convolutional codes (PCCCs), called "turbo codes" by their discoverers, have been shown to perform close to the Shannon bound at bit error rates (BERs) between 1e-4 and 1e-6. Serial concatenated convolutional codes (SCCCs), which perform better than PCCCs at BERs lower than …

    vt Repository record for Implementation of Parallel and Serial Concatenated Convolutional Codes (opens in a new tab)

  8. Energy-Efficient Turbo Decoder for 3G Wireless Terminals

    … Two key innovations of turbo codes are parallel concatenated encoding and iterative decoding. In its IMT-2000 initiative, the International Telecommunication Union (ITU) adopted turbo coding as a channel coding standard for Third-Generation (3G) wireless high-speed (up to 2 Mbps) data …

    waterloo Repository record for Energy-Efficient Turbo Decoder for 3G Wireless Terminals (opens in a new tab)

  9. Spatially Coupled Turbo-Like Codes

    … First, we considered the spatial coupling of parallel concatenated codes (PCCs), serially concatenated codes (SCCs), and hybrid concatenated codes (HCCs).We also proposed two extensions of braided convolutional codes (BCCs) to higher coupling memories. Second, we investigated the impact of …

    lund Repository record for Spatially Coupled Turbo-Like Codes (opens in a new tab) Download PDF for Spatially Coupled Turbo-Like Codes (opens in a new tab)

  10. Analysis of the Asymptotic Performance of Turbo Codes

    … for large block lengths, $N\rightarrow\infty$. A parallel concatenated turbo code that consists of two or more component codes is considered. We demonstrate that for $N\rightarrow\infty$, the normalized weight of the systematic $\widehat{w_1}=\displaystyle\frac{w_1}{\sqrt{N}}$, and the parity …

    waterloo Repository record for Analysis of the Asymptotic Performance of Turbo Codes (opens in a new tab)

  11. Self-concatenated coding for wireless communication systems

    In this thesis, we have explored self-concatenated coding schemes that are designed for transmission over Additive White Gaussian Noise (AWGN) and uncorrelated Rayleigh fading channels. We designed both the symbol-based Self-Concatenated<br/>Codes considered using Trellis Coded Modulation (SECTCM) …

    soton Download PDF for Self-concatenated coding for wireless communication systems (opens in a new tab)

  12. Low-Complexity Interleaver Design for Turbo Codes

    … design, sub-vector interleaving, for both parallel and serially concatenated convolutional codes (PCCCs and SCCCs, respectively) is presented here. Since the method is low-complexity, it is uniquely suitable for designing long interleavers. Sub-vector interleaving is based on a dynamical …

    gatech Repository record for Low-Complexity Interleaver Design for Turbo Codes (opens in a new tab)

  13. Sparse Codes on Graphs with Convolutional Code Constraints

    … the BP and MAP performance. The TCs ensembles, parallel concatenated codes, serially concatenated codes, braided convolutional codes, and hybrid concatenated codes, with varying component convolutional codes strengths were considered in these investigations.This thesis focuses on investigating …

    lund Repository record for Sparse Codes on Graphs with Convolutional Code Constraints (opens in a new tab) Download PDF for Sparse Codes on Graphs with Convolutional Code Constraints (opens in a new tab)

  14. Reliability information in channel decoding : practical aspects and information theoretical bounds

    This thesis addresses the use of reliability information in channel decoding. The considered transmission systems comprise linear binary channel encoders, symmetric memoryless communication channels, and non-iterative or iterative symbol-by-symbol soft-output channel decoders. The notions of …

    cau-kiel Repository record for Reliability information in channel decoding : practical aspects and information theoretical bounds (opens in a new tab)