cover
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
ISSN : 25024752     EISSN : 25024760     DOI : -
Core Subject :
Arjuna Subject : -
Articles 70 Documents
Search results for , issue "Vol 20, No 3: December 2020" : 70 Documents clear
Spectrum sensing of wideband signals based on cyclostationary and compressive sensing Ali Mohammad A. AL-Hussain; Maher K. Mahmood Al Azawi
Indonesian Journal of Electrical Engineering and Computer Science Vol 20, No 3: December 2020
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v20.i3.pp1361-1368

Abstract

Compressive sensing is a powerful technique used to overcome the problem of high sampling rate when dealing with wideband signal spectrum sensing which leads to high speed analogue to digital convertor (ADC) accompanied with large hardware complexity, high processing time, long duration of signal spectrum acquisition and high consumption power. Cyclostationary based detection with compressive technique will be studied and discussed in this paper. To perform the compressive sensing technique, discrete cosine transform (DCT) is used as sparse representation basis of received signal and Gaussian random matrix as a sensing matrix, and then ????1- norm recovery algorithm is used to recover the original signal. This signal is used with cyclostationary detector. The probability of detection as a function of SNR and the probability of false alarm as a function of SNR with several compression ratios and processing time are used as performance parameters. The effect of the recovery error of reconstruction algorithm is presented as a function of probability of detection. Simulation results show that the performance of the system is maintained even at high compression.
Optical repeater for indoor visible light communication using amplify-forward method Arsyad Ramadhan Darlis; Lucia Jambola; Lita Lidyawati; Adisty Hanny Asri
Indonesian Journal of Electrical Engineering and Computer Science Vol 20, No 3: December 2020
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v20.i3.pp1351-1360

Abstract

In this paper, the implementation of an optical repeater for indoor visible light communication using the amplify-forward method was proposed. In indoor, visible light communication (VLC) can occur by transmitting information signals from lamps as a VLC transmitter toward the VLC receiver as line-of-sight (LOS) that is located with only a few meters. In the non-los (NLOS) communication, the signal will be attenuated, so it needs to amplify to improve good signal quality in a VLC receiver. The optical repeater could be used to improve the signal quality that attenuating due to distance. The audio signal was generated and sent using VLC Transmitter toward the light emitting diode (LED). Then, the electrical signal was converted to become visible light, and it was amplified using an optical amplifier with an amplify-forward method. The signal in the form of visible light that had been amplified would be received by the photodiode (PD), and the VLC receiver processed it. The measurement results showed the system that used the optical repeater could improving the distance until 9.5 m with frequency 6000 Hz, where the best signal quality at a frequency of 3000 Hz. The measurement result showed that the use of repeater components with the amplify-forward method for VLC systems, especially in the room, can increase the range until 4.5 m compare without an optical repeater. This result exceeds the minimum distance of an indoor visible light communication system, with an average distance of the roof to the floor is 3.5 m.
Face recognition using viola-jones depending on python Khansaa Dheyaa Ismael; Stanciu Irina
Indonesian Journal of Electrical Engineering and Computer Science Vol 20, No 3: December 2020
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v20.i3.pp1513-1521

Abstract

In this paper, the proposed software system based on face recognition the proposed system can be implemented in the smart building or any VIP building need security interring in general, The human face will be recognized from a stream of pictures or video feed, this technology recognizes the person according to the specific algorithm, the algorithm that employed in this paper is the Viola–Jones object detection framework by using Python. The task of the proposed facial recognition system consists of two steps, the first one was detected the human face from live video using the webcamera in the computer, and the second step recognizes if this face allowed to enter the building or not by comparing it with the existing database, the two steps depending on the OpenCV python by importing cv2 method for detecting the human face, the frames can be read or written to file with the cv2.imread and cv2.imwrite functions respectively Finally, this proposed software system can be used to control access in smart buildings as a rule and the advancement of techniques connected around there, Providing a security system is one of the most important features must be achieved in the smart buildings, this proposed system can be used as an application in a smart building as a security system. Face recognition is one of the most important applications using today for practical facial recognition. The proposed software system, depending on using OpenCV (open source computer vision) is a popular computer vision library, in 1999 this library started by Intel. The platform library sets its focus on real-time image processing and includes patent-free implementations of the latest computer vision algorithms. OpenCV 2.3.1 now comes with a programming interface to C, C++, Python, and Android. OpenCV library of python, the three algorithms that will be used in this proposed system. The currently available algorithms are: Eigenfaces → createEigenFaceRecognizer(). Fisherfaces → createFisherFaceRecognizer(). Local Binary Patterns Histograms → createLBPHFaceRecognizer(). Finally the proposed system provide entering to the building just for the authorized person according to face recognition algorithem. 
Design of arduino-based loading management system to improve continuity of solar power supply Muhardika Muhardika; Syafii Syafii
Indonesian Journal of Electrical Engineering and Computer Science Vol 20, No 3: December 2020
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v20.i3.pp1677-1684

