• 한국통신학회논문지
• /
• 제35권7C호
• /
• pp.594-597
• /
• 2010

This paper estimates belief-propagation (BP) decoding performance of moderate-length irregular low-density parity-check (LDPC) codes with sphere bounds. We note that for moderate-length($10^3{\leq}N{\leq}4\times10^3$) irregular LDPC codes, BP decoding performance, which is much worse than maximum likelihood (ML) decoding performance, is well matched with one of loose upper bounds, i.e., sphere bounds. We introduce the sphere bounding technique for particular codes, not average bounds. The sphere bounding estimation technique is validated by simulation results. It is also shown that sphere bounds and BP decoding performance of irregular LDPC codes are very close at bit-error-rates (BERs) $P_b$ of practical importance($10^{-5}{\leq}P_b{\leq}10^{-4}$).

• ETRI Journal
• /
• 제38권5호
• /
• pp.896-902
• /
• 2016

Luby transform (LT) codes were the first practical rateless erasure codes proposed in the literature. The performances of these codes, which are iteratively decoded using belief propagation algorithms, depend on the degree distribution used to generate the coded symbols. The existence of degree-one coded symbols is essential for the starting and continuation of the decoding process. The absence of a degree-one coded symbol at any instant of an iterative decoding operation results in decoding failure. To alleviate this problem, we proposed a method used in the absence of a degree-one code symbol to overcome a stuck decoding operation and its continuation. The simulation results show that the proposed approach provides a better performance than a conventional LT code and memory-based robust soliton distributed LT code, as well as that of a Gaussian elimination assisted LT code, particularly for short data lengths.

• ETRI Journal
• /
• 제37권4호
• /
• pp.736-742
• /
• 2015

A serial concatenated decoding algorithm with dynamic threshold is proposed for low-density parity-check codes with short and medium code lengths. The proposed approach uses a dynamic threshold to select a decoding result from belief propagation decoding and order statistic decoding, which improves the performance of the decoder at a negligible cost. Simulation results show that, under a high SNR region, the proposed concatenated decoder performs better than a serial concatenated decoder without threshold with an Eb/N0 gain of above 0.1 dB.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 하계종합학술대회 논문집(1)
• /
• pp.323-326
• /
• 2002

In this paper, we study the improved bounds on the performance of low-density parity-check (LDPC) codes over binary-input additive white Gaussian noise (AWGN) channels with belief propagation (BP) decoding in log domain. We define an extended Gallager ensemble based on a new method of constructing parity check matrix and make use of this way to improve upper bound of LDPC codes. At the same time, many simulation results are presented in this paper. These results indicate the extended Gallager ensembles based on Hamming codes have typical minimum distance ratio, which is very close to the asymptotic Gilbert Varshamov bound and the superior performance which is better than the original Gallager ensembles.

• 한국통신학회논문지
• /
• 제35권11C호
• /
• pp.907-910
• /
• 2010

This paper presents the design of block lengths for irregular low-density parity-check (LDPC) codes based on the maximum variable degree $d_{{\upsilon},max}$. To design a block length, the performance degradation of belief-propagation (BP) decoding performance from upper bounds on the maximum likelihood (ML) decoding performance is used as an important factor. Since for large block lengths, the performance of irregular LDPC codes is very close to the Shannon limit, we focus on moderate block lengths ($5{\times}10^2\;{\leq}\;N\;{\leq}\;4{\times}10^3$). Given degree distributions, the purpose of our paper is to find proper block lengths based on the maximum variable degree $d_{{\upsilon},max}$. We also present some simulation results which show how a block length can be optimized.

• 한국HCI학회:학술대회논문집
• /
• 한국HCI학회 2009년도 학술대회
• /
• pp.620-624
• /
• 2009

본 논문은 고화질(high definition, HD) 복합형 카메라 시스템과 고품질(high-quality) 3차원 스캐너를 결합하여 다시점 비디오와 그에 상응하는 다시점 깊이맵을 생성하는 시스템을 제안한다. 복합형 카메라 시스템과 3차원 스캐너를 이용해 3차원 비디오를 생성하기 위해서는, 우선 움직임이 없는 배경영역에 대한 깊이정보를 고품질 3차원 스캐너를 이용해 미리 획득하고, 동적으로 움직이는 전경영역에 대해서는 다시점 카메라와 깊이 카메라를 결합한 복합형 카메라 시스템을 이용해 다시점 비디오와 깊이맵을 획득한다. 그리고 3차원 스캐너와 깊이카메라를 통해 획득한 깊이정보를 이용해 3차원 워핑(warping)을 적용하여 각 다시점 카메라를 위한 초기 깊이정보를 예측한다. 초기 깊이정보를 이용해 다시점 깊이를 예측하는 것은 다시점 카메라의 각 시점에서의 초기 깊이맵을 계산하기 위한 것이다. 고화질의 다시점 깊이맵을 생성하기 위해서 belief propagation 방법을 이용하여 초기 깊이맵을 정제한다. 마지막으로, 전경영역의 경계선 영역의 불규칙적인 깊이맵을 정제하기 위해 전경영역의 외곽선 정보를 추출하여 생성된 깊이맵의 경계선 영역을 다시한번 정제한다. 제안한 3차원 스캐너와 복합형 카메라를 결합한 시스템은 기존의 깊이맵 예측 방법보다 정확한 다시점 깊이맵을 포함하는 3차원 비디오를 생성할 수 있었으며, 보다 자연스러운 3차원 영상을 생성할 수 있었다.

