Finite field Fourier transformation based on factor graph and its application to Reed Solomon codes

SympoTIC'03. Joint 1st Workshop on Mobile Future and Symposium on Trends in Communications Pub Date : 2003-12-03 DOI:10.1109/TIC.2003.1249089

P. Forgac, P. Farkaš

引用次数: 0

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.

查看原文本刊更多论文

基于因子图的有限域傅里叶变换及其在Reed Solomon码中的应用

提出了一种有限域傅里叶变换(FFFT)的因子图实现方法，可用于里德-所罗门码的编码或解码过程。给出了复杂度评价及其与快速FFFT的比较。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

SympoTIC'03. Joint 1st Workshop on Mobile Future and Symposium on Trends in Communications

自引率

0.00%

发文量