• Title/Summary/Keyword: Additive Algorithm

Search Result 308, Processing Time 0.022 seconds

Dominant Source Based Tree for Dynamic Multicasting (동적 멀티캐스트를 위한 주 송신원 기탄 트리)

  • 남홍순;김대영;이규욱
    • Journal of Korea Multimedia Society
    • /
    • v.3 no.6
    • /
    • pp.633-642
    • /
    • 2000
  • This paper proposes a dominant source-based tree (DSBT) that constructs a localized multicast routing tree for dynamic multicasting without rerouting. To constrain end-to-end delays a multicast tree needs to be reconstructed when a new node joins the group due to additive tree constraint. In DSBT, a multicast group G is expressed by a (DS, NCM) pair, where DS is a dominant source address and NCM is a normalized cost margin. A node wishing to participate in a group selects a path that complies with NCM toward DS such that the end-to-end cost is constrained without any rerouting. Simulation results show that the proposed method performed better in terms of the overall tree cost compared with the Nave algorithm and in terms of the end-to-end delays between any two members compared with the Greedy algorithm.

  • PDF

Construction of Structured q-ary LDPC Codes over Small Fields Using Sliding-Window Method

  • Chen, Haiqiang;Liu, Yunyi;Qin, Tuanfa;Yao, Haitao;Tang, Qiuling
    • Journal of Communications and Networks
    • /
    • v.16 no.5
    • /
    • pp.479-484
    • /
    • 2014
  • In this paper, we consider the construction of cyclic and quasi-cyclic structured q-ary low-density parity-check (LDPC) codes over a designated small field. The construction is performed with a pre-defined sliding-window, which actually executes the regular mapping from original field to the targeted field under certain parameters. Compared to the original codes, the new constructed codes can provide better flexibility in choice of code rate, code length and size of field. The constructed codes over small fields with code length from tenths to hundreds perform well with q-ary sum-product decoding algorithm (QSPA) over the additive white Gaussian noise channel and are comparable to the improved spherepacking bound. These codes may found applications in wireless sensor networks (WSN), where the delay and energy are extremely constrained.

An Alternating Equalizer with Differential Adjustment Based on Symbol Decisions by Soft/Hard Decision (연/경판정에 의한 심벌 판정 기반의 차등 조정 교번 등화기)

  • Oh, Kil-Nam
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.13 no.5
    • /
    • pp.2347-2352
    • /
    • 2012
  • In this paper, a new alternating equalizer and its differential adjustment algorithm are proposed. The proposed alternating equalizer achieves equalization effectively using an algorithm performing symbol decisions based on soft/hard decision. In addition, it is possible to improve the initial blind convergence speed and steady-state error performance simultaneously by adjusting the equalizer differentially according to the relative reliability of the symbol decisions by soft/hard decision devices. The simulation results on 16/64-QAM constellations under multipath propagation channel and additive noise conditions confirmed to support usefulness of the proposed method.

GENERAL CONVERGENCE ANALYSIS OF THE LVCMS ALGORITHM (LVCMS 알고리즘에 대한 일반적인 수렴 특성 분석)

  • Nam, Seung-Hyon;Kim, Yong-Hoh
    • The Journal of Natural Sciences
    • /
    • v.8 no.2
    • /
    • pp.63-67
    • /
    • 1996
  • Adaptive algorithms based on the higher order error criterion such as the LVCMS and the LMF show performance degradation if input signal contains additive noise with a heavier-tailed density. Conventional analysis often neglects higher order terms in the recursion and my not suit for prediction exact behavior of these higher order algorithms. This paper presents a new convergence analysis which contains all the higher order term in the recursion. The analysis shows that the higher order terms, which are often neglected, dose not affect the upper bound on the step size but the misadjustment. However, the effect decreases sharply proportional to the square of the step size.

  • PDF

Indoor Mobile Localization System and Stabilization of Localization Performance using Pre-filtering

  • Ko, Sang-Il;Choi, Jong-Suk;Kim, Byoung-Hoon
    • International Journal of Control, Automation, and Systems
    • /
    • v.6 no.2
    • /
    • pp.204-213
    • /
    • 2008
  • In this paper, we present the practical application of an Unscented Kalman Filter (UKF) for an Indoor Mobile Localization System using ultrasonic sensors. It is true that many kinds of localization techniques have been researched for several years in order to contribute to the realization of a ubiquitous system; particularly, such a ubiquitous system needs a high degree of accuracy to be practical and efficient. Unfortunately, a number of localization systems for indoor space do not have sufficient accuracy to establish any special task such as precise position control of a moving target even though they require comparatively high developmental cost. Therefore, we developed an Indoor Mobile Localization System having high localization performance; specifically, the Unscented Kalman Filter is applied for improving the localization accuracy. In addition, we also present the additive filter named 'Pre-filtering' to compensate the performance of the estimation algorithm. Pre-filtering has been developed to overcome negative effects from unexpected external noise so that localization through the Unscented Kalman Filter has come to be stable. Moreover, we tried to demonstrate the performance comparison of the Unscented Kalman Filter and another estimation algorithm, such as the Unscented Particle Filter (UPF), through simulation for our system.

