Efficient standard basis Reed-Solomon encoder

Surendra K. Jain, Keshab K Parhi

Research output: Contribution to journalArticlepeer-review

7 Scopus citations

Abstract

This paper presents an efficient Reed-Solomon encoder based on standard basis. The key operation in Reed-Solomon encoding is the multiplication of a feedback term with several (possibly) known terms. We present an efficient structure to implement this operation. The hardware complexity of this encoder is identical to the well-known Berlekamp encoder. It however, offers two advantages over the Berlekamp encoder - a critical path independent of the order of Reed-Solomon code being implemented and the ability to encode without any need for basis conversion.

Original languageEnglish (US)
Pages (from-to)3287-3290
Number of pages4
JournalICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
Volume6
StatePublished - Jan 1 1996

Fingerprint

Dive into the research topics of 'Efficient standard basis Reed-Solomon encoder'. Together they form a unique fingerprint.

Cite this