Fast DHT algorithms for length N= q*2 m, IEEE Trans. Signal Process, vol.47, issue.3, pp.900-903, 1999. ,
A Novel Algorithm for Computing the 1-D Discrete Hartley Transform, IEEE Signal Processing Letters, vol.11, issue.2, pp.156-159, 2004. ,
DOI : 10.1109/LSP.2003.819876
A New Split-Radix FHT Algorithm for Length-<tex>$q*2^m$</tex>DHTs, IEEE Transactions on Circuits and Systems I: Regular Papers, vol.51, issue.10, pp.2031-2043, 2004. ,
DOI : 10.1109/TCSI.2004.835680
Scalable and modular memory-based systolic architectures for discrete Hartley transform, IEEE Transactions on Circuits and Systems I: Regular Papers, vol.53, issue.5, pp.1065-1077, 2006. ,
DOI : 10.1109/TCSI.2006.870225
High-Throughput Memory-Based Architecture for DHT Using a New Convolutional Formulation, IEEE Transactions on Circuits and Systems II: Express Briefs, vol.54, issue.7, pp.606-610, 2007. ,
DOI : 10.1109/TCSII.2007.894407
Power Modeling and Efficient FPGA Implementation of FHT for Signal Processing, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, vol.15, issue.3, pp.286-295, 2007. ,
DOI : 10.1109/TVLSI.2007.893606
Direct Computation of Type-II Discrete Hartley Transform, IEEE Signal Processing Letters, vol.14, issue.5, pp.329-332, 2007. ,
DOI : 10.1109/LSP.2006.888362
URL : https://hal.archives-ouvertes.fr/inserm-00149853
Fast computation of the discrete Hartley transform, International Journal of Circuit Theory and Applications, vol.36, issue.4 ,
DOI : 10.1002/cta.574
On hardware implementation of the split-radix FFT, IEEE Transactions on Acoustics, Speech, and Signal Processing, vol.36, issue.10, pp.1575-1581, 1988. ,
DOI : 10.1109/29.7545
High-speed and low-power split-radix FFT, IEEE Trans. Signal Process, vol.51, issue.3, pp.864-874, 2003. ,
Efficient Systolic Implementation of DFT Using a Low-Complexity Convolution-Like Formulation, IEEE Transactions on Circuits and Systems II: Express Briefs, vol.53, issue.8, pp.702-706, 2006. ,
DOI : 10.1109/TCSII.2006.875379
Low-Cost Fast VLSI Algorithm for Discrete Fourier Transform, IEEE Transactions on Circuits and Systems I: Regular Papers, vol.54, issue.4, pp.791-806, 2007. ,
DOI : 10.1109/TCSI.2006.888772
High-Throughput VLSI Architecture for FFT Computation, IEEE Transactions on Circuits and Systems II: Express Briefs, vol.54, issue.10, pp.863-867, 2007. ,
DOI : 10.1109/TCSII.2007.901635
A Modified Split-Radix FFT With Fewer Arithmetic Operations, IEEE Transactions on Signal Processing, vol.55, issue.1, pp.111-119, 2007. ,
DOI : 10.1109/TSP.2006.882087
A General Class of Split-Radix FFT Algorithms for the Computation of the DFT of Length-<formula formulatype="inline"><tex>$2^{m}$</tex> </formula>, IEEE Transactions on Signal Processing, vol.55, issue.8, pp.4127-4138, 2007. ,
DOI : 10.1109/TSP.2007.896110
Design of an FFT/IFFT Processor for MIMO OFDM Systems, IEEE Transactions on Circuits and Systems I: Regular Papers, vol.54, issue.4, pp.807-815, 2007. ,
DOI : 10.1109/TCSI.2006.888664
Balanced Binary-Tree Decomposition for Area-Efficient Pipelined FFT Processing, IEEE Transactions on Circuits and Systems I: Regular Papers, vol.54, issue.4, pp.889-900, 2007. ,
DOI : 10.1109/TCSI.2006.888764
An Efficient VLSI Architecture for Normal I/O Order Pipeline FFT Design, IEEE Transactions on Circuits and Systems II: Express Briefs, vol.55, issue.12, pp.1234-1238, 2008. ,
DOI : 10.1109/TCSII.2008.2008074
Computational Schemes for Warped DFT and Its Inverse, IEEE Transactions on Circuits and Systems I: Regular Papers, vol.55, issue.9, pp.2686-2695, 2008. ,
DOI : 10.1109/TCSI.2008.921023
Algebraic Signal Processing Theory: Cooley–Tukey Type Algorithms for Real DFTs, IEEE Transactions on Signal Processing, vol.57, issue.1, pp.205-222, 2009. ,
DOI : 10.1109/TSP.2008.2006152
Generic multiphase software pipelined partial FFT on instruction level parallel architectures, IEEE Trans. Signal Process, vol.57, issue.4, pp.1604-1615, 2009. ,
Vector-radix algorithm for 2-D discrete Hartley transform, Proc. IEEE, pp.755-757, 1986. ,
Multidimensional vector radix FHT algorithms, IEEE Transactions on Circuits and Systems I: Regular Papers, vol.53, issue.4, pp.905-917, 2006. ,
DOI : 10.1109/TCSI.2005.862067
Fast computation of the two-dimensional generalised Hartley transforms, IEE Proceedings - Vision, Image, and Signal Processing, vol.142, issue.1, pp.35-39, 1995. ,
DOI : 10.1049/ip-vis:19951547
Split vector radix algorithm for two-dimensional Hartley transform, IEEE Transactions on Aerospace and Electronic Systems, vol.27, issue.6, pp.865-868, 1991. ,
DOI : 10.1109/7.104244
Number of multiplications necessary to compute length 2n two-dimensional discrete Hartley transform DHT(2n;2), Electronics Letters, vol.28, issue.5, pp.480-482, 1992. ,
DOI : 10.1049/el:19920303
Split-radix fast Hartley transform in one and two dimensions, IEEE Transactions on Signal Processing, vol.39, issue.2, pp.499-503, 1991. ,
DOI : 10.1109/78.80838
The vector split-radix algorithm for 2-D DHT, IEEE Trans. Signal Process, vol.41, issue.2, pp.960-965, 1993. ,
Split-radix algorithm for 2-D discrete Hartley transform, Signal Processing, vol.63, issue.1, pp.45-53, 1997. ,
DOI : 10.1016/S0165-1684(96)00139-9
Computation of 2D discrete Hartley transform, Electronics Letters, vol.34, issue.11, pp.1058-1059, 1998. ,
DOI : 10.1049/el:19980802
An Efficient Multidimensional Decimation-in-Frequency FHT Algorithm Based on the Radix-2/4 Approach, 2005 IEEE International Symposium on Circuits and Systems, pp.2405-2408, 2005. ,
DOI : 10.1109/ISCAS.2005.1465110
New algorithms for multidimensional discrete Hartley transform, Signal Processing, vol.82, issue.8, pp.1086-1095, 2002. ,
DOI : 10.1016/S0165-1684(02)00241-4
Polynomial Transform Fast Hartley transform, Proc. IEEE ISCAS, pp.642-645, 1991. ,
Fast algorithm for multi-dimensional discrete Hartley transform with size 1 ,
Radix-2 ?? 2 ?? 2 algorithm for the 3-D discrete Hartley transform, IEEE Transactions on Signal Processing, vol.49, issue.12, pp.3145-3156, 2001. ,
DOI : 10.1109/78.969521
Fast 3-D decimation-in-frequency algorithm for 3-D Hartley transform, Signal Processing, vol.82, issue.1, pp.121-126, 2002. ,
DOI : 10.1016/S0165-1684(01)00102-5
Radix-2 algorithm for the fast computation of type-III 3-D discrete W transform, Signal Processing, vol.88, issue.1, pp.210-215, 2008. ,
DOI : 10.1016/j.sigpro.2007.07.007
URL : https://hal.archives-ouvertes.fr/inserm-00304096
A Split Vector-Radix Algorithm for the 3-D Discrete Hartley Transform, IEEE Transactions on Circuits and Systems I: Regular Papers, vol.53, issue.9, pp.1966-1976, 2006. ,
DOI : 10.1109/TCSI.2006.881185
Radix-3<formula formulatype="inline"><tex>$\,\times\,$</tex></formula>3 Algorithm for The 2-D Discrete Hartley Transform, IEEE Transactions on Circuits and Systems II: Express Briefs, vol.55, issue.6, pp.566-570, 2008. ,
DOI : 10.1109/TCSII.2007.916796
Split Vector-Radix-2/8 2-D Fast Fourier Transform, IEEE Signal Processing Letters, vol.11, issue.5, pp.459-462, 2004. ,
DOI : 10.1109/LSP.2004.826652
A split-radix algorit hm for 2-D DFT, Proc. IEEE ISCAS, pp.698-701, 2003. ,
The tensor product: a mathematical programming language for FFTs and other fast DSP operations, IEEE Signal Processing Magazine, vol.9, issue.1, pp.40-48, 1992. ,
DOI : 10.1109/79.109206
Fast Algorithm for the 3-D DCT-II, IEEE Transactions on Signal Processing, vol.52, issue.4, pp.992-1001, 2004. ,
DOI : 10.1109/TSP.2004.823472
Alternatives to the discrete cosine transform for irreversible tomographic image compression, IEEE Transactions on Medical Imaging, vol.12, issue.4, pp.803-811, 1993. ,
DOI : 10.1109/42.251132
Medical image compression using 3-D Hartley transform, Computers in Biology and Medicine, vol.36, issue.9, pp.958-973, 2006. ,
DOI : 10.1016/j.compbiomed.2005.04.005
A new, fast, and efficient image codec based on set partitioning in hierarchical trees, SPIHT Matlab Program, [Online], pp.243-250, 1996. ,
DOI : 10.1109/76.499834