#### Filter Results:

- Full text PDF available (3)

#### Publication Year

2007

2013

- This year (0)
- Last 5 years (1)
- Last 10 years (3)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Steve Haynal, Heidi Haynal
- JSAT
- 2011

A fundamental question of longstanding theoretical interest is to prove the lowest exact count of real additions and multiplications required to compute a power-of-two discrete Fourier transform (DFT). For 35 years the split-radix algorithm held the record by requiring just 4n log2 n−6n+8 arithmetic operations on real numbers for a size-n DFT, and was… (More)

- Steve Haynal, Heidi Haynal
- 2013 IEEE International Conference on Acoustics…
- 2013

Recent research presents a technique to enumerate all valid assignments of “twiddle factors” for power-of-two fast Fourier transform (FFT) flow graphs. Brute-force search employing state-of-the-art Boolean satisfiability (SAT) solvers can then be used to find FFT algorithms within this large solution space which have desirable characteristics.… (More)

- Heidi Haynal
- 2007

For k a field of arbitrary characteristic, and R a k-algebra, we show that the PI degree of an iterated skew polynomial ring R[x1; τ1, δ1] · · · [xn; τn, δn] agrees with the PI degree of R[x1; τ1] · · · [xn; τn] when each (τi, δi) satisfies a qi-skew relation for qi ∈ k and extends to a higher qi-skew τi-derivation. We confirm the quantum Gel’fand-Kirillov… (More)

- ‹
- 1
- ›