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
 143   144   145   146   147 
Resource allocation algorithm for symmetrical services in OFDMA systems Swapna P S; Sakuntala S Pillai; Sreeni K. G
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.pp867-874

Abstract

The widespread acceptance of symmetrical services has urged for performance betterment techniques in wireless communication systems. In this paper, we propose an algorithm for resource allocation in MIMO-OFDMA system for applications that demand similar quality in uplink and downlink direction. The problem is formulated as multiobjective optimization problem with objectives to maximize the bidirectional data rates for individual users and to minimize the difference between the uplink and downlink data rate for each user. Fairness has been considered as a constraint in the optimization problem. The power allocation for each subcarrier in the OFDMA system is carried out using Linear Programming (LP) techniques, while the subcarrier allocation problem has been undertaken using an innovative multiobjective optimization technique that employs the concept of non-dominance in evolutionary algorithms. The results are extremely encouraging as they outperform the algorithms reported in literature using linear programming techniques or evolutionary algorithms solely. 
Local Application of Non Negative Matrix Factorization Algorithm in Face Recognition Lou Xiongwei; Huang Decai; Fang Luming; Xu Aijun
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

Face recognition is a challenging issue in the field of multi-science, the main contents of the research is how to make computer have the ability of face recognition face recognition technology involved in a lot, which is a key feature extraction and classification method, this paper focuses on the study of related theory. Non-negative matrix factorization trapped MF) algorithm and local non-negative matrix factorization (LNMF) algorithm is a feature extraction method based on local features, has been successfully used in face recognition "but NMF algorithm in face recognition rate is low, although LNMF algorithm to a certain extent, improve the recognition rate, but its price is to increase the number of iterations. In addition, the two algorithms have failed to solve good nonlinear separable problems "the kernel method combined with LNMF algorithm, the kernel local non-negative matrix factorization (KLNMF) algorithm, the first by a nonlinear transformation of the original space to high-dimensional space, making samples linearly separable, and then use the LNMF algorithm to extract face features. In the classification part, paper presents the decision rules of classification of their own, and design based on the NMF subspace classifier. DOI : http://dx.doi.org/10.11591/telkomnika.v12i3.4356
A Novel Solution to Sieving Model for a Drilling Fluid Shale Shaker WeiBing Zhu; WaNi Wu; Xu Hao; HeShun Wang
Indonesian Journal of Electrical Engineering and Computer Science Vol 10, No 6: October 2012
Publisher : Institute of Advanced Engineering and Science

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

Abstract

  According to the principle of hydromechanics, the flow characteristic of drilling fluid on the screen is studied. In consideration of affecting factors, sieving model equations including kinematic equations and continuity equation for drilling fluid shale shaker are established. This paper shows a novel solution to the sieving model equations by using average energy principle and finite differential method. The computer simulation program of flow capacity of the shaker is developed. The model will be of great significance in evaluating screening performance and screen selection. DOI: http://dx.doi.org/10.11591/telkomnika.v10i6.1399
Investigation of Lossless Audio Compression using IEEE 1857.2 Advanced Audio Coding Teddy Surya Gunawan; Muhammad Khalif Mat Zain; Fathiah Abdul Muin; Mira Kartiwi
Indonesian Journal of Electrical Engineering and Computer Science Vol 6, No 2: May 2017
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v6.i2.pp422-430

Abstract

Audio compression is a method of reducing the space demand and aid transmission of the source file which then can be categorized by lossy and lossless compression. Lossless audio compression was considered to be a luxury previously due to the limited storage space. However, as storage technology progresses, lossless audio files can be seen as the only plausible choice for those seeking the ultimate audio quality experience. There are a lot of commonly used lossless codecs are FLAC, Wavpack, ALAC, Monkey Audio, True Audio, etc. The IEEE Standard for Advanced Audio Coding (IEEE 1857.2) is a new standard approved by IEEE in 2013 that covers both lossy and lossless audio compression tools. A lot of research has been done on this standard, but this paper will focus more on whether the IEEE 1857.2 lossless audio codec to be a viable alternative to other existing codecs in its current state. Therefore, the objective of this paper is to investigate the codec’s operation as initial measurements performed by researchers show that the lossless compression performance of the IEEE compressor is better than any traditional encoders, while the encoding speed is slower which can be further optimized.
Five-Level Single Source Voltage Converter Controlled Using Selective Harmonic Elimination Ibrahim Haruna Shanono; Nor Rul Hasma Abdullah; Aisha Muhammad
Indonesian Journal of Electrical Engineering and Computer Science Vol 12, No 3: December 2018
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v12.i3.pp924-932

Abstract

The paper presents a 5-level cascaded H-bridge voltage source inverter. The converter topology composed of two-cascaded H-bridge modules connected in parallel and powered by a single DC source. The benefit of this topology in comparison with the conventional H-Bridge configuration is that it uses single input DC source instead of two to achieve the same output steps/levels. Selective Harmonic Elimination (SHE) is the modulation technique employed. The generated non-linear transcendental equations are solved using an optimised Genetic algorithms to find the switching angles. This property makes the topology and the control function suitable for three phase applications where triplen harmonics are said to cancel out at the line-to-line voltages. This concept of SHE modulation extends the value of the filter cut-off frequency, which translates to smaller sized filter, compact cooling system and reduced system weight. This advantage makes the topology attractive to automotive and renewable energy applications. The topology was simulated using PSIM software.
Severe-Dynamic Tracking Problems Based on Lower Particles Resampling Xungao Zhong; Xiafu Peng; Xunyu Zhong
Indonesian Journal of Electrical Engineering and Computer Science Vol 12, No 6: June 2014
Publisher : Institute of Advanced Engineering and Science

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

Abstract

