Pages that link to "Item:Q2732815"

The following pages link to Fast DHT algorithms for length \(N=q*2^m\) (Q2732815):

Displaying 9 items.

• In-place in-order mixed radix fast Hartley transforms (Q672118) (← links)
• Split-radix algorithm for 2-D discrete Hartley transform (Q1127485) (← links)
• Fast generalized DFT and DHT algorithms (Q1129082) (← links)
• Fast algorithm for multi-dimensional discrete Hartley transform with size \(q^{l_{1}}\times q^{l_{2}}\times \cdots \times q^{l_{r}}\) (Q1605390) (← links)
• A structured dual split-radix algorithm for the discrete Hartley transform of length \(2^{N}\) (Q2003161) (← links)
• Fast DFT algorithms for length \(N=q*2^m\) (Q2724302) (← links)
• Fast computation of the discrete Hartley transform (Q3563602) (← links)
• Split-radix algorithms for length-p/sup m/ DFT's (Q3823113) (← links)
• A New Split-Radix FHT Algorithm for Length-<tex>$q*2^m$</tex>DHTs (Q4590324) (← links)