Turbo-like Codes : Design for High Speed Decoding
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, includ...
সংরক্ষণ করুন:
| প্রধান লেখক: | |
|---|---|
| বিন্যাস: | Livre numérique |
| ভাষা: | Anglais |
| প্রকাশিত: |
Dordrecht :
Springer Netherlands
2007.
Cham : Springer Nature |
| অনলাইন ব্যবহার করুন: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| টীকা: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Turbo-like Codes, Texte imprimé, 9781402063909 • Turbo-like Codes, Texte imprimé, 9789048114733 • Turbo-like Codes, Texte imprimé, 9789048176236 |
| LEADER | 04026nam a22003377a 4500 | ||
|---|---|---|---|
| 001 | 938982 | ||
| 008 | 080410s2007 xx ||| |||| 00| 0 eng d | ||
| 009 | PPN123150957 | ||
| 020 | |a 9781402063916 | ||
| 020 | |a 9781402063916 | ||
| 041 | 0 | |a eng | |
| 082 | |a 621.382 | ||
| 100 | 1 | |a Abbasfar, Aliazam. | |
| 245 | 1 | 0 | |a Turbo-like Codes : |b Design for High Speed Decoding |c by Aliazam Abbasfar. |
| 260 | |a Dordrecht : |b Springer Netherlands. | ||
| 260 | |a Cham : |b Springer Nature, |c 2007. | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a Turbo Concept -- High-speed Turbo Decoders -- Very Simple Turbo-like Codes -- High Speed Turbo-like Decoders. | |
| 506 | |a Accès en ligne pour les établissements français bénéficiaires des licences nationales | ||
| 506 | |a Accès soumis à abonnement pour tout autre établissement | ||
| 506 | |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. chttps://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 | ||
| 520 | |a 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. | ||
| 776 | 0 | |t Turbo-like Codes |b Texte imprimé |z 9781402063909 | |
| 776 | 0 | |t Turbo-like Codes |b Texte imprimé |z 9789048114733 | |
| 776 | 0 | |t Turbo-like Codes |b Texte imprimé |z 9789048176236 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/978-1-4020-6391-6 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-37H1MB1H-8 |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:747887357 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/978-1-4020-6391-6 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:750900369 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/978-1-4020-6391-6 |z Accès INSA CVL | |
| 997 | |0 938982 |1 Livre numérique |a Ressource numérique |b INSA |b ENSA |c 0/Bibliothèque numérique/ |c 1/Bibliothèque numérique/Autre ressource numérique/ | ||