• Title/Summary/Keyword: Communication algorithm

Search Result 7,824, Processing Time 0.03 seconds

Tabu Search based Optimization Algorithm for Reporting Cell Planning in Mobile Communication (이동통신에서 리포팅 셀 계획을 위한 타부서치 기반 최적화 알고리즘)

  • Jang, Kil-woong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.24 no.9
    • /
    • pp.1193-1201
    • /
    • 2020
  • Cell planning, which determines the cell structure for location management of mobile terminals in mobile communications, has been dealt with as an important research task to determine network performance. Among the factors influencing the cell structure planning in mobile communication, the signal cost for location management plays the most important role. In this paper, we propose an optimization algorithm that minimizes the location management cost of all the cells used to plan the cell structure in the network with reporting cell structure in mobile communication. The proposed algorithm uses a Tabu search algorithm, which is a meta-heuristic algorithm, and the proposed algorithm proposes a new neighborhood generation method to obtain a result close to the optimal solution. In order to evaluate the performance of the proposed algorithm, the simulation was performed in terms of location management cost and algorithm execution time. The evaluation results show that the proposed algorithm outperforms the existing genetic algorithm and simulated annealing.

Efficient LDPC Decoding Algorithm Using Node Monitoring (노드 모니터링에 의한 효율적인 LDPC 디코딩 알고리듬)

  • Suh, Hee-Jong
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.10 no.11
    • /
    • pp.1231-1238
    • /
    • 2015
  • In this paper, we proposed an efficient algorithm using Node monitoring (NM) and Piecewise Linear Function Approximation(: NP) for reducing the complexity of LDPC code decoding. Proposed NM algorithm is based on a new node-threshold method together with message passing algorithm. Piecewise linear function approximation is used to reduce the complexity of the algorithm. This new algorithm was simulated in order to verify its efficiency. Complexity of our new NM algorithm is improved to about 20% compared with well-known methods according to simulation results.

Algorithm for Dithering Color Images (칼라 이미지 디더링 알고리즘에 관한 연구)

  • Lee, Tae-Kyoung;Choi, Doo-Il;Cho, Woo-Yeon
    • Proceedings of the KIEE Conference
    • /
    • 2002.11c
    • /
    • pp.581-584
    • /
    • 2002
  • In this study, an algorithm for dithering true color image to 8-bit indexded color image using Artificial Neural Network was proposed. An adaptive vector quantization algorithm based on Artificial neural network was proposed for dithering color images. To evaluate the proposed algorithm, Mean Square Error(MSE) and quality between original image and dithered image was compared to those of other algorithm. As a results, MSE of proposed algorithm was lower than that of other algorithm used in commercial application and quality of dithered image was also highly improved.

  • PDF

Ethernet with Virtual Polling Algorithm for real-Time Industrial Communication Network (실시간 산업용 네트워크를 위한 가상 폴링 기반 이더넷 구현)

  • Kim, T. J.;Lee, K. C;Lee, S.
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2001.04a
    • /
    • pp.602-605
    • /
    • 2001
  • This paper focus on a method to use Ethernet Network for Industrial Communication Network. Ethernet use the CSMA/CD MAC(Medium Access Control) Protocol at the Data-Link Layer, Which isn't suit for Industrial Communication Network requiring Real-Time Communication, periodic data processing, critical data processing characteristics. In this paper we proposed the Virtual Polling Algorithm at the Application Layer will be solution of using the Ethernet Network for the Industrial Communication Network, Proposed Algorithm terminate the Collision in the network thus Delay Time is reduced and Real-Time Communication will be implemented.

  • PDF

A Genetic Algorithm for Cooperative Communication in Ad-hoc Networks (애드혹 네트워크에서 협력통신을 위한 유전 알고리즘)

  • Jang, Kil-Woong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.18 no.1
    • /
    • pp.201-209
    • /
    • 2014
  • This paper proposes a genetic algorithm to maximize the connectivity among the mobile nodes for the cooperative communication in ad-hoc networks. In general, as the movement of the mobile nodes in the networks increases, the amount of calculation for finding the solution would be too much increased. To obtain the optimal solution within a reasonable computation time for a high-density network, we propose a genetic algorithm to obtain the optimal solution for maximizing the connectivity. In order to make a search more efficient, we propose some efficient neighborhood generating operations of the genetic algorithm. We evaluate those performances through some experiments in terms of the maximum number of connections and the execution time of the proposed algorithm. The comparison results show that the proposed algorithm outperforms other existing algorithms.

