Home > Science, Technology & Agriculture > Electronics and communications engineering > Communications engineering / telecommunications > Trellis and Turbo Coding: Iterative and Graph-Based Error Control Coding(IEEE Series on Digital & Mobile Communication)
6%
Trellis and Turbo Coding: Iterative and Graph-Based Error Control Coding(IEEE Series on Digital & Mobile Communication)

Trellis and Turbo Coding: Iterative and Graph-Based Error Control Coding(IEEE Series on Digital & Mobile Communication)

          
5
4
3
2
1

International Edition


Premium quality
Premium quality
Bookswagon upholds the quality by delivering untarnished books. Quality, services and satisfaction are everything for us!
Easy Return
Easy return
Not satisfied with this product! Keep it in original condition and packaging to avail easy return policy.
Certified product
Certified product
First impression is the last impression! Address the book’s certification page, ISBN, publisher’s name, copyright page and print quality.
Secure Checkout
Secure checkout
Security at its finest! Login, browse, purchase and pay, every step is safe and secured.
Money back guarantee
Money-back guarantee:
It’s all about customers! For any kind of bad experience with the product, get your actual amount back after returning the product.
On time delivery
On-time delivery
At your doorstep on time! Get this book delivered without any delay.
Quantity:
Add to Wishlist

About the Book

This new edition has been extensively revised to reflect the progress in error control coding over the past few years. Over 60% of the material has been completely reworked, and 30% of the material is original. Convolutional, turbo, and low density parity-check (LDPC) coding and polar codes in a unified framework Advanced research-related developments such as spatial coupling A focus on algorithmic and implementation aspects of error control coding

