#### Filter Results:

#### Publication Year

2007

2013

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

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 log 2 n − 6n + 8 arithmetic operations on real numbers for a size-n DFT, and was… (More)

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[x 1 ; τ 1 , δ 1 ] · · · [x n ; τ n , δ n ] agrees with the PI degree of R[x 1 ; τ 1 ] · · · [x n ; τ n ] when each (τ i , δ i) satisfies a q i-skew relation for q i ∈ k × and extends to a higher q i-skew τ i-derivation. We confirm… (More)

- ‹
- 1
- ›