IEEE SIGNAL PROCESSING LETTERS, VOL. 18, NO.

11, NOVEMBER 2011

687

Fast Radix-2 Algorithm for the Discrete Hartley Transform of Type II

Doru Florin Chiper, Senior Member, IEEE
AbstractWe present a new efcient method for the computation of the discrete Hartley transform of type II and radix-2 length . This recursive method requires a reduced number of arithmetic operations compared with existing methods and can be easily implemented. A new efcient method for the direct computation of a length N type-II DHT from two adjacent DHT-II sequences of length N/2 is also presented. Index TermsDiscrete Hartley transform, fast radix-2 algorithm, low arithmetic cost.
Fig. 1. Flow graph for the proposed method.

I. INTRODUCTION HE discrete Fourier transform (DFT) is used in many digital signal processing applications as signal and image compression techniques, lter banks [1], signal representation or harmonic analysis [2]. It is used when shifts in the time and frequency domain are necessary. The discrete Hartley transform of type-II,III, and IV [3], [4] can be used to efciently replace the corresponding discrete Fourier transform when the input sequence is real. It is interesting to note that the type-II, type-III and type-IVDHT has the same denition as the discrete W transform [5] excepting the scale factor. In the literature there are several fast algorithms for computing the type II DHT (DHT-II). Thus, Hu proposed several fast algorithms for computing type-II,type-III and type-IV DHT [6]. In [7] Bi derived a split-radix fast algorithms for computation of type-II, type-III and type-IV DFT and DHT. Other fast algorithm for computation of DHT-II when the length is a composite number is presented in [8]. In signal and image compression applications the problem to directly manipulate compressed data in DHT-II domain arises. Thus we have to obtain a long DHT-II sequence from some short DHT sequences. In [9] Shu developed a new fast computation of DHT-II based on a decomposition of DHT into two length N/2 type II DHT (DHT-II(N/2)) that can be used to solve a such problem. In this letter we propose an improved method based on an efcient fast algorithm for computation of DHT-II. In this letter we treat the problem of the direct computation of the DHT-II(N) sequence using two adjacent N/2 sets of DHT-II coefcients. In Fig. 2 from [9] it is presented the computational scheme for the solution presented there. According to this
Manuscript received August 14, 2011; revised September 22, 2011; accepted September 22, 2011. Date of publication September 29, 2011; date of current version October 13, 2011. The associate editor coordinating the review of this manuscript and approving it for publication was Dr. Ricardo Merched. The author is with the Department of Applied Electronics, Technical University Gheorghe Asachi Iasi, Iasi RO-6600, Romania (E-mail: chiper@etc.tuiasi.ro). Digital Object Identier 10.1109/LSP.2011.2170166

scheme one inverse DHT-II of length N/2 and two direct type-II DHT of length N/2 are necessary. Such a solution may not be optimal in terms of the number of arithmetic operations especially multiplications. We present a new approach to solve this problem that uses only one direct DHT-II(N/2) instead of 2 as shown in Fig. 1. An improved fast algorithm for type II DHT has also been obtained with reduced number of multiplications. The rest of the letter is organized as follows. In Section II, we present a new radix-2 fast algorithm for computing DHT-II(N). In Section III, we analyze the arithmetic cost of the proposed radix-2 fast DHT-II algorithm. In Section IV, we present the new computational scheme to obtain a N-point DHT-II(N) sequence from two adjacent DHT-II(N/2) sequences. II. RADIX-2 ALGORITHM FOR DHT-II Let be a power of 2. For any real input sequence , the DHT-II(N) is dened by:

(1) where (2) In order to derive a fast algorithm for DHT-II we decompose the computation of the output sequence in even-indexed and in odd-indexed output sequences, We will obtain thus a decimation in frequency fast algorithm for DHT-II. The even-indexed output sequence can be computed as follows:

(3) Then (3) is a DHT-II(N/2).

1070-9908/$26.00 2011 IEEE

688

IEEE SIGNAL PROCESSING LETTERS, VOL. 18, NO. 11, NOVEMBER 2011

The odd-indexed output sequence can be computed employing an auxiliary output sequence using the following equation that can be written as (4) with (5) (6) Then (4) is a DHT-II(N/2),too. It needs extra N/2 additions and N/2 multiplications for computation of the auxiliary input sequence using (5) and (6). Finally, the odd-indexed output sequence can be recursively computed using the following relations: (7) where

TABLE I COMPUTATIONAL COMPLEXITY

The arithmetic cost of the method presented in [9] is: (14) (15) Solving the recursions (12) and (13) we obtain: (16) (17)

