• Title/Summary/Keyword: Broadcasting algorithm

Search Result 1,175, Processing Time 0.023 seconds

A Study on Correlation Interference Signal Cancellation Algorithm for Target Estimation in Multi Input Multi Output (다중 입력 다중 출력 배열 시스템에서 목표물 추정을 위한 상관성 간섭신호 제거 알고리즘 연구)

  • Lee, Kwan-Hyeong;Song, Woo-Young;Lee, Myeong-Ho
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.13 no.1
    • /
    • pp.89-93
    • /
    • 2013
  • This paper is estimating a target direction of arrival with incident to receiver in spatial. This paper presented covariance using constraint matrix to correlation interference signal cancellation in multi input multi output array antennas system. we proposed a target direction of arrival estimation algorithm using cost function and minimum variance method. Through simulation, we were analysis a performance to compare general SPT-LCMV algorithm and proposal algorithm. We showed that proposal algorithm improve more target estimation than general SPT-LCMV algorithm in direction of arrival.

Linear Bottleneck Assignment Problem Based on Reverse-delete Algorithm (선형 병목할당 문제의 역-삭제 알고리즘)

  • Lee, Sang-Un
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.13 no.6
    • /
    • pp.211-220
    • /
    • 2013
  • This paper proposes an algorithm that easily finds an optimal solution for linear bottleneck assignment problems. It is either threshold or augmenting path algorithm that is generally used to solve the bottleneck assignment problem. This paper proposes a reverse-delete algorithm that follows 2 steps. Firstly, the algorithm deletes the maximum cost in a given matrix until it renders a single row or column. Next, the algorithm improves any solution that contains a cost exceeding the threshold value $c^*_{ij}$. Upon its application to 28 balanced assignment problems and 7 unbalanced problems, the algorithm is found to be both successful and simple.

Optimization Algorithm for Real-time Load Dispatch Problem Using Shut-off and Swap Method (발전정지와 교환방법을 적용한 실시간급전문제 최적화 알고리즘)

  • Lee, Sang-Un
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.17 no.4
    • /
    • pp.219-224
    • /
    • 2017
  • In facing the lack of a deterministic algorithm for economic load dispatch optimization problem, only non-deterministic heuristic algorithms have been suggested. Worse still, there is a near deficiency of research devoted to real-time load dispatch optimization algorithm. In this paper, therefore, I devise a shut-off and swap algorithm to solve real-time load dispatch optimization problem. With this algorithm in place, generators with maximum cost-per-unit generation power are to be shut off. The proposed shut-off criteria use only quadratic function in power generation cost function without valve effect nonlinear absolute function. When applied to the most prevalent economic load dispatch benchmark data, the proposed algorithm is proven to largely reduce the power cost of known algorithms.

A Study on Direction of Arrival Algorithm using Optimum Weight and Steering Direction Vector of MUSIC Algorithm (MUSIC알고리즘의 지향 방향벡터와 최적 가중치를 이용한 도래방향 추정 알고리즘 연구)

  • Lee, Kwan-Hyeong;Song, Woo-Young;Lee, Myeong-Ho
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.12 no.4
    • /
    • pp.147-152
    • /
    • 2012
  • This paper estimates the direction of arrival of desired a target using propagation wave in spatial. Direction of arrival estimation is to find desired target position among received signal to receiver array antennas. In this paper, we estimated direction of arrival for target, by using cost function and high resolution MUSIC algorithm, in order to direction of arrival estimation, and calculated optimum weight vector. Through simulation, in regard to the estimation of the arrival direction of a target, the performances of the existing ESPRIT algorithm and the proposed algorithm were comparatively analyzed. In the estimation time of the arrival direction of a target object, the proposed algorithm showed an improvement of approximately as compared to the existing ESPRIT algorithm.

A Study on Target Incident Signal Estimaion Technique of spatial Spectrum in Wireless Network System (공간 영역 신호에서 다중 빔 형성을 이용한 목표물 추정 방법에 대한 연구)

  • Lee, Kwan-Hyeong;Song, Woo-Young;Lee, Myeong-Ho
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.13 no.2
    • /
    • pp.137-142
    • /
    • 2013
  • Direction of arrival is estimating for desire signal direction among received signal on antenna in spatial. In this paper, we were an estimation a receiving signal direction of arrival using multi beam forming in radar. We proposed, by signal direction of arrival estimation method, an algorithm which combine spatial correlation matrix weight value and beam steering algorithm in this paper. Through simulation, we were analysis a performance to compare general algorithm and proposal algorithm. In direction of arrival estimation, proposed algorithm is effectivity to decrease processing time because it is not doing an eigen decomposition. We showed that proposal algorithm improve more target estimation than general algorithm.