Abstract

Solar power plants using environmentally friendly technology in the process of harvesting energy from the sun can be a solution to the future electricity crisis so that it has been the most widely developed and reliable alternative. However, the conversion of solar energy depends on the availability and conditions of sunlight. In sunny conditions, the PV system can serve large loads while charging the battery to the maximum. While in cloudy weather conditions or at night, the PV system serves the load and without charge of the battery. The battery will discharge the stored energy until it runs out, and the supply to the load will be cut off before the desired time. Therefore, research on the PV system loading management system is needed to increase the amount of electricity from solar energy and maintain the continuity of electricity supply to the load. The load power management strategy follows the conditions of sunny, cloudy, rainy, or night time by considering the remaining capacity of the battery that can be used. Load installations are designed to consist of low, medium, and high load installations. Simulation results show that the use of PV loading management strategies can increase the operating time of the PV system. When the remaining less than 10% battery capacity and PLN supply is available, the supply will be switched to PLN. The remaining 10% of PV battery capacity could be used to maintain electricity supply to a low load if the PLN supply interrupted. Thus, the use of a loading management strategy will increase the electricity supply from renewable energy and improve the sustainability of electricity supply.
A new hybrid algorithm for solving distribution network reconfiguration under different load conditions Omar Muhammed Neda
Indonesian Journal of Electrical Engineering and Computer Science Vol 20, No 3: December 2020
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v20.i3.pp1118-1127

Abstract

Distribution network reconfiguration (DNR) is a significant problem for keeping the network running under normal conditions. In this study, for preventing the premature convergence issue, also to improving the searching ability of the binary particle sarm optimization (BPSO) algorithm, chaotic strategy is incorporating with BPSO algorithm to create a new hybrid algorithm called chaotic BPSO (CBPSO). Undeniably, the chaotic strategy enables the hybrid CBPSO algorithm to slip from the local optima and also to reach optimal solution in fewer number of iterations compare to BPSO due to the remarkable behavior and ergodic of the chaos strategy than random search in BPSO algorithm. The CBPSO algorithm is presented as a advantageous optimization tool for solving DNR. In this problem, decreasing of real power loss () is an objective function while node voltage, system radially and line current have been utilized as a constrains of the system. The search space in this problem for the presented technique is a group of lines (switches) that are normally opened or closed. Two types of loads are presented: the constant and variable loads for testing the efficacy of the CBPSO method for tackling DNR problem when the load is changes. The proposed technique is implemented on IEEE Node system by utilizing R2013b software for verifying the efficacy of CBPSO technique. The simulation results confirm that technique has high ability in reducing and raising the voltage profile of the grid compared to and other procedures in the literature.
Performance evaluation of wireless data traffic in mm Wave massive MIMO communication Ahmed Thair Al-Heety; Mohammad Tariqul Islam; Ahmed Hashim Rashid; Hasanain N. Abd Ali; Ali Mohammed Fadil; Farah Arabian
Indonesian Journal of Electrical Engineering and Computer Science Vol 20, No 3: December 2020
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v20.i3.pp1342-1350

Abstract

Due to the evaluation of mobile devices and applications in the current decade, a new direction for wireless networks has emerged. The general consensus about the future 5G network is that the following should be taken into account; the purpose of thousand-fold system capacity, hundredfold energy efficiency, lower latency, and smooth connectivity. The massive multiple-input multiple-output (MIMO), as well as the Millimeter wave (mm Wave) have been considered in the ultra-dense cellular network (UDN), because they are viewed as the emergent solution for the next generations of communication. This article focuses on evaluating and discussing the performance of mm Wave massive MIMO for ultra-dense network, which is one of the major technologies for the 5G wireless network. More so, the energy efficiencies of two kinds of architectures for wireless backhaul networks were investigated and compared in this article. The results of the simulation revealed some points that should be considered during the deployment of small cells in the two architectures UDN with backhaul network capacity and backhaul energy efficiency, that the changing the frequency bands in Distribution approach gives the same energy efficiency reached to 600 Mb/s at 15 nodes while the Conventional approach results reached less than 100 Mb/s at the same number of nodes.
Optimization of energy consumption and thermal comfort for intelligent building management system using genetic algorithm Subhi Aswad Mohammed; Osama Ali Awad; Abdulkareem Merhej Radhi
Indonesian Journal of Electrical Engineering and Computer Science Vol 20, No 3: December 2020
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v20.i3.pp1613-1625

