Non–Binary Error Control Coding for Wireless Communication and Data Storage explores non–binary coding schemes that have been developed to provide an alternative to the Reed Solomon codes, which are expected to become unsuitable for use in future data storage and communication devices as the demand for higher data rates increases. This book will look at the other significant non–binary coding schemes, including non–binary block and ring trellis–coded modulation (TCM) codes that perform well in fading conditions without any expansion in bandwidth use, and algebraic–geometric codes which are an extension of Reed–Solomon codes but with better parameters.
Comprehensive and self–contained reference to non–binary error control coding starting from binary codes and progressing up to the latest non–binary codes
Explains the design and construction of good non–binary codes with descriptions of efficient non–binary decoding algorithms with applications for wireless communication and high–density data storage
Discusses the application to specific cellular and wireless channels, and also magnetic storage channels that model the reading of data from the magnetic disc of a hard drive.
Includes detailed worked examples for each coding scheme to supplement the concepts described in this book
Focuses on the encoding, decoding and performance of both block and convolutional non–binary codes, and covers the Kötter–Vardy algorithm and Non–binary LDPC codes
This book will be an excellent reference for researchers in the wireless communication and data storage communities, as well as development/research engineers in telecoms and storage companies. Postgraduate students in these fields will also find this book of interest.
Chapter 1 – Information, Channel Capacity and Channel Modelling
1.2. Measure of Information
1.3. Channel Capacity
1.4 Channel Modelling
1.5. Definition of a communications channel and its parameters
1.6. Multiple Input Multiple Output (MIMO) Channel
1.8. Magnetic Storage Channel Modelling
Chapter 2 – Basic Principles of Non–Binary Codes
2.1. Introduction to Algebraic Concepts
2.2. Algebraic Geometry
Chapter 3 – Non–Binary Block Codes
3.2. Fundamentals of Block Codes
3.3. Bose–Chaudhuri–Hocquenghem (BCH) Codes
Example 3.3. Constructing a non–binary BCH code over GF(4) of length n = 15 symbols
3.4. Reed–Solomon Codes
Example 3.4: Constructing a non–binary BCH code over GF(16) of length n = 15 symbols
3.5. Decoding Reed–Solomon Codes
3.6. Coded Modulation
Chapter 4 – Algebraic–Geometric Codes
4.2. Construction of Algebraic–Geometric Codes
4.3. Decoding Algebraic–Geometric Codes
4.4. Majority Voting
4.5. Calculating the Error Magnitudes.
4.6. Complete Hard–Decision Decoding Algorithm for Hermitian Codes.
4.8. Simulation Results
Chapter 5 – List Decoding
5.2. List Decoding of Reed–Solomon Codes using the Guruswami–Sudan algorithm
5.3. Soft–Decision List Decoding of Reed–Solomon codes using the Kötter–Vardy Algorithm.
5.4. List Decoding of Algebraic–Geometric Codes
5.5. Determining the Corresponding Coefficients
5.6. Complexity reduction Interpolation
5.7. General Factorisation
5.8. Soft–Decision List Decoding of Hermitian Codes
Chapter 6 – Non–Binary Low Density Parity Check Codes
6.2. Construction of Binary LDPC Codes Random and Structured Methods
6.3. Decoding of Binary LDPC Codes using the Belief Propagation Algorithm.
6.4. Construction of Non–Binary LDPC Codes defined over Finite Fields
6.5. Decoding Non–Binary LDPC Codes with the Sum Product Algorithm
Chapter 7 – Non–Binary Convolutional Codes
Chapter 8 – Non–binary Turbo codes
8.2. The turbo encoder
8.3. The Turbo Decoder
8.4. Non–Binary Turbo Codes