cover
Article Per Year (5 Year)
All
Home Page
OAI Link
Editorial Team
Contact
Reviewer
Google Scholar
Contact Name
Yuliah Qotimah
Contact Email
yuliah@lppm.itb.ac.id
Phone
+622286010080
Journal Mail Official
jictra@lppm.itb.ac.id
Editorial Address
LPPM - ITB Center for Research and Community Services (CRCS) Building Floor 6th Jl. Ganesha No. 10 Bandung 40132, Indonesia Telp. +62-22-86010080 Fax. +62-22-86010051
Location
Kota bandung,
Jawa barat
INDONESIA
Journal of ICT Research and Applications
Published by Institut Teknologi Bandung
ISSN : 23375787     EISSN : 23385499     DOI : https://doi.org/10.5614/itbj.ict.res.appl.
Core Subject : Science,
Computer Science & IT
Journal of ICT Research and Applications welcomes full research articles in the area of Information and Communication Technology from the following subject areas: Information Theory, Signal Processing, Electronics, Computer Network, Telecommunication, Wireless & Mobile Computing, Internet Technology, Multimedia, Software Engineering, Computer Science, Information System and Knowledge Management.
Arjuna Subject : Ilmu Komputer (semua kategori) - Aplikasi Ilmu Komputer
Articles 302 Documents
 5   6   7   8   9 
Improve the Robustness of Range-Free Localization Methods on Wireless Sensor Networks using Recursive Position Estimation Algorithm Prima Kristalina; Wirawan Wirawan; Gamantyo Hendrantoro
Journal of ICT Research and Applications Vol. 5 No. 3 (2011)
Publisher : LPPM ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/itbj.ict.2011.5.3.4

Abstract

The position of a sensor node at wireless sensor networks determines the received data sensing accuracy. By the knowledge of sensor positioning, the location of target sensed can be estimated. Localization techniques used to find out the position of sensor node by considering the distance of this sensor from the vicinity reference nodes.  Centroid Algorithm is a robust, simple and low cost localization technique without dependence on hardware requirement. We propose Recursive Position Estimation Algorithm to obtain the more accurate node positioning on range-free localization technique. The simulation result shows that this algorithm has the ability on increasing position accuracy up to 50%.  The trade off factor shows the smaller the number of reference nodes the higher the computational time required. The new method on the availability on sensor power controlled is proposed to optimize the estimated position.
Opinion Mining for User Generated Design by Social Networking Service and Japanese Manga Anak Agung Gede Dharma; Hiroyuki Kumamoto; Shogo Kochi; Natsuki Kudo; Wei Guowei; Chiu Shu-Chuan; Kiyoshi Tomimatsu
Journal of ICT Research and Applications Vol. 5 No. 3 (2011)
Publisher : LPPM ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/itbj.ict.2011.5.3.5

Abstract

The growth of Social Networking Service (SNS) has created a new potential in marketing. While users communicate and interact via SNS, the list of their conversation, which is called casual data can be used to determine their needs or aspirations. SNS can be very useful for product/service developers, especially when developing new ideas or simply evaluating the feasibility of their existing products/services. Furthermore, SNS provides a unique system that enables expressive and two-way communication between its users. SNS is known for its effectiveness in delivering fresh news and information, thus it can be used as promotional media. Although several online services that utilize SNS and casual data have been provided, the purpose of those services is still unclear and ineffective. In those services, users were only asked for their opinions without receiving sufficient feedbacks. Therefore, to solve these problems we propose an innovative way of utilizing SNS and casual data in designing user generated design. In our proposed system, users can directly contribute to the product/service development process in an interesting way. We designed an online service, which allows users to posts manga that describes their original idea. While contributing to the product/service development, they can also benefit from expressing their hobbies and receiving feedbacks from other users.
Enhancement of the Adaptive Shape Variants Average Values by Using Eight Movement Directions for Multi-Features Detection of Facial Sketch Arif Muntasa; Mochammad Kautsar Shopan; Mauridhi Hery Purnomo; Kondo Kunio
Journal of ICT Research and Applications Vol. 6 No. 1 (2012)
Publisher : LPPM ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/itbj.ict.2012.6.1.1

Abstract

This paper aims to detect multi features of a facial sketch by using a novel approach. The detection of multi features of facial sketch has been conducted by several researchers, but they mainly considered frontal face sketches as object samples. In fact, the detection of multi features of facial sketch with certain angle is very important to assist police for describing the criminal's face, when criminal's face only appears on certain angle. Integration of the maximum line gradient value enhancement and the level set methods was implemented to detect facial features sketches with tilt angle to 15 degrees. However, these methods tend to move towards non features when there are a lot of graffiti around the shape. To overcome this weakness, the author proposes a novel approach to move the shape by adding a parameter to control the movement based on enhancement of the adaptive shape variants average values with 8 movement directions. The experimental results show that the proposed method can improve the detection accuracy up to 92.74%.
Feasibility of LTE 700 MHz Digital Dividend for Broadband Development Acceleration in Rural Areas Denny Setiawan; Djamhari Sirat; Dadang Gunawan
Journal of ICT Research and Applications Vol. 6 No. 1 (2012)
Publisher : LPPM ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/itbj.ict.2012.6.1.2

