cover
Contact Name
Tole Sutikno
Contact Email
ijece@iaesjournal.com
Phone
-
Journal Mail Official
ijece@iaesjournal.com
Editorial Address
-
Location
Kota yogyakarta,
Daerah istimewa yogyakarta
INDONESIA
International Journal of Electrical and Computer Engineering
ISSN : 20888708     EISSN : 27222578     DOI : -
International Journal of Electrical and Computer Engineering (IJECE, ISSN: 2088-8708, a SCOPUS indexed Journal, SNIP: 1.001; SJR: 0.296; CiteScore: 0.99; SJR & CiteScore Q2 on both of the Electrical & Electronics Engineering, and Computer Science) is the official publication of the Institute of Advanced Engineering and Science (IAES). The journal is open to submission from scholars and experts in the wide areas of electrical, electronics, instrumentation, control, telecommunication and computer engineering from the global world.
Articles 98 Documents
Search results for , issue "Vol 11, No 6: December 2021" : 98 Documents clear
Speech signal compression and encryption based on sudoku, fuzzy C-means and threefish cipher Iman Qays Abduljaleel; Amal Hameed Khaleel
International Journal of Electrical and Computer Engineering (IJECE) Vol 11, No 6: December 2021
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v11i6.pp5049-5059

Abstract

Compression and encryption of speech signals are essential multimedia technologies. In the field of speech, these technologies are needed to meet the security and confidentiality of information requirements for transferring huge speech signals via a network, and for decreasing storage space for rapid retrieval. In this paper, we propose an algorithm that includes hybrid transformation in order to analyses the speech signal frequencies. The speech signal is then compressed, after removing low and less intense frequencies, to produce a well compressed speech signal and ensure the quality of the speech. The resulting compressed speech is then used as an input in a scrambling algorithm that was proposed on two levels. One of these is an external scramble that works on mixing up the segments of speech that were divided using Fuzzy C-Means and changing their locations. The internal scramble scatters the values of each block internally based on the pattern of a Sudoku puzzle and quadratic map so that the resulting speech is an input to a proposed encryption algorithm using the threefish algorithm. The proposed algorithm proved to be highly efficient in the compression and encryption of the speech signal based on approved statistical measures.
An overview of information extraction techniques for legal document analysis and processing Ashwini V. Zadgaonkar; Avinash J. Agrawal
International Journal of Electrical and Computer Engineering (IJECE) Vol 11, No 6: December 2021
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v11i6.pp5450-5457

Abstract

In an Indian law system, different courts publish their legal proceedings every month for future reference of legal experts and common people. Extensive manual labor and time are required to analyze and process the information stored in these lengthy complex legal documents. Automatic legal document processing is the solution to overcome drawbacks of manual processing and will be very helpful to the common man for a better understanding of a legal domain. In this paper, we are exploring the recent advances in the field of legal text processing and provide a comparative analysis of approaches used for it. In this work, we have divided the approaches into three classes NLP based, deep learning-based and, KBP based approaches. We have put special emphasis on the KBP approach as we strongly believe that this approach can handle the complexities of the legal domain well. We finally discuss some of the possible future research directions for legal document analysis and processing.
An adaptive multi-hop routing with IoT abstraction for minimizing delay-node capacity trade-offs in mobile ad-hoc network Haitham Shiaibth Chasib; Saddam Raheem Salih; Israa Jaber Khalaf Al-Ogaili
International Journal of Electrical and Computer Engineering (IJECE) Vol 11, No 6: December 2021
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v11i6.pp5315-5326

Abstract

Delay and node capacity are incompatible mobile ad hoc constraints because of the network's versatility and self-disciplined design. It is a challenging problem to maximize the trade-off between the above mobility correlation factors. This manuscript proposes an adaptive multi-hop routing (A.M.R.) for mobile ad-hoc network (MANET) to minimize the trade-off by integrating the internet of things (IoT). IoT nodes' smart computing and offloading abilities are extended to ad-hoc nodes to improve routing and transmission. Dor MANET nodes in route exploration, neighbor selection, and data transmission, the beneficial features of IoT include enhanced decision making. The traditional routing protocols use IoT at the time of the neighbor discovery process in updating the routing table and localization. The harmonizing technologies with their extended support improve the performance of MANETs has been estimated. The proposed method achieves better throughput (14.16 Mbps), delay (0.118), packet drop (126), and overhead (36 packets) when compared to existing methods.
An improvement and a fast DSP implementation of the bit flipping algorithms for low density parity check decoder Mouhcine Razi; Mhammed Benhayoun; Anass Mansouri; Ali Ahaitouf
International Journal of Electrical and Computer Engineering (IJECE) Vol 11, No 6: December 2021
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v11i6.pp4774-4784

Abstract

