Articoli correlati a Turbo-like Codes: Design for High Speed Decoding

Turbo-like Codes: Design for High Speed Decoding - Brossura

 
9789048176236: Turbo-like Codes: Design for High Speed Decoding
Vedi tutte le copie di questo ISBN:
 
 

This book introduces turbo error correcting concept in a simple language, including a general theory and the algorithms for decoding turbo-like code. It presents a unified framework for the design and analysis of turbo codes and LDPC codes and their decoding algorithms.

A major focus is on high speed turbo decoding, which targets applications with data rates of several hundred million bits per second (Mbps).

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.

Dalla quarta di copertina:

The advent of turbo codes has sparked tremendous research activities around the theoretical and practical aspects of turbo codes and turbo-like codes. The crucial novelty in these codes is the iterative decoding.

Turbo-like Codes introduces turbo error correcting concept in a simple language, including a general theory and the algorithms for decoding turbo-like code. It presents a unified framework for the design and analysis of turbo codes and LDPC codes and their decoding algorithms.

A major focus of Turbo-like Codes is on high speed turbo decoding, which targets applications with data rates of several hundred million bits per second (Mbps). In this book a novel high-speed turbo decoder is presented that exploits parallelization. Parallelism is achieved very efficiently by exploiting the flexibility of message-passing algorithm. It has been shown that very large speed gains can be achieved by this scheme while the efficiency is maintained reasonably high. Memory access, which poses a practical problem for the proposed parallel turbo decoder, is solved by introducing the conflict-free interleaver. The latency is further improved by designing a special kind of conflict-free interleaver. Furthermore, an algorithm to design such interleaver is presented. It is shown that the performance of turbo code is not sacrificed by using the interleaver with the proposed structure.

Although turbo code has near Shannon-capacity performance and the proposed architecture for parallel turbo decoder provides a very efficient and highly regular hardware, the circuit is still very complex and demanding for very high-speed decoding. Therefore, the next step would be finding turbo-like codes that not only achieve excellent error correction capability, but also are very simple. As a result, a class of new Low-Density Parity-Check (LDPC) codes for different rates and block-sizes, called Accumulate-Repeat-Accumulate (ARA) codes, is presented. The performance of ARA codes is analyzed and shown that some ARA codes perform very close to random codes, which achieve Shannon limit.

Contenuti:
List of Figures. List of Tables. Acknowledgments. Abstract. 1 Introduction. 1.1 Outline. 2 Turbo concept. 2.1 Turbo codes and turbo-like codes. 2.2 Iterative decoding. 2.3 Probability propagation algorithms. 2.4 Message passing algorithm. 2.5 Graphs with cycles. 2.6 Codes on graph. 3 High speed turbo decoders. 3.1 Introduction. 3.2 BCJR algorithm. 3.3 Turbo decoding. 3.4 Pipelined turbo decoder. 3.5 Parallel turbo decoder. 3.6 Speed gain and efficiency. 3.7 Interleaver Design. 3.8 Hardware complexity. 3.9 Conclusion. 4 Very simple turbo-like codes. 4.1 Introduction. 4.2 RA codes. 4.3 RA codes with puncturing. 4.4 ARA codes. 4.5 Other precoders. 4.6 Hardware complexity. 4.7 Conclusion. 5 High speed turbo-like decoders. 5.1 Introduction. 5.2 Parallel ARA decoder. 5.3 Speed gain and efficiency. 5.4 Interleaver design. 5.5 Projected graph. 5.6 General hardware architecture. 5.7 Conclusion. References. Index.

Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.

  • EditoreSpringer
  • Data di pubblicazione2010
  • ISBN 10 9048176239
  • ISBN 13 9789048176236
  • RilegaturaCopertina flessibile
  • Numero di pagine104

Altre edizioni note dello stesso titolo

9781402063909: Turbo-like Codes: Design for High Speed Decoding

Edizione in evidenza

ISBN 10:  1402063903 ISBN 13:  9781402063909
Casa editrice: Springer Verlag, 2007
Rilegato

I migliori risultati di ricerca su AbeBooks

Immagini fornite dal venditore