Abstract

The need of broadband services to reduce digital divide in rural areas had increased in the recent years. The government of the Republic Indonesia shared similar intention and had set guidance of ICT development in its "economic master plan" and "medium term development plan". This paper addressed feasibility and suitability of its implementation in Indonesia, by conducting assessment of possible solutions. Using mixed method, the study was started with qualitative approach to identify possible options, conducted benchmarking and case study analysis to narrow down the options and finally conducted quantitative calculation for the two remaining options and measure performance of the solutions. The results of analysis concluded that early implementation of LTE in 700 MHz Digital Dividend would be feasible in certain geographical areas to fasten the broadband plan development in Indonesia.
Dynamic Overlapping Clustering for Wireless Sensor Networks Based-on Particle Swarm Optimization Amin Suharjono; Wirawan Wirawan; Gamantyo Hendrantoro
Journal of ICT Research and Applications Vol. 6 No. 1 (2012)
Publisher : LPPM ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/itbj.ict.2012.6.1.3

Abstract

In the recent years, Wireless Sensor Network (WSN) has been one of the most interesting research topics because of its flexibility and many potential applications. However, in the applications, there are still resources constraints, including: energy, computation, and bandwidth. It is believed that clustering is the best solution for the need of energy efficiency and scalability. In order to reach the high level of energy efficiencies, mostly, the clustering algorithms avoid the possibility of overlap between clusters. But in fact, there are several applications that need the occurrence of overlaps between clusters. In this paper, we propose a Particle Swarm Optimization (PSO)-based Clustering algorithm that has capability to control the overlap between clusters but still it has an ability to reach energy efficiency. PSO is chosen because it has a light computation and can quickly reach convergence. This proposed algorithm performance is analytically and experimentally compared with clustering on LEACH. The result of the test shows that this proposed algorithm has a capability to control the rate of overlapping degree linearly. The testing on the PSO for clustering also shows the better performance than on LEACH, although there are a few problems related to its complexity.
Composite Field Multiplier based on Look-Up Table for Elliptic Curve Cryptography Implementation Marisa W. Paryasto; Budi Rahardjo; Fajar Yuliawan; Intan Muchtadi Alamsyah; Kuspriyanto Kuspriyanto
Journal of ICT Research and Applications Vol. 6 No. 1 (2012)
Publisher : LPPM ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/itbj.ict.2012.6.1.4

Abstract

Implementing a secure cryptosystem requires operations involving hundreds of bits. One of the most recommended algorithm is Elliptic Curve Cryptography (ECC). The complexity of elliptic curve algorithms and parameters with hundreds of bits requires specific design and implementation strategy. The design architecture must be customized according to security requirement, available resources and parameter choices. In this work we propose the use of composite field to implement finite field multiplication for ECC implementation. We use 299-bit keylength represented in GF((213)23) instead of in GF(2299). Composite field multiplier can be implemented using different multiplier for ground-field and for extension field. In this paper, LUT is used for multiplication in the ground-field and classic multiplieris used for the extension field multiplication. A generic architecture for the multiplier is presented. Implementation is done with VHDL with the target device Altera DE2. The work in this paper uses the simplest algorithm to confirm the idea that by dividing field into composite, use different multiplier for base and extension field would give better trade-off for time and area. This work will be the beginning of our more advanced further research that implements composite-field using Mastrovito Hybrid, KOA and LUT.
A Motion Estimation Algorithm Using DTCWT and ARPS Unan Y. Oktiawati; Vooi Voon Yap
Journal of ICT Research and Applications Vol. 6 No. 1 (2012)
Publisher : LPPM ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/itbj.ict.2012.6.1.5

Abstract

In this paper, a hybrid motion estimation algorithm utilizing the Dual Tree Complex Wavelet Transform (DTCWT) and the Adaptive Rood Pattern Search (ARPS) block is presented. The proposed algorithm first transforms each video sequence with DTCWT. The frame n of the video sequence is used as a reference input and the frame n+2 is used to find the motion vector. Next, the ARPS block search algorithm is carried out and followed by an inverse DTCWT. The motion compensation is then carried out on each inversed frame n and motion vector. The results show that PSNR can be improved for mobile device without depriving its quality. The proposed algorithm also takes less memory usage compared to the DCT-based algorithm. The main contribution of this work is a hybrid wavelet-based motion estimation algorithm for mobile devices. Other contribution is the visual quality scoring system as used in section 6.
An Alternative Design Topology for Metropolitan Area Networks Antonius Suhartomo
Journal of ICT Research and Applications Vol. 6 No. 2 (2012)
Publisher : LPPM ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/itbj.ict.2012.6.2.1

Abstract

