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 22 Documents
 1   2   3 
Search results for , issue "Vol 9, No 1: April 2011" : 22 Documents clear
Hybrid De-embedding Technique for Microwave Absorber Characterization Achmad Munir
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 9, No 1: April 2011
Publisher : Universitas Ahmad Dahlan

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

Abstract

In this paper, a data processing technique to obtain the true characteristic of microwave absorber material characterization is proposed. This technique addressed to overcome the limitations of port extension is known as hybrid de-embedding technique, which in principle is carried out by combining the structure model data of test fixture that is used with simulated data or experimental measurements. In this technique, the test fixture is simulated numerically to get S (scattering) parameter data. Then the S parameter is converted into the T parameter (transfer) to be used for de-embedding process by removing the characteristic of test fixture used so that the true characteristics of a microwave absorber material can be revealed. To verify the accuracy of technique proposed, the characteristics of a microwave absorber is simulated numerically and measured experimentally. The simulation and measurements results are then processed using the proposed technique to be compared with its ideal model. In general, the result of de-embedding process shows that the proposed technique has high accuracy.
An Algorithm for Predicting the Speed of Traffic Light Violators Iswanjono Iswanjono; Bagio Budiardjo; Kalamullah Ramli
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 9, No 1: April 2011
Publisher : Universitas Ahmad Dahlan

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

Abstract

The tracking of vehicles using RFID was developed consider three major problems, i.e. traffic signal timing, congestion on road and theft of vehicles. This paper describes an algorithm for predicting the speed of traffic light violators. The novel algorithm is implemented in the form of a simulation program. The traffic light system is equipped RFID reader as the main tool for identifying the vehicle’s RFID tags. In the simulation, the vehicle’s ID is generated using a random number generation. The distribution of the vehicle’s numbers is uniform and the expected number of vehicles violated the traffic light is not more than 3 % of the total number generated. The timing accuracy for speed traffic lights violator is 100 milli seconds. From the simulation conducted, the algorithm has performed as expected. It is able to predict the speed of traffic light violators ranging from 5 km/h up to 80 km/h in real-time.

Page 3 of 3 | Total Record : 22

 1   2   3 

Filter by Year

2011 2011


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