For low density parity check (LDPC) decoding, hard-decision algorithms are sometimes more suitable than the soft-decision ones. Particularly in the high throughput and high speed applications. However, there exists a considerable gap in performances between these two classes of algorithms in favor of soft-decision algorithms.  In order to reduce this gap, in this work we introduce two new improved versions of the hard-decision algorithms, the adaptative gradient descent bit-flipping (AGDBF) and adaptative reliability ratio weighted GDBF (ARRWGDBF).  An adaptative weighting and correction factor is introduced in each case to improve the performances of the two algorithms allowing an important gain of bit error rate. As a second contribution of this work a real time implementation of the proposed solutions on a digital signal processors (DSP) is performed in order to optimize and improve the performance of these new approchs. The results of numerical simulations and DSP implementation reveal a faster convergence with a low processing time and a reduction in consumed memory resources when compared to soft-decision algorithms. For the irregular LDPC code, our approachs achieves gains of 0.25 and 0.15 dB respectively for the AGDBF and ARRWGDBF algorithms.
Using CaCO3-doped package to improve correlated color temperature uniformity of white light-emitting diodes My Hanh Nguyen Thi; Nguyen Thi Phuong Loan; Thuc Minh Bui; Hoang Van Ngoc
International Journal of Electrical and Computer Engineering (IJECE) Vol 11, No 6: December 2021
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v11i6.pp4817-4824

Abstract

The white light-emitting diode (WLED) has been the most advance lighting method currently, however, the fabrication process of this configuration still has drawbacks which negatively affect its color quality. This research was conducted to provide a method for WLED’s lighting output enhancement. Since CaCO3 particles are excellent for thermal stability enhancement, especially when being combined with an adhesive substance, we decided to integrate CO3 particles into resin matrix such as melamine formaldehyde (MF) and investigate their influences on the optical properties, including color uniformity and lumen output, of the WLED. The results showed that CaCO3 and MF resin are beneficial to the light scattering efficiency, which results in higher luminous flux and chromatic quality for WLED packages. In addition to that, the appropriate amounts of MF resin and CaCO3 for reaching the best lumen efficiency and color quality are figured out at 1% and 10%, respectively. Moreover, another advantage of using MF resin and CaCO3 for fabricating WLEDs is cost effectiveness. Hence, it has turned out that CaCO3 and MF resins can be potential materials for next high-quality WLED generations.
Design methodology of smart photovoltaic plant Boutlilis Fatima; Chouitek Mama; Bekkouche Benaissa
International Journal of Electrical and Computer Engineering (IJECE) Vol 11, No 6: December 2021
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v11i6.pp4718-4730

Abstract

In this article, we present a new methodology to design an intelligent photovoltaic power plant connected to an electrical grid with storage to supply the laying hen rearing centers. This study requires a very competent design methodology in order to optimize the production and consumption of electrical energy. Our contribution consists in proposing a robust dimensioning synthesis elaborated according to a data flow chart. To achieve this objective, the photovoltaic system was first designed using a deterministic method, then the software "Homer" was used to check the feasibility of the design. Then, controllers (fuzzy logic) were used to optimize the energy produced and consumed. The power produced by the photovoltaic generator (GPV) is optimized by two fuzzy controllers: one to extract the maximum energy and another to control the batteries. The energy consumed by the load is optimized by a fuzzy controller that regulates the internal climate of the livestock buildings. The proposed control strategies are developed and implemented using MATLAB/Simulink.
An efficient encode-decode deep learning network for lane markings instant segmentation A. Al Mamun; P. P. Em; J. Hossen
International Journal of Electrical and Computer Engineering (IJECE) Vol 11, No 6: December 2021
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v11i6.pp4982-4990

Abstract

Nowadays, advanced driver assistance systems (ADAS) has been incorporated with a distinct type of progressive and essential features. One of the most preliminary and significant features of the ADAS is lane marking detection, which permits the vehicle to keep in a particular road lane itself. It has been detected by utilizing high-specialized, handcrafted features and distinct post-processing approaches lead to less accurate, less efficient, and high computational framework under different environmental conditions. Hence, this research proposed a simple encode-decode deep learning approach under distinguishing environmental effects like different daytime, multiple lanes, different traffic condition, good and medium weather conditions for detecting the lane markings more accurately and efficiently. The proposed model is emphasized on the simple encode-decode Seg-Net framework incorporated with VGG16 architecture that has been trained by using the inequity and cross-entropy losses to obtain more accurate instant segmentation result of lane markings. The framework has been trained and tested on a vast public dataset named Tusimple, which includes around 3.6K training and 2.7 k testing image frames of different environmental conditions. The model has noted the highest accuracy, 96.61%, F1 score 96.34%, precision 98.91%, and recall 93.89%. Also, it has also obtained the lowest 3.125% false positive and 1.259% false-negative value, which transcended some of the previous researches. It is expected to assist significantly in the field of lane markings detection applying deep neural networks.
Hybrid deep learning model using recurrent neural network and gated recurrent unit for heart disease prediction Surenthiran Krishnan; Pritheega Magalingam; Roslina Ibrahim
International Journal of Electrical and Computer Engineering (IJECE) Vol 11, No 6: December 2021
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v11i6.pp5467-5476