One of the key issues in designing a network topology is vulnerability. The vulnerability parameter measures the resistance of a network to disruption of operation  after  the  failure  of  certain  stations  or  communication  links.  One counter-measure  to address  the vulnerability of a network is edge connectivity.In this paper, a  more selective concept of edge  connectivity is introduced, called component  order  edge  connectivity  for  MAN  topology  design.  This  parameter equals the smallest number of edges that must be removed in order to ensure that the  order  of  each  component  of  the  resulting  sub -network  or  sub-graph  is  less than k. 
A Low-Complexity and High-Throughput RTL Design of a BCH (15,7) Decoder Hendra Setiawan
Journal of ICT Research and Applications Vol. 6 No. 2 (2012)
Publisher : LPPM ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/itbj.ict.2012.6.2.2

Abstract

The  Bose,  Chaudhuri  and  Hocquenghem  (BCH)  codes  form  a  large class  of  powerful  random-error  correcting  cyclic  codes.  However,  the implementation  of  its  decoder  requires  high-complexity  computation  resources with a huge number of sequential circuits. This paper presents a  low-complexity register transfer level (RTL) circuit design of a BCH decoder. In accordance with the  table  relationship  between  the  syndrome  and  the  error  bit  position,  we propose  a  circuit that  is  mostly occupied by combinational elements without any sequential evolvement. Therefore the designed  system has a  low complexity and high  throughput  properties.  The  implementation  of  the  BCH  (15,7)decoder  on Virtex  5  FX70TFF1136  requires  77  look-up  tables  (LUTs)  with  the  maximum throughput reaching 1.7 Gbps.
A New RTL Design Approach for a DCT/IDCT-Based Image Compression Architecture using the mCBE Algorithm Rachmad Vidya Wicaksana Putra; Rella Mareta; Nurfitri Anbarsanti; Trio Adiono
Journal of ICT Research and Applications Vol. 6 No. 2 (2012)
Publisher : LPPM ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/itbj.ict.2012.6.2.3

Abstract

In  the  literature, several approaches  of  designing  a  DCT/IDCT-based image compression system have been proposed.  In this paper,  we present a new RTL design approach with as main  focus developing a  DCT/IDCT-based image compression  architecture  using  a  self-created  algorithm.  This  algorithm  can efficiently  minimize  the  amount  of  shifter -adders  to  substitute  multiplier s.  We call  this  new  algorithm  the  multiplication  from  Common  Binary  Expression (mCBE)  Algorithm. Besides this algorithm, we propose alternative quantization numbers,  which  can  be  implemented  simply  as  shifters  in  digital  hardware. Mostly, these numbers can retain a good compressed-image quality  compared to JPEG  recommendations.  These  ideas  lead  to  our  design  being  small  in  circuit area,  multiplierless,  and  low  in  complexity.  The  proposed  8-point  1D-DCT design  has  only  six  stages,  while  the  8-point  1D-IDCT  design  has  only  seven stages  (one  stage  being  defined as  equal  to  the  delay  of  one  shifter  or  2-input adder). By using the pipelining method, we can achieve a high-speed architecture with latency as    a  trade-off consideration. The  design has been synthesized and can reach a speed of up to 1.41ns critical path delay (709.22MHz). 

Page 7 of 31 | Total Record : 302

 5   6   7   8   9 

Filter by Year

2007 2025


Reset
Filter By Issues
All Issue Vol. 19 No. 2 (2025) Vol. 19 No. 1 (2025) Vol. 18 No. 2 (2024): (In Progress) Vol. 18 No. 1 (2024) Vol. 17 No. 3 (2023) Vol. 17 No. 2 (2023) Vol. 17 No. 1 (2023) Vol. 16 No. 3 (2022) Vol. 16 No. 2 (2022) Vol. 16 No. 1 (2022) Vol. 15 No. 3 (2021) Vol. 15 No. 2 (2021) Vol. 15 No. 1 (2021) Vol. 14 No. 3 (2021) Vol. 14 No. 2 (2020) Vol. 14 No. 1 (2020) Vol. 13 No. 3 (2019) Vol. 13 No. 2 (2019) Vol. 13 No. 1 (2019) Vol. 12 No. 3 (2018) Vol. 12 No. 2 (2018) Vol. 12 No. 1 (2018) Vol. 11 No. 3 (2017) Vol. 11 No. 2 (2017) Vol. 11 No. 1 (2017) Vol. 10 No. 3 (2016) Vol. 10 No. 2 (2016) Vol. 10 No. 1 (2016) Vol. 9 No. 3 (2015) Vol. 9 No. 2 (2015) Vol. 9 No. 1 (2015) Vol. 8 No. 3 (2015) Vol. 8 No. 2 (2014) Vol. 8 No. 1 (2014) Vol. 7 No. 3 (2013) Vol. 7 No. 2 (2013) Vol. 7 No. 1 (2013) Vol. 6 No. 3 (2012) Vol. 6 No. 2 (2012) Vol. 6 No. 1 (2012) Vol. 5 No. 3 (2011) Vol. 5 No. 2 (2011) Vol. 5 No. 1 (2011) Vol. 4 No. 2 (2010) Vol. 4 No. 1 (2010) Vol. 3 No. 2 (2009) Vol. 3 No. 1 (2009) Vol. 2 No. 2 (2008) Vol. 2 No. 1 (2008) Vol. 1 No. 2 (2007) Vol. 1 No. 1 (2007) More Issue