Finite Field Fourier Transformation based on Factor Graph and its Application
Peter Farkaš · 2003
g Abstract -In this paper a factor graph realization of Finite Field Fourier Transformation (FFFT) is presented, which could be used during encoding or decoding procedures for Reed Solomon Codes. Complexity evaluation and its comparison with Fast FFFT is given as well.