Sold out

Channel Coding Techniques for Wireless Communications

English · Hardback

Description

Read more

The book discusses modern channel coding techniques for wireless communications such as turbo codes, low parity check codes (LDPC), space-time coding, Reed Solomon (RS) codes and convolutional codes. Many illustrative examples are included in each chapter for easy understanding of the coding techniques. The text is integrated with MATLAB-based programs to enhance the understanding of the subject's underlying theories. It includes current topics of increasing importance such as turbo codes, LDPC codes, LT codes, Raptor codes and space-time coding in detail, in addition to the traditional codes such as cyclic codes, BCH and RS codes and convolutional codes. MIMO communications is a multiple antenna technology, which is an effective method for high-speed or high-reliability wireless communications. PC-based MATLAB m-files for the illustrative examples are included and also provided on the accompanying CD, which will help students and researchers involved in advanced and current concepts in coding theory. Channel coding, the core of digital communication and data storage, has undergone a major revolution as a result of the rapid growth of mobile and wireless communications.

The book is divided into 11 chapters. Assuming no prior knowledge in the field of channel coding, the opening chapters (1 - 2) begin with basic theory and discuss how to improve the performance of wireless communication channels using channel coding. Chapters 3 and 4 introduce Galois fields and present detailed coverage of BCH codes and Reed-Solomon codes. Chapters 5-7 introduce the family of convolutional codes, hard and soft-decision Viterbi algorithms, turbo codes, BCJR algorithm for turbo decoding and studies trellis coded modulation (TCM), turbo trellis coded modulation (TTCM), bit-interleaved coded modulation (BICM) as well as iterative BICM (BICM-ID) and compares them under various channel conditions. Chapters 8 and 9 focus on low-density parity-check (LDPC) codes, LT codes and Raptor codes. Chapters 10 and 11 discuss MIMO systems and space-time (ST) coding.

List of contents

Chapter 1 . Introduction.- Chapter 2. Performance of Digital Communication Over Fading Channels.- Chapter 3. Galois Field Theory.- Chapter 4. Linear Block Codes.- Chapter 5. Convolutional Codes.- Chapter 6. Turbo Codes.- Chapter 7. Bandwidth Efficient Coded Modulation.- Chapter 8. Low Density Parity Check codes.- Chapter 9. LT and Raptor Codes.- Chapter 10. MIMO System.- Chapter 11. Space-Time Coding. Chapter 1. Introduction.- Chapter 2. Performance of Digital Communication Over Fading Channels.- Chapter 3. Galois Field Theory.- Chapter 4. Linear Block Codes.- Chapter 5. Convolutional Codes.- Chapter 6. Turbo Codes.- Chapter 7. Bandwidth Efficient Coded Modulation.- Chapter 8. Low Density Parity Check codes.- Chapter 9. LT and Raptor Codes.- Chapter 10. MIMO System.- Chapter 11. Space-Time Coding.

Report

"The book presents many illustrative examples for easy understanding of the coding techniques. An attractive feature of the book is the inclusion of MATLAB-based examples with codes which will surely help readers to gain more insight into the subject. The book is fit to be prescribed as a text book at Bachelor's and Master's level along with researchers to peep into the subject from a different perspective." (Bal Kishan Dass, zbMATH 1334.94004, 2016)

Product details

Authors K. Deergha Rao
Publisher Springer, Berlin
 
Languages English
Product format Hardback
Released 01.01.2015
 
EAN 9788132222910
ISBN 978-81-322-2291-0
No. of pages 394
Dimensions 162 mm x 243 mm x 30 mm
Weight 767 g
Illustrations 255 SW-Abb., 20 Tabellen
Subject Natural sciences, medicine, IT, technology > Mathematics

Customer reviews

No reviews have been written for this item yet. Write the first review and be helpful to other users when they decide on a purchase.

Write a review

Thumbs up or thumbs down? Write your own review.

For messages to CeDe.ch please use the contact form.

The input fields marked * are obligatory

By submitting this form you agree to our data privacy statement.