Kehandalan Metode Most Significant Bit First Algoritma Shift and ADD Pada Operasi Perkalian Waktu Nyata

-, Andrizal (2009) Kehandalan Metode Most Significant Bit First Algoritma Shift and ADD Pada Operasi Perkalian Waktu Nyata. POLI REKAYASA, 4 (2). pp. 108-116. ISSN 1858-3709

[img]PDF
3121Kb
[img]
Preview
PDF
3121Kb

Official URL: http://www.polinpdg.ac.id

Abstract

Real-time system requires a rapid process with an optimum accurate value in order to produce data that can be used in the decision making or used in other processes according to the required deadline. However, problems occur when the data that must be processed arrive late or the deadline is accelerated so that the process must be stopped before completion. This cause an intermediated result with low accurate value, therefore the real-time system performance criteria is difficult to achieve. This paper discusses the real-time serial-bit multiplication process using the most significant bit (MSB) first process shift-and-add multiplication algorithm method. This algorithm is a modification of the shift-and-add least significant bit (LSB) first multiplication algorithm which processes the MSB prior to the processing of operand multiplier. it is expected that the products of multiplication processes a valua with high accuracy if the process must be stopped prior to completion. this algorithm has been simulated using Altera MaxPlus II software. it is expected that this algorithm can be used in real-time system processor design application because the intermediate result value is more preferable compared to the shift-and-add LSB first.

Item Type:Article
Subjects:G Technology > GI Electrical engineering. Electronics Nuclear engineering
Divisions:Jurusan Teknik Elektro > Prog.Studi Teknik Elektronika-D3 > Journal, Proceeding
ID Code:517
Deposited By:Mr. OP Repo-1 Puskom
Deposited On:30 Nov 2016 14:07
Last Modified:30 Nov 2016 14:07

Repository Staff Only: item control page