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 38 for “"iterative decoding"”.

  1. Iterative decoding of codes defined on graphs

    Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1998.

    mit Repository record for Iterative decoding of codes defined on graphs (opens in a new tab)

  2. Channel matched iterative decoding for magnetic recording systems.

    … pattern correction code (EPCC), which works iteratively with the other constituent code in TE, whether block or convolutional, to suppress the occurrence of low-Euclidean-distance errors at the output of the channel detector. To understand this mechanism, and with no loss of generality, we …

    umn Repository record for Channel matched iterative decoding for magnetic recording systems. (opens in a new tab)

  3. The Study of Turbo Codes and Iterative Decoding

    … bound is much less than a full simulation of the iterative turbo decoding. Based on the proposed methodologies, we discuss the guideline for the design of turbo codes which satisfy two design criteria.

    uiuc Repository record for The Study of Turbo Codes and Iterative Decoding (opens in a new tab)

  4. Single and joint iterative decoding for higher order modulation schemes

    … low-density 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, …

    whiterose Repository record for Single and joint iterative decoding for higher order modulation schemes (opens in a new tab)

  5. Trellis-based iterative decoding of block codes for satellite ATM

    … (SNRs). Turbo Codes or concatenated codes with iterative decoding, can achieve a performance very close to the Shannon limit. They are the most powerful codes known so far and are considered for use in various applications. In this thesis, we present the turbo codes using Reed-Muller (RM) codes …

    concordia Repository record for Trellis-based iterative decoding of block codes for satellite ATM (opens in a new tab)

  6. Iterative Decoding and Channel Estimation over Hidden Markov Fading Channels

    … exploit hidden Markov fading models within an iterative (turbo) decoding framework. Of particular importance is the problem of channel estimation, which is vital for realizing the large coding gains inherent in turbo coded schemes. This thesis shows that a Markov fading channel (MFC) can be …

    vt Repository record for Iterative Decoding and Channel Estimation over Hidden Markov Fading Channels (opens in a new tab)

  7. Transceiver Design with Iterative Decoding of Capacity-Approaching codes over Fading channels

    … knowledge of channel estimation accuracy into iterative decoding processes. We also propose a joint maximum-likelihood detector based on soft-output Viterbi algorithm for LDPC coded transmissions over block-wise static fading channels with unknown fading statistics. Computer simulations show …

    nus Repository record for Transceiver Design with Iterative Decoding of Capacity-Approaching codes over Fading channels (opens in a new tab)

  8. GMD Decoding of Euclidean -Space Codes and Iterative Decoding of Turbo Codes

    … and leads to a better understanding of the turbo decoding algorithm. Specifically, a simplified stopping criterion based on the characteristics of the phase trajectories is provided.

    uiuc Repository record for GMD Decoding of Euclidean -Space Codes and Iterative Decoding of Turbo Codes (opens in a new tab)

  9. On Iterative Decoding of Bch Codes and Decoding Beyond the Bch Bound

    Made available in DSpace on 2015-09-25T20:09:50Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 6915412.pdf: 1296238 bytes, checksum: ae9e9bfbda92498eb7733384ab2c9d2a (MD5) Previous issue date: 1969

    uiuc Repository record for On Iterative Decoding of Bch Codes and Decoding Beyond the Bch Bound (opens in a new tab)

  10. On Iterative Decoding of Bch Codes and Decoding Beyond the Bch Bound

    Made available in DSpace on 2015-05-12T21:43:52Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 6915412.PDF: 1820527 bytes, checksum: 9a49271a8d50009362cdb1eb2974e5d2 (MD5) Previous issue date: 1969

    uiuc Repository record for On Iterative Decoding of Bch Codes and Decoding Beyond the Bch Bound (opens in a new tab)

  11. Iterative decoding for rate adaptive forward error correction on the mobile satellite channel.

    … are especially interested in codes that can be iteratively decoded. Multilevel coded modulations are considered: partitioning of constellations, coding principle and iterative decoding are studied. We present design rules for multilevel coded modulations through the asymptotic coding gain, the …

    ottawa-retro Repository record for Iterative decoding for rate adaptive forward error correction on the mobile satellite channel. (opens in a new tab)

  12. On performance analysis and implementation issues of iterative decoding for graph based codes

    … Shannon limit performance by using an elegant iterative decoding algorithm. This great success stimulated intensive research oil long compound codes sharing the same decoding mechanism. Among these long codes are low-density parity-check (LDPC) code and product code, which render brilliant …

    njit Repository record for On performance analysis and implementation issues of iterative decoding for graph based codes (opens in a new tab)

  13. Iterative Detection and Decoding for Wireless Communications

    … nonuniform interleaving, and an associated iterative decoding algorithm. Although the iterative decoding algorithm has been primarily used for the decoding of turbo codes, it represents a solution to a more general class of estimation problems that can be described as follows: a data set …

    vt Repository record for Iterative Detection and Decoding for Wireless Communications (opens in a new tab)

  14. On the Design of Turbo Codes

    … and the interleaver, as well as the procedure of iterative decoding. The investigations are carried out for transmission on additive white Gaussian noise channels. Two aspects that influence the performance of Turbo codes are considered: (1) code properties, in terms of Hamming distance spectra, …

    lund Repository record for On the Design of Turbo Codes (opens in a new tab)

  15. Turbo coding and equalization for wireless communication systems

    … near Shannon Limit performance possible when Iterative decoding algorithms are used. Intersymbol interference (ISI) is a major problem in communication systems when information is transmitted through a wireless channel. Conventional approaches implement an equalizer to remove the ISI, but …

    greenwich Repository record for Turbo coding and equalization for wireless communication systems (opens in a new tab)

  16. Fountain codes for the wireless Internet

    … and Bit Interleaved Coded Modulation using Iterative Decoding (LT-BICM-ID), the amalgamated Luby Transform and Generalized Low Density Parity Check (LT-GLDPC) code, or the Luby Transform coded Spatial Division Multiple Access (LT-SDMA) scenario considered. The thesis also investigates the …

    soton Repository record for Fountain codes for the wireless Internet (opens in a new tab)

  17. Iterative Algebraic Decoding of Codes Defined on Graphs

    … to several subgroups. A localized algebraic iterative decoding algorithm is used to decode across subgroups to correct large errors. Very little correction capability is sacrificed to achieve fast error correction and lower communication overhead. This scheme improves data access for all the …

    uiuc Repository record for Iterative Algebraic Decoding of Codes Defined on Graphs (opens in a new tab)

  18. Two–Way Relaying Communications with OFDM and BICM/BICM-ID

    … code modulation (BICM) without and with iterative decoding (BICM-ID) are investigated in a TWRC system. Distributed linear constellation precoding (DLCP) is applied to handle MAI and the design of DLCP in a TWRC system using BICM/BICM-ID is discussed. Taking into account the multiple …

    sask Repository record for Two–Way Relaying Communications with OFDM and BICM/BICM-ID (opens in a new tab)

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

    … sparse parity check matrices, and efficient iterative decoding algorithms. This dissertation deals with failure configurations, known as \emph{trapping sets} of classical and quantum LDPC codes when decoded with iterative message passing decoding algorithms, and the \emph{error floor …

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

Page 1 of 2