Abstract

This paper proposes a new hybrid deep learning model for heart disease prediction using recurrent neural network (RNN) with the combination of multiple gated recurrent units (GRU), long short-term memory (LSTM) and Adam optimizer. This proposed model resulted in an outstanding accuracy of 98.6876% which is the highest in the existing model of RNN. The model was developed in Python 3.7 by integrating RNN in multiple GRU that operates in Keras and Tensorflow as the backend for deep learning process, supported by various Python libraries. The recent existing models using RNN have reached an accuracy of 98.23% and deep neural network (DNN) has reached 98.5%. The common drawbacks of the existing models are low accuracy due to the complex build-up of the neural network, high number of neurons with redundancy in the neural network model and imbalance datasets of Cleveland. Experiments were conducted with various customized model, where results showed that the proposed model using RNN and multiple GRU with synthetic minority oversampling technique (SMOTe) has reached the best performance level. This is the highest accuracy result for RNN using Cleveland datasets and much promising for making an early heart disease prediction for the patients.

Page 10 of 10 | Total Record : 98


Filter by Year

2021 2021


Filter By Issues
All Issue Vol 16, No 1: February 2026 Vol 15, No 6: December 2025 Vol 15, No 5: October 2025 Vol 15, No 4: August 2025 Vol 15, No 3: June 2025 Vol 15, No 2: April 2025 Vol 15, No 1: February 2025 Vol 14, No 6: December 2024 Vol 14, No 5: October 2024 Vol 14, No 4: August 2024 Vol 14, No 3: June 2024 Vol 14, No 2: April 2024 Vol 14, No 1: February 2024 Vol 13, No 6: December 2023 Vol 13, No 5: October 2023 Vol 13, No 4: August 2023 Vol 13, No 3: June 2023 Vol 13, No 2: April 2023 Vol 13, No 1: February 2023 Vol 12, No 6: December 2022 Vol 12, No 5: October 2022 Vol 12, No 4: August 2022 Vol 12, No 3: June 2022 Vol 12, No 2: April 2022 Vol 12, No 1: February 2022 Vol 11, No 6: December 2021 Vol 11, No 5: October 2021 Vol 11, No 4: August 2021 Vol 11, No 3: June 2021 Vol 11, No 2: April 2021 Vol 11, No 1: February 2021 Vol 10, No 6: December 2020 Vol 10, No 5: October 2020 Vol 10, No 4: August 2020 Vol 10, No 3: June 2020 Vol 10, No 2: April 2020 Vol 10, No 1: February 2020 Vol 9, No 6: December 2019 Vol 9, No 5: October 2019 Vol 9, No 4: August 2019 Vol 9, No 3: June 2019 Vol 9, No 2: April 2019 Vol 9, No 1: February 2019 Vol 8, No 6: December 2018 Vol 8, No 5: October 2018 Vol 8, No 4: August 2018 Vol 8, No 3: June 2018 Vol 8, No 2: April 2018 Vol 8, No 1: February 2018 Vol 7, No 6: December 2017 Vol 7, No 5: October 2017 Vol 7, No 4: August 2017 Vol 7, No 3: June 2017 Vol 7, No 2: April 2017 Vol 7, No 1: February 2017 Vol 6, No 6: December 2016 Vol 6, No 5: October 2016 Vol 6, No 4: August 2016 Vol 6, No 3: June 2016 Vol 6, No 2: April 2016 Vol 6, No 1: February 2016 Vol 5, No 6: December 2015 Vol 5, No 5: October 2015 Vol 5, No 4: August 2015 Vol 5, No 3: June 2015 Vol 5, No 2: April 2015 Vol 5, No 1: February 2015 Vol 4, No 6: December 2014 Vol 4, No 5: October 2014 Vol 4, No 4: August 2014 Vol 4, No 3: June 2014 Vol 4, No 2: April 2014 Vol 4, No 1: February 2014 Vol 3, No 6: December 2013 Vol 3, No 5: October 2013 Vol 3, No 4: August 2013 Vol 3, No 3: June 2013 Vol 3, No 2: April 2013 Vol 3, No 1: February 2013 Vol 2, No 6: December 2012 Vol 2, No 5: October 2012 Vol 2, No 4: August 2012 Vol 2, No 3: June 2012 Vol 2, No 2: April 2012 Vol 2, No 1: February 2012 Vol 1, No 2: December 2011 Vol 1, No 1: September 2011 More Issue