Abbasfar, Aliazam
Editore: Springer (2010)
ISBN 10: 9048176239 ISBN 13: 9789048176236
Nuovo Soft Cover Quantità: 1
Da:
booksXpress
(Bayonne, NJ, U.S.A.)
Valutazione libreria

Descrizione libro Soft Cover. Condizione: new. Codice articolo 9789048176236

Informazioni sul venditore | Contatta il venditore

Compra nuovo
EUR 102,07
Convertire valuta

Aggiungere al carrello

Spese di spedizione: GRATIS
In U.S.A.
Destinazione, tempi e costi
Foto dell'editore

Abbasfar, Aliazam
Editore: Springer (2010)
ISBN 10: 9048176239 ISBN 13: 9789048176236
Nuovo Brossura Quantità: > 20
Da:
Lucky's Textbooks
(Dallas, TX, U.S.A.)
Valutazione libreria

Descrizione libro Condizione: New. Codice articolo ABLIING23Apr0316110338771

Informazioni sul venditore | Contatta il venditore

Compra nuovo
EUR 111,31
Convertire valuta

Aggiungere al carrello

Spese di spedizione: EUR 3,72
In U.S.A.
Destinazione, tempi e costi
Immagini fornite dal venditore

Aliazam Abbasfar
ISBN 10: 9048176239 ISBN 13: 9789048176236
Nuovo Taschenbuch Quantità: 2
Print on Demand
Da:
BuchWeltWeit Ludwig Meier e.K.
(Bergisch Gladbach, Germania)
Valutazione libreria

Descrizione libro Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This book introduces turbo error correcting concept in a simple language, including a general theory and the algorithms for decoding turbo-like code. It presents a unified framework for the design and analysis of turbo codes and LDPC codes and their decoding algorithms.A major focus is on high speed turbo decoding, which targets applications with data rates of several hundred million bits per second (Mbps). 104 pp. Englisch. Codice articolo 9789048176236

Informazioni sul venditore | Contatta il venditore

Compra nuovo
EUR 106,99
Convertire valuta

Aggiungere al carrello

Spese di spedizione: EUR 23,00
Da: Germania a: U.S.A.
Destinazione, tempi e costi
Foto dell'editore

Aliazam Abbasfar
Editore: Springer (2010)
ISBN 10: 9048176239 ISBN 13: 9789048176236
Nuovo Brossura Quantità: > 20
Print on Demand
Da:
Ria Christie Collections
(Uxbridge, Regno Unito)
Valutazione libreria

Descrizione libro Condizione: New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book. Codice articolo ria9789048176236_lsuk

Informazioni sul venditore | Contatta il venditore

Compra nuovo
EUR 126,49
Convertire valuta

Aggiungere al carrello

Spese di spedizione: EUR 11,70
Da: Regno Unito a: U.S.A.
Destinazione, tempi e costi
Immagini fornite dal venditore

Aliazam Abbasfar
Editore: Springer Netherlands (2010)
ISBN 10: 9048176239 ISBN 13: 9789048176236
Nuovo Brossura Quantità: > 20
Print on Demand
Da:
moluna
(Greven, Germania)
Valutazione libreria

Descrizione libro Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Turbo code concepts are explained in simple languageTurbo codes and LDPC codes are viewed in a unified manner as turbo-like codesImplementation and hardware complexity is a major focus Presents a novel class of powerful and practical. Codice articolo 5821462

Informazioni sul venditore | Contatta il venditore

Compra nuovo
EUR 92,27
Convertire valuta

Aggiungere al carrello

Spese di spedizione: EUR 48,99
Da: Germania a: U.S.A.
Destinazione, tempi e costi
Immagini fornite dal venditore

Aliazam Abbasfar
Editore: Springer Netherlands (2010)
ISBN 10: 9048176239 ISBN 13: 9789048176236
Nuovo Taschenbuch Quantità: 1
Da:
AHA-BUCH GmbH
(Einbeck, Germania)
Valutazione libreria

Descrizione libro Taschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Codice articolo 9789048176236

Informazioni sul venditore | Contatta il venditore

Compra nuovo
EUR 109,42
Convertire valuta

Aggiungere al carrello

Spese di spedizione: EUR 32,99
Da: Germania a: U.S.A.
Destinazione, tempi e costi