English  |  正體中文  |  简体中文  |  Items with full text/Total items : 54367/62174 (87%)
Visitors : 14784406      Online Users : 55
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTHU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    National Tsing Hua University Institutional Repository > 電機資訊學院 > 電機資訊學院學士班 > 期刊論文 >  An area-efficient pipelined VLSI architecture for decoding of Reed-Solomon codes based on a time-domain algorithm

    Please use this identifier to cite or link to this item: http://nthur.lib.nthu.edu.tw/dspace/handle/987654321/41795

    Title: An area-efficient pipelined VLSI architecture for decoding of Reed-Solomon codes based on a time-domain algorithm
    Authors: Jah-Ming Hsu;Chin-Liang Wang
    教師: 王晉良
    Date: 1997
    Publisher: Institute of Electrical and Electronics Engineers
    Relation: Circuits and Systems for Video Technology, IEEE Transactions ,Volume 7, Issue 6, Dec. 1997, Page(s) 864 - 871
    Keywords: area-efficient pipelined VLSI architecture
    Reed-Solomon codes
    time-domain algorithm
    Abstract: © 1997 Institute of Electrical and Electronics Engineers - Reed-Solomon (RS) codes have been widely used in a variety of communication systems to protect digital data against errors occurring in the transmission process. Since the decoding process for RS codes is rather computation-extensive, special-purpose hardware structures are often necessary for it to meet the real-time requirements. In this paper, an area-efficient pipelined very large scale integration (VLSI) architecture is proposed for RS decoding. The architecture is developed based on a time domain algorithm using the remainder decoding concept. A prominent feature of the proposed system is that, for a t-error-correcting RS code with block length n, it involves only 2t consecutive symbols to compute a discrepancy value in the decoding process, instead of n consecutive symbols used in the previous RS decoders based on the same algorithm without using the remainder decoding concept. The proposed RS decoder can process one data block every n clock cycles, i.e., the average decoding rate is one symbol per clock cycle. As compared to a similar pipelined RS decoder with the same decoding rate, it gains significant improvements in hardware complexity and latency
    URI: http://www.ieee.org/
    Appears in Collections:[電機資訊學院學士班] 期刊論文

    Files in This Item:

    File SizeFormat


    SFX Query


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback