The most computationally demanding step in soft-decision decoding of RS codes is bivariate polynomial interpolation. The reencoding and coordinate transformation based technique can significantly reduce the computation complexity of the original interpolation problem, thus making the algebraic soft-decision decoder practically feasible. In this paper, an implementation of the reencoding and coordinate transformation procedure is presented. The novelties of our design include a fast algorithm to determine the reencoding points, an area efficient erasure-only RS decoding architecture, and an overlapped scheduling of the various procedures required for the reencoding process to reduce the overall latency. The synthesis result shows that the proposed design is sufficiently fast for any existing or developing interpolation architecture.