Skip to main content
SpringerLink
Log in

Turbo-like Codes

Design for High Speed Decoding

  • Book
  • © 2007

Overview

Authors:
  1. Aliazam Abbasfar
    View author publications

    You can also search for this author in PubMed   Google Scholar

  • Turbo code concepts are explained in simple language
  • Turbo codes and LDPC codes are viewed in a unified manner as turbo-like codes
  • Implementation and hardware complexity is a major focus
  • Presents a novel class of powerful and practical turbo-like codes
  • Includes advanced theoretical framework for professionals

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 16.99 USD 84.99
Discount applied Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (5 chapters)

  1. Front Matter

    Pages i-xvii
    Download chapter PDF

  2. Introduction

    Pages 1-3

  3. Turbo Concept

    Pages 5-17

  4. High-speed Turbo Decoders

    Pages 19-38

  5. Very Simple Turbo-like Codes

    Pages 39-65

  6. High Speed Turbo-like Decoders

    Pages 67-80

  7. Back Matter

    Pages 81-84
    Download chapter PDF
Back to top

Keywords

About this book

The common property among turbo-like code is that they consist of very simple constituent codes that are connected to each other with random or pseudorandom interleavers. The crucial novelty in these codes is the iterative decoding. This means that the constituent codes are decoded separately, which is ef?cient and practically feasible since they are very simple codes. Then, they pass new information to each other in a course of a few iterations. It has been shown that iterative decoding is a generalization of the well-known probability or belief propagation algorithm. The belief propagation algorithm that has been essential for development of new ideas throughout this work is described in the context of coding. The basic theorems for this algorithm are explained and proven in the following paragraphs. Thisis then followed by a description of the computational algorithm. The probability propagation algorithm is proven in c- junctionwithatree-structuredgraph–graphswithoutanycycle.Infact,thegraphical representation of any problem solved by this algorithm is the centerpiece of the algorithm. The generalization of the algorithm for graphs with cycles is presented later on. Representation of codes on graph is the next step towards characterization of the iterative decoding as an example of the probability propagation algorithm. The graph representations are presented for a few codes that are commonly used in turbo-like codes.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation