DocumentCode
2340456
Title
Finite field Fourier transformation based on factor graph and its application to Reed Solomon codes
Author
Forgac, Bc Peter ; Farkas, P.
fYear
2003
fDate
26-28 Oct. 2003
Firstpage
59
Lastpage
62
Abstract
A factor graph realization of the 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.
Keywords
Fourier transforms; Reed-Solomon codes; decoding; fast Fourier transforms; graph theory; Reed Solomon codes; complexity evaluation; decoding; encoding; factor graph; fast Fourier transform; finite field Fourier transform; Computational complexity; Decoding; Digital communication; Digital signal processing; Discrete Fourier transforms; Encoding; Galois fields; Kernel; Reed-Solomon codes; Signal processing algorithms;
fLanguage
English
Publisher
ieee
Conference_Titel
Mobile Future and Symposium on Trends in Communications, 2003. SympoTIC '03. Joint First Workshop on
Print_ISBN
0-7803-7993-4
Type
conf
DOI
10.1109/TIC.2003.1249089
Filename
1249089
Link To Document