cover
Article Per Year (5 Year)
All
Home Page
OAI Link
Editorial Team
Contact
Reviewer
Google Scholar
Contact Name
Nizirwan Anwar
Contact Email
nizirwan.anwar@esaunggul.ac.id
Phone
-
Journal Mail Official
telkomnika@ee.uad.ac.id
Editorial Address
Ahmad Yani st. (Southern Ring Road), Tamanan, Banguntapan, Bantul, Yogyakarta 55191, Indonesia
Location
Kota yogyakarta,
Daerah istimewa yogyakarta
INDONESIA
TELKOMNIKA (Telecommunication Computing Electronics and Control)
Published by Universitas Ahmad Dahlan
ISSN : 16936930     EISSN : 23029293     DOI : 10.12928
Core Subject : Science,
Computer Science & IT
Submitted papers are evaluated by anonymous referees by single blind peer review for contribution, originality, relevance, and presentation. The Editor shall inform you of the results of the review as soon as possible, hopefully in 10 weeks. Please notice that because of the great number of submissions that TELKOMNIKA has received during the last few months the duration of the review process can be up to 14 weeks. Communication Engineering, Computer Network and System Engineering, Computer Science and Information System, Machine Learning, AI and Soft Computing, Signal, Image and Video Processing, Electronics Engineering, Electrical Power Engineering, Power Electronics and Drives, Instrumentation and Control Engineering, Internet of Things (IoT)
Arjuna Subject : Ilmu Komputer (semua kategori) - Aplikasi Ilmu Komputer
Articles 64 Documents
 3   4   5   6   7 
Search results for , issue "Vol 15, No 1: March 2017" : 64 Documents clear
Modeling Text Independent Speaker Identification with Vector Quantization Syeiva Nurul Desylvia; Agus Buono; Bib Paruhum Silalahi
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 15, No 1: March 2017
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12928/telkomnika.v15i1.4656

Abstract

Speaker identification is one of the most important technology nowadays. Many fields such as bioinformatics and security are using speaker identification. Also, almost all electronic devices are using this technology too. Based on number of text, speaker identification divided into text dependent and text independent. On many fields, text independent is mostly used because number of text is unlimited. So, text independent is generally more challenging than text dependent. In this research, speaker identification text independent with Indonesian speaker data was modelled with Vector Quantization (VQ). In this research VQ with K-Means initialization was used. K-Means clustering also was used to initialize mean and Hierarchical Agglomerative Clustering was used to identify K value for VQ. The best VQ accuracy was 59.67% when k was 5. According to the result, Indonesian language could be modelled by VQ. This research can be developed using optimization method for VQ parameters such as Genetic Algorithm or Particle Swarm Optimization.
Research on VoIP Acoustic Echo Cancelation Algorithm Based on Speex Liu hua-zhu; Zhao xiao-fang; Lin sheng-xin
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 15, No 1: March 2017
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12928/telkomnika.v15i1.4053

Abstract

Echo cancellation has been a major problem to be solved in VoIP, although the integrated echo cancellation module in Speex, it does not consider thread synchronization issues. The frequency domain echo cancellation algorithm MDF of speex is analyzed, and then a synchronization method of playing thread and recording thread is proposed. The results show that the acoustic echo canceller which achieved by the proposed method meet the requirements of voice communication, implementation is easier and therefore provides a reference for the VoIP voice communication and mobile communication terminal.
Image De-noising on Strip Steel Surface Defect Using Improved Compressive Sensing Algorithm Dongyan Cui; Kewen Xia; Jingzhong Hou; Ahmad Ali
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 15, No 1: March 2017
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12928/telkomnika.v15i1.3164

Abstract

De-noising for the strip steel surface defect image is conductive to the accurate detection of the strip steel surface defects. In order to filter the Gaussian noise and salt and pepper noise of strip steel surface defect images, an improved compressive sensing algorithm was applied to defect image de-noising in this paper. First, the improved Regularized Orthogonal Matching Pursuit algorithm was described. Then, three typical surface defects (scratch, scar, surface upwarping) images were selected as the experimental samples. Last, detailed experimental tests were carried out to the strip steel surface defect image de-noising. Through comparison and analysis of the test results, the Peak Signal to Noise Ratio value of the proposed algorithm is higher compared with other traditional de-noising algorithm, and the running time of the proposed algorithm is only26.6\% of that of traditional Orthogonal Matching Pursuit algorithms. Therefore, it has better de-noising effect and can meet the requirements of real-time image processing.
Research on topology control in WSNs based on complex network model Chuanyun Wang; Yin Yan
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 15, No 1: March 2017
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12928/telkomnika.v15i1.3854

Abstract

