ZOT -Mk: A New Algorithm For Big Integer Multiplication

Jahani, Shahram (2009) ZOT -Mk: A New Algorithm For Big Integer Multiplication. Masters thesis, Universiti Sains Malaysia.

[img]
Preview
PDF
Download (845kB) | Preview

Abstract

Pendaraban nombor besar banyak digunakan dalam pengkomputeran saintifik. Walau bagaimanapun, terdapat hanya beberapa alogritma yang ada kini, memperoleh keefisienan mereka melalui pendaraban integer besar. Oleh sebab pendaraban integer tidak natif terhadap struktur penomboran arkitektur komputer bagi bit dan bait, maka pelaksanaan algoritma tersebut akan menjadi agak lamb at Penyelidikan ini menekankan algoritma pend araban nombor besar berdasarkan simbol yang terekstrak daripada sistem nombor perduaan. Kami namakan struktur penomboran barn ini sebagai "ZOT". Algoritma baru bagi pendaraban nombor besar, ZOT-MK, dibina daripada gabungan algoritma Karatsuba dan struktur ZOT. Multiplication of big numbers is being used heavily in scientific computation. However, there are only a few existing algorithms today that gain their efficiency through the multiplication of the big integer characteristic. Since the multiplication on integers is not native to the computer architecture numbering structure of bits and bytes, such algorithms are bound to be a bit slower on the implementation. This research focuses on big number multiplication algorithm that is based on the symbols extracted from the binary numbering system. We named the new numbering structure as "ZOT". The new algorithm for big numbers mUltiplication, ZOT-MK, is constructed from the combination of Karatsuba algorithm and the ZOT structure.

Item Type: Thesis (Masters)
Subjects: Q Science > QA Mathematics > QA101-145 Elementary Mathematics, Arithmetic
Divisions: Pusat Pengajian Sains Komputer (School of Computer Sciences) > Thesis
Depositing User: HJ Hazwani Jamaluddin
Date Deposited: 21 Nov 2016 08:02
Last Modified: 14 Apr 2017 12:18
URI: http://eprints.usm.my/id/eprint/31161

Actions (login required)

View Item View Item
Share