cover
Article Per Year (5 Year)
All
Home Page
OAI Link
Editorial Team
Contact
Reviewer
Google Scholar
Contact Name
-
Contact Email
-
Phone
-
Journal Mail Official
-
Editorial Address
-
Location
Kota yogyakarta,
Daerah istimewa yogyakarta
INDONESIA
Indonesian Journal of Electrical Engineering and Computer Science
Published by Institute of Advanced Engineering and Science
ISSN : 25024752     EISSN : 25024760     DOI : -
Core Subject :
Arjuna Subject : -
Articles 9,199 Documents
 94   95   96   97   98 
Development of An On-Board Diagnostics System Based On Wireless Network Guosheng Feng; Bo Feng; Sumei Jia; Lisha Feng
Indonesian Journal of Electrical Engineering and Computer Science Vol 12, No 3: March 2014
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

In order to control vehicle exhaust emission effectively, an OBD is developed based on Zigbee technology. Overall solution design of the system is proposed and the vehicle-mounted monitoring database is established. The wireless network communication hardware platform is set up by the MC9S08GT60 microcontroller and the MC13192 wireless module. The project document is produced with the help of BeeKit wireless connectivity toolkit. Under the CodeWarrior IDE development environment, the monitoring station coordinator networking program and the vehicle-mounted terminal device networking program are designed. Experimental results shows that this system complete data exchange between the monitoring station coordinator and the vehicle-mounted terminal device and transfer data into monitoring station computer. The wireless network of OBD is realized. DOI : http://dx.doi.org/10.11591/telkomnika.v12i3.4687
Dynamic characteristics analysis of mats of ballasted track on bridge Xiao Hong; Gao Liang; Wu Kaiwei
Indonesian Journal of Electrical Engineering and Computer Science Vol 10, No 7: November 2012
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

A complete vehicle-ballasted track-bridge coupling dynamic model is established. A program to analyze dynamic characteristics is also invented, which is the first time to systematically analyze the dynamic characteristics of vehicles, tracks and bridges when using mats under ballast on the rigid foundation of bridge, in China. The results show that:(1) The mats under ballast are able to reduce vibration of the train and the wheel-rail forces by a certain extent, which increase the comforts of passengers.(2) The mats under ballast are able to reduce the stress of ballast, which has a great practical significance on avoiding ballast powdering and reducing maintenance work of ballast. (3) The mats under ballast are able to reduce the vibration of bridges. It has a great significance on avoiding the lateral flow deformation of ballast under dynamic loads, keeping good track geometry to ensure the safety of operation. DOI: http://dx.doi.org/10.11591/telkomnika.v10i7.1575
Design and Simulation of a New ZVT Bi-directional DC-DC Converter for Electric Vehicles Rajesh Thumma; Veera Venkata Subrahmanya Kumar Bhajana; Pramo kumar Aylapogu
Indonesian Journal of Electrical Engineering and Computer Science Vol 7, No 1: July 2017
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v7.i1.pp75-83

Abstract

This paper presents a new zero voltage transistion (ZVT) bi-directional DC-DCconverter for energy storage system in DC traction. This bidirectional converter can transfers the power flow from low voltage side to high voltage side and viceversa. The conventional hard-switched non-isolated converter improved with the additional auxiliary cell to obtain zero voltage transition for the IGBTs. The main advantages of this topology are reduced the switching losses and improved the efficiency as well.The main aim of this converter is to achieve the operation of zero voltage transition during the commutation of main switches from off to on by utilizing auxiliary cell, which consist active and passive elements.The boost and buck modes of operations are achieved with the zero voltage transistion, which reduce the IGBTs current stresses and switching losses.This paper mainly describes the operation principles and the evaluation of the simulation results with the aid of Matlab simulations.The obtained results were proved the expected assumptions of the theoretical analysis.
FPGA implementation of color image encryption using a new chaotic map Hamsa A Abdullah; Hikmat N Abdullah
Indonesian Journal of Electrical Engineering and Computer Science Vol 13, No 1: January 2019
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v13.i1.pp129-137

Abstract

