Login | Register

A VHDL code generator for Reed-Solomon encoders and decoders


A VHDL code generator for Reed-Solomon encoders and decoders

Glavac, Vladimir (2003) A VHDL code generator for Reed-Solomon encoders and decoders. Masters thesis, Concordia University.

Text (application/pdf)


Reed-Solomon codes are error correcting codes that are used in many applications such as satellite communications, digital audio tape, and in CDROMs. Such diverse applications call for the use of many different Reed-Solomon codes. The topic of this thesis is the development of a program to produce synthesizable VHDL code for an arbitrary Reed-Solomon encoder or decoder. A novel extension of the Massey-Berlekamp algorithm for solving the key equation is presented. This modified algorithm is a key aspect of the Reed-Solomon decoder designs discussed in this thesis. The details of the design of both RS encoders and decoders are presented in detail. A program written in a high level language was designed so as to generate the VHDL code that corresponds to the algorithms for encoding and decoding. Several encoders and decoders were synthesized for the Xilinx XCV1000 series of field programmable gate arrays (FPGAs). The resulting area and speed metrics are presented for several designs of Reed-Solomon encoders and decoders.

Divisions:Concordia University > Gina Cody School of Engineering and Computer Science > Electrical and Computer Engineering
Item Type:Thesis (Masters)
Authors:Glavac, Vladimir
Pagination:xiii, 204 leaves : ill. ; 29 cm.
Institution:Concordia University
Degree Name:M.A. Sc.
Program:Electrical and Computer Engineering
Thesis Supervisor(s):Soleymani, Mohammad Reza
ID Code:1922
Deposited By: Concordia University Library
Deposited On:27 Aug 2009 17:23
Last Modified:18 Jan 2018 17:18
Related URLs:
All items in Spectrum are protected by copyright, with all rights reserved. The use of items is governed by Spectrum's terms of access.

Repository Staff Only: item control page

Downloads per month over past year

Back to top Back to top