Channel Coding Techniques for Wireless Communications (Forum for Interdisciplinary Mathematics)
4.2 (130 items)
Limited Time Sale$36.32 cheaper than the new price!!
Free cash-on-delivery fees for purchases over $99
Product details
| Management number | 233489191 | Release Date | 2026/06/27 | List Price | $24.21 | Model Number | 233489191 | ||
|---|---|---|---|---|---|---|---|---|---|
| Category | |||||||||
This book discusses the latest channel coding techniques, MIMO systems, and 5G channel coding evolution. It provides a comprehensive overview of channel coding, covering modern techniques such as turbo codes, low-density parity-check (LDPC) codes, space–time coding, polar codes, LT codes, and Raptor codes as well as the traditional codes such as cyclic codes, BCH, RS codes, and convolutional codes. It also explores MIMO communications, which is an effective method for high-speed or high-reliability wireless communications. It also examines the evolution of 5G channel coding techniques. Each of the 13 chapters features numerous illustrative examples for easy understanding of the coding techniques, and MATLAB-based programs are integrated in the text to enhance readers’ grasp of the underlying theories. Further, PC-based MATLAB m-files for illustrative examples are included for students and researchers involved in advanced and current concepts of coding theory. Read more
| ASIN | B081W4K9NB |
|---|---|
| XRay | Not Enabled |
| Format | Print Replica |
| ISBN13 | 978-9811505614 |
| Edition | 2nd |
| Language | English |
| File size | 20.9 MB |
| Page Flip | Not Enabled |
| Publisher | Springer |
| Word Wise | Not Enabled |
| Print length | 495 pages |
| Accessibility | Learn more |
| Part of series | Forum for Interdisciplinary Mathematics |
| Publication date | November 22, 2019 |
| Enhanced typesetting | Not Enabled |
Bestseller ranking
Cooking by Ingredient
Customers who viewed this product also viewed
Radio & Wireless
Correction of product information
If you notice any omissions or errors in the product information on this page, please use the correction request form below.
Correction Request Form