In this paper, an FPGA implementation of efficient image encryption algorithm using a chaotic map has been proposed. The proposed system consists of two phases image encryption technique. First phase consists of scrambling of pixel position and second phase consist of diffusion of bit value. In the first phase, original pixel values remain unchanged. In second phase, pixel values are modified. These modifications are done by using chaotic behavior of a recently developed chaotic map called Nahrain.  A color image encryption using Nahrain chaotic map is simulated in software via Matlab, Altera Quartus Prime 17.0 Lite EditionI and ModelSim software tools then implemented in hardware via Cyclone V GX Starter Kit FPGA platform. The results show the feasibility and effectiveness of the cryptosystem. As a typical application, the image encryption/decryption is used to demonstrate and verify the operation of the cryptosystem hardware. Complete analysis on robustness of the method is investigated. Correlation, Encryption time, Decryption time and key sensitivity show that the proposed crypto processor offers high security and reliable encryption speed for real-time image encryption and transmission.  To evaluate the performance, histogram, correlation, information entropy, number of pixel change rate (NPCR), and unified average changing intensity (UACI) measures are used for security analysis. The simulation results and security analysis have demonstrated that the proposed encryption system is robust and flexible. For example the amount of entropy obtained by the proposed algorithm is 7.9964, which is very close to its ideal amount: 8, and NPCR is 99.76 %, which is the excellent value to obtain. The hardware simulation results show that the number of pins that used of the proposed system reaches to 6% of total pins and Logic utilization (in ALMs) is 1%.
Vibration Error Research of Fiber Optic Gyroscope in Engineering Surveying Zhang Zhuomin; Hu Wenbin; Liu Fang; Gan Weibing; Yang Yan
Indonesian Journal of Electrical Engineering and Computer Science Vol 11, No 4: April 2013
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

In the process of the engineering surveying by FOG (fiber optic gyroscope), there are a lot of measurement error caused by many kinds of factors, vibration error is one of them. Analyzing the output signal of FOG on the effect of vibration, Kalman filter can be used to inhibit the drift of output signal, and it is experimentally validated based on the filtering algorithm. The results show that, the vibration error of FOG was reduced, and the validity of the method has been proved. DOI: http://dx.doi.org/10.11591/telkomnika.v11i4.2367
A descent extension of the Dai - Yuan conjugate gradient technique Basim Abbas Hassan; Zeyad M. Abdullah; Hawraz N. Jabbar
Indonesian Journal of Electrical Engineering and Computer Science Vol 16, No 2: November 2019
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v16.i2.pp661-668

Abstract

Based on Dai - Yuan technique, a new extension method was proposed. In contrary to the CG classical method, this proposed method employs a coefficient that has an important role in constructing the new formula with less computational efforts. This proposed method was found to be efficient on the basis of theory analysis and numerical results.
An Improved A Low Power CMOS TIQ Comparator Flash ADC A Al; Mamun B. Ibne Reaz; J. Jalil; Mohd. Alauddin Bin Mohd. Ali
Indonesian Journal of Electrical Engineering and Computer Science Vol 12, No 7: July 2014
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v12.i7.pp5204-5210

Abstract

This paper was presented the design of a threshold inverter quantized (TIQ) comparator in flash analog to digital converter. The TIQ-comparator has a high speed response; however this circuit involves a lot of transistors hence wasteful power consumption. The design is intended to obtain a low-power TIQ-comparator and reduces the area of the chip in 0.18 µm CMOS technology. The method was proposed to set each of the transistor channel length for the threshold voltage difference gained of the inverter each in the TIQ-comparator and adding a transistor as compensation to overcome the limitations of the length channel expansion due to the body effect influence. This method has reduced the drain current of CMOS transistors; hence the power dissipation can be reduced. The event has achieved low power dissipation of 31.14 µW and a chip size of 1065 µm2 with 0 to 0.6 V input signal condition.
Blockchain based crowdfunding systems Md Nazmus Saadat; Syed Abdul Halim; Husna Osman; Rasheed Mohammad Nassr; Megat F. Zuhairi
Indonesian Journal of Electrical Engineering and Computer Science Vol 15, No 1: July 2019
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v15.i1.pp409-413

Abstract

Initially, blockchain is only used as a foundation of cryptocurrency, but today, we can see the rise of this new emerging technology are being implemented in many industries. In the future, most technologies around the world are expected to use blockchain as an efficient way to make online transactions. One of the areas that blockchain technologies can be applied is crowdfunding platforms. The most common problem with current crowdfunding scene in around the world including is that the campaigns are not regulated and some of the crowd-funding campaign turned out to be fraud. Besides, the completion of some projects also was significantly delayed. This project aims to solve these problems by applying Ethereum smart contracts to the crowdfunding site to that the contracts will be fully automatically executed, thus preventing frauds and ensuring that the projects can be delivered within duration given.
Position Estimation Comparison of a 3-D Linear Lateration Algorithm with a Reference Selection Technique Abdulmalik Shehu Yaro; Ahmad Zuri Sha'ameri; Nidal Kamel
Indonesian Journal of Electrical Engineering and Computer Science Vol 10, No 1: April 2018
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v10.i1.pp207-213

