English  |  正體中文  |  简体中文  |  Items with full text/Total items : 6469/11641
Visitors : 19103869      Online Users : 259
RC Version 3.2 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Adv. Search
LoginUploadHelpAboutAdminister

Please use this identifier to cite or link to this item: http://ir.ncue.edu.tw/ir/handle/987654321/16437

Title: Step-By-Step Decoding Algorithm for Reed-Solomon Codes
Authors: Chen, Tung-Chou;Wei, Che-Ho;Wei, Shyue-Win
Contributors: 電子工程學系
Date: 2000-02
Issue Date: 2013-05-06T03:50:09Z
Publisher: IEEE
Abstract: A new step-by-step decoding algorithm for decoding Reed-Solomon codes over GF(2m) is presented. Based on several properties of the syndrome matrices, the new step-by-step decoding algorithm can directly determine whether every received symbol is an error locator. The detection of error location is based only on the determinant of a v�v syndrome matrix, where v is the number of errors, When an error location is found, its corresponding error value can also be determined by performing a determinant division operation between two syndrome matrices. The new decoding algorithm can significantly reduce computation complexity and improve the decoding speed compared with the conventional step-by-step decoding algorithm
Relation: IEEE Proceeding-Communications, 147(1): 8-12
Appears in Collections:[電子工程學系] 期刊論文

Files in This Item:

File SizeFormat
index.html0KbHTML338View/Open


All items in NCUEIR are protected by copyright, with all rights reserved.

 


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