Abstract

This paper presents a design, simulation and performance evaluation of an optimized model for the heating, ventilation and air-conditioning (HVAC) systems using intelligent control algorithm. Fanger’s comfort method and genetic algorithms were used to obtain the optimal and initial values. The heat transmission coefficient between internal and external environments were determined depending on several inputs and factors acquired via supervisory control and data acquisition (SCADA) system sensors. The main feature of the real-time model is the prediction of the internal buildings environment, in order to control HVAC system for indoor environment and to utilize the optimum power consumed depending on optimized air temperature value. The predicted air temperature value and predictive mean vote (PMV) value was applied using intelligent algorithm to obtain an optimal comfort level of the air temperature. The optimized air temperature value can be used in HVAC system controller to ensure that the temperature of indoor can reach a specific value after a known period of time. The use of genetic algorithm (GE) ensures that the used power is well below its peak value and maintains the comfort of the user’s environment.
Optimized formation control of multi-agent system using PSO algorithm Ahmed M. Hasan; Safanah M. Raafat
Indonesian Journal of Electrical Engineering and Computer Science Vol 20, No 3: December 2020
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v20.i3.pp1591-1600

Abstract

Formation Control (FC) is an important application for Multi-agent Systems (MASs) in coordinated control and especially for Unmanned Aerial Vehicle (UAV) which are widely used nowadays in military and civil sections. FC is mostly applied in conjunction with consensus algorithm. In this paper, a framework for an implementation of consensus FC that involves the decentralized type of network control is considered in order to achieve  formation keeping, where the control of each vehicle is calculated dependent upon locally existed facts. The dynamic behavior of each vehicle agent is governed by its second-order dynamic model, and the networked mobile vehicle system is modeled by a directed graph. Then, particle swarm optimization (PSO) is implemented for speeding up the convergence to the desired geometrical shape. Acceleration of the network while approaching the coveted shape is achieved and omissions of undesired swing that transpires through the acceleration is examined. The merits and effectiveness of the applied approach are demonstrated using two different examples.
A robust watermarking algorithm for medical images Ahmed Nagm; Mohammed Safy
Indonesian Journal of Electrical Engineering and Computer Science Vol 20, No 3: December 2020
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v20.i3.pp1601-1612

Abstract

Integrated healthcare systems require the transmission of medical images between medical centres. The presence of watermarks in such images has become important for patient privacy protection. However, some important issues should be considered while watermarking an image. Among these issues, the watermark should be robust against attacks and does not affect the quality of the image. In this paper, a watermarking approach employing a robust dynamic secret code is proposed. This approach is to process every pixel of the digital image and not only the pixels of the regions of non-interest at the same time it preserves the image details. The performance of the proposed approach is evaluated using several performance measures such as the mean square error (MSE), the mean absolute error (MAE), the peak signal to noise ratio (PSNR), the universal image quality index (UIQI) and the structural similarity index (SSIM). The proposed approach has been tested and shown robustness in detecting the intentional attacks that change image, specifically the most important diagnostic information.
A beamforming study of the linear antenna array using grey wolf optimization algorithm Asma Issa Mohsin; Asaad S. Daghal; Adheed Hasan Sallomi
Indonesian Journal of Electrical Engineering and Computer Science Vol 20, No 3: December 2020
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v20.i3.pp1538-1546

Abstract

The grey wolf optimization (GWO) algorithm is considered an inspired meta-heuristic algorithm, which inspired by the social hierarchy and hunting behavior of the grey wolves. GWO has a high-performance capability of solving constrained, as well as unconstrained optimization problems. In this paper, the beamforming of smart antennas in a code division multiple access system based on the GWO algorithm is investigated. The sidelobe level (SLL) is minimized along with peak sidelobe level reduction, as well as an optimal beam pattern has been accomplished by using GWO to uniform linear antenna arrays. In this work, an amplitude is introduced as constant, while the interspacing distance between antenna array elements and the number of elements in a linear array are variables. The simulation results show that a faster convergence and likely high accurate beamforming are gained using GWO based method. Finally, it is shown that the GWO outperforms the genetic algorithm (GA) based method.

Filter by Year

2020 2020


Filter By Issues
All Issue 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