• Title/Summary/Keyword: Additive Algorithm

Search Result 308, Processing Time 0.026 seconds

Subsidiary Maximum Likelihood Iterative Decoding Based on Extrinsic Information

  • Yang, Fengfan;Le-Ngoc, Tho
    • Journal of Communications and Networks
    • /
    • v.9 no.1
    • /
    • pp.1-10
    • /
    • 2007
  • This paper proposes a multimodal generalized Gaussian distribution (MGGD) to effectively model the varying statistical properties of the extrinsic information. A subsidiary maximum likelihood decoding (MLD) algorithm is subsequently developed to dynamically select the most suitable MGGD parameters to be used in the component maximum a posteriori (MAP) decoders at each decoding iteration to derive the more reliable metrics performance enhancement. Simulation results show that, for a wide range of block lengths, the proposed approach can enhance the overall turbo decoding performance for both parallel and serially concatenated codes in additive white Gaussian noise (AWGN), Rician, and Rayleigh fading channels.

Gaussian noise estimation using adaptive filtering (적응적 필터링을 이용한 가우시안 잡음 예측)

  • Joh, Beom Seok;Kim, Young Ro
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.8 no.4
    • /
    • pp.13-18
    • /
    • 2012
  • In this paper, we propose a noise estimation method for noise reduction. It is based on block and pixel-based noise estimation. We assume that an input image is contaminated by the additive white Gaussian noise. Thus, we use an adaptive Gaussian filter and estimate the amount of noise. It computes the standard deviation of each block and estimation is performed on pixel-based operation. The proposed algorithm divides an input image into blocks. This method calculates the standard deviation of each block and finds the minimum standard deviation block. The block in flat region shows well noise and filtering effects. Blocks which have similar standard deviation are selected as test blocks. These pixels are filtered by adaptive Gaussian filtering. Then, the amount of noise is calculated by the standard deviation of the differences between noisy and filtered blocks. Experimental results show that our proposed estimation method has better results than those by existing estimation methods.

A Study on the Still Image Compression using the Low Pass Filter (로우 패스 필터를 이용한 정지 영상 압축에 관한 연구)

  • 김성종;신인철
    • Proceedings of the Korea Society for Industrial Systems Conference
    • /
    • 1997.11a
    • /
    • pp.91-101
    • /
    • 1997
  • The demand for handling images in digital form has increased dramatically in recent years. Digital image compression is required to store and transmit mass information in different from general information. JPEG(Joint Photographic Experts Group) committee founded by CCITT and ISO is define the still-image standard compression/restoration algorithm. JPEG is proposed the standard of grayscale and color still-image compression/restoration. In the image quality, JPEG is applicable to the various applications in which compression is able to from 1/10 to 1/50 without the visible obstacle. In this paper, we proposed that the proposed method enhance the compression ratio which is reducing the higher frequency in order to increasing the spatial redundancy in the image. The proposed method is using the low pass filter in order to reducing the higher frequency. The low-pass filters are using the median filter and convolution filter in the spatial domain, FFT filter in the frequency domain. We acquired the additive compression ratio reducing the higher frequency using the low-pass filter.

  • PDF

A Good Puncturing Scheme for Rate Compatible Low-Density Parity-Check Codes

  • Choi, Sung-Hoon;Yoon, Sung-Roh;Sung, Won-Jin;Kwon, Hong-Kyu;Heo, Jun
    • Journal of Communications and Networks
    • /
    • v.11 no.5
    • /
    • pp.455-463
    • /
    • 2009
  • We consider the challenges of finding good puncturing patterns for rate-compatible low-density parity-check code (LDPC) codes over additive white Gaussian noise (AWGN) channels. Puncturing is a scheme to obtain a series of higher rate codes from a lower rate mother code. It is widely used in channel coding but it causes performance is lost compared to non-punctured LDPC codes at the same rate. Previous work, considered the role of survived check nodes in puncturing patterns. Limitations, such as single survived check node assumption and simulation-based verification, were examined. This paper analyzes the performance according to the role of multiple survived check nodes and multiple dead check nodes. Based on these analyses, we propose new algorithm to find a good puncturing pattern for LDPC codes over AWGN channels.

Structural Topology Optimization using Element Remove Method (요소제거법을 이용한 구조물 위상최적설계)

  • 임오강;이진식;김창식
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 2001.10a
    • /
    • pp.183-190
    • /
    • 2001
  • Topology optimization. has been evolved into a very efficient conceptual design tool and has been utilized into design engineering processes in many industrial parts. In recent years, topology optimization has become the focus of structural optimization design and has been researched and widely applied both in academy and industry. Traditional topology optimization has been using homogenization method and optimality criteria method. Homogenization method provides relationship equation between structure which includes many holes and stiffness matrix in FEM. Optimality criteria method is used to update design variables while maintaining that volume fraction is uniform. Traditional topology optimization has advantage of good convergence but has disadvantage of too much convergency time and additive checkerboard prevention algorithm is needed. In one way to solve this problem, element remove method is presented. Then, it is applied to many examples. From the results, it is verified that the time of convergence is very improved and optimal designed results is obtained very similar to the results of traditional topology using 8 nodes per element.

  • PDF

Denoising of Speech Signal Using Wavelet Transform (웨이브렛 변환을 이용한 음성신호의 잡음제거)

  • 한미경;배건성
    • The Journal of the Acoustical Society of Korea
    • /
    • v.19 no.5
    • /
    • pp.27-34
    • /
    • 2000
  • This paper deals with speech enhancement methods using the wavelet transform. A cycle-spinning scheme and undecimated wavelet transform are used for denoising of speech signals, and then their results are compared with that of the conventional wavelet transform. We apply soft-thresholding technique for removing additive background noise from noisy speech. The symlets 8-tap wavelet and pyramid algorithm are used for the wavelet transform. Performance assessments based on average SNR, cepstral distance and informal subjective listening test are carried out. Experimental results demonstrate that both cycle-spinning denoising(CSD) method and undecimated wavelet denoising(CWD) method outperform conventional wavelet denoising(UWD) method in objective performance measure as welt as subjective listening test. The two methods also show less "clicks" that usually appears in the neighborhood of signal discontinuities.

  • PDF

A review of tree-based Bayesian methods

  • Linero, Antonio R.
    • Communications for Statistical Applications and Methods
    • /
    • v.24 no.6
    • /
    • pp.543-559
    • /
    • 2017
  • Tree-based regression and classification ensembles form a standard part of the data-science toolkit. Many commonly used methods take an algorithmic view, proposing greedy methods for constructing decision trees; examples include the classification and regression trees algorithm, boosted decision trees, and random forests. Recent history has seen a surge of interest in Bayesian techniques for constructing decision tree ensembles, with these methods frequently outperforming their algorithmic counterparts. The goal of this article is to survey the landscape surrounding Bayesian decision tree methods, and to discuss recent modeling and computational developments. We provide connections between Bayesian tree-based methods and existing machine learning techniques, and outline several recent theoretical developments establishing frequentist consistency and rates of convergence for the posterior distribution. The methodology we present is applicable for a wide variety of statistical tasks including regression, classification, modeling of count data, and many others. We illustrate the methodology on both simulated and real datasets.

A Multi-attribute Dispatching Rule Using A Neural Network for An Automated Guided Vehicle (신경망을 이용한 무인운반차의 다요소배송규칙)

  • 정병호
    • Journal of the Korea Society for Simulation
    • /
    • v.9 no.3
    • /
    • pp.77-89
    • /
    • 2000
  • This paper suggests a multi-attribute dispatching rule for an automated guided vehicle(AGV). The attributes to be considered are the number of queues in outgoing buffers of workstations, distance between an idle AGV and a workstation with a job waiting for the service of vehicle, and the number of queues in input buffers of the destination workstation of a job. The suggested rule is based on the simple additive weighting method using a normalized score for each attribute. A neural network approach is applied to obtain an appropriate weight vector of attributes based on the current status of the manufacturing system. Backpropagation algorithm is used to train the neural network model. The proposed dispatching rules and some single attribute rules are compared and analyzed by simulation technique. A number of simulation runs are executed under different experimental conditions to compare the several performance measures of the suggested rules and some existing single attribute dispatching rules each other.

  • PDF

Scene-Based Video Watermarking Using Temporal Spread Spectrum in Com pressed Domain (압축 영역에서 시간축 확산 스펙트럼을 이용한 장면단위의 비디오 워터마킹)

  • 최윤희;강경표;최태선
    • Proceedings of the IEEK Conference
    • /
    • 2002.06d
    • /
    • pp.93-96
    • /
    • 2002
  • This paper presents robust and efficient scene-based video watermarking method using visual rhythm (spatio-temporal slice) in compressed domain. Scene change can be detected easily using visual rhythm and video sequences are conveniently edited at the scene boundaries. Therefore, scene-based watermark embedding Process it a natural choice. Temporal spread spectrum can be achieved by applying spread spectrum methods to visual rhythm. Additive Gaussian noise, low-pass filtering, median filtering and histogram equalization attack are simulated for all frames. Frame sub-sampling is also simulated as a typical video attack Simulation results show that proposed algorithm is robust and efficient in the presence of such kind of attacks.

  • PDF

New Channel Equalizers for Mixed Phase Channel (혼합위상 특성을 고려한 새로운 채널 등화기)

  • 안경승;조주필;백흥기
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.8B
    • /
    • pp.1445-1452
    • /
    • 2000
  • In general, the communication channel can be modeled as inter-symbol interference(ISI) and additive white gaussian noise channel. Viterbi algorithm is optimum detector for transmitted data at transmitter, but it needs large computational complexity. For the sake of this problem, adaptive equalizers are employed for channel equalization which is not attractive for mixed phase channel. In this paper, we propose the effective new channel equalizer for mixed phase channel and show the better performance than previous equalizers.

  • PDF