Libros bestsellers hasta 50% dcto  Ver más

menu

0
  • argentina
  • chile
  • colombia
  • españa
  • méxico
  • perú
  • estados unidos
  • internacional
portada turbo-like codes: design for high speed decoding (in English)
Type
Physical Book
Publisher
Year
2010
Language
English
Pages
84
Format
Paperback
Dimensions
23.4 x 15.6 x 0.6 cm
Weight
0.16 kg.
ISBN
9048176239
ISBN13
9789048176236

turbo-like codes: design for high speed decoding (in English)

Aliazam Abbasfar (Author) · Springer · Paperback

turbo-like codes: design for high speed decoding (in English) - Abbasfar, Aliazam

Physical Book

$ 104.20

$ 109.99

You save: $ 5.79

5% discount
  • Condition: New
It will be shipped from our warehouse between Tuesday, May 21 and Wednesday, May 22.
You will receive it anywhere in United States between 1 and 3 business days after shipment.

Synopsis "turbo-like codes: design for high speed decoding (in English)"

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.

Customers reviews

More customer reviews
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)

Frequently Asked Questions about the Book

All books in our catalog are Original.
The book is written in English.
The binding of this edition is Paperback.

Questions and Answers about the Book

Do you have a question about the book? Login to be able to add your own question.

Opinions about Bookdelivery

More customer reviews