• 한국전자파학회논문지
• /
• 제16권10호
• /
• pp.965-972
• /
• 2005

본 연구에서는 DTV, HDTV 서비스를 동시에 제공하는 차세대 위성 방송시스템의 표준안인 DVB-S2에서 채널 부호화 알고리즘으로 채택한 LDPC 부호의 복호 알고리즘에 대해 연구를 하였다. 샤논의 한계에 근접하기 위해서는 큰 블록 사이즈의 LDPC 부호어 길이와 많은 반복 횟수를 요구한다. 이는 많은 계산량을 요구하며, 그리고 이에 따른 전력 소비량(power consumption)을 야기시키므로 본 논문에서는 세 가지 형태의 low complexity LDPC 복호 알고리즘을 제시한다. 첫째로 큰 블록 사이즈와 많은 반복 회수는 많은 계산량과 power 소모량을 요구하므로 성능 손실 없이 반복 횟수를 줄일 수 있는 SUBSET 방법을 이용한 복호 알고리즘, 둘째로 early stop 알고리즘에 대해 연구하였고, 셋째로 비트 노드 계산과 체크 노드 계산시 일정한 신뢰도 값보다 크면 다음 반복시 계산을 하지 않는 early detection 알고리즘에 대해 연구하였다.

• 대한전자공학회논문지SD
• /
• 제39권2호
• /
• pp.27-38
• /
• 2002

양자 우물 반도체 소자 모델링에 있어서 양자 우물의 다중 에너지 부준위 각각에 대한 Boltzmann 방정식의 해를 직접적으로 구하는 self-consistent한 방법을 개발하였다 양자 우물의 특성을 고려하여 Schrodinger 방정식과 Poisson 방정식 및 Boltzmann 방정식으로 구성된 양자 우물 소자 모델을 설정하였으며 이들의 직접적인 해를 유한 차분법과 Gummel-type iteration scheme에 의해 구하였다. Si MOSFET의 inversion 영역에 형성되는 양자 우물에 적용하여 그 시뮬레이션 결과로부터 본 방법의 타당성 및 효율성을 보여 주었다.

• 한국항공우주학회지
• /
• 제34권10호
• /
• pp.1-6
• /
• 2006

본 연구에서는 3차원 날개의 실속 특성을 예측하였다. 날개의 실속 특성을 해석하기 위해 반복적 캠버변형 기법을 비평면 양력면 이론에 도입하였다. 반복적 캠버변형 기법은 기지의 2차원 에어포일 데이터를 이용하여 3차원 날개의 실속 특성을 해석한다. 날개의 한 단면에서의 캠버변형이 날개의 다른 단면에 미치는 영향은 다차원 뉴턴 반복법을 사용하여 고려하였다. 해석 결과는 실험값과 타 전산해석 결과와 비교하여 일치되는 결과를 보였다. 본 기법은 비틀림 또는 조종면을 갖는 어떠한 날개에도 적용이 가능하며 또한 날개와 날개의 상호 작용이 있을 때의 실속 특성도 예측 가능하다.

• 대한자원환경지질학회:학술대회논문집
• /
• 대한자원환경지질학회 2002년도 춘계 공동학술발표회
• /
• pp.167-169
• /
• 2002

The extended Born, or localized nonlinear approximation of integral equation (IE) solution has been applied to inverting single-hole electromagnetic (EM) data using a cylindrically symmetric model. The extended Born approximation is less accurate than a full solution but much superior to the simple Born approximation. When applied to the cylindrically symmetric model with a vertical magnetic dipole source, however, the accuracy of the extended Born approximation is greatly improved because the electric field is scalar and continuous everywhere. One of the most important steps in the inversion is the selection of a proper regularization parameter for stability. Occam's inversion (Constable et al., 1987) is an excellent method for obtaining a stable inverse solution. It is extremely slow when combined with a differential equation method because many forward simulations are needed but suitable for the extended Born solution because the Green's functions, the most time consuming part in IE methods, are repeatedly re-usable throughout the inversion. In addition, the If formulation also readily contains a sensitivity matrix, which can be revised at each iteration at little expense. The inversion algorithm developed in this study is quite stable and fast even if the optimum regularization parameter Is sought at each iteration step. Tn this paper we show inversion results using synthetic data obtained from a finite-element method and field data as well.

• 대한원격탐사학회지
• /
• 제25권3호
• /
• pp.295-309
• /
• 2009

In this study, an iterative maximum a posteriori (MAP) approach using a Bayesian model of Markovrandom field (MRF) was proposed for despeckling images that contains speckle. Image process is assumed to combine the random fields associated with the observed intensity process and the image texture process respectively. The objective measure for determining the optimal restoration of this "double compound stochastic" image process is based on Bayes' theorem, and the MAP estimation employs the Point-Jacobian iteration to obtain the optimal solution. In the proposed algorithm, MRF is used to quantify the spatial interaction probabilistically, that is, to provide a type of prior information on the image texture and the neighbor window of any size is defined for contextual information on a local region. However, the window of a certain size would result in using wrong information for the estimation from adjacent regions with different characteristics at the pixels close to or on boundary. To overcome this problem, the new method is designed to use less information from more distant neighbors as the pixel is closer to boundary. It can reduce the possibility to involve the pixel values of adjacent region with different characteristics. The proximity to boundary is estimated using a non-uniformity measurement based on standard deviation of local region. The new scheme has been extensively evaluated using simulation data, and the experimental results show a considerable improvement in despeckling the images that contain speckle.

