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
 88   89   90   91   92 
Comparison of two new methods for implementa BPSK modulator using FPGA Hebibi Amar; Arres Bartil; Lahcene Ziet
Indonesian Journal of Electrical Engineering and Computer Science Vol 19, No 2: August 2020
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v19.i2.pp819-827

Abstract

The design of electronic systems has become mainly dependent on FPGAs applications. This is due to the softness effectiveness progress by reconfigurable computing and reduced time to develop solutions for digital signal processing. In this article, we present the theoretical backgrounds of a BPSK modulation and hardware designs of the BPSK system, a firstly with the help of Matlab/Simulink reliant on the System Generator and a second with Xilinx ISE VERILOG Hardware Description Language. In order to show the differences between them, in terms of efficiency, duration of development and how many resources are used in FPGA. For the projected system, we have a tendency to aimed toward employing a moderately sized, low-value FPGA to implement the system. The Atlys development board by Digilent to configure develops, and run the system, based on a Xilinx Spartan-6 LX45 FPGA.
An Improved Evolutionary Algorithm with New Genetic Operation for Optimization Problem Wang Jiekai; Hu Ruikai; Wang Chao
Indonesian Journal of Electrical Engineering and Computer Science Vol 12, No 4: April 2014
Publisher : Institute of Advanced Engineering and Science

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

Abstract

An improved evolutionary algorithm (SCAGA) is proposed in this paper for solving optimization problem. In order to control genetic operations in an effective range, the new algorithm regulate both of the crossover probability and mutation probability with the iteration process. In addition, SCAGA presents a new crossover strategy that restricts the cross of the chromosomes to some extent to protect good genes schema. We also perform the schema theorem on the algorithm process to analyze the working mechanism of SCAGA, and we conclude that the new algorithm is effective. According to experiment results for some test functions and TSP problems, SCAGA have a high performance in both constrained an unconstrained optimization problems. DOI : http://dx.doi.org/10.11591/telkomnika.v12i4.4785 
IoT recycle management system to support green city initiatives Ruwaida Ramly; Aznida Abu Bakar Sajak; Muhaira Rashid
Indonesian Journal of Electrical Engineering and Computer Science Vol 15, No 2: August 2019
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v15.i2.pp1037-1045

Abstract

In July 2009, Government of Malaysia had launched Green Technology Policy as new initiatives from Malaysia to handle greenhouse effect issue and energy usage through application and green technologies development to reduce carbon footprint. This project, Internet of Things (IoT) Recycle Management System is an idea to help the government in gearing the nation towards this aim with a developed system or technology that support green environment. For this paper, the intended cities are Putrajaya and Cyberjaya areas since both of these cities are chosen as a pioneer for the Green City Initiatives by the Government. This Arduino based Internet of Things (IoT) project is an upcoming urban technology that transforms everyday current recycling system into an ecosystem that would enrich our lives and make it exciting to recycle things anywhere. Hence, encourages Malaysian to recycle their things regularly and make it as a normal routine. This project consists of the development of recycle waste bin that have sensor-based and a database with webpage system for client interface which be connected via Internet network. This project has a huge prospect to be implemented in the future, should there be a collaboration with Government entities and Non- Government entities as this effort needs huge support from all Malaysians in order to realize first class mentality transformation.
3D Objects Retrieval using Geodesic Distance Based on Eikonal equation Driss Naji; M. Fakir; O. Bencharef
Indonesian Journal of Electrical Engineering and Computer Science Vol 15, No 3: September 2015
Publisher : Institute of Advanced Engineering and Science

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

Abstract

Recently, shape-based matching and retrieval of 3D polygonal models has become one of the most fundamental problems in computer vision. Dealing with families of objects instead of a single one may impose further challenges on regular geometric algorithms. In this paper we focus on the classification of 3D objects based on their geodesic distance & path calculated on a mesh using an iterative algorithm for solving the Eikonal equation. For the classification process, we use both Multiclass Support Vector Machine (M-SVM) classifier,K-Nearest Neighbors (KNN), Decision Tree (DT) and Artificial Neural Networks (ANN) to better evaluate our descriptors. We illustrate the potential of extracted characteristics by two 3D benchmarks. The recognition rates achieved in all experiments show that a small number of curve between 9 and 12 can correctly categorize a family of 3D objects.
Cooperation Mechanism of Wide-area Protection System Based on Multi-Agents Mingzhu Zhang; Zhenxing Li
Indonesian Journal of Electrical Engineering and Computer Science Vol 11, No 1: January 2013
Publisher : Institute of Advanced Engineering and Science

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

Abstract

With the rapid growth of power system, it is becoming increasingly difficult to realize reach and time coordination for conventional backup protection. To cope with those problems, wide-area protection is widely researched. In this paper, a novel dynamic cooperation mechanism of wide-area protection is proposed, which can operate better than distributed and centralized systems with respect to reliability, section selectivity, and so on. The multi-agents technology is used to enhance adaptability and decrease communication traffic of wide-area protection system. The improvement of backup protection performance to overcome some specific conditions, such as communication bit error, protection failure, and breaker failure, is also illustrated by utilizing communication networks and distributed protection agents which enables an easy and flexible construction and operation of the proposed wide-area protection system. The example analysis on IEEE 5 nodes system shows the concrete cooperation processing among agents in the cases of typical faults. DOI: http://dx.doi.org/10.11591/telkomnika.v11i1.1888
Route Optimization of Stacker in Automatic Warehouse Based on Genetic Algorithm Cui Changqing; Wang Yiqiang
Indonesian Journal of Electrical Engineering and Computer Science Vol 11, No 11: November 2013
Publisher : Institute of Advanced Engineering and Science

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

