Fundamentals of Convolutional Codes
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Home > Science, Technology & Agriculture > Electronics and communications engineering > Communications engineering / telecommunications > Fundamentals of Convolutional Codes: (IEEE Series on Digital & Mobile Communication)
Fundamentals of Convolutional Codes: (IEEE Series on Digital & Mobile Communication)

Fundamentals of Convolutional Codes: (IEEE Series on Digital & Mobile Communication)


     0     
5
4
3
2
1



Out of Stock


Notify me when this book is in stock
X
About the Book

Convolutional codes, among the main error control codes, are routinely used in applications for mobile telephony, satellite communications, and voice-band modems. Written by two leading authorities in coding and information theory, this book brings you a clear and comprehensive discussion of the basic principles underlying convolutional coding. FUNDAMENTALS OF CONVOLUTIONAL CODING is unmatched in the field for its accessible analysis of the structural properties of convolutional encoders. Other essentials covered in FUNDAMENTALS OF CONVOLUTIONAL CODING include:* Distance properties of convolutional codes* Viterbi, list, sequential, and iterative decoding* Modulation codes* Tables of good convolutional encoders* An extensive set of homework problems The authors draw on their own research and more than twenty years of teaching experience to present the fundamentals needed to understand the types of codes used in a variety of applications today. This book can be used as a textbook for graduate-level electrical engineering students. It will be of key interest to researchers and engineers of wireless and mobile communications, satellite communication, and data communication. Sponsored by: IEEE Communications Society, IEEE Information Theory Society, IEEE Vehicular Technology Society.

Table of Contents:
PREFACE. ACKNOWLEDGMENTS. CHAPTER 1 INTRODUCTION. 1.1 Why Error Control? 1.2 Block Codes--A Primer. 1.3 A First Encounter with Convolutional Codes. 1.4 Block Codes versus Convolutional Codes. 1.5 Capacity Limits and Potential Coding Gain Revisited. 1.6 Comments. Problems. CHAPTER 2 CONVOLUTIONAL ENCODERSSTRUCTURAL PROPERTIES. 2.1 Convolutional Codes and Their Encoders. 2.2 The Smith Form of Polynomial Convolutional Generator Matrices. 2.3 Encoder Inverses. 2.4 Equivalent and Basic Encoding Matrices. 2.5 Minimal-Basic Encoding Matrices. 2.6 Minimal Encoding Matrices and Minimal Encoders. 2.7 Canonical Encoding Matrices. 2.8 Minimality via the Invariant-Factor Theorem. 2.9 Syndrome Formers and Dual Encoders. 2.10 Systematic Convolutional Encoders. 2.11 Comments. Problems. CHAPTER 3 DISTANCE PROPERTIES OF CONVOLUTIONAL CODES. 3.1 Distance Measures--A First Encounter. 3.2 Active Distances. 3.3 Properties of Convolutional Codes via the Active Distances. 3.4 Lower Bound on the Distance Profile. 3.5 Upper Bounds on the Free Distance. 3.6 Time-Varying Convolutional Codes. 3.7 Lower Bound on the Free Distance. 3.8 Lower Bounds on the Active Distances. 3.9 Distances of Cascaded Concatenated Codes. 3.10 Path Enumerators. 3.11 Comments. Problems. CHAPTER 4 VITERBI DECODING. 4.1 The Viterbi Algorithm Revisited. 4.2 Error Bounds for Time-Invariant Convolutional Codes. 4.3 Tighter Error Bounds for Time-Invariant Convolutional Codes. 4.4 Upper Bounds on the Output Error Burst Lengths. 4.5 Error Bounds for Periodically Time-Varying Convolutional Codes. 4.6 Lower Error Bounds for Convolutional Codes. 4.7 Error Bounds for Time-Varying Convolutional Codes. 4.8 Error Bounds for Finite Back-Search Limits. 4.9 Tailbiting Trellises. 4.10 Quantization of Channel Outputs. 4.11 Comments. Problems. CHAPTERS LIST DECODING. 5.1 List Decoding Algorithms. 5.2 List Decoding--Performance. 5.3 The List Minimum Weight. 5.4 Upper Bounds on the Probability of Correct Path Loss. 5.5 Lower Bound on the Probability of Correct Path Loss. 5.6 Correct Path Loss for Time-Invariant Convolutional Codes. 5.7 Comments. Problems. CHAPTER 6 SEQUENTIAL DECODING. 6.1 The Fano Metric. 6.2 The Stack Algorithm. 6.3 The Fano Algorithm. 6.4 The Creeper Algorithm. 6.5 Simulations. 6.6 Computational Analysis of the Stack Algorithm. 6.7 Error Probability Analysis of the Stack Algorithm. 6.8 Analysis of the Fano Algorithm. 6.9 Analysis of Creeper. 6.10 Comments. Problems. CHAPTER 7 ITERATIVE DECODING. 7.1 Iterative Decoding--A Primer. 7.2 The Two-Way Algorithm for APP Decoding. 7.3 The Two-Way Algorithm for Tailbiting Trellises. 7.4 The One-Way Algorithm for APP Decoding. 7.5 Low-Density Parity-Check Convolutional Codes. 7.6 Comments. Problems. CHAPTER 8 CONVOLUTIONAL CODES WITH GOOD DISTANCE PROPERTIES. 8.1 Computing the Distance Spectrum. 8.2 Some Classes of Rate R = 111 Convolutional Codes. 8.3 Low-Rate Convolutional Codes. 8.4 High-Rate Convolutional Codes. 8.5 Tailbiting Trellis Encoders. 8.6 Comments. CHAPTER 9 MODULATION CODES. 9.1 Bandlimited Channels and QAM. 9.2 Coding Fundamentals. 9.3 Lattice-Type Trellis Codes. 9.4 Geometrically Uniform Trellis Codes. 9.5 Decoding of Modulation Codes. 9.6 Comments. Problems. APPENDIX A MINIMAL ENCODERS. APPENDIX B WALD'S IDENTITY. BIBLIOGRAPHY. INDEX. ABOUT THE AUTHORS.

About the Author :
Rolf Johannesson holds the Chair of Information Theory at Lund University, Sweden. He has written two textbooks on switching theory and digital design, as well as a textbook on information theory. Dr. Johannesson s research interests include information theory, error-correcting codes, and cryptography. He is a Fellow of the IEEE. Kamil Sh. Zigangirov holds the Chair of Telecommunication Theory at Lund University, Sweden. He is widely published in the areas of information theory, coding theory, detection theory, and mathematical statistics. Dr. Zigangirov is the inventor of the stack algorithm for sequential decoding.


Best Sellers


Product Details
  • ISBN-13: 9780780334830
  • Publisher: I.E.E.E.Press
  • Publisher Imprint: IEEE Publications,U.S.
  • Height: 256 mm
  • Returnable: N
  • Spine Width: 32 mm
  • Width: 186 mm
  • ISBN-10: 0780334833
  • Publisher Date: 31 Mar 1999
  • Binding: Hardback
  • Language: English
  • Series Title: IEEE Series on Digital & Mobile Communication
  • Weight: 980 gr


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Fundamentals of Convolutional Codes: (IEEE Series on Digital & Mobile Communication)
I.E.E.E.Press -
Fundamentals of Convolutional Codes: (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.

Fundamentals of Convolutional Codes: (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

    Fresh on the Shelf


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!