Last edited by Muk
Friday, May 1, 2020 | History

2 edition of Low-density parity-check codes for Gilbert-Elliott and Markov-modulated channels. found in the catalog.

Low-density parity-check codes for Gilbert-Elliott and Markov-modulated channels.

Andrew W. Eckford

Low-density parity-check codes for Gilbert-Elliott and Markov-modulated channels.

  • 43 Want to read
  • 32 Currently reading

Published .
Written in English


About the Edition

The problem of low-density parity-check (LDPC) decoding in channels with memory has been attracting increasing attention in the literature. In this thesis, we use LDPC codes in an estimation-decoding scheme for the Gilbert-Elliott (GE) channel and more general Markov-modulated channels. The major accomplishments of this thesis include both analysis and design components. To analyze our estimation-decoding scheme, we derive density evolution for the GE channel, which has previously been used largely in memoryless channels. Furthermore, we develop techniques that use density evolution results to more efficiently characterize the space of Markov-modulated parameters. We begin by applying a characterization to the GE channel, following which we generalize this characterization into a partial ordering of Markov-modulated channels in terms of probability of symbol error. We also consider the design problem of developing LDPC degree sequences that are optimized for the GE channel. We obtain a novel design tool that approximates density evolution for our estimation-decoding algorithm, and present degree sequences that represent the best known codes in the GE channel. We also present a method of generalizing this tool to Markov-modulated channels, and give some of the first optimized degree sequences ever obtained for these channels.

The Physical Object
Pagination164 leaves.
Number of Pages164
ID Numbers
Open LibraryOL20338892M
ISBN 100612916146


Share this book
You might also like
Polymer latices

Polymer latices

inroad upon the sacred trial by jury, or, The case of John Bentley, gaoler of Baltimore County gaol, and Isaiah Green, turnkey of said gaol

inroad upon the sacred trial by jury, or, The case of John Bentley, gaoler of Baltimore County gaol, and Isaiah Green, turnkey of said gaol

Traditions in transition

Traditions in transition

[Bristol cuttings I

[Bristol cuttings I

Costume design.

Costume design.

life & letters of Lady Dorothy Nevill

life & letters of Lady Dorothy Nevill

Consultation and political culture

Consultation and political culture

Hilbert spaces in intuitionism.

Hilbert spaces in intuitionism.

What will happen to my home?

What will happen to my home?

Report of the working party on mobility allowance.

Report of the working party on mobility allowance.

Q

Q

Low-density parity-check codes for Gilbert-Elliott and Markov-modulated channels. by Andrew W. Eckford Download PDF EPUB FB2

Request PDF | Low-Density Parity-Check Codes for Gilbert-Elliott and Markov-Modulated Channels | The problem of low-density parity-check (LDPC) decoding in channels with memory has been attracting Author: Andrew Eckford.

The low-density parity-check codes are optimized and the best known rate R = code for the insertion-deletion channel presented.

The codes are also shown to be effective on the bit-deletion. We present a reduced-complexity approximate density evolution scheme that is particularly suitable for Markov-modulated channels, based on the semiGaussian approximation. We propose a design algorithm whose complexity is comparable to the memoryless case, assuming unlimited precomputation is allowed.

We also present degree sequences representing some of the best known codes in the GE channel. Eckford, A.W.: Low-density parity-check codes for Gilbert-Elliott and Markov-modulated channels.

Ph.D. thesis, University of Toronto () Google ScholarAuthor: Wolfgang Proß, Franz Quint, Marius Otesteanu. Book Chapters. Journal Papers. Conference Papers (Refereed) A. Eckford, F. Kschischang, and S. Pasupathy, “On designing good LDPC codes for Markov channels,” IEEE Trans F. Kschischang, and S.

Pasupathy, “Analysis of low-density parity-check codes for the Gilbert-Elliott channel,” IEEE Trans. Inform. Theory. Ndzana Ndzana, A. Eckford, M. Shokrollahi, and G. Shamir, “Fountain codes for piecewise stationary channels,” in Proc.

IEEE International Symposium on. Gou Hosoya, Hideki Yagi, Shigeichi Hirasawa, "Modification methods for construction and performance analysis of low-density parity check-check codes over Markov-modulated channels," Proc.

of International Symposium on Information Theory and its Applications (ISITA), pp. [C92] Designing Very Good Low-Density Parity-Check Codes for the Gilbert-Elliott Channel A. Eckford, F. Kschischang, and S. Pasupathy, in Proc. 8th Canadian Workshop on Information Theory, University of Waterloo, Waterloo, ON, – @INPROCEEDINGS{, AUTHOR="Lajos Hanzo", TITLE="Full-day Tutorial: Joint Physical and Network Layer Optimisation of Wireless Systems: Smart Antennas, Turbo Coding, Space-Time Coding.

Modern Coding Theory summarizes the state of the art in iterative coding, with particular emphasis on the underlying theory.

Starting with Gallager’s original ensemble of low-density parity-check codes as a representative example, focus is placed on the techniques to. @TECHREPORT{CERTOverview, AUTHOR="C. RT Coordination Center", TITLE="Overview of Attack Trends", TYPE="Technical Report", INSTITUTION="CERT, Carnegie Mellon.