This paper is under in-depth investigation due to suspicion of possible plagiarism on a high similarity indexA topology control algorithm based on mutual selection mechanism is proposed, combined with complex network model. It adopts node strength and spacing between nodes as the measuring parameters, selects the cluster head nodes based on mutual selection mechanism in the communication radius of nodes and builds the hierarchical topology. The algorithm can improve the clustering efficiency, shorten the average path length, save the energy of the nodes. The simulation and analysis of network evolving process and algorithm model are completed using MATLAB tools and the results verify the correctness and stability of the proposed algorithm model. The algorithm is suitable for large-scale node deployment in WSNs.
A Two Stage Classification Model for Call Center Purchase Prediction Kai Shuang; Kai-Ze Ding; Xi-Hao Liu; Xiao-Le Wen
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 15, No 1: March 2017
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12928/telkomnika.v15i1.4269

Abstract

In call center [1] product recommendation field, call center as an organization between users and telecom operator, doesn’t have permission to access users specific information and the detailed products information. Accordingly, rule-based selection method is common used to predict user purchase behavior by the call center. Unfortunately, rule-based approach not only ignores the user’s previous behavior information entirely, and it is difficult to make use of the existing interaction records between users and products. Consequently, it will not get desired results if we just use the basic selection method to predict user purchase behavior directly, because the problem is that the features straightly extracted from the interaction data records are limited. In order to solve the problem above, this paper proposes a two-stage algorithm that based on K-Means Clustering Algorithm [2] and SVM [3, 4] Classification Algorithm. Firstly, we get the potential category information of products by K-Means Clustering Algorithm, then use SVM Classification Model to predict users purchasing behavior. This two-stage prediction model not only solves the feature shortage problem, but also gives full consideration to the potential features between users and product categories, which can help us to gain significant performance in call center product recommendation field.
A Study on Image Reconfiguration Algorithm of Compressed Sensing Zhang Yubo; Wang Dongmei; Lingling Kan; Panpan Zhao
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 15, No 1: March 2017
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12928/telkomnika.v15i1.3710

Abstract

Compressed sensing theory is a subversion of the traditional theory. The theory obtains data sampling points while achieves data compression. The main content of this thesis is reconstruction algorithm. It’s the key of the compressed sensing theory, which directly determines the quality of reconstructed signal, reconstruction speed and application effect. In this paper, we have studied the theory of compressed sensing and the existing reconstruction algorithms, then choosing three algorithms (OMP, CoSaMP, StOMP) as the research. On the basis of summarizing the existing algorithms and models, we analyze the results such as PSNR, relative error, matching ratio and running time of them from image signal respectively. In the three reconstruction algorithms, OMP algorithm has the best accuracy for image reconstruction. The convergence speed of CoSaMP algorithm is faster than that of the OMP algorithm’s, but it depends on sparsity K quietly. StOMP algorithm on image reconstruction effect is the best, and the convergence speed is also the fastest.
Comparison of Feature Extraction Mel Frequency Cepstral Coefficients and Linear Predictive Coding in Automatic Speech Recognition for Indonesian Sukmawati Nur Endah; Satriyo Adhy; Sutikno Sutikno
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 15, No 1: March 2017
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12928/telkomnika.v15i1.3605

Abstract

Speech recognition can be defined as the process of converting voice signals into the ranks of the word, by applying a specific algorithm that is implemented in a computer program. The research of speech recognition in Indonesia is relatively limited. This paper has studied methods of feature extraction which is the best among the Linear Predictive Coding (LPC) and Mel Frequency Cepstral Coefficients (MFCC) for speech recognition in Indonesian language. This is important because the method can produce a high accuracy for a particular language does not necessarily produce the same accuracy for other languages, considering every language has different characteristics. Thus this research hopefully can help further accelerate the use of automatic speech recognition for Indonesian language. There are two main processes in speech recognition, feature extraction and recognition. The method used for comparison feature extraction in this study is the LPC and MFCC, while the method of recognition using Hidden Markov Model (HMM). The test results showed that the LPC method is better than MFCC in Indonesian language speech recognition.
Research on Chaotic Firefly Algorithm and the Application in Optimal Reactive Power Dispatch Genfu Xiao; Huan Liu; Yuming Guo; Yanhui Zhou
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 15, No 1: March 2017
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12928/telkomnika.v15i1.3862

Abstract

Firefly algorithm (FA) is a newly proposed swarm intelligence optimization algorithm. The original version of FA usually traps into local optima like many other general swarm intelligence optimization algorithm. In order to overcome this drawback, the chaotic firefly algorithm(CFA) is proposed. The methods of chaos initialization, chaos population regeneration and linear decreasing inertia weight have been introduced into the original version of FA so as to increase its global search mobility for robust global optimization. The CFA is calculated in Matlab and is examined on six benchmark functions. In order to evaluate the engineering application of the algorithm, the reactive power optimization problem in IEEE 30 bus system is solved by CFA. The outcomes show that the CFA has better performance compared to the original version of FA and PSO
Investigation Study of Three-Level Cascaded H-bridge Multilevel Inverter Mohd Ruddin Ab Ghani; Nabil Farah; Jurifa Lazi; M.R. Tamjis; Md Nazri Othman; Nur Huda Mohd Amin; Syariffah Othman; Zanariah Jano; Tole Sutikno
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 15, No 1: March 2017
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12928/telkomnika.v15i1.4749