Abstract

Today, automatic warehouse system gradually replaced manual labor, and played an important role in the production work, especially in the cargo handling work. It was important to research the time-consuming and efficiency of stacker in the automated warehouse system. This paper researched the path of stacker in automated warehouse and calculated the operation time of stacker working path according to actual working condition, and then put forward a route optimization method of stacker based on genetic algorithm, finally simulated this algorithm by using MATLAB. The simulation results showed that this algorithm could shorten the way of stacker, and increase the working efficiency of the warehouse. DOI: http://dx.doi.org/10.11591/telkomnika.v11i11.2959
A comparison between the secp256r1 and the koblitz secp256k1 bitcoin curves Azine Houria; Bencherif Mohamed Abdelkader; Guessoum Abderezzak
Indonesian Journal of Electrical Engineering and Computer Science Vol 13, No 3: March 2019
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v13.i3.pp910-918

Abstract

Bitcoin uses elliptic curve cryptography for its keys and signatures, but the specific secp256k1 curve used is rather unusual. The ECDSA keys used to generate Bitcoin addresses and sign transactions are derived from some specific parameters. Due to this characteristic, several questions come up concerning Satoshi’s choice of this curve rather than that of the NIST standard secp256r1 curve. Former President Dan Brown’s address to Bitcoin users on the Bitcoin talk.org online forum concerning the use of secp256k1 in Bitcoin of SECG showed his surprise to see someone uses SECG secp256k1 instead of secp256r1 of NIST.In this article, we will analyze the random secp256r1 curve and the Koblitz Secp256k1 curve (parameters, equation, automorphism…), by giving the strengths and weaknesses of each one of them, in order to justify the choice of Bitcoin’s creator, and then we will tackle the mining using the new graphic cards.
Design of Android Based Smart Car D. Wilfred Shiju
Indonesian Journal of Electrical Engineering and Computer Science Vol 8, No 3: December 2017
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v8.i3.pp648-650

Abstract

Android smart car is designed with safety in mind. A simple and sensitiveline, included steering wheels and new voice events, this is designed to reduceinterruption so you can stay focused on the highway.This car which can be controlling using an Android APP for smart phones.A car is regularly an electronic mechanic machine that is guide by computer and electronic controlling programming. The innovation of the Smart Car technology to developing based on remote connection using android application can control the car movements. This system use Bluetooth device controller to control the mobile App. This Bluetooth device interface with UART communication. The UART receive the command via the Bluetooth device.   This design is may helps to our rural citifies. This system is developing to help to self driving vehicles.
BCH codes for 5G wireless communication systems over multipath fading channel Ghasan Ali Hussain; Lukman Audah
Indonesian Journal of Electrical Engineering and Computer Science Vol 17, No 1: January 2020
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v17.i1.pp310-316

Abstract

Due to its large peak to average power ratio (PAPR) and high out of band emission (OOBE), OFDM doesn't meet the requirements of 5G services. Additionally, it supports only one type of waveform parameters in entire bandwidth. In contrast, f-OFDM is dividing the system's bandwidth into a number of subbands to support several waveform parameters based on various service scenarios. So, Filtered-OFDM (f-OFDM) is considered as a modern enabler of the flexible waveform to overcome the OFDM drawbacks while remaining its advantages as well as, to encounter the new challenges that faced 5G. Nonetheless, there is a trade-off among OOBE, PAPR and SNR performance. Meanwhile, channel coding technology is one of the most important issue in physical layer which is playing an essential role in order to achieve the reliability and latency. So, BCH code has been suggested in this paper for f-OFDM system to achieve the reliability of transmission information and thus improving BER performance over multipath fading channel. Whilst, BCH-LTE system is introduced as a baseline in this paper that using for comparison purpose with proposed system. Simulation results showed that the proposed BCH-f-OFDM system was significantly better than BCH-LTE system in terms of decreasing OOBE and achieving improving in BER performance. Although, PAPR levels was stilling high in proposed system due to the trade-off among OOBE, PAPR and SNR performance. However, the proposed system is considered a promising candidate to meet the requirements of 5G services because of its ability to solve two important issues in between three trade-offs'.
SVC Placement for Voltage Profile Enhancement Using Self-Adaptive Firefly Algorithm Selvarasu Ranganathan; Surya Kalavathi. M
Indonesian Journal of Electrical Engineering and Computer Science Vol 12, No 8: August 2014
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v12.i8.pp5976-5984

Abstract

Static VAR Compensator (SVC) is one of the shunt type FACTS devices for providing reactive power support in power systems network and its placement representing the location and size has significant influence on enhancement of voltage profile. This paper presents a firefly algorithm based optimization strategy for placement of SVC in power systems with a view of minimizing voltage deviation at the load buses to enhance the load bus voltages. This method uses a self-adaptive scheme for tuning the firefly parameters. The proposed strategy is tested on three IEEE test systems. The obtained results are promising and show the effectiveness of the proposed approach.

Page 90 of 920 | Total Record : 9199

 88   89   90   91   92 

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