For a target as it with large-dynamic-change which is still challenging for existing methods to performed robust tracking. The sampling-based Bayesian filtering often suffer from computational complexity associated with large number of particle demanded and weighing multiple hypotheses. Specifically, this work proposes a neural auxiliary Bayesian filtering scheme based on Monte Carlo resampling techniques, which to addresses the computational intensity that is intrinsic to all particle filter, including those have been modified to overcome the degeneracy of particles. Tracking quality for severe-dynamic experiments demonstrate that the neural via compensate the Bayesian filtering error, with high accuracy and intensive tracking performance only require lower particles compare with sequential importance resampling Bayesian filtering, meanwhile, our method also with strong robustness for low number of particles. DOI : http://dx.doi.org/10.11591/telkomnika.v12i6.5493
Automatic Detection and Assessment System of Water Turbidity based on Image Processing CHENG En; ZHANG Rong-Xin; YUAN Fei
Indonesian Journal of Electrical Engineering and Computer Science Vol 11, No 3: March 2013
Publisher : Institute of Advanced Engineering and Science

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

Abstract

The realization of automatic control system of releasing flocculating agent is one of the bottlenecks in the automation process of waterworks. For various reasons, most of waterworks in China decide the dosing amount just by artificial methods, which may lead to great subjectivity. It can result in direct economic losses and threaten residents’ drinking water safety. To solve the problem, based on digital image processing and pattern recognition technology, the paper presents an advanced and practical automation scheme, trying to control the releasing of flocculating agent. According to the characteristics of alum images captured from waterworks, by comparing the effects of many vision algorithms, the paper selects a suitable combination and tries to implement it with EmguCV. On next step, the paper implements feature selection and classification with LibSVM. The experiments show that, the system designed in this paper is reasonable and feasible. DOI: http://dx.doi.org/10.11591/telkomnika.v11i3.2299 
Performance evaluation of space time trellis coded MIMO for mobile communications Gebrehiwet Gebrekrstos Lema; Teklehaymanot Baweke Reda; Dawit Hailu; Tole Sutikno
Indonesian Journal of Electrical Engineering and Computer Science Vol 15, No 3: September 2019
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v15.i3.pp1501-1508

Abstract

The major enemy of wireless communication is multipath fading that highly degrades the received signal. Spatial diversity highly reduces deep fades of the wireless communication. Higher signal to noise ratio (SNR) requirement can be reduced by using space time coding. In this paper, the error performance of un-coded MIMO, different diversity combing methods, space time block codes and space time trellis codes are analyzed using different parameters including number of antennas, M-array modulations, trace criteria, rank and determinant. The simulation results have shown that the Bit Error Rate (BER) significantly reduces with increasing number of receiver antennas. However, the number of antennas that a mobile device can have is limited by its size and this is inconvenient for mobile communication. Hence, this paper suggests space time codes to mitigate multipath problems in mobile communication. So, BER performance of space time block codes scheme was evaluated by varying the number of transmitter and receiver antennas along with varying M-array PSK modulation orders. The results have shown that better BER is possible by integrating space time codes with spatial diversity. Finally, the error performance of space time trellis codes was evaluated by using trace, rank and determinant, and the simulation results depicted that better error performance is achieved using the proposed multipath reduction method.
Rakebot: a robotic rake for mixing paddy in sun drying Ertie Cusipag Abana; Meljiflor Pacion; Roxanne Sordilla; Daniel Montaner; Dennis Agpaoa; Rryma Mae Allam
Indonesian Journal of Electrical Engineering and Computer Science Vol 14, No 3: June 2019
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v14.i3.pp1165-1170

Abstract

Sun drying is a conventional drying method of paddy commonly used in Asia. During the process, grains are mixed and turned continuously using a rake to maintain good quality. For this reason, a robotic rake or Rakebot was developed in this study to properly mix the grains during sun drying. Rakebot is manually controlled using a mobile application through Bluetooth connection but can also move automatically using the previous movements that were recorded on the first used. It was developed using a microcontroller that gives directions to the motors based on the received instructions from the mobile application. The recorded movements are saved in a memory card by means of a memory card module connected to the microcontroller. The objective measures showed that the Rakebot ensures simultaneous reduction of the moisture content of paddy. Also, the rake design of the robot prevents fissuring of grains.
A Comprehensive Study and Analysis of LEACH and HEED Routing Protocols for Wireless Sensor Networks – With Suggestion for Improvements G. Anitha; V. Vijayakumari; S. Thangavelu
Indonesian Journal of Electrical Engineering and Computer Science Vol 9, No 3: March 2018
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v9.i3.pp778-783

Abstract

The main interesting aspect of the digital era is the widely spread ease of communication from one end of the world to the other end of the world. There is a revolution in communication, digitalization, globalization, video calling, wireless data transfer and this is possible due to networking. Initially computer networks is the data sharing where data such as documents, file, reports, presentation files, videos, images etc can be shared within a local network or remotely connected networks. Traditional data networking is to empower end-to-end information transfer. The data in such networks are carried across point-to-point links and the intermediate nodes just forward the packets, where the payload of the packets is not modified. Traditional LANs need wires, which may be difficult to set up in some situations.It is very much understandable and clearly visible that wired communication is being completely overtaken by wireless technologies in the recent past. Wireless LANs, by its very nature, empowers with increased mobility and flexibility. Wi-Fi devices get connected to the internet through WLAN and access points. 2.4 GHz and 5 GHz ISM bands are used by Wi-Fi. Also, it is to be understood that, a wireless adhoc network is distributed in its nature. It is also to be noted that, the adhoc nature makes these network to rely on any of the pre-existing infrastructure. The data forwarding shall happen from the nodes very much dynamically based on the connectivity and the routing algorithm used.  

Page 145 of 920 | Total Record : 9199

 143   144   145   146   147 

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