Abstract

Multilateration system estimates emitter position using time difference of arrival (TDOA) measurement with a lateration algorithm. The position estimation (PE) accuracy of the system depends on several factors such as the number of ground receiving station (GRS)s deployed, the reference station used and the type of lateration algorithm. In this paper, the 3-D PE accuracy of a four-GRS linear lateration algorithm combined with a GRS reference pair selection (GREPS) technique is determined and compared with two different five-GRS linear lateration algorithms. The two five-GRS linear lateration algorithms chosen for comparison are based on single reference total least square (SF-TLS) and multiple reference least square (MF-LS) approaches. Monte Carlo simulation result comparison shows that the four-GRS linear lateration algorithm with the GREPS technique outperformed the SF-TLS and MF-LS with a reduction in horizontal coordinate PE error of about 50% and 30% respectively, and with a 90% reduction in the altitude error
Radial basis function neural network for 2 satisfiability programming Shehab Alzaeemi; Mohd. Asyraf Mansor; Mohd Shareduwan Mohd Kasihmuddin; Saratha Sathasivam; Mustafa Mamat
Indonesian Journal of Electrical Engineering and Computer Science Vol 18, No 1: April 2020
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v18.i1.pp459-469

Abstract

Radial Basis Function Neural Network (RBFNN) is very prominent in data processing. However, improving this technique is vital for the NN training process. This paper presents an integrated 2 Satisfiability in radial basis function neural network (RBFNN-2SAT). There are two different types of training in RBFNN, namely no-training technique and half-training technique. The performance of the solutions via Genetic Algorithm (GA) training was investigated by comparing the Radial Basis Function Neural Network No-Training Technique (RBFNN- 2SATNT) and Radial Basis Function Neural Network Half-Training Technique (RBFNN- 2SATHT). The comparison of both techniques was examined on 2 Satisfiability problem by using a C# software that was developed for this experiment. The performance of the RBFNN-2SATNT and RBFNN-2SATHT in performing 2SAT is discussed in terms of root mean squared error (RMSE), sum squared error (SSE), mean absolute percentage error (MAPE), mean absolute error (MAE), number of the hidden neurons and CPU time. Results obtained from a computer simulation showed that RBFNN-2SATHT outperformed RBFNN-2SATNT.

Page 96 of 920 | Total Record : 9199

 94   95   96   97   98 

Filter by Year

2012 2026