(8)

(9)

(10) The recurrence (10) is based on the following identity: (11)

It can be seen that our method has signicantly less arithmetic operations especially multiplications preserving also the advantage of the algorithm presented in [9] that can be used to calculate a N-point DHT-II using two adjacent N/2-point DHT-II sequences as will be shown in Section IV. In Table I it is possible to see the number of arithmetic operations for Hu algorithm [6], for the method presented in [9] and for our proposed algorithm for different values of the transform length N. It can be seen that 13%28% multiplications and 5%.33% additions can be saved compared with the method proposed in [9]. The algorithm proposed by Hu has even more additions and multiplications then [9]. IV. A NEW SCHEME FOR DIRECT COMPUTATION OF DHT-II(N) The problem that will be solved in this section is the following.: how can we compute the DHT-II(N) sequence of a real input sequence by using of two DHT-II(N/2) sequences and where (18) (19) and . with For even-indexed output sequence we can rewrite (3) as (20)

III. ARITHMETIC COST For the computation of we need one addition, N/2 addition for computing and N/4 additions and multiplications for computing . The recursive (10) requires N/2-1 additions. The above scheme is similar with the decimation in frequency decomposition and has a computational complexity given by the following equations: Let and denote the number of additions and multiplications for computing DHT-II(N). We have (12) (13)

CHIPER: FAST RADIX-2 ALGORITHM

689

For odd-indexed output sequence we can write (4) as

if we use our proposed radix-2 fast altation of gorithm for the computation of DHT-II. V. CONCLUSION (21) In this letter, a new approach for the direct computation of a length DHT-II using two adjacent length-N/2 GDHT sequences is presented. This approach is based on a fast radix-2 algorithm for computation of DHT-II with a signicant less number of arithmetic operations, especially multiplications. ACKNOWLEDGMENT The author would like to thank the reviewers and Associate Editor Dr. R. Merched for their insightful suggestions for improving the text. REFERENCES
[1] R. E. Crochiere and L. R. Rabiner, Multirate Digital Signal Processing. Englewood Cliffs, NJ: Prentice-Hall, 1983. [2] Z. Wang, Harmonic analysis with a real frequency function, I Aperiodic case, II Periodic and bounded cases, and III Data sequence, Appl. Math. Comput., vol. 9, pp. 5373, 1981. [3] Z. Wang, Harmonic alaizez with a real frequency function,I Aperiodic case,II Periodic and bounded case and III Data sequence, Appl. Math. Comput., vol. 9, pp. 5373, 1981. [4] J. Xi and J. F. Chicharo, Computing running discrete Hartley transform and running discrete W transforms based on the adaptive LMS algorithm, IEEE Trans. Circuits Syst. II, vol. 44, pp. 257260, Mar. 1997. [5] Z. Wang, Fast algorithms for the discrete W transform and for the discrete Fourier transform, IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-32, pp. 803816, 1984. [6] N. C. Hu, H. I. Chang, and O. K. Orsoy, Generalized discrete Hartley transforms, IEEE Trans. Signal Process., vol. 40, no. 12, pp. 29312940, Dec. 1992. [7] G. Bi and Y. Chen, Fast generalized DFT and DHT algorithms, Signal Process., vol. 65, no. 3, pp. 383390, 1998. [8] G. Bi, Y. Chen, and Y. Zeng, Fast algorithms for generalized discrete Hartley transform of composite sequence length, IEEE Trans. Circuits Syst. II, vol. 47, no. 9, pp. 893901, Sep. 2000. [9] H. Shu, Y. Wang, L. Senhadji, and L. Luo, Direct computation of type-II discrete Hartley transform, IEEE Signal Process. Lett., vol. 14, no. 5, pp. 329332, May 2007. [10] A. Arico, S. Serra-Capizzano, and M. Tasche, Fast and numerically stable algorithms for discrete Hartley transforms and applications to preconditioningI, Commun. Inform. Syst., vol. 5, no. 1, pp. 2168, 2005.

with (22) Note that the inverse DHT-II(N/2) is equal with DHT-III(N/2) multiplied with 2/N. A fast radix-2 algorithm for DHT-III can be nd in [10]. We obtain thus the computational structure from Fig. 1. Finaly, the odd-indexed sequence can be recursively computed using the following equations:

(23) where (24)

(25) As we compare this scheme with the method presented in [9] we can see that the computation of is similar with the computation of but the computation of is more complex than the computation of and of recursion (25) that require N additions and 3 N/4 multiplications instead. of multiplications and additions for the compu-