 |
Technical Program
Paper Detail
| Paper: | MA-P5.2 |
| Session: | Image Representation, Rendering, Display, and Assesment |
| Time: | Monday, October 9, 09:40 - 12:20 |
| Presentation: |
Poster
|
| Title: |
NEW FAST HARTLEY TRANSFORM WITH LINEAR MULTIPLICATIVE COMPLEXITY |
| Authors: |
Sos Agaian; University of Texas San Antonio | | | | | Okan Caglayan; University of Texas San Antonio | | |
| Abstract: |
In this paper, we introduced a new Hartley transform algorithm with linear multiplicative complexity. The proposed algorithm not only minimizes the number of multiplications, but also reduces the total number of operations (arithmetic complexity, or the number of multiplications and additions) compared to the existing and recently published methods, such as Heideman, Burrus, Bi et al., Bouguezel et al. |
|