Reset
Filter By Issues
All Issue Vol 41, No 3: March 2026 Vol 41, No 2: February 2026 Vol 41, No 1: January 2026 Vol 40, No 3: December 2025 Vol 40, No 2: November 2025 Vol 40, No 1: October 2025 Vol 39, No 3: September 2025 Vol 39, No 2: August 2025 Vol 39, No 1: July 2025 Vol 38, No 3: June 2025 Vol 38, No 2: May 2025 Vol 38, No 1: April 2025 Vol 37, No 3: March 2025 Vol 37, No 2: February 2025 Vol 37, No 1: January 2025 Vol 36, No 3: December 2024 Vol 36, No 2: November 2024 Vol 36, No 1: October 2024 Vol 35, No 3: September 2024 Vol 35, No 2: August 2024 Vol 35, No 1: July 2024 Vol 34, No 3: June 2024 Vol 34, No 2: May 2024 Vol 34, No 1: April 2024 Vol 33, No 3: March 2024 Vol 33, No 2: February 2024 Vol 33, No 1: January 2024 Vol 32, No 3: December 2023 Vol 32, No 1: October 2023 Vol 31, No 3: September 2023 Vol 31, No 2: August 2023 Vol 31, No 1: July 2023 Vol 30, No 3: June 2023 Vol 30, No 2: May 2023 Vol 30, No 1: April 2023 Vol 29, No 3: March 2023 Vol 29, No 2: February 2023 Vol 29, No 1: January 2023 Vol 28, No 3: December 2022 Vol 28, No 2: November 2022 Vol 28, No 1: October 2022 Vol 27, No 3: September 2022 Vol 27, No 2: August 2022 Vol 27, No 1: July 2022 Vol 26, No 3: June 2022 Vol 26, No 2: May 2022 Vol 26, No 1: April 2022 Vol 25, No 3: March 2022 Vol 25, No 2: February 2022 Vol 25, No 1: January 2022 Vol 24, No 3: December 2021 Vol 24, No 2: November 2021 Vol 24, No 1: October 2021 Vol 23, No 3: September 2021 Vol 23, No 2: August 2021 Vol 23, No 1: July 2021 Vol 22, No 3: June 2021 Vol 22, No 2: May 2021 Vol 22, No 1: April 2021 Vol 21, No 3: March 2021 Vol 21, No 2: February 2021 Vol 21, No 1: January 2021 Vol 20, No 3: December 2020 Vol 20, No 2: November 2020 Vol 20, No 1: October 2020 Vol 19, No 3: September 2020 Vol 19, No 2: August 2020 Vol 19, No 1: July 2020 Vol 18, No 3: June 2020 Vol 18, No 2: May 2020 Vol 18, No 1: April 2020 Vol 17, No 3: March 2020 Vol 17, No 2: February 2020 Vol 17, No 1: January 2020 Vol 16, No 3: December 2019 Vol 16, No 2: November 2019 Vol 16, No 1: October 2019 Vol 15, No 3: September 2019 Vol 15, No 2: August 2019 Vol 15, No 1: July 2019 Vol 14, No 3: June 2019 Vol 14, No 2: May 2019 Vol 14, No 1: April 2019 Vol 13, No 3: March 2019 Vol 13, No 2: February 2019 Vol 13, No 1: January 2019 Vol 12, No 3: December 2018 Vol 12, No 2: November 2018 Vol 12, No 1: October 2018 Vol 11, No 3: September 2018 Vol 11, No 2: August 2018 Vol 11, No 1: July 2018 Vol 10, No 3: June 2018 Vol 10, No 2: May 2018 Vol 10, No 1: April 2018 Vol 9, No 3: March 2018 Vol 9, No 2: February 2018 Vol 9, No 1: January 2018 Vol 8, No 3: December 2017 Vol 8, No 2: November 2017 Vol 8, No 1: October 2017 Vol 7, No 3: September 2017 Vol 7, No 2: August 2017 Vol 7, No 1: July 2017 Vol 6, No 3: June 2017 Vol 6, No 2: May 2017 Vol 6, No 1: April 2017 Vol 5, No 3: March 2017 Vol 5, No 2: February 2017 Vol 5, No 1: January 2017 Vol 4, No 3: December 2016 Vol 4, No 2: November 2016 Vol 4, No 1: October 2016 Vol 3, No 3: September 2016 Vol 3, No 2: August 2016 Vol 3, No 1: July 2016 Vol 2, No 3: June 2016 Vol 2, No 2: May 2016 Vol 2, No 1: April 2016 Vol 1, No 3: March 2016 Vol 1, No 2: February 2016 Vol 1, No 1: January 2016 Vol 16, No 3: December 2015 Vol 16, No 2: November 2015 Vol 16, No 1: October 2015 Vol 15, No 3: September 2015 Vol 15, No 2: August 2015 Vol 15, No 1: July 2015 Vol 14, No 3: June 2015 Vol 14, No 2: May 2015 Vol 14, No 1: April 2015 Vol 13, No 3: March 2015 Vol 13, No 2: February 2015 Vol 13, No 1: January 2015 Vol 12, No 12: December 2014 Vol 12, No 11: November 2014 Vol 12, No 10: October 2014 Vol 12, No 9: September 2014 Vol 12, No 8: August 2014 Vol 12, No 7: July 2014 Vol 12, No 6: June 2014 Vol 12, No 5: May 2014 Vol 12, No 4: April 2014 Vol 12, No 3: March 2014 Vol 12, No 2: February 2014 Vol 12, No 1: January 2014 Vol 11, No 12: December 2013 Vol 11, No 11: November 2013 Vol 11, No 10: October 2013 Vol 11, No 9: September 2013 Vol 11, No 8: August 2013 Vol 11, No 7: July 2013 Vol 11, No 6: June 2013 Vol 11, No 5: May 2013 Vol 11, No 4: April 2013 Vol 11, No 3: March 2013 Vol 11, No 2: February 2013 Vol 11, No 1: January 2013 Vol 10, No 8: December 2012 Vol 10, No 7: November 2012 Vol 10, No 6: October 2012 Vol 10, No 5: September 2012 Vol 10, No 4: August 2012 Vol 10, No 3: July 2012 More Issue