Table of Contents:
1 Introduction 1 1.1 Modern Digital Communications 1 1.2 The Rise of Digital Communications 4 1.3 Communication Systems 4 1.4 Error Control Coding 7 1.5 Bandwidth, Power, and Complexity 12 1.6 A Brief History - The Drive Towards Capacity 20 2 Communications Basics 27 2.1 The Probabilistic Viewpoint 27 2.2 Vector Communication Channels 29 2.3 Optimum Receivers 31 2.4 Matched Filters 33 2.5 Message Sequences 35 2.6 The Complex Equivalent Baseband Model 39 2.7 Spectral Behavior 44 2.8 Advanced Modulation Methods 46 2.8.1 OFDM 46 2.8.2 Multiple Antenna Channels (MIMO Channels) 48 2.9 A Communications System Case Study 53 2.10 Appendix 2.A 61 3 Trellis-Coded Modulation 67 3.1 An Introductory Example 67 3.2 Construction of Codes 71 3.3 Lattices 80 3.4 Lattice Formulation of Trellis Codes 86 3.5 Rotational Invariance 92 3.6 V.fast 99 3.7 The IEEE 802.3an Standard 101 3.8 Historical Notes 106 4 Trellis Representations 111 4.1 Preliminaries 111 4.2 The Parity-Check Matrix 112 4.3 Parity-Check Trellis Representations 113 4.4 Convolutional Codes and Their Trellis 115 4.5 Minimal Trellises 120 4.6 Minimum-Span Generator Matrices 124 4.7 Systematic Construction of the PC-Trellis 127 4.8 Tail-Biting Trellises 129 4.9 The Minimal Trellis of Convolutional Codes 133 4.10 Fundamental Theorems from Basic Algebra 139 4.11 Systematic Encoders 149 4.12 Maximum Free-Distance Convolutional Codes 151 4.13 The Squaring Construction and the Trellis of Lattices 154 4.14 The Construction of Reed-Muller Codes 161 4.15 A Decoding Example 163 4.16 Polar Codes and Their Relationship to RM Codes 166 Appendix 4.A 171 5 Trellis and Tree Decoding 179 5.1 Background and Introduction 179 5.2 Tree Decoders 181 5.3 The Stack Algorithm 183 5.4 The Fano Algorithm 185 5.5 The M-Algorithm 186 5.6 Maximum Likelihood Decoding 197 5.7 A Posteriori Probability Symbol Decoding 200 5.8 Log-APP and Approximations 207 5.9 Error Analysis and Distance Spectrum 211 5.10 Random Coding Analysis of Optimal Decoding 222 5.11 Random Coding Analysis of Sequential Decoding 232 5.12 Some Final Remarks 238 6 Low-Density Parity-Check Codes 249 6.1 Introduction 249 6.2 LDPC Codes and Graphs 251 6.3 LDPC Decoding via Message Passing 255 6.4 Analysis Techniques 259 6.4.1 (Error) Probability Evolution for Binary Erasure Channels 259 6.4.2 Error Mechanism of LDPCs on BECs 265 6.4.3 Binary Symmetric Channels and the Gallager Algorithms 266 6.4.4 The AWGN Channel 270 6.5 Code Families and Construction 281 6.5.1 Constructions with Permutation Matrices 281 6.5.2 Cycle Reduction Design 286 6.5.3 RS-based Construction 287 6.5.4 Repeat-Accumulate Codes 289 6.6 Encoding of LDPC Codes 291 6.6.1 Triangular LDPC Codes 292 6.6.2 Specialized LDPC Codes 295 6.6.3 Approximate Triangularization 296 Appendix 6.A 298 7 Error Floors 319 7.1 The Error Floor Problem 319 7.2 Dynamics of the Absorption Sets 323 7.3 Code Design for Low Error Floors 331 7.4 Impact of the Decoding Algorithm 335 7.5 Importance Sampling (IS) 336 7.6 Computing Error Rates via Importance Sampling 340 8 Turbo Coding: Basic Principles 351 8.1 Introduction 351 8.2 Parallel Concatenated Convolutional Codes 353 8.3 Distance Spectrum Analysis of Turbo Codes 356 8.4 The Free Distance of a Turbo Code 358 8.5 Weight Enumerator Analysis of Turbo Codes 364 8.6 Iterative Decoding of Turbo Codes 371 8.7 EXIT Analysis 376 8.8 Serial Concatenation 383 8.9 Cascaded Convolutional Codes 383 8.10 Weight Enumerator Analysis of SCCCs 385 8.11 Iterative Decoding and Performance of SCCCs 394 8.12 EXIT Analysis of Serially Concatenated Codes 397 8.13 Viewpoint 401 8.14 Turbo-Trellis-Coded Modulation 402 8.15 Serial Concatenation 406 8.16 EXIT Analysis of Serial TTCM 408 8.17 Differential-Coded Modulation 409 8.18 Concatenated Space-Time Coding 414 8.19 Bit-Interleaved Coded and Generalized Modulation 418 9 Turbo Coding: Applications 431 9.1 Interleavers 431 9.2 Turbo Codes in Telecommunication Standards 439 9.2.1 The Space Data System Standard 439 9.2.2 3G Wireless Standards 440 9.2.3 Digital Video Broadcast Standards 443 9.3 Product Codes and Block Turbo Decoding 446 9.4 Approximate APP Decoding 448 9.5 Product Codes with High-Order Modulations 451 9.6 The IEEE 802.16 Standard 453 9.7 Decoding of Polar Codes 454 9.8 Polar Code Performance and Outlook 458 10 Convolutional LDPC Codes and Spatial Coupling 465 10.1 Capacity: The Ultimate Limit 465 10.2 Low-Density Parity-Check Convolutional Codes 467 10.2.1 New LDPC Codes from Old 467 10.2.2 Decoding Convolutional LDPC Codes 472 10.3 Spatial Coupling: A General View 474 10.4 Spatial Coupling: Convergence Analysis 482 10.4.1 Problem Setup 482 10.4.2 Lyapunov Approach 483


Best Sellers


Product Details
  • ISBN-13: 9781118083161
  • Publisher: John Wiley & Sons Inc
  • Publisher Imprint: Wiley-IEEE Press
  • Depth: 25
  • Height: 239 mm
  • No of Pages: 528
  • Returnable: N
  • Spine Width: 33 mm
  • Weight: 839 gr
  • ISBN-10: 1118083164
  • Publisher Date: 20 Nov 2015
  • Binding: Hardback
  • Edition: 2
  • Language: English
  • Returnable: N
  • Series Title: IEEE Series on Digital & Mobile Communication
  • Sub Title: Iterative and Graph-Based Error Control Coding
  • Width: 160 mm


Similar Products

How would you rate your experience shopping for books on Bookswagon?

Add Photo
Add Photo

Customer Reviews

REVIEWS           
Click Here To Be The First to Review this Product
Trellis and Turbo Coding: Iterative and Graph-Based Error Control Coding(IEEE Series on Digital & Mobile Communication)
John Wiley & Sons Inc -
Trellis and Turbo Coding: Iterative and Graph-Based Error Control Coding(IEEE Series on Digital & Mobile Communication)
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Trellis and Turbo Coding: Iterative and Graph-Based Error Control Coding(IEEE Series on Digital & Mobile Communication)

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book
    Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals

    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!
    ASK VIDYA