• ETRI Journal
• /
• 제27권5호
• /
• pp.525-532
• /
• 2005

In this paper, we propose and present implementation results of a high-speed turbo decoding algorithm. The latency caused by (de)interleaving and iterative decoding in a conventional maximum a posteriori turbo decoder can be dramatically reduced with the proposed design. The source of the latency reduction is from the combination of the radix-4, center to top, parallel decoding, and early-stop algorithms. This reduced latency enables the use of the turbo decoder as a forward error correction scheme in real-time wireless communication services. The proposed scheme results in a slight degradation in bit error rate performance for large block sizes because the effective interleaver size in a radix-4 implementation is reduced to half, relative to the conventional method. To prove the latency reduction, we implemented the proposed scheme on a field-programmable gate array and compared its decoding speed with that of a conventional decoder. The results show an improvement of at least five fold for a single iteration of turbo decoding.

• 한국전산구조공학회논문집
• /
• 제13권3호
• /
• pp.305-319
• /
• 2000

본 논문에서는 대변형 비선형 변형체의 마찰 접촉 문제의 해법을 제시하였다. 접촉 가능 점에서 접촉조건을 접촉오차 벡터를 이용하여 표시하였으며, 이러한 접촉오차 벡터를 0으로 단조 감소시키기 위하여 반복계산법을 사용하였다. 각 반복계산은 2개의 단계로 구성되어 있다 : 첫 단계에서는 이미 구해진 해의 기하학적 모양에서 얻어지는 접촉오차 벡터를 이용하여 접촉력을 수정하고, 두 번째 단계에서는 첫 단계의 접촉력을 이용하여 평형방정식을 풀어서 변위 및 접촉오차를 계산하는 것이다. 본 반복계산법에 의하여 정확한 해를 얻을 수 있음을 설명하였으며, 강소성 막 및 비선형 탄성보를 사용하여 예제계산을 수행하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권11호
• /
• pp.2616-2635
• /
• 2013

In this paper, we propose an iterative transceiver design in a multi-relay multi-user multiple-input multiple-output (MIMO) system. The design criterion is to minimize sum mean squared error (SMSE) under relay sum power constraint (RSPC) where only local channel state information (CSI)s are available at relays. Local CSI at a relay is defined as the CSI of the channel between BS and the relay in the $1^{st}$ hop link, and the CSI of the channel between the relay and all users in the $2^{nd}$ hop link. Exploiting BS transmitter structure which is concatenated with block diagonalization (BD) precoder, each relay's precoder can be determined using local CSI at the relay. The proposed scheme is based on sequential iteration of two stages; stage 1 determines BS transmitter and relay precoders jointly with SMSE duality, and stage 2 determines user receivers. We verify that the proposed scheme outperforms simple amplify-and-forward (SAF), minimum mean squared error (MMSE) relay, and an existing good scheme of [13] in terms of both SMSE and sum-rate performances.

• 대한기계학회논문집B
• /
• 제21권12호
• /
• pp.1624-1634
• /
• 1997

A numerical study on two-dimensional unsteady transonic cascade flow has been performed by adopting dual time stepping and the k-.omega. turbulence model. An explicit 4 stage Runge-Kutta scheme for the compressible Navier-Stokes equations and an implicit Gauss-Seidel iteration scheme for the k-.omega. turbulence model are proposed for fictitious time stepping. This mixed time stepping scheme ensures the stability of numerical computation and exhibits a good convergence property with less computation time. Typical steady-state convergence accelerating schemes such as local time stepping, residual smoothing and multigrid combined with dual time stepping shows good convergence properties. Numerical results are presented for unsteady laminar flow past a cylinder and turbulent shock buffeting problem for bicircular arc cascade flow is discussed.

• Journal of electromagnetic engineering and science
• /
• 제6권3호
• /
• pp.147-154
• /
• 2006

In this paper, we propose and present implementation results of a high-speed turbo decoding algorithm. The latency caused by (de) interleaving and iterative decoding in a conventional maximum a posteriori(MAP) turbo decoder can be dramatically reduced with the proposed design. The source of the latency reduction is come from the combination of the radix-4, dual-path processing, parallel decoding, and rearly-stop algorithms. This reduced latency enables the use of the turbo decoder as a forward error correction scheme in real-time wireless communication services. The proposed scheme results in a slight degradation in bit-error rate(BER) performance for large block sizes because the effective interleaver size in a radix-4 implementation is reduced to half, relative to the conventional method. Fixed on the parameters of N=212, iteration=3, 8-states, 3 iterations, and QPSK modulation scheme, we designed the adaptive high-speed turbo decoder using the Xilinx chip (VIRTEX2P (XC2VP30-5FG676)) with the speed of 17.78 Mb/s. From the results, we confirmed that the decoding speed of the proposed decoder is faster than conventional algorithms by 8 times.