Skip to content
Open global navigation

Cambridge University Press

AcademicLocation selectorSearch toggleMain navigation toggle
Cart
Register Sign in Wishlist

Iterative Receiver Design

$123.00

  • Date Published: September 2007
  • availability: Temporarily unavailable - no date available
  • format: Hardback
  • isbn: 9780521873154

$123.00
Hardback

Temporarily unavailable - no date available
Unavailable Add to wishlist

Other available formats:
eBook


Looking for an examination copy?

This title is not currently available for examination. However, if you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact collegesales@cambridge.org providing details of the course you are teaching.

Description
Product filter button
Description
Contents
Resources
About the Authors
  • Iterative processing is an important technique with numerous applications. Exploiting the power of factor graphs, this detailed survey provides a general framework for systematically developing iterative algorithms for digital receivers, and highlights connections between important algorithms. Starting with basic concepts in digital communications, progressively more complex ideas are presented and integrated resulting in the development of cutting-edge algorithms for iterative receivers. Real-world applications are covered in detail, including decoding for turbo and LDPC codes, and detection for multi-antenna and multi-user systems. This accessible framework will allow the reader to apply factor graphs to practical problems, leading to the design of new algorithms in applications beyond digital receivers. With many examples and algorithms in pseudo-code, this book is an invaluable resource for graduate students and researchers in electrical engineering and computer science, and for practitioners in the communications industry. Additional resources for this title are available online at www.cambridge.org/9780521873154.

    • Explains and develops important algorithms using factor graphs, rather than equations
    • Provides a general framework that enables the reader to formulate new algorithms well beyond the scope of the book
    • Supplementary material including lecture slides, appendices and source code is available online at www.cambridge.org/9780521873154
    Read more

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity

    ×

    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?

    ×

    Product details

    • Date Published: September 2007
    • format: Hardback
    • isbn: 9780521873154
    • length: 272 pages
    • dimensions: 254 x 180 x 18 mm
    • weight: 0.686kg
    • contains: 96 b/w illus.
    • availability: Temporarily unavailable - no date available
  • Table of Contents

    1. Introduction
    2. Digital communication
    3. Estimation theory and Monte Carlo techniques
    4. Factor graphs and the Sum-Product algorithm
    5. Statistical inference using factor graphs
    6. State-space models
    7. Factor graphs in digital communication
    8. Decoding
    9. Demapping
    10. Equalization: general formulation
    11. Equalization: single-user single-antenna communication
    12. Equalization: multi-antenna communication
    13. Equalization: multi-user communication
    14. Synchronization and channel estimation
    15. Appendices
    List of algorithms
    Bibliography
    Index.

  • general resources

    View all resources
    Group Section Name Type Size Sort Order filter vars
    General ResourcesErrataErratapdf34KB0errata general resources errata general resourceserrata
    General ResourcesSlidesLecture Slidespdf8267KB1slides general resources slides general resourcesslides
    General ResourcesSource Code IRD Code (Instructions)pdf74KB2source code general resources source code general resourcessource code
    General ResourcesSource Code Source Code IRDzip48KB3source code general resources source code general resourcessource code

    This title has a locked file and access is given only to instructors adopting the textbook for their class. We need to strictly enforce this so that solutions are not made available to students. To gain access to locked resources you need to first log in with your Cambridge account details and then return to this page to submit details of your course so you can be authenticated as an instructor. Click here to log in. If you do not have a Cambridge account you will first need to click here to create an account and then return to this page to be authenticated.


    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 cflack@cambridge.org

  • Author

    Henk Wymeersch, Massachusetts Institute of Technology
    fm.author_biographical_note1

Sign In

Please sign in to access your account

Cancel

Not already registered? Create an account now. ×

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 ×

Continue ×

Find content that relates to you

© Cambridge University Press 2014

Back to top

Are you sure you want to delete your account?

This cannot be undone.

Cancel Delete

Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

×
Please fill in the required fields in your feedback submission.
×