Design of cyclotomic Fast Fourier Transform architecture over Galois field for 15 point DFT

No abstract is available for this paper.

• Publication year

  2015

• Venue

  International Conference on Intelligent Computing

• Publication date

  2015-07-09

• Fields of study

  Mathematics, Computer Science, Engineering

• Identifiers
  DOI 10.1109/IIC.2015.7150814
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• On the Reduction of Additive Complexity of Cyclotomic FFTs

  2012cited by this paper
• On the FPGA implementation of the Fourier Transform over finite fields GF(2m)

  2007cited by this paper
• A Method for Fast Computation of the Fourier Transform over a Finite Field

  2003cited by this paper
• A New Algorithm for Decoding Reed-Solomon Codes

  2003cited by this paper
• Finding roots of polynomials over finite fields

  2002cited by this paper
• Fast algorithm for computing the roots of error locator polynomials up to degree 11 in Reed-Solomon decoders

  2001cited by this paper
• A fast algorithm for the Fourier transform over finite fields and its VLSI implementation

  1988cited by this paper
• Theory and practice of error control codes

  1983cited by this paper

• Cycle Lengths of Finite Cyclotomic Mappings

  2022cites this paper
• Representation of Cascade Codes in the Frequency Domain

  2020cites this paper
• Improving Generalized Discrete Fourier Transform (GDFT) Filter Banks with Low-Complexity and Reconfigurable Hybrid Algorithm

  2020cites this paper