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,226 Documents
 200   201   202   203   204 
Survey on underwater optical wireless communication: perspectives and challenges Tejaswini R Murgod; S Meenakshi Sundaram
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.pp138-146

Abstract

The demand for underwater communication is growing at a faster pace since few decades. Maximizing the communication performance and building efficient network architecture for underwater communication is a challenging task. Due to the reduced bandwidth, high error rate, noise, propagation delay, water currents and increased cost in the network topology, the existing communication techniques are not feasible for underwater communication. Research in high speed underwater transmission technology has become a primary need in today’s world. By using underwater acoustic sensor network high transmission distance can be achieved but with lower data rates, high power consumption, larger delays and with higher cost. Underwater Optical Communication can be used to increase data rates and lower delays but it suffers from high attenuation due to which it cannot be used for data transfer over larger distances. Research in the area of hybrid sensor networks is a challenging task and has many open research challenges, which needs to be solved. In this paper we discuss the various architectures of underwater communication. A comparative study is made on different routing protocols and localization algorithms. The challenges faced by acoustic and optical communication are also discussed.
Calculate the optimum slot area of elliptical microstrip antenna for mobile application Raad H. Thaher; ِAli Khalid Jassim
Indonesian Journal of Electrical Engineering and Computer Science Vol 16, No 3: December 2019
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v16.i3.pp1364-1370

Abstract

Designing and analysis the antenna parameter, for the calculation optimum the slot area for a new broadband elliptical antenna for mobile application, to enhancement impedance bandwidth. Two equations have been obtained, representing the first relationship between the area of the slot and the area of the patch, and the second represents the area of the slot to the wavelength of the band frequency. The antenna was implemented and gets simulation result using CST software and manufacturing on an FR-4 material with =4.3, tan (δ) =0.002 and the feeding line has a characteristic impedance of 50Ω. The proposed antenna is operating in the bandwidth 24GHz and the gain (6.8) dBi.
Stochastic Synchronization of Neutral-Type Chaotic Markovian Neural Networks with Impulsive Effects Cheng-De Zheng; Xixi Lv
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.pp5430-5437

Abstract

This paper studies the globally stochastic synchronization problem for a class of neutral-type chaotic neural networks with Markovian jumping parameters under impulsive perturbations. By virtue of drive-response concept and time-delay feedback control techniques, by using the Lyapunov functional method, Jensen integral inequality, a novel reciprocal convex lemma and the free-weight matrix method, a novel sufficient condition is derived to ensure the asymptotic synchronization of two identical Markovian jumping chaotic delayed neural networks with impulsive perturbation. The proposed results, which do not require the differentiability and monotonicity of the activation functions, can be easily checked via Matlab software. Finally, a numerical example with their simulations is provided to illustrate the effectiveness of the presented synchronization scheme.  
Printing Detecting Algorithm Basing on Maximum Degree of Recognition Hu Zhang; Feng Guo
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 modern packaging, printing industry, due to effects of the properties of the strip itself and the ambient light, strip background color and the color of the printing line, the low contrast boundaries of the strip on both sides and so on, the traditional digital qualitative detection and control to the correction system does not meet the comprehensive requirements. This paper aims to study the detection of a continuous line, discontinuous line and color dividing line on the strip, and because of low contrast between background color and dividing line, we proposed an innovative solution and implementation. This article discusses a new algorithm basing on maximum degree of recognition and optimal light source search algorithm, and we simulated this in MATLAB, finally, we completed the physical testing of the overall system. DOI: http://dx.doi.org/10.11591/telkomnika.v11i4.2394
Ideal Huffman Code for Lossless Image Compression for Ubiquitous Access T Kavitha; K. Jayasankar
Indonesian Journal of Electrical Engineering and Computer Science Vol 12, No 2: November 2018
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v12.i2.pp765-774

Abstract

Compression technique is adopted to solve various big data problems such as storage and transmission. The growth of cloud computing and smart phone industries has led to generation of huge volume of digital data. Digital data can be in various forms as audio, video, images and documents. These digital data are generally compressed and stored in cloud storage environment. Efficient storing and retrieval mechanism of digital data by adopting good compression technique will result in reducing cost. The compression technique is composed of lossy and lossless compression technique. Here we consider Lossless image compression technique, minimizing the number of bits for encoding will aid in improving the coding efficiency and high compression. Fixed length coding cannot assure in minimizing bit length. In order to minimize the bits variable Length codes with prefix-free codes nature are preferred. However the existing compression model presented induce high computing overhead, to address this issue, this work presents an ideal and efficient modified Huffman technique that improves compression factor up to 33.44% for Bi-level images and 32.578% for Half-tone Images. The average computation time both encoding and decoding shows an improvement of 20.73% for Bi-level images and 28.71% for Half-tone images. The proposed work has achieved overall 2% increase in coding efficiency, reduced memory usage of 0.435% for Bi-level images and 0.19% for Half-tone Images. The overall result achieved shows that the proposed model can be adopted to support ubiquitous access to digital data.
Analysis of 4G mobile network coverage in UTeM technology campus Zahariah Manap; Anis Suhaila Mohd Zain; Rahaini Mohd Said; Shawn Shivaneson Balakirisnan
Indonesian Journal of Electrical Engineering and Computer Science Vol 18, No 2: May 2020
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v18.i2.pp882-889

