Reduced-Complexity Reed--Solomon Decoders Based on Cyclotomic FFTs

Details Reduced-Complexity Reed--Solomon Decoders Based on Cyclotomic FFTs Reduced-Complexity Reed--Solomon Decoders Based on Cyclotomic FFTs

2008-11-02

arxiv.org/abs/0811.0196v1

Computer Science

Information Theory

15 pages, shortened version submitted to IEEE Signal Processing Letters

Scientific paper

10.1109/LSP.2009.2014292

In this paper, we reduce the computational complexities of partial and dual partial cyclotomic FFTs (CFFTs), which are discrete Fourier transforms where spectral and temporal components are constrained, based on their properties as well as a common subexpression elimination algorithm. Our partial CFFTs achieve smaller computational complexities than previously proposed partial CFFTs. Utilizing our CFFTs in both transform- and time-domain Reed--Solomon decoders, we achieve significant complexity reductions.

Affiliated with

Also associated with

No associations

Rating

Reduced-Complexity Reed--Solomon Decoders Based on Cyclotomic FFTs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Reduced-Complexity Reed--Solomon Decoders Based on Cyclotomic FFTs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Reduced-Complexity Reed--Solomon Decoders Based on Cyclotomic FFTs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-233204