Efficient Polynomial Interpolation Filters with Symmetric Coefficients

Interpolation filters are widely used in full digital symbol timing recovery system to interpolate new sample values at arbitrary points between the existing discrete-time samples. This paper proposes an efficient structure for polynomial interpolation filters (PIF) with symmetric coefficients. The efficiency is achieved based on the analysis of constraints which is used for filter coefficients optimization. The proposed architecture does not require two sub filters in well known Farrow structure with symmetric coefficients leading to a very efficient PIF. Implementation examples are illustrated showing the efficiency of the proposed method