Computing discrete Hartley transform using algebraic integers

Author

Dimitrov, Vassil ; Baghaie, Ramin

Author_Institution

Dept. of Electr. & Commun. Eng., Helsinki Univ. of Technol., Finland

Volume

2

fYear

1999

fDate

24-27 Oct. 1999

Firstpage

1351

Abstract

An algorithm for computing the discrete Hartley transform is presented that is based on the algebraic integers encoding scheme. With the aid of this scheme, an error-free representation of the cos function becomes possible. In addition, for further complexity reduction an approximation scheme is proposed. Finally, for the implementation of the algorithm a fully pipelined systolic architecture with O(N) throughput is proposed.

Keywords

approximation theory; computational complexity; discrete Hartley transforms; pipeline processing; residue number systems; signal processing; systolic arrays; DSP; RNS; addition; algebraic integers encoding; algorithm; approximation; approximation method; complexity reduction; cos function; digital signal processing; discrete Hartley transform; error-free representation; pipelined systolic architecture; residue number system; sin function; throughput; Computer architecture; Content addressable storage; Discrete Fourier transforms; Discrete transforms; Electronic mail; Encoding; Kernel; Polynomials; Signal processing algorithms; Throughput;

fLanguage

English

Publisher

ieee

Conference_Titel

Signals, Systems, and Computers, 1999. Conference Record of the Thirty-Third Asilomar Conference on

Conference_Location

Pacific Grove, CA, USA

ISSN

1058-6393

Print_ISBN

0-7803-5700-0

Type

conf

DOI

10.1109/ACSSC.1999.831927

Filename

831927