Yazar "Knifati, Abdurrahman" seçeneğine göre listele

Listeleniyor 1 - 2 / 2
  • Küçük Resim
    Öğe
    FPGA implementation of discrete cosine transform using difference based adder graph algorith
    (İstanbul Gelişim Üniversitesi Lisansüstü Eğitim Enstitüsü, 2021) Knifati, Abdurrahman
    Nowadays, Digital Signal Processing (DSP) is an active research field especially topics related to hardware design such as circuit implementation using Field Programmable Gate Arrays (FPGA). In addition, since multipliers take up a lot of resources in DSP applications, researchers have been implementing multiplications using shift/add network design, also known as Multiple Constant Multiplication (MCM). There are several algorithms that solve the MCM problem efficiently, including Hcub, FRYER and DiffAG. In this work, the DiffAG algorithm has been developed using Matlab. Then, using its MCM solution, a Discrete Cosine Transform (DCT) design is implemented using FPGA. The DCT design is developed using the row-column decomposition method. In order to compare, another design is developed using FREYR's MCM solution. The results suggest that the DCT design using MCM solutions obtained from DiffAG algorithm achieve more processing speed by 18.2%. However, results obtained using FREYR's MCM solution achieve the DCT using less area by 9.2%.
  • Küçük Resim
    Öğe
    Multiple Constant Multiplication using Difference based Adder Graph
    (IEEE, 2021) Knifati, Abdurrahman; Myderrizi, Indrit
    In this paper, the multiple constant multiplication is implemented using the difference based adder graph. The experiments carried with the developed algorithm using Matlab, show that difference based adder graph provides low adder depth at the expense of having more adder cost, especially dealing with sets of many small constants or large constants. For such cases, results show an adder depth reduction up to 17% while an adder cost increase up to 11% compared to a recent adder graph algorithm known as FREYR in the state-of-art algorithms.