Abstract

This paper proposes an analysis of the coverage performance of 4G cellular services in UTeM Technology Campus. The performance of the cellular services is presented as the network’s coverage profile which is based on the received signal strength indicator (RSSI). The area under study is virtually divided into 64 grid points where the average RSSI measurements are captured by using an open source software namely G-Mon. The measured values are mapped into the network coverage profile which represents the signal reception quality at each of the grid points. A statistical analysis called Two-Way ANOVA is performed to investigate the correlation of the performance of 4G cellular services in UTeM Technology Campus with the mobile phone brands and service operators. Based on the analysis, it is found that the signal reception in outdoor areas are better than that of indoor areas. In addition, the analysis shows that the propagation loss and signal degradation are two factors that contribute to the 4G services’ performance in UTeM Technology Campus. 
Optimization of Support Vector Regression using Genetic Algorithm and Particle Swarm Optimization for Rainfall Prediction in Dry Season Gita Adhani; Agus Buono; Akhmad Faqih
Indonesian Journal of Electrical Engineering and Computer Science Vol 12, No 11: November 2014
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v12.i11.pp7912-7919

Abstract

Support Vector Regression (SVR) is Support Vector Machine (SVM) is used for regression case. Regression method is one of prediction season method has been commonly used. SVR process requires kernel functions to transform the non-linear inputs into a high dimensional feature space. This research was conducted to predict rainfall in the dry season at 15 weather stations in Indramayu district. The basic method used in this study was Support Vector Regression (SVR) optimized by a hybrid algorithm GAPSO (Genetic Algorithm and Particle Swarm Optimization). SVR models created using Radial Basis Function (RBF) kernel. This hybrid technique incorporates concepts from GA and PSO and creates individuals new generation not only by crossover and mutation operation in GA, but also through the process of PSO. Predictors used were Indian Ocean Dipole (IOD) and NINO3.4 Sea Surface Temperature Anomaly (SSTA) data. This research obtained an SVR model with the highest correlation coefficient of 0.87 and NRMSE error value of 11.53 at Bulak station. Cikedung station has the lowest NMRSE error value of 0.78 and the correlation coefficient of 9.01.
Design of Robust UPFC Based Damping Controller Using Biogeography Based Optimization S.Ali Abbas Al-Mawsawi; Anwer Haider; S.Ahmed Al-gallaf
Indonesian Journal of Electrical Engineering and Computer Science Vol 2, No 3: June 2016
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v2.i3.pp554-565

Abstract

In this paper a new optimization algorithm, the biogeography based optimization (BBO) is employed to design a robust power oscillation damping (POD) controller using unified power flow controller (UPFC). The controller that is used to damp low frequency oscillation is designed over a wide range of operating points using two different objective functions. The obtained controllers are then verified through time-domain simulation over different loading conditions with different system uncertainties introduced.
Computational Method on the Shearer Position Zhipeng Xu
Indonesian Journal of Electrical Engineering and Computer Science Vol 11, No 9: September 2013
Publisher : Institute of Advanced Engineering and Science

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

Abstract

According to problems such as low accuracy, high error in the shearer body position, this paper proposes a new computational method combining with the information of shearer, scraper conveyor and hydraulic support in order to realize three machine positioning. Using the sensor information and static-dynamic fusion, this paper solves positioning problem of the three-dimensional in the process of the shearer movement, and derive the relevant formula. Through the laboratory simulation experiment and industrial field experiments of Xi'an Coal Mining Machinery Co., Ltd show that this system can effectively improve the precision and stability of the fuselage orientation, so as to provide security for realizing the memory of shearer cutting and remote control. DOI: http://dx.doi.org/10.11591/telkomnika.v11i9.3239 
A Novel Battery Equalizer for Plug-in Hybrid Electric Vehicle Yi-Fan Zhao; Fu-Wu Yan; Chang-Qing Du
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 meet cost targets for hybrid electric (HEV), Plug-in hybrid electric (PHEV), and all-electric vehicles (EV), an improvement in the battery life cycle and safety is essential. One practical approach to improve performance is to use power electronics intensive cell equalizer, in conjunction with on-board energy storage devices. A new technique based on buck-boost topology to equalize a series-connected battery stack on PHEV is proposed in this paper. The proposed scheme transfers the energy from fully charged cell to the weaker charged cell. Unlike previous battery equalizing schemes was based on terminal voltage, the proposed scheme is based on the THEVENIN model parameters, resulting more precisely and more available energy. Experiment results are provided to verify the operation of proposed battery equalizer with characters as the following: low cost; high equalizer current and high efficiency. DOI : http://dx.doi.org/10.11591/telkomnika.v12i3.4374

Page 202 of 923 | Total Record : 9226

 200   201   202   203   204 

Filter by Year

2012 2026


Reset
Filter By Issues
All Issue Vol 42, No 1: April 2026 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