Description 
1 online resource (ix, 86 pages) : charts, some color. 
Content Type 
text 

still image 
Format 
online resource 
File Characteristics 
text file PDF 
Thesis 
M.S. California State University, Northridge 2012. 
Bibliography 
Includes bibliographical references (pages 4849). 
Summary 
In this project, the algorithm of the ReedSolomon code encoder and decoder is discussed, followed by the implementations of (255, 223) ReedSolomon codes. The encoder takes a 223byte date block and generates a 255byte code block to be transmitted on a digital communication channel. This code is defined over a Galois Field GF (2̂8) and has the capability of correcting up to sixteen short bursts of errors. The software part of the design is written in C language and tested using Simulink, and the hardware part is implemented using a microcontroller. The encoding process is simpler than the decoding process and requires less complex hardware. The decoder, however, is implemented using a parallel structure to speed up the Galois Field computations necessary to find out the locations of the errors and their values. The decoder logic circuit comprises multiple units in order to perform a parallel computation for the syndrome calculation. The Berlekamp's iterative algorithm is used to determine the coefficients of the error location polynomial. At the same time, the Chien's searching algorithm is used to calculate the roots of the error location polynomial, their error values, and perform the correction of the found errors. 
Note 
Description based on online resource; title from PDF title page (viewed on January 24, 2013). 
Subject 
ReedSolomon codes.

Local Subject 
Dissertations, Academic  CSUN  Engineering  Electrical and Computer Engineering.

OCLC number 
850973033 
