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

Title	Architecture for a low complexity rate-adaptive Reed-Solomon encoder
Publication Type	Journal Article
Year of Publication	1995
Authors	Hasan, M. A., and V. K. Bhargava
Journal	Computers, IEEE Transactions on
Volume	44
Pagination	938 -942
Date Published	jul.
ISSN	0018-9340
Keywords	bit-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
Abstract	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
URL	http://dx.doi.org/10.1109/12.392853
DOI	10.1109/12.392853

The University of British Columbia