Abstract

This paper analyzed three-level Cascaded H-bridge Multilevel Inverter (CHMLI) utilizing two modulation techniques namely Sinusoidal Pulse Width Modulation (SPWM) and Space Vector Pulse Width Modulation (SVPWM). The performance and the output of CHMLI in terms of Total Harmonic Distotion (THD) % and circuits complexity were compared. The simulations models were constructed using MATLAB/SIMULINK. The results showed the CHMLI produced the lowest THD contents and utilized fewer components. Moreover, the SVPWM produced less THD than SPWM.
High throughput FPGA Implementation of Advanced Encryption Standard Algorithm Soufiane Oukili; Seddik Bri
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 15, No 1: March 2017
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12928/telkomnika.v15i1.4713

Abstract

 The growth of computer systems and electronic communications and transactions has meant that the need for effective security and reliability of data communication, processing and storage is more important than ever. In this context, cryptography is a high priority research area in engineering. The Advanced Encryption Standard (AES) is a symmetric-key criptographic algorithm for protecting sensitive information and is one of the most widely secure and used algorithm today. High-throughput, low power and compactness have always been topic of interest for implementing this type of algorithm. In this paper, we are interested on the development of high throughput architecture and implementation of AES algorithm, using the least amount of hardware possible. We have adopted a pipeline approach in order to reduce the critical path and achieve competitive performances in terms of throughput and efficiency. This approach is effectively tested on the AES S-Box substitution. The latter is a complex transformation and the key point to improve architecture performances. Considering the high delay and hardware required for this transformation, we proposed 7-stage pipelined S-box by using composite field in order to deal with the critical path and the occupied area resources. In addition, efficient AES key expansion architecture suitable for our proposed pipelined AES is presented. The implementation had been successfully done on Virtex-5 XC5VLX85 and Virtex-6 XC6VLX75T Field Programmable Gate Array (FPGA) devices using Xilinx ISE v14.7. Our AES design achieved a data encryption rate of 108.69 Gbps and used only 6361 slices ressource. Compared to the best previous work, this implementation improves data throughput by 5.6% and reduces the used slices to 77.69%.

Page 5 of 7 | Total Record : 64

 3   4   5   6   7 

Filter by Year

2017 2017


Reset
Filter By Issues
All Issue Vol 20, No 3: June 2022 Vol 20, No 2: April 2022 Vol 20, No 1: February 2022 Vol 19, No 6: December 2021 Vol 19, No 5: October 2021 Vol 19, No 4: August 2021 Vol 19, No 3: June 2021 Vol 19, No 2: April 2021 Vol 19, No 1: February 2021 Vol 18, No 6: December 2020 Vol 18, No 5: October 2020 Vol 18, No 4: August 2020 Vol 18, No 3: June 2020 Vol 18, No 2: April 2020 Vol 18, No 1: February 2020 Vol 17, No 6: December 2019 Vol 17, No 5: October 2019 Vol 17, No 4: August 2019 Vol 17, No 3: June 2019 Vol 17, No 2: April 2019 Vol 17, No 1: February 2019 Vol 16, No 6: December 2018 Vol 16, No 5: October 2018 Vol 16, No 4: August 2018 Vol 16, No 3: June 2018 Vol 16, No 2: April 2018 Vol 16, No 1: February 2018 Vol 15, No 4: December 2017 Vol 15, No 3: September 2017 Vol 15, No 2: June 2017 Vol 15, No 1: March 2017 Vol 14, No 4: December 2016 Vol 14, No 3: September 2016 Vol 14, No 2: June 2016 Vol 14, No 1: March 2016 Vol 13, No 4: December 2015 Vol 13, No 3: September 2015 Vol 13, No 2: June 2015 Vol 13, No 1: March 2015 Vol 12, No 4: December 2014 Vol 12, No 3: September 2014 Vol 12, No 2: June 2014 Vol 12, No 1: March 2014 Vol 11, No 4: December 2013 Vol 11, No 3: September 2013 Vol 11, No 2: June 2013 Vol 11, No 1: March 2013 Vol 10, No 4: December 2012 Vol 10, No 3: September 2012 Vol 10, No 2: June 2012 Vol 10, No 1: March 2012 Vol 9, No 3: December 2011 Vol 9, No 2: August 2011 Vol 9, No 1: April 2011 Vol 8, No 3: December 2010 Vol 8, No 2: August 2010 Vol 8, No 1: April 2010 Vol 7, No 3: December 2009 Vol 7, No 2: August 2009 Vol 7, No 1: April 2009 Vol 6, No 3: December 2008 Vol 6, No 2: August 2008 Vol 6, No 1: April 2008 Vol 5, No 3: December 2007 Vol 5, No 2: August 2007 Vol 5, No 1: April 2007 Vol 4, No 3: December 2006 Vol 4, No 2: August 2006 Vol 4, No 1: April 2006 Vol 3, No 3: December 2005 Vol 3, No 2: August 2005 Vol 3, No 1: April 2005 Vol 2, No 1: April 2004 More Issue