cover
Article Per Year (5 Year)
All
Home Page
OAI Link
Editorial Team
Contact
Reviewer
Google Scholar
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
Published by Institute of Advanced Engineering and Science
ISSN : 20888708     EISSN : 27222578     DOI : -
Core Subject : Science, Engineering,
Computer Science & IT Electrical & Electronics Engineering
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.
Arjuna Subject : Ilmu Komputer (semua kategori) - Ilmu Komputer (Lain-Lain)
Articles 25 Documents
 1   2   3 
Search results for , issue "Vol 5, No 3: June 2015" : 25 Documents clear
HybridConcatenated Coding Scheme for MIMO Systems Ilesanmi Banjo Oluwafemi
International Journal of Electrical and Computer Engineering (IJECE) Vol 5, No 3: June 2015
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (265.124 KB) | DOI: 10.11591/ijece.v5i3.pp464-476

Abstract

Abstract: Inthis paper, two hybrid concatenated super-orthogonal space-time trellis codes(SOSTTC) applying iterative decoding are proposed for flat fading channels. Theencoding operation is based on the concatenation of convolutional codes,interleaving and super-orthogonal space-time trellis codes. The firstconcatenated scheme consists of a serial concatenation of a parallelconcatenated convolutional code with a SOSTTC while the second consists ofparallel concatenation of two serially concatenated convolutional and SOSTTCcodes. The decoding of these two schemes is described, their pairwise errorprobabilities are derived and the frame error rate (FER) performances areevaluated by computer simulation in Rayleigh fading channels. The proposedtopologies are shown to perform better than existing concatenated schemes with aconstituent code of convolutional andspace-time codes in literature.
Evaluation of Noise Exclusion of Medical Images Using Hybridization of Particle Swarm Optimization and Bivariate Shrinkage Methods Shruti Bhargava; Ajay Somkuwar
International Journal of Electrical and Computer Engineering (IJECE) Vol 5, No 3: June 2015
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (288.66 KB) | DOI: 10.11591/ijece.v5i3.pp421-428

Abstract

Denoising of images got corrupted by addition of noise signals (generated by no single reason) has always a subject of interest for researchers. This paper proposes and classifies the efficiency of an algorithm based on bivariate shrinkage further optimized by Particle Swarm Optimization (PSO).The estimator for undecimatedfilterbank which incorporate the adaptive subbands thresholding further represented with singal threshold based on denosing performs.The paper evaluate performance of medical image denoising by calculation of PSNR, MSE, WPSNR and SSIM. The simulation results based on testing the model at MATLAB 2010A platform shows significant enhancement in mitigation of Gaussian noise, speckle noise, poisson noise and salt & pepper noises from experimental data
Toward Content-Aware Video Partitioning Methods for Distributed HEVC Video Encoding Myunghoon Jeon; Byoung-Dai Lee
International Journal of Electrical and Computer Engineering (IJECE) Vol 5, No 3: June 2015
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (550.562 KB) | DOI: 10.11591/ijece.v5i3.pp569-578

Abstract

Recently, cloud computing has emerged as a potential platform for distributed video encoding due to its advantages in terms of costs as well as performance. For distributed video encoding, the input video must be partitioned into several segments, each of which is processed over distributed resources. This paper describes the effect of different video partitioning schemes on overall encoding performance in the distributed encoding of High-Efficiency Video Coding (HEVC). In addition, we explored performances of video partitioning schemes on the basis of the types of the content to be encoded
Modelling Electronic Characteristic of InP/InGaAs Double Heterojunction Bipolar Transistor Berrichi Yamina; Ghaffour Kherreddine
International Journal of Electrical and Computer Engineering (IJECE) Vol 5, No 3: June 2015
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (163.184 KB) | DOI: 10.11591/ijece.v5i3.pp525-530

Abstract

In this paper, we are interested in studying InP/InGaAs heterojunction bipolar transistor NPN type. First and for most we should describe the structure of our simulation, then, we ploted at room temperature: Energy band diagram, Gummel plot, IC-VC characteristic and conduction bands for different values of VBE.  The simulation of this structure has demonstrated the validity of our model and the method of the simulation.
Improved Rejection Penalty Algorithm with Multiprocessor Rejection Technique Prativa Satpathy; Kalyan Das; Jagamohan Padhi
International Journal of Electrical and Computer Engineering (IJECE) Vol 5, No 3: June 2015
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (264.046 KB) | DOI: 10.11591/ijece.v5i3.pp477-482

Abstract

This paper deals with multiprocessor scheduling with rejection technique where each job is provided with processing time and a given penalty cost. If the job satisfies the acceptance condition, it will schedule in the least loaded identical parallel machine else job is rejected. In this way its penalty cost is calculated. Our objective is to minimize the makespan of the scheduled job and to minimize the sum of the penalties of rejected jobs. We have merged ‘CHOOSE ‘and ‘REJECTION PENALTY’ algorithm to reduce the sum of penalties cost and makespan. Our proposed ‘Improved Reject penalty algorithm’ reduce competitive ratio, which in turn enhances the efficiency of the on-line algorithm. By applying our new on-line technique, we got the lower bound of our algorithm is is 1.286 which is far better from the existing algorithms whose competitive ratio is at 1.819. In our approach we have consider non-preemption scheduling technique.

Page 3 of 3 | Total Record : 25

 1   2   3 

Filter by Year

2015 2015


Reset
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