UGC Approved Journal no 63975(19)

ISSN: 2349-5162 | ESTD Year : 2014
Call for Paper
Volume 11 | Issue 4 | April 2024

JETIREXPLORE- Search Thousands of research papers



WhatsApp Contact
Click Here

Published in:

Volume 9 Issue 9
September-2022
eISSN: 2349-5162

UGC and ISSN approved 7.95 impact factor UGC Approved Journal no 63975

7.95 impact factor calculated by Google scholar

Unique Identifier

Published Paper ID:
JETIR2209173


Registration ID:
502456

Page Number

b604-b611

Share This Article


Jetir RMS

Title

AN IMPROVED GENERALIZED KARATSUBA MULTIPLIER IN GF(2m) FIELD AND IT’S CONVOLUTION APPLICATION

Authors

Abstract

Finite field or Galois field arithmetic is becoming increasingly a very important solution for calculations in many applications like wireless or mobile communication systems, satellite communication systems, storage systems, crypto systems, etc. This paper presents a modified multiplier based on Karatsuba multiplication algorithm. To optimize the Karatsuba multiplication algorithm, the product terms are splited into two alternative forms and all the terms are expressed in the repeated fashion. We generalize the modified algorithm for any input bit GF field application. We have compared our proposed multiplier with karatsuba multiplier with respect to complexity. We have also given the general equation for hardware requirement for any field. Less no. of additions is required by our proposed multiplier. The overall area of modified multiplier is improved by 53.75% (over without reduction) & 52.08% (over with reduction). Proposed multiplier is also faster than actual karatsuba multiplier by 3.63% (over without reduction) & 3.91% (over with reduction). The proposed architecture has been simulated and synthesized by Xilinx ISE 14.7 design suite for Vertex , Spartan and Artix 7 device family. The new architecture is simple & easy. Common Expression Elimination (CSE) is applied in the proposed Modified Karatsuba Multiplier (MKM).It is also faster than M-Term Karatsuba algorithm .and it is also applied to compute the circular convolution for DSP application. In Vertex5 FPGA device family, computation of 8-bit circular convolution using Modified Karatsuba Algorithm (MKA) is 23.69% faster than Karatsuba Algorithm (KA). It also consumes 68.69% less slices than existing KA based Convolution.

Key Words

Karatsuba Algorithm; Finite fields; FPGA; VLSI; polynomial multiplication; Circular Convolution.Common Expression Elimination (CSE).

Cite This Article

"AN IMPROVED GENERALIZED KARATSUBA MULTIPLIER IN GF(2m) FIELD AND IT’S CONVOLUTION APPLICATION", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.9, Issue 9, page no.b604-b611, September-2022, Available :http://www.jetir.org/papers/JETIR2209173.pdf

ISSN


2349-5162 | Impact Factor 7.95 Calculate by Google Scholar

An International Scholarly Open Access Journal, Peer-Reviewed, Refereed Journal Impact Factor 7.95 Calculate by Google Scholar and Semantic Scholar | AI-Powered Research Tool, Multidisciplinary, Monthly, Multilanguage Journal Indexing in All Major Database & Metadata, Citation Generator

Cite This Article

"AN IMPROVED GENERALIZED KARATSUBA MULTIPLIER IN GF(2m) FIELD AND IT’S CONVOLUTION APPLICATION", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.9, Issue 9, page no. ppb604-b611, September-2022, Available at : http://www.jetir.org/papers/JETIR2209173.pdf

Publication Details

Published Paper ID: JETIR2209173
Registration ID: 502456
Published In: Volume 9 | Issue 9 | Year September-2022
DOI (Digital Object Identifier):
Page No: b604-b611
Country: haldia, West Bengal, India .
Area: Engineering
ISSN Number: 2349-5162
Publisher: IJ Publication


Preview This Article


Downlaod

Click here for Article Preview

Download PDF

Downloads

00095

Print This Page

Current Call For Paper

Jetir RMS