Having trouble deciding which coding scheme to employ, how to design a new scheme, or how to improve an existing system? This summary of the state-of-the-art in iterative coding makes this decision more straightforward. With emphasis on the underlying theory, techniques to analyse and design practical iterative coding systems are presented. Using Gallager's original ensemble of LDPC codes, the basic concepts are extended for several general codes, including the practically important class of turbo codes. The simplicity of the binary erasure channel is exploited to develop analytical techniques and intuition, which are then applied to general channel models. A chapter on factor graphs helps to unify the important topics of information theory, coding and communication theory. Covering the most recent advances, this text is ideal for graduate students in electrical engineering and computer science, and practitioners. Additional resources, including instructor's solutions and figures, available online: www.cambridge.org/9780521852296.Read more
- Helps you to decide which coding scheme to employ, how to design a new scheme and how to improve an existing system
- Emphasis is on the underlying theory so that the reader develops an intuitive understanding
- Provides a comprehensive description of turbo codes and iterative codes (including LDPC codes) over the binary erasure channel
Reviews & endorsements
'There is definitely a market for a book focusing on LDPC codes, and Tom Richardson and Reudiger Urbanke would be on anyone's short list to write that book. They have made substantive contributions to the theory and practice of LDPC codes. I believe this book will become required reading for researchers in LDPC codes at universities and communications companies around the world.' Thomas Fuja, University of Notre Dame
Not yet reviewed
Be the first to review
Review was not posted due to profanity×
- Date Published: May 2008
- format: Hardback
- isbn: 9780521852296
- length: 590 pages
- dimensions: 259 x 183 x 36 mm
- weight: 1.22kg
- contains: 150 b/w illus. 185 exercises
- availability: Available
Table of Contents
2. Factor graphs
3. Binary erasure channel
4. Binary memoryless symmetric channels
5. General channels
6. Convolutional codes and turbo codes
7. General ensembles
8. Expander codes and the flipping algorithm
Appendices: A. Encoding low-density parity-check codes
B. Efficient implementation of density evolution
C. Concentration inequalities
D. Formal power sums.
Welcome to the resources site
Here you will find free-of-charge online materials to accompany this book. The range of materials we provide across our academic and higher education titles are an integral part of the book package whether you are a student, instructor, researcher or professional.
Find resources associated with this titleYour search for '' returned .
Type Name Unlocked * Format Size
*This title has one or more locked files and access is given only to lecturers adopting the textbook for their class. We need to enforce this strictly so that solutions are not made available to students. To gain access to locked resources you either need first to sign in or register for an account.
These resources are provided free of charge by Cambridge University Press with permission of the author of the corresponding work, but are subject to copyright. You are permitted to view, print and download these resources for your own personal use only, provided any copyright lines on the resources are not removed or altered in any way. Any other use, including but not limited to distribution of the resources in modified form, or via electronic or other media, is strictly prohibited unless you have permission from the author of the corresponding work and provided you give appropriate acknowledgement of the source.
If you are having problems accessing these resources please email firstname.lastname@example.org
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email email@example.comRegister Sign in
You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.Continue ×