Constrained Coding and Soft Iterative Decoding

Overview

Constrained Coding and Soft Iterative Decoding is the first work to combine the issues of constrained coding and soft iterative decoding (e.g., turbo and LDPC codes) from a unified point of view. Since constrained coding is widely used in magnetic and optical storage, it is necessary to use some special techniques (modified concatenation scheme or bit insertion) in order to apply soft iterative decoding.
Recent breakthroughs in the design and decoding of error-control codes ...

See more details below
Paperback (Softcover reprint of the original 1st ed. 2001)
$185.47
BN.com price
(Save 15%)$219.00 List Price
Other sellers (Paperback)
  • All (3) from $161.46   
  • New (3) from $161.46   
Sending request ...

Overview

Constrained Coding and Soft Iterative Decoding is the first work to combine the issues of constrained coding and soft iterative decoding (e.g., turbo and LDPC codes) from a unified point of view. Since constrained coding is widely used in magnetic and optical storage, it is necessary to use some special techniques (modified concatenation scheme or bit insertion) in order to apply soft iterative decoding.
Recent breakthroughs in the design and decoding of error-control codes (ECCs) show significant potential for improving the performance of many communications systems. ECCs such as turbo codes and low-density parity check (LDPC) codes can be represented by graphs and decoded by passing probabilistic (a.k.a. 'soft') messages along the edges of the graph. This message-passing algorithm yields powerful decoders whose performance can approach the theoretical limits on capacity. This exposition uses 'normal graphs,' introduced by Forney, which extend in a natural manner to block diagram representations of the system and provide a simple unified framework for the decoding of ECCs, constrained codes, and channels with memory. Soft iterative decoding is illustrated by the application of turbo codes and LDPC codes to magnetic recording channels.
For magnetic and optical storage, an issue arises in the use of constrained coding, which places restrictions on the sequences that can be transmitted through the channel; the use of constrained coding in combination with soft ECC decoders is addressed by the modified concatenation scheme also known as 'reverse concatenation.' Moreover, a soft constraint decoder yields additional coding gain from the redundancy in the constraint, which may be of practical interest in the case of optical storage. In addition, this monograph presents several other research results (including the design of sliding-block lossless compression codes, and the decoding of array codes as LDPC codes).
Constrained Coding and Soft Iterative Decoding will prove useful to students, researchers and professional engineers who are interested in understanding this new soft iterative decoding paradigm and applying it in communications and storage systems.

Read More Show Less

Editorial Reviews

From the Publisher

From the reviews of the first edition:

'This monograph is a most welcome addition to the coding theory literature. It contains a masterfully written and easily accessible tutorial treatment of new and exciting error-correction codes, such as turbo codes and low-density parity-check (LDPC) codes. In addition, it introduces novel and promising approaches to integration of error correction codes with constrained codes as well as hybrid constructions of algebraic codes and LDPC. While these codes can be applied to any communications channel, special focus is given to the magnetic recording channel. Students as well as professionals in the information sciences will benefit greatly from having this monograph on their desks. I highly recommend it!'
Brian Marcus, IBM Almaden Research Center

"The book describes topical methods for soft-decision iterative coding … in a very clear manner. It provides a unified framework for the decoding of error-correcting codes, constraint codes, and channels with memory. I consider a strong point of this book the emphasis on the application of these techniques to a combination of error-correcting codes and constrained codes as used in magnetic and optical storage, and highly recommend it to engineers working in signal processing for storage systems … ." (L. M. G. M. Tolhuizen, Zentralblatt MATH, Vol. 1051 (26), 2005)

From The Critics
This revised version of a dissertation (from 1999, at Stanford U.) presents an in-depth description of research into the topics of soft decoding of constrained codes, the design of sliding-block lossless compression codes, and the decoding of array codes as LDPC codes. In addition, Fan explains the message-passing algorithm using Forney's "normal graphs" and discusses its use as a framework for decoding error- control codes, constrained codes, and channels with memory. The text will be of interest to engineers, researchers, and graduate students who work in communications and storage systems. Annotation c. Book News, Inc., Portland, OR (booknews.com)
Read More Show Less

Product Details

Table of Contents

List of Figures. List of Tables. Preface. Foreword by John M. Cioffi. Acknowledgments. 1. Introduction. 2. Message-Passing Algorithm. 3. Forward-Backward Algorithm. 4. Application to Magnetic Storage. 5. Constrained Coding for Hard Decoders. 6. Constrained Coding for Soft Decoders. 7. Array Codes as LDPC Codes. 8. Other Topics. Appendices. Index.

Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)