Performance Improvement of CCA Blind Equalization Algorithm by Adaptive Step Size (적응 스텝 크기에 의한 CCA 블라인드 등화 알고리즘의 성능 개선)

  • Lim, Seung-Gag
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.16 no.1
    • /
    • pp.109-114
    • /
    • 2016
  • This paper relates with the performance improvement of CCA (Compact Constellation Algorithm) equalization algorithm by adding the adaptive step size control in order to the minimization of intersymbol interference and additive noise effects that is occurs in the channel for digital radio transmissionl. In general, the fixed step size was used in order to adaptation in equalizer algorithm. But in proposed algorithm, the variable step size were adapted that is proposional to the nonlinear function of error signal for equalization. In order to show the improved equalizatation performance, the output signal constellation of equalizer, residual isi, maximum distortion, MSE and SER were used, then it were compared with the present CCA algorithm. As a result of computer simulation, the adaptive step size CCA has more better performance in the every performance index compared to the fixed step size CCA after in the steay state.

A Study of Non-Intrusive Appliance Load Identification Algorithm using Complex Sensor Data Processing Algorithm (복합 센서 데이터 처리 알고리즘을 이용한 비접촉 가전 기기 식별 알고리즘 연구)

  • Chae, Sung-Yoon;Park, Jinhee
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.17 no.2
    • /
    • pp.199-204
    • /
    • 2017
  • In this study, we present a home appliance load identification algorithm. The algorithm utilizes complex sensory data in order to improve the existing NIALM using total power usage information. We define the influence graph between the appliance status and the measured sensor data. The device identification prediction result is calculated as the weighted sum of the predicted value of the sensor data processing algorithm and the predicted value based on the total power usage. We evaluate proposed algorithm to compare appliance identification accuracy with the existing NIALM algorithm.

A Greedy Algorithm for Minimum Power Broadcast in Wireless Networks (무선 네트워크에서 최소전력 브로드캐스트를 위한 탐욕 알고리즘)

  • Lee, Dong-ho;Jang, Kil-woong
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2016.05a
    • /
    • pp.641-644
    • /
    • 2016
  • Unlike wired networks, broadcasting in wireless networks can transmit data at once to several nodes with a single transmission. For omnidirectional broadcast to a node in wireless networks, all adjacent nodes receive the data at the same time. In this paper, we propose a greedy algorithm to solve the minimum power broadcasting problem of minimizing the total transmit power on broadcasting in wireless networks. We apply two matrices to the proposed algorithm: one is a distance matrix that represents the distance between each node, the other is an adjacency matrix having the number of adjacency nodes. Among the nodes that receive the data, a node that has the greatest number of the adjacent node transmits data to neighbor preferential. We compare the performance of the proposed algorithm with random method through computer simulation in terms of transmitting power of nodes. Experiment results show that the proposed algorithm outperforms better than the random method.

  • PDF

An Improved Non-CSD 2-Bit Recursive Common Subexpression Elimination Method to Implement FIR Filter

  • Kamal, Hassan;Lee, Joo-Hyun;Koo, Bon-Tae
    • ETRI Journal
    • /
    • v.33 no.5
    • /
    • pp.695-703
    • /
    • 2011
  • The number of adders and critical paths in a multiplier block of a multiple constant multiplication based implementation of a finite impulse response (FIR) filter can be minimized through common subexpression elimination (CSE) techniques. A two-bit common subexpression (CS) can be located recursively in a noncanonic sign digit (CSD) representation of the filter coefficients. An efficient algorithm is presented in this paper to improve the elimination of a CS from the multiplier block of an FIR filter so that it can be realized with fewer adders and low logical depth as compared to the existing CSE methods in the literature. Vinod and others claimed the highest reduction in the number of logical operators (LOs) without increasing the logic depth (LD) requirement. Using the design examples given by Vinod and others, we compare the average reduction in LOs and LDs achieved by our algorithm. Our algorithm shows average LO improvements of 30.8%, 5.5%, and 22.5% with a comparative LD requirement over that of Vinod and others for three design examples. Improvement increases as the filter order increases, and for the highest filter order and lowest coefficient width, the LO improvements are 70.3%, 75.3%, and 72.2% for the three design examples.

Two-Step Rate Distortion Optimization Algorithm for High Efficiency Video Coding

  • Goswami, Kalyan;Lee, Dae Yeol;Kim, Jongho;Jeong, Seyoon;Kim, Hui Yong;Kim, Byung-Gyu
    • Journal of Multimedia Information System
    • /
    • v.4 no.4
    • /
    • pp.311-316
    • /
    • 2017
  • High Efficiency Video Coding (HEVC) is the newest video coding standard for improvement in video data compression. This new standard provides a significant improvement in picture quality, especially for high-resolution videos. A quadtree-based structure is created for the encoding and decoding processes and the rate-distortion (RD) cost is calculated for all possible dimensions of coding units in the quadtree. To get the best combination of the block an optimization process is performed in the encoder, called rate distortion optimization (RDO). In this work we are proposing a novel approach to enhance the overall RDO process of HEVC encoder. The proposed algorithm is performed in two steps. In the first step, like HEVC, it performs general rate distortion optimization. The second step is an extra checking where a SSIM based cost is evaluated. Moreover, a fast SSIM (FSSIM) calculation technique is also proposed in this paper.