Referenced Items are not available for this document.
A fast decoding algorithm for double error correcting Reed Solomon (RS) codes is presented. A new approach to the RS code decoding is introduced to eliminate the Chien search, to reduce substantially the root search time and hence to increase the decoding speed. It is interesting that the error locating time almost constant as the number of bits per symbol is increased. The algorithm finds suitable for microprocessor-based as well as VLSI implementations. Various RS codes are considered. Complexity, memory space and decoding time are all minimized as compared to the normal Chien search approach
Published in:
Circuits and Systems, 1993., Proceedings of the 36th Midwest Symposium on
Date of Conference: 16-18 Aug 1993
- Page(s):
- 534 - 537 vol.1
- Meeting Date :
- 16 Aug 1993-18 Aug 1993
- Print ISBN:
- 0-7803-1760-2
- INSPEC Accession Number:
- 4839703
- Conference Location :
- Detroit, MI
- Digital Object Identifier :
- 10.1109/MWSCAS.1993.343002
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