A Study on Mobile Wireless Communication Network Optimization Using Global Search Algorithm (전역 탐색 알고리듬을 이용한 이동 무선통신 네트워크의 최적화에 대한 연구)

  • 김성곤
    • Journal of the Korea Society of Computer and Information
    • /
    • v.9 no.1
    • /
    • pp.87-93
    • /
    • 2004
  • In the design of mobile wireless communication network, BSC(Base Station Location), BSC(Base Station Controller) and MSC(Mobile Switching Center) are the most important parameters. Designing base station location, the cost must be minimized by combining various, complex parameters. We can solve this Problem by combining optimization algorithm, such as Simulated Annealing, Tabu Search, Genetic Algorithm, Random Walk Algorithm that have been used extensively for global optimization. This paper shows the 4 kinds of algorithm to be applied to the optimization of base station location for communication system and then compares, analyzes the results and shows optimization process of algorithm.

  • PDF

A Study on Adaptive Sparse Matrix Beamforming Algorithm of Error Beam Steering Vector for Target Estimation (목표물 추정을 위한 오차 빔 지향벡터의 적응 회소 행렬 빔형성 알고리즘 연구)

  • Kang, Kyoung Sik
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.7 no.2
    • /
    • pp.111-116
    • /
    • 2014
  • In this paper, we estimates the direction of arrival of desired a target using linear array antenna in wireless communication. Direction of arrival estimation is to estimate for desired target position among incident signals on receiver array antennas. This paper improved estimation of direction of arrival for target using optimum weight, high resolution adaptive beamforming algorithm, and sparse matrix for driection of arrival estimation. Through simulation, we showed that we are performance the analysis to compare general algorithm with proposed algorithm. We show that propose algorithm more improve for direction of estimation than general beamforming algorithm.

Fire Detection Algorithm for a Quad-rotor using Ego-motion Compensation (Ego-Motion 보정기법을 적용한 쿼드로터의 화재 감지 알고리즘)

  • Lee, Young-Wan;Kim, Jin-Hwang;Oh, Jeong-Ju;Kim, Hakil
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.21 no.1
    • /
    • pp.21-27
    • /
    • 2015
  • A conventional fire detection has been developed based on images captured from a fixed camera. However, It is difficult to apply current algorithms to a flying Quad-rotor to detect fire. To solve this problem, we propose that the fire detection algorithm can be modified for Quad-rotor using Ego-motion compensation. The proposed fire detection algorithm consists of color detection, motion detection, and fire determination using a randomness test. Color detection and randomness test are adapted similarly from an existing algorithm. However, Ego-motion compensation is adapted on motion detection for compensating the degree of Quad-rotor's motion using Planar Projective Transformation based on Optical Flow, RANSAC Algorithm, and Homography. By adapting Ego-motion compensation on the motion detection step, it has been proven that the proposed algorithm has been able to detect fires 83% of the time in hovering mode.

Performance Analysis of Target Adapted RED Algorithm on TCP/IP based GEO Satellite Communication Network (TCP/IP 기반의 정지 위성 궤도 통신망에서 TARED 알고리즘 성능 분석)

  • 서진원;김덕년
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.6A
    • /
    • pp.666-676
    • /
    • 2004
  • We must design the buffer algorithm that protects traffic congestion and decreasing throughput at satellite communication network. It is important that buffer algorithm is satisfied with the good performance of transmission packet, responsibility of many connecting traffic and the 005 for connecting character. Old buffer algorithms are not the suitable algorithms when we have the satellite communication network environment. RED buffer algorithm is proposed by Floyd. It has a better performance than old buffer algorithm. But this algorithm is not well adapted a number of connecting TCP packet and changing network, so this algorithm has a bad Performance on satellite communication network that is many of connecting user at same time. This paper Propose the TARED(Target Adaptive RED). It has a good performance, adaptation and stability on satellite communication network and has not overflow and underflow of the buffer level.

Blind Channel Estimation through Clustering in Backscatter Communication Systems (후방산란 통신시스템에서 군집화를 통한 블라인드 채널 추정)

  • Kim, Soo-Hyun;Lee, Donggu;Sun, Young-Ghyu;Sim, Issac;Hwang, Yu-Min;Shin, Yoan;Kim, Dong-In;Kim, Jin-Young
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.20 no.2
    • /
    • pp.81-86
    • /
    • 2020
  • Ambient backscatter communication has a drawback in which the transmission power is limited because the data is transmitted using the ambient RF signal. In order to improve transmission efficiency between transceiver, a channel estimator capable of estimating channel state at a receiver is needed. In this paper, we consider the K-means algorithm to improve the performance of the channel estimator based on EM algorithm. The simulation uses MSE as a performance parameter to verify the performance of the proposed channel estimator. The initial value setting through K-means shows improved performance compared to the channel estimation method using the general EM algorithm.