ZOT -Mk: A New Algorithm For Big Integer Multiplication
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...
| Main Author: | |
|---|---|
| Format: | Thesis |
| Language: | English |
| Published: |
2009
|
| Subjects: | |
| Online Access: | http://eprints.usm.my/31161/1/SHAHRAM_JAHANI.pdf |
| _version_ | 1825832485650432000 |
|---|---|
| author | Jahani, Shahram |
| author_facet | Jahani, Shahram |
| author_sort | Jahani, Shahram |
| collection | USM |
| description | 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. |
| first_indexed | 2024-03-06T14:53:34Z |
| format | Thesis |
| id | usm.eprints-31161 |
| institution | Universiti Sains Malaysia |
| language | English |
| last_indexed | 2024-03-06T14:53:34Z |
| publishDate | 2009 |
| record_format | dspace |
| spelling | usm.eprints-311612017-04-14T12:18:31Z http://eprints.usm.my/31161/ ZOT -Mk: A New Algorithm For Big Integer Multiplication Jahani, Shahram QA101-145 Elementary Mathematics, Arithmetic 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. 2009-06 Thesis NonPeerReviewed application/pdf en http://eprints.usm.my/31161/1/SHAHRAM_JAHANI.pdf Jahani, Shahram (2009) ZOT -Mk: A New Algorithm For Big Integer Multiplication. Masters thesis, Universiti Sains Malaysia. |
| spellingShingle | QA101-145 Elementary Mathematics, Arithmetic Jahani, Shahram ZOT -Mk: A New Algorithm For Big Integer Multiplication |
| title | ZOT -Mk: A New Algorithm For Big Integer
Multiplication
|
| title_full | ZOT -Mk: A New Algorithm For Big Integer
Multiplication
|
| title_fullStr | ZOT -Mk: A New Algorithm For Big Integer
Multiplication
|
| title_full_unstemmed | ZOT -Mk: A New Algorithm For Big Integer
Multiplication
|
| title_short | ZOT -Mk: A New Algorithm For Big Integer
Multiplication
|
| title_sort | zot mk a new algorithm for big integer multiplication |
| topic | QA101-145 Elementary Mathematics, Arithmetic |
| url | http://eprints.usm.my/31161/1/SHAHRAM_JAHANI.pdf |
| work_keys_str_mv | AT jahanishahram zotmkanewalgorithmforbigintegermultiplication |