A structured dual split-radix algorithm for the discrete Hartley transform of length \(2^{N}\) (Q2003161): Difference between revisions

@@ Property / cites work @@
+Fast algorithms for generalized discrete Hartley transform of composite sequence lengths
+Normal rank
@@ Property / cites work @@
+New Parametric Discrete Fourier and Hartley Transforms, and Algorithms for Fast Computation
+Normal rank
@@ Property / cites work @@
+Calculating the FHT in hardware
@@ Property / cites work: Calculating the FHT in hardware / rank @@
+Normal rank
@@ Property / cites work @@
+Q4040743
@@ Property / cites work: Q4040743 / rank @@
+Normal rank
@@ Property / cites work @@
+The Fast Hartley Transform Algorithm
@@ Property / cites work: The Fast Hartley Transform Algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Scalable and modular memory-based systolic architectures for discrete Hartley transform
+Normal rank
@@ Property / cites work @@
+Harmonic analysis with a real frequency function. I: Aperiodic case
+Normal rank
@@ Property / cites work @@
+Harmonic analysis with a real function of frequency: II. Periodic and bounded cases; III. Data sequence
+Normal rank
@@ Property / cites work @@
+Prime factor fast Hartley transform
@@ Property / cites work: Prime factor fast Hartley transform / rank @@
+Normal rank
@@ Property / cites work @@
+High-speed and low-power split-radix FFT
@@ Property / cites work: High-speed and low-power split-radix FFT / rank @@
+Normal rank