Header menu link for other important links
X
Efficient radix-3 FHT algorithm
K. M.Muraleedhara Prabhu
Published in IEEE, Piscataway, NJ, United States
1997
Volume: 1
   
Pages: 349 - 351
Abstract
By modifying the conventional decomposition formula for the decimation-in-frequency (DIF) case, a more efficient radix-3 fast Hartley transform(FHT) algorithm has been introduced resulting in a fewer number multiplications. The reduction in the number of multiplications is of the order of 25-30 percent. It is useful in cases where the sequence length is closer to a power of 3 rather than a power of 2.
About the journal
JournalData powered by TypesetInternational Conference on Digital Signal Processing, DSP
PublisherData powered by TypesetIEEE, Piscataway, NJ, United States
Open AccessNo
Concepts (7)
  •  related image
    Algorithms
  •  related image
    Fourier transforms
  •  related image
    Mathematical models
  •  related image
    DECIMATION IN FREQUENCY (DIF) CASE
  •  related image
    FAST HARTLEY TRANSFORM (FHT) ALGORITHM
  •  related image
    SEQUENCE LENGTHS
  •  related image
    Digital signal processing