A Modified Gaussian Model-based Low Complexity Pre-processing Algorithm for H.264 Video Coding Standard (H.264 동영상 표준 부호화 방식을 위한 변형된 가우시안 모델 기반의 저 계산량 전처리 필터)

  • Song, Won-Seon;Hong, Min-Cheol
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.2C
    • /
    • pp.41-48
    • /
    • 2005
  • In this paper, we present a low complexity modified Gaussian model based pre-processing filter to improve the performance of H.264 compressed video. Video sequence captured by general imaging system represents the degraded version due to the additive noise which decreases coding efficiency and results in unpleasant coding artifacts due to higher frequency components. By incorporating local statistics and quantization parameter into filtering process, the spurious noise is significantly attenuated and coding efficiency is improved for given quantization step size. In addition, in order to reduce the complexity of the pre-processing filter, the simplified local statistics and quantization parameter are introduced. The simulation results show the capability of the proposed algorithm.

The Modified Mean Filter to Remove AWGN (AWGN 제거를 위한 변형된 평균필터)

  • Gao, Yinyu;Kim, Nam-Ho
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.5
    • /
    • pp.1177-1182
    • /
    • 2011
  • The image signals are corrupted by various noises in signal processing and the noises caused the degradation phenomenon. gaussian noise occurs in the process of transmission. Many studies are being accomplished to restore those signals which corrupted by additive gaussian noise. In this paper, the algorithm is proposed to remove AWGN. The algorithm first calculates the mask's standard deviation and next according to the thresholds separated as three levels, then calculates the weight which for different location in the mask's pixels. At last the mean value of the modified mean filter's is the output. Also we compare existing methods through the simulation and using PSNR as the standard of judgement of improvement effect.

Wavelet-based Algorithm for Signal Reconstruction (신호 복원을 위한 웨이브렛기반 알고리즘)

  • Bae, Sang-Bum;Kim, Nam-Ho
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.11 no.1
    • /
    • pp.150-156
    • /
    • 2007
  • Noise is generated by several causes, when signal is processed. Hence, it generates error in the process of data transmission and decreases recognition ratio of image and speech data. Therefore, after eliminating those noises, a variety of methods for reconstructing the signal have been researched. Recently, wavelet transform which has time-frequency localization and is possible for multiresolution analysis is applied to many fields of technology. Then threshold-and correlation-based methods are proposed for removing noise. But, conventional methods accept a lot of noise as an edge and are impossible to remove the additive white Gaussian noise (AWGN) and the impulse noise at the same time. Therefore, in this paper we proposed new wavelet-based algorithm for reconstructing degraded signal by noise and compared it with conventional methods.

Sliding-DFT based multi-channel phase measurement FPGA system (Sliding-DFT를 이용한 다채널 위상 측정 FPGA 시스템)

  • Eo, Jin-Woo;Chang, Tae-Gyu
    • Journal of IKEEE
    • /
    • v.8 no.1 s.14
    • /
    • pp.128-135
    • /
    • 2004
  • This paper proposes a phase measurement algorithm which is based on the recursive implementation of sliding-DFT. The algorithm is designed to have a robust behavior against the erroneous factors of frequency drift, additive noise, and twiddle factor approximation. The size of phase error caused by the finite wordlength implementation of DFT twiddle factors is shown significantly lower than that of magnitude error. The drastic reduction of the phase error is achieved by the exploitation of the quadruplet symmetry characteristics of the approximated twiddle factors in the complex plane. Four channel power-line phase measurement system is also designed and implemented based on the time-multiplexed sharing architecture of the proposed algorithm. The operation of the developed system is also verified by the experiment performed under the test environment implemented with the multi-channel function generator and the on-line interfaced host processor system. The proposed algorithm's features of phase measurement accuracy and its robustness against the finite wordlength effects can provide a significant impact especially for the ASIC or microprocessor based embedded system applications where the enhanced processing speed and implementation simplicity are crucial design considerations.

  • PDF

Symbol Time Tracking Algorithm for WAVE Systems (WAVE 시스템에서 심볼 시간추적 알고리듬)

  • Hong, Dae-Ki
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.2
    • /
    • pp.397-406
    • /
    • 2009
  • A Wireless Access for Vehicular Environment (WAVE) system based on Orthogonal frequency Division Multiplexing (OFDM) is made for vehicle to vehicle wireless communications. The physical layer standard of the WAVE system is very similar to that of the IEEE802.1la wireless local area network (WLAN). Therefore, the performance of the WAVE system is degraded by continual timing delay in the WAVE multipath fading channels after starting initial timing synchronization. In this paper, the tracking algorithm that synchronizes symbol timing is proposed to continually compensate additional timing delay. Computer simulation of the proposed algorithm is performed in the worst communication environments that apply to maximum timing delay. Computer simulation shows that the proposed algorithm can improve the system performance in various channel conditions.