Architecture For A Low Complexity Rate-Adaptive Reed-Solomon Encoder

Authors:
V. k. Bhargava;M. a. Hasan
Affiliations:
-;-
Venue:
IEEE Transactions on Computers
Year:
1995

Citing 2
Cited 9

Introduction to finite fields and their applications

Introduction to finite fields and their applications
Bit serial multiplication in finite fields

SIAM Journal on Discrete Mathematics

Efficient Exponentiation of a Primitive Root in GF(2m)

IEEE Transactions on Computers
Division-and-Accumulation over GF(2m)

IEEE Transactions on Computers
Double-Basis Multiplicative Inversion Over GF(2m)

IEEE Transactions on Computers
Equally Spaced Polynomials, Dual Bases, and Multiplication in F2^n

IEEE Transactions on Computers
VLSI Algorithms, Architectures, and Implementation of a Versatile GF(2m) Processor

IEEE Transactions on Computers
Bit-Parallel Finite Field Multipliers for Irreducible Trinomials

IEEE Transactions on Computers
A New Approach to Subquadratic Space Complexity Parallel Multipliers for Extended Binary Fields

IEEE Transactions on Computers
Systolic and non-systolic scalable modular designs of finite field multipliers for reed-solomon codec

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
An Efficient Finite Field Multiplier Using Redundant Representation

ACM Transactions on Embedded Computing Systems (TECS)

Quantified Score

Hi-index	15.00

Visualization

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. In this article, we consider a triangular basis for representing the field elements, and present 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.