| Summary: | 碩士 === 國立雲林科技大學 === 電子與資訊工程研究所碩士班 === 91 === Since the emerging of a practical decoding algorithm proposed by Berlekamp in 1968, lots of papers were inspired and lots of research was conducted. Such a enthusiasm makes RS codes the most popular channel coding scheme nowadays. Ranging from CD, DVD, HDTV to deep space communication, RS codes are always in an indispensable position. Due to the popularity and indispensability of RS codes, certain IP generator which can produce IPs respect to different applications is pressingly needed. This thesis, based on this demend, develops such an RS codec IP generator.
Architectures based on the Berlekamp-Massey decoding algorithm, though had been discussed over 30 years, still got the bottle neck in Key Equation Solver block. It was not until 2001, after Sarwate proposed an algorithmic-derived architecture, this bottle neck was surmounted. Due to the high regularity of Sarwate’s proposal, we use the technique of resource sharing to modify it. We found that, in certain scheme of resource sharing, we can get architecture with area consumption of 50% to 33.3% of the original design while the resulted architecture is very suitable for “multi-mode” purpose. By the same principle, with avoding loss of throughput rate and clock rate in mind, we developed an IP generator which can produce area-optimized design according to different application. After evaluating, we found that the designs generated by our IP generator can work very well in many general applications.
|
|---|
