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 53 Documents
 2   3   4   5   6 
Search results for , issue "Vol 16, No 1: February 2018" : 53 Documents clear
Exponential Tapered Balun with Different Sizes for UWB Elliptical Dipole Antenna M A Zakwan; S A Hamzah; S M Shah; K N Ramli; M S Zainal; L Audah; N Abdullah; A Ubin; F C Seman; A K Anuar; Adeeb Salh; M Esa; N N N Abd Malik
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 16, No 1: February 2018
Publisher : Universitas Ahmad Dahlan

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

Abstract

This work presents a broadband tapered balun with different sizes using nonlinear transition particularly suitable for planar and three-dimensional (3-D) dipole antennas for ultra-wideband (UWB) applications such as communication, radar systems and geolocation precision. Four baluns with wideband microstrip-to-parallel-strip transition using an elliptical structure for an elliptical dipole antenna are proposed. The initial balun structure consists of a nonlinear profile with a quarter-wavelength for both height and width. By studying the current distributions at the balun surface, it can be reduced to 25%, 50% and 75% from the original size. Measured results based on the reflection coefficients for all baluns are shown to be better than -10 dB from 1.0 GHz to 10 GHz. These baluns are integrated with an elliptical dipole which acts as a feeding circuit. Eight set of antennas with a planar and 3-D configurations with four different sizes are proposed in this work. The planar configurations are named as Planar 1, Planar 2, Planar 3 and Planar 4 while the 3-D configurations are named as 3D Dipole 1, 3D Dipole 2, 3D Dipole 3 and 3D Dipole 4, respectively. The results show that all antennas with the proposed baluns operates within the UWB frequency range.
Rank Computation Model for Distribution Product in Fuzzy Multiple Attribute Decision Making Syafariani R. Fenny; A. Nursikuwagus; Tono Hartono
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 16, No 1: February 2018
Publisher : Universitas Ahmad Dahlan

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

Abstract

Ranking of an activity is very important to support work effectiveness. Previous works, ranking for distribution product is used by manual process or averaging value. Problem in this research, the research should be found the effective way to rank the distribution product. This research proposes assist the ranking with a computational model based on Fuzzy Multiple Decision Making (FMADM). Getting an effective ranking, a variable in FMADM computing is required. Variables is used in this research such as number of households, number of small-scale enterprises run by households, gross domestic regional income, and economic growth rate of a region. Research completion is assisted by using self-built research methods. Research method consists of determining value of origin, determining degree of membership, determining weight of each variable, calculation of relation matrix, calculation of the preference value in each village for ranking value, and last is sorting. Operationalized FMADM is gain a result with three priorities district. Priority number one is all of district that have a rank or Vij (alternative rank) higher than 0.4. It means only 7% or 5 villages with the highest rank. Priority number second s all of district that have rank between Vij = 0.26 and Vij = 0.4. It means only 62% or 44 villages. Priority number three is district that have a rank lower than Vij = 0.26, and only 31% or 22 villages. Impact in use of FMADM, calculated in rank, is the process runs effective and dynamic with changing of weighted. User can arrange of weighted as needed.
Efficiency of 128-bit Encryption and Decryption Process in Elgamal Method Using Elliptic Curve Cryptography (ECC) Dicky Nofriansyah; Afzalur Syaref; Widiarti R Maya; Ganefri Ganefri; Ridwan Ridwan
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 16, No 1: February 2018
Publisher : Universitas Ahmad Dahlan

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

Abstract

Cryptography is a growing science of data security. The integrity of a data is an important thing to keep the secrets contained in the data. In this research will be visualized the efficient quantities that use elliptic curves and do not use them. The Elgamal method is an asymmetric cryptographic algorithm whose complexity of processes. It is especially for digital signatures. This research will discuss about the use of ECC to optimize and streamline the Encryption and Decryption process in particular 128-bit Elgamal method. The hope is that by using elliptic curves the timing of the encryption and decryption process can run faster in the computation of Elgamal Method.

Page 6 of 6 | Total Record : 53

 2   3   4   5   6 

Filter by Year

2018 2018


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