Architecture for a low complexity rate-adaptive Reed-Solomon encoder

TitleArchitecture for a low complexity rate-adaptive Reed-Solomon encoder
Publication TypeJournal Article
Year of Publication1995
AuthorsHasan, M. A., and V. K. Bhargava
JournalComputers, IEEE Transactions on
Pagination938 -942
Date Publishedjul.
Keywordsbit-serial operations, circuit complexity, computational complexity, encoding, error correction codes, low complexity rate-adaptive Reed-Solomon encoder, matrix multiplication, multiple error-correcting Reed-Solomon codes, multiplications, pipeline operations, rate-adaptive RS encoder, Reed-Solomon codes, RS encoder, triangular basis, triangular basis multiplication algorithm

Multiple error-correcting Reed-Solomon (RS) codes have many practical applications. The complexity of an RS encoder depends on multiplications in the finite field over which the code is defined. We consider a triangular basis for representing the field elements, and present an architecture for a rate-adaptive RS encoder using a triangular basis multiplication algorithm. The architecture supports pipeline and bit-serial operations, and has a low circuit complexity


a place of mind, The University of British Columbia

Electrical and Computer Engineering
2332 Main Mall
Vancouver, BC Canada V6T 1Z4
Tel +1.604.822.2872
Fax +1.604.822.5949

Emergency Procedures | Accessibility | Contact UBC | © Copyright 2021 The University of British Columbia