ASIC implementation of high speed processor for computing fast hartley transformation

The improvement in speed and power for the computation of Discrete Hartley Transformation (DHT) using parallel addition technique is well established, but all the work have been reported in gate (FPGA) level. In this paper transistor level (ASIC) implementation technique for computation of high speed processor of prime length one dimensional Fast Hartley Transformation (FHT) based on MAC is reported for the first time. Equation formulation methodology for the transformation of such processors offered a technique of parallelism, also ensure substantial reduction of pre and post processing stages, owing towards high speed operation. The functionality of these circuits was checked and performance parameters like propagation delay, dynamic power consumptions were calculated through spice spectre using 45nm CMOS technology. The implementation methodology ensure substantial reduction of propagation delay in comparison with CORDIC, parallel adder (PA), distributed arithmetic and circular convolution (CC) based implementation which is most commonly used architecture, reported so far, for DHT processors. The propagation delay of the resulting 16 point FHT processor is only ~7.68μs while the power consumption of the same was ~90.5mW only. Almost 50% improvement in speed from earlier reported FHT processors, e.g. CORDIC, PA and CC based implementation methodology, has been achieved.

[1]  S. Kumar P,et al.  Novel CORDIC-based systolic arrays for the DFT and the DHT , 1997, Proceedings High Performance Computing on the Information Superhighway. HPC Asia '97.

[2]  Neng-Chung Hu,et al.  Generalized discrete Hartley transforms , 1992, IEEE Trans. Signal Process..

[3]  Francesco Piazza,et al.  A systolic circuit for fast Hartley transform , 1988, 1988., IEEE International Symposium on Circuits and Systems.

[4]  Prabir Saha,et al.  ASIC implementation of high speed processor for calculating discrete Fourier transformation using circular convolution technique , 2011 .

[5]  Algirdas Avizienis,et al.  Signed-Digit Numbe Representations for Fast Parallel Arithmetic , 1961, IRE Trans. Electron. Comput..

[6]  Jiun-In Guo An efficient design for one-dimensional discrete Hartley transform using parallel additions , 2000, IEEE Trans. Signal Process..

[7]  Chein-Wei Jen,et al.  A novel CORDIC-based array architecture for the multidimensional discrete Hartley transform , 1995 .

[8]  Long-Wen Chang,et al.  Systolic arrays for the discrete Hartley transform , 1991, IEEE Trans. Signal Process..

[9]  Douglas L. Jones,et al.  On computing the discrete Hartley transform , 1985, IEEE Trans. Acoust. Speech Signal Process..

[10]  M. Omair Ahmad,et al.  New Parametric Discrete Fourier and Hartley Transforms, and Algorithms for Fast Computation , 2011, IEEE Transactions on Circuits and Systems I: Regular Papers.

[11]  Chaitali Chakrabarti,et al.  Systolic Architectures for the Computation of the Discrete Hartley and the Discrete Cosine Transforms Based on Prime Factor Decomposition , 1990, IEEE Trans. Computers.

[12]  Liang-Gee Chen,et al.  Novel systolic array design for the discrete Hartley transform with high throughput rate , 1993, 1993 IEEE International Symposium on Circuits and Systems.

[13]  Shyamalee Mukherji,et al.  Speeding Up the Computation of Cross-Correlation Using the FHT and FFT by Page-locking , 2006, 2006 IEEE International Symposium on Geoscience and Remote Sensing.

[14]  A. Avizeinis,et al.  Signed Digit Number Representations for Fast Parallel Arithmetic , 1961 .

[15]  Chein-Wei Jen,et al.  A novel VLSI array design for the discrete Hartley transform using cyclic convolution , 1994, Proceedings of ICASSP '94. IEEE International Conference on Acoustics, Speech and Signal Processing.

[16]  T. Srikanthan,et al.  A circular formulation of the prime length DHT kernel and its FPGA implementation , 2003, Fourth International Conference on Information, Communications and Signal Processing, 2003 and the Fourth Pacific Rim Conference on Multimedia. Proceedings of the 2003 Joint.