Open AccessPENGGUNAAN PROSESOR DSP SEBAGAI PENGGANTI KOMPONEN RANGKAIAN CDMA
Author(s) -
Arman Djohan D
Publication year - 2010
Publication title -
makara of technology series
Language(s) - English
Resource type - Journals
ISSN - 1693-6698
DOI - 10.7454/mst.v6i1.60
Subject(s) - computer science , digital signal processing , lookup table , algorithm , table (database) , millisecond , rounding , signal processing , software , parallel computing , computer hardware , arithmetic , programming language , mathematics , operating system , data mining , astronomy , physics
This research apply two algorithms namely Mathematic Algorithm and table lookup Algorithm. From both algorithms, the research examine what algorithm have the fasted processing time and the smallest memory occupation. From the examination results the Mathematic Algorithm have 20.62 milliseconds processing time and the Table lookup algorithm have 14.08 milliseconds processing time. The Table lookup algorithm have the fastest processing time because the Matematic algorithm need the rounding process of the fi gure. Eventhough such processing time is not exceed from the 125 millisecond of delay time, in real condition, the total processing time are include the error correction processing time and voice compression processing time such as ADPCM or QCELP voice compression techniques.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom