cover
Article Per Year (5 Year)
All
Home Page
OAI Link
Editorial Team
Contact
Reviewer
Google Scholar
Contact Name
Nizirwan Anwar
Contact Email
nizirwan.anwar@esaunggul.ac.id
Phone
-
Journal Mail Official
telkomnika@ee.uad.ac.id
Editorial Address
Ahmad Yani st. (Southern Ring Road), Tamanan, Banguntapan, Bantul, Yogyakarta 55191, Indonesia
Location
Kota yogyakarta,
Daerah istimewa yogyakarta
INDONESIA
TELKOMNIKA (Telecommunication Computing Electronics and Control)
Published by Universitas Ahmad Dahlan
ISSN : 16936930     EISSN : 23029293     DOI : 10.12928
Core Subject : Science,
Computer Science & IT
Submitted papers are evaluated by anonymous referees by single blind peer review for contribution, originality, relevance, and presentation. The Editor shall inform you of the results of the review as soon as possible, hopefully in 10 weeks. Please notice that because of the great number of submissions that TELKOMNIKA has received during the last few months the duration of the review process can be up to 14 weeks. Communication Engineering, Computer Network and System Engineering, Computer Science and Information System, Machine Learning, AI and Soft Computing, Signal, Image and Video Processing, Electronics Engineering, Electrical Power Engineering, Power Electronics and Drives, Instrumentation and Control Engineering, Internet of Things (IoT)
Arjuna Subject : Ilmu Komputer (semua kategori) - Aplikasi Ilmu Komputer
Articles 42 Documents
 1   2   3   4   5 
Search results for , issue "Vol 13, No 2: June 2015" : 42 Documents clear
Unambiguous Sine-phased BOC(kn,n) Signal Acquisition Based on Combined Correlation Functions Deng Zhongliang; Xi Yue; Yin Lu
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 13, No 2: June 2015
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12928/telkomnika.v13i2.1469

Abstract

Galileo and GPS have been developing their new signals in recent years. Multiplexed Binary Offset Carrier (MBOC) is the final implementation of Galileo E1 and GPS L1C, which is the multiplexing of BOC(1,1) and BOC(6,1). Therefore, it is helpful to satisfy the demand that the new signals must be compatible with GPS BPSK signal. BOC(kn,n) modulation will provide better track performance and higher positioning accuracy. However, the main drawback of the BOC modulated signal is that its autocorrelation has multiple side peaks around the main peak. This paper will focus on a family of signals: sine-phased BOC(kn,n). We are trying to explore a new method to cancel the side peaks of BOC(kn,n) autocorrelation, making use of two kinds of correlation functions. One is the correlation of the incoming signal and the sine-phased BOC(kn,n) modulated spreading code(PRN code multiplied by subcarrier), and the other is the correlation of the incoming signal and the PRN code only. Two kinds of correlation function are separated into several sub-correlations. Sub-correlations have less side peaks which are in different code delays. Corresponding parts of two sub-correlations will be combined to cancel the side peaks separately, and finally the new function without side peaks will be acquired after several correlations added together. Simulation results will be given. It is shown that the proposed method is contributed to the side peaks cancellation for unambiguous sine-phased BOC (kn, n) signal acquisition.
The Implementation of One Opportunistic Routing in Wireless Networks Han Li; Huan-yan Qian
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 13, No 2: June 2015
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12928/telkomnika.v13i2.132

Abstract

In the paper, it proposes an optimization framework addressing fairness issues for opportunity routing in wireless mesh networks, where we use network coding to ease the routing problem. We propose a distributed heuristic algorithm in the case when scheduling is determined by MAC, and discuss the suitability of our algorithm through simulations. It is found that in most situations our algorithm has better performances than the single-path algorithm and the classical network coding which is based opportunity algorithm MORE.

Page 5 of 5 | Total Record : 42

 1   2   3   4   5 

Filter by Year

2015 2015


Reset
Filter By Issues
All Issue Vol 20, No 3: June 2022 Vol 20, No 2: April 2022 Vol 20, No 1: February 2022 Vol 19, No 6: December 2021 Vol 19, No 5: October 2021 Vol 19, No 4: August 2021 Vol 19, No 3: June 2021 Vol 19, No 2: April 2021 Vol 19, No 1: February 2021 Vol 18, No 6: December 2020 Vol 18, No 5: October 2020 Vol 18, No 4: August 2020 Vol 18, No 3: June 2020 Vol 18, No 2: April 2020 Vol 18, No 1: February 2020 Vol 17, No 6: December 2019 Vol 17, No 5: October 2019 Vol 17, No 4: August 2019 Vol 17, No 3: June 2019 Vol 17, No 2: April 2019 Vol 17, No 1: February 2019 Vol 16, No 6: December 2018 Vol 16, No 5: October 2018 Vol 16, No 4: August 2018 Vol 16, No 3: June 2018 Vol 16, No 2: April 2018 Vol 16, No 1: February 2018 Vol 15, No 4: December 2017 Vol 15, No 3: September 2017 Vol 15, No 2: June 2017 Vol 15, No 1: March 2017 Vol 14, No 4: December 2016 Vol 14, No 3: September 2016 Vol 14, No 2: June 2016 Vol 14, No 1: March 2016 Vol 13, No 4: December 2015 Vol 13, No 3: September 2015 Vol 13, No 2: June 2015 Vol 13, No 1: March 2015 Vol 12, No 4: December 2014 Vol 12, No 3: September 2014 Vol 12, No 2: June 2014 Vol 12, No 1: March 2014 Vol 11, No 4: December 2013 Vol 11, No 3: September 2013 Vol 11, No 2: June 2013 Vol 11, No 1: March 2013 Vol 10, No 4: December 2012 Vol 10, No 3: September 2012 Vol 10, No 2: June 2012 Vol 10, No 1: March 2012 Vol 9, No 3: December 2011 Vol 9, No 2: August 2011 Vol 9, No 1: April 2011 Vol 8, No 3: December 2010 Vol 8, No 2: August 2010 Vol 8, No 1: April 2010 Vol 7, No 3: December 2009 Vol 7, No 2: August 2009 Vol 7, No 1: April 2009 Vol 6, No 3: December 2008 Vol 6, No 2: August 2008 Vol 6, No 1: April 2008 Vol 5, No 3: December 2007 Vol 5, No 2: August 2007 Vol 5, No 1: April 2007 Vol 4, No 3: December 2006 Vol 4, No 2: August 2006 Vol 4, No 1: April 2006 Vol 3, No 3: December 2005 Vol 3, No 2: August 2005 Vol 3, No 1: April 2005 Vol 2, No 1: April 2004 More Issue