• Bhangale Sushant Vijay
• Dr Neetesh Raghuwanshi
• Dr Bharti Chourasia

Discrete Hartley transform is one of the most important algorithms of the signal processing and image processing system. Now a day in every field required an ever growing demand for high speed processing and low area design. Many types of discrete Hartley transform algorithm are design in different adder but day by day is required high speed adder. In this paper, we introduce a novel architecture to perform high speed adder using half adder (HA) and XOR gate techniques. Here, for enhancing the speed of addition, we are proposing Kogge Stone adder instead of other adder like ripple carry adder, look a-head carry adder in different-different manner, which has less propagation delay. All design is verified in Xilinx tool with different device family and the timing and area of the design, on the same have been calculated.

Discrete Hartley Transform (DHT), Kogge-stone adder, and Xilinx Spartan family.

"Performance Analysis of efficient Discrete Hartley Transform using Kogge-Stone Adder", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.7, Issue 8, page no.750-755, August 2020, Available :http://www.jetir.org/papers/JETIR2008404.pdf

"Performance Analysis of efficient Discrete Hartley Transform using Kogge-Stone Adder", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.7, Issue 8, page no. pp750-755, August 2020, Available at : http://www.jetir.org/papers/JETIR2008404.pdf