Logic cell array designs for a (31,k) Reed-Solomon Codec
| dc.contributor.author | Dravnieks, Olaf Olgert Walter | en_US |
| dc.date.accessioned | 2024-08-13T20:18:46Z | |
| dc.date.available | 2024-08-13T20:18:46Z | |
| dc.date.copyright | 1992 | en_US |
| dc.date.issued | 1992 | |
| dc.degree.department | Department of Electrical and Computer Engineering | |
| dc.degree.level | Master of Applied Science M.A.Sc. | en |
| dc.description.abstract | In this thesis, logic cell array designs for a (31, k) Reed-Solomon Codec are examined. The normal basis and a power basis representation for GF(25) are considered with respect to the number of clock cycles and number of logical gates or configurable logic blocks required to implement Galois field addition, multiplication and inversion. The decoder is partitioned into 5 logical modules. Pipelining options for the 5 logical modules are considered, in light of the resulting speed and hardware requirements. Two methods of passing information between the modules are considered: direct passing of information, and using external memory to store each modules results. A software implementation of the (31, k) codec in the C programming language, and a Xilinx XC3000 Series PGA design for a 5 stage external RAM based decoder are presented. | en |
| dc.format.extent | 162 pages | |
| dc.identifier.uri | https://hdl.handle.net/1828/17650 | |
| dc.rights | Available to the World Wide Web | en_US |
| dc.subject | UN SDG 7: Affordable and Clean Energy | en |
| dc.title | Logic cell array designs for a (31,k) Reed-Solomon Codec | en_US |
| dc.type | Thesis | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- DRAVNIEKS_Olaf_Olgert_Walter_MASC_558019.pdf
- Size:
- 40.3 MB
- Format:
- Adobe Portable Document Format