MAG 알고리즘에 의한 힐버트 변환기의 하드웨어 복잡도 감소에 관한 연구

Abstract

Abstract The Hilbert transform performs a role to transform band pass signals into low pass signals in wireless communication systems. The operation of Hilbert transform is based on a convolution process which is required adding and multiplying calculations. When the Hilbert transform is designed and hardware-implemented at gate level, the adding and multiplying operation requires a high power consumption and a occupation of wide area on a chip. So the results of adding and multiplying operation cause to degrade the performance of implemented system.In this paper, the new Hilbert transformer is proposed, which has a low hardware complexity by application of MAG(Minimum Adder Graph) algorithm. The proposed Hilbert transformer was simulated in ISE environment of Xilinx and showed the reduction of hardware complexity comparing with the number of gate in the conventional Hilbert transformer.Key Words : SOC, FPGA, Hilbert Transform, MAG algorithm 본 연구는 2010학년도 청운대학교 학술연구조성비에 의하여 수행되었음. * 교신저자 : 이영석(yslee@chungwoon.ac.kr)접수일 10년 10월 27일 수정일 (1차 10년 12월 15일, 2차 11년 01월 12일) 게재확정일 11년 01월 13일