• 산업공학
• /
• 제23권4호
• /
• pp.311-318
• /
• 2010

In the daily multi-reservoir operating problem, monthly storage targets can be used as principal operational guidelines. In this study, we tested the use of a simple back-propagation Artificial Neural Network (ANN) model to derive monthly storage guideline for daily Coordinated Multi-reservoir Operating Model (CoMOM) of the Han-River basin. This approach is based on the belief that the optimum solution of the daily CoMOM has a good performance, and the ANN model trained with the results of daily CoMOM would produce effective monthly operating guidelines. The optimum results of daily CoMOM is used as the training set for the back-propagation ANN model, which is designed to derive monthly reservoir storage targets in the basin. For the input patterns of the ANN model, we adopted the ratios of initial storage of each dam to the storage of Paldang dam, ratios of monthly expected inflow of each dam to the total inflow of the whole basin, ratios of monthly demand at each dam to the total demand of the whole basin, ratio of total storage of the whole basin to the active storage of Paldang dam, and the ratio of total inflow of the whole basin to the active storage of the whole basin. And the output pattern of ANN model is the optimal final storages that are generated by the daily CoMOM. Then, we analyzed the performance of the ANN model by using a real-time simulation procedure for the multi-reservoir system of the Han-river basin, assuming that historical inflows from October 1st, 2004 to June 30th, 2007 (except July, August, September) were occurred. The simulation results showed that by utilizing the monthly storage target provided by the ANN model, we could reduce the spillages, increase hydropower generation, and secure more water at the end of the planning horizon compared to the historical records.

• ETRI Journal
• /
• 제30권6호
• /
• pp.807-817
• /
• 2008

We present a low-density parity-check (LDPC)-based, threaded layered space-time-frequency system with emphasis on the iterative receiver design. First, the unbiased minimum mean-squared-error iterative-tree-search (U-MMSE-ITS) detector, which is known to be one of the most efficient multi-input multi-output (MIMO) detectors available, is improved by augmentation of the partial-length paths and by the addition of one-bit complement sequences. Compared with the U-MMSE-ITS detector, the improved detector provides better detection performance with lower complexity. Furthermore, the improved detector is robust to arbitrary MIMO channels and to any antenna configurations. Second, based on the structure of the iterative receiver, we present a low-complexity belief-propagation (BP) decoding algorithm for LDPC-codes. This BP decoder not only has low computing complexity but also converges very fast (5 iterations is sufficient). With the efficient receiver employing the improved detector and the low-complexity BP decoder, the proposed system is a promising solution to high-data-rate transmission over selective-fading channels.

• 대한임베디드공학회논문지
• /
• 제4권4호
• /
• pp.195-200
• /
• 2009

As 4G mobile communication systems require high transmission rates with reliability, the need for efficient error correcting code is increasing. In this paper, a novel LDPC (Low Density Parity Check) decoder is introduced. The LDPC code is one of the most popular error correcting codes. In order to improve performance of the LDPC decoder, we use SNR (Signal-to-Noise Ratio) estimation results to adjust coefficients of modified UMP-BP (Uniformly Most Probable Belief Propagation) algorithm which is one of widely-used LDPC decoding algorithms. An advantage of Modified UMP-BP is that it is amenable to implement in hardware. We generate the optimal values by simulation for various SNRs and coefficients, and the values are stored in a look-up table. The proposed decoder decides coefficients of the modified UMP-BP based on SNR information. The simulation results show that the BER (Bit Error Rate) performance of the proposed LDPC decoder is better than an LDPC decoder using a conventional modified UMP-BP.

• 한국통신학회논문지
• /
• 제33권9C호
• /
• pp.683-690
• /
• 2008

반복적인 신뢰 전파 알고리듬을 low-density parity-check(LDPC) 부호에 적용하는 경우 패리티-검사를 이용한 기존 복호 중단 기법은 높은 signal-to-noise ratio(SNR) 영역에서 반복 복호 수를 줄이는 것을 가능케 한다. 그러나 재전송 요청이 빈번한 Hybrid-ARQ(H-ARQ) 시스템에서는 낮은 SNR 영역에 적합한 복호 중단 기법이 없기 때문에 복호에 실패하는 경우 많은 양의 불필요한 반복 복호가 수행된다. 본 논문에서는 결국 복호에 실패하게 될 LDPC 부호 블록들을 복호 초기 단계에서 발견하기 위하여 신뢰 전파 복호에서 임시 부호어의 신드롬 무게를 이용한 중단 기법을 제안한다. 제안된 기법은 H-ARQ 시스템을 위한 LDPC 복호기에서 구현 복잡도의 증가와 성능의 열화 없이도 연산량을 70-80% 감소시킨다.