• Journal of Broadcast Engineering
• /
• v.24 no.5
• /
• pp.879-891
• /
• 2019

This paper provides performance evaluations of various channel estimation schemes for Advanced Television Systems Committee (ATSC) 3.0 multiple-input multiple-output (MIMO) system under a fixed reception environment. ATSC 3.0 MIMO system can obtain high spectral efficiency and improved reception performance compared to conventional terrestrial broadcasting systems. The ATSC 3.0 MIMO defines Walsh-Hadamard and null pilot encoding algorithms and the amplitude and phase of MIMO pilots are different from those of single-input single-output pilots. At the receiver, linear and discrete Fourier transform (DFT)-based interpolations can be used for the channel estimation. This paper provides the various combinations of the interpolation schemes for channel estimation in time and frequency dimensions, and then analyzes the performance of the various combinations through the computer simulation. The results of computer simulation show that the combination of the linear interpolation in the time dimension and then DFT-based interpolation in the frequency dimension can obtain the best performance among the considered combinations.

• Journal of Broadcast Engineering
• /
• v.21 no.4
• /
• pp.552-561
• /
• 2016

In OFDM system, frequency-domain sub-carriers of a symbol generally consist of data sub-carriers and scattered pilot sub-carriers and in the receiver, channel is estimated through time-axis interpolating pilot sub-carriers of several OFDM symbols. However, time-axis interpolation fails to keep track of rapid channel variation caused by fast moving receiver. Although symbol by symbol channel estimation without time-axis interpolation enables fast estimation, the performance is severely degraded for a long delay spread channel in a single frequency networks (SFNs) because of insufficient pilot sub-carriers. In this paper, a channel estimation scheme for OFDM receiver in a fast mobile SFN channel is proposed. The proposed scheme is applied to DVB-T receiver to improve the Doppler mobile performance in SFN channel.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2002.05c
• /
• pp.371-376
• /
• 2002

본 논문은 영역 분할에 기반한 스테레오 정합에 있어서, 분할영역 내부에 존재하는 단계적인 변위의 변화를 추정할 수 있는 스테레오 정합 알고리즘에 관한 것이다. 우선, 분할영역을 효과적으로 표현할 수 있는 복수의 샘플점들을 선정한 다음에 각 샘플점 주위에 인접한 영역 내부의 미소영역을 취하여 스테레오 정함을 수행한다. 이후, 획득된 각 샘플점들의 변위를 이용하여 평면의 방정식을 통해 내부 변위를 보간함으로써 연산 시간을 감축함과 동시에 영역 내부의 단계적인 변위의 변화를 추정할 순 있다. 제안된 방법에 따르면, 분할된 영역을 사용함으로써 분할영역 자체가 구속 조건이 되어 특징 기반 기법들의 단점인 변위 보간의 문제점을 해결할 수 있다. 특히, 복수의 샘플점들 간의 변위차를 이용함으로써 영상 평면에 대해 깊이 방향으로 기울어진 영역 평면에 대한 변위의 기울기를 보간할 수 있음에 기인하여 조밀한 변위 맵을 얻을 수 있었다.

• Proceedings of the Korea Society for Simulation Conference
• /
• 1999.10a
• /
• pp.254-262
• /
• 1999

실시간 시뮬레이션에서 주어지는 다양한 종류의 불연속적인 파라미터 값을 가지는 데이터 테이블에서 실시간의 제약 하에서의 검색을 수행하기 위해서는 최적의 기법이 요구된다. 실시간의 제약 하에서 최적 기법의 기준이 되는 것은 보통의 알고리즘들과는 달리 평균 속도가 아니라 worst case에서의 속도가 된다. 검색 알고리즘 들은 iteration을 거치게 되므로 총 탐색에 걸리는 시간은 iteration의 수(logical speed)와 1 probe를 수행하는 데 걸리는 시간(실제 수행속도)의 곱으로 정의된다. 본 연구에서 총 탐색에 걸리는 시간을 이론적으로 계산한 검색 속도 기존의 수행한 수치비교시험의 결과와 대체로 일치하였고, 이분 검색법이 iteration의 수와 실제 수행시간 모두에 있어서 가장 우수하다. 한편, 검색하고자 하는 파라미터 값의 dynamics를 이용하여 주어진 데이터 테이블 내의 검색 영역을 축소시키는 dynamic-window 개념을 도입하여 검색 알고리즘의 속도를 향상시킬 수 있었다. 이 개념의 도입은 데이터 테이블의 형태에 민감한 보간 검색법(interpolation method)과 그 응용 기법들에 대해 탁월한 효과를 나타내었다. 결론적으로 일반적 데이터 테이블에 있어서는 이분 검색법이 logical speed와 실제 수행속도가 우수하고, dynamic-window 개념을 도입한 보간 검색법과 그 변형들은 logical speed가 탁월하게 향상된다.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.47 no.5
• /
• pp.100-108
• /
• 2010

An autocorrelation method is used in pitch estimation. Autocorrelation values in time and frequency domains, which have different characteristics, correspond to the pitch period and fundamental frequency, respectively. We utilize an integrated autocorrelation method in time and frequency domains. It can remove the errors of pitch doubling and having. In the time and frequency domains, pitch period and fundamental frequency have reciprocal relation to each other. Especially, fundamental frequency estimation ends up as an error because of the resolution of FFT. To reduce these artifacts, interpolation methods are applied in the integrated autocorrelation domain, which decreases pitch errors. Moreover, only for the pitch candidates found in a time domain, the corresponding frequency-domain autocorrelation values are calculated with reduced computational complexity. Using linear interpolation, we can decrease the required number of FFT coefficients by 8 times. Thus, compared to the conventional methods, computational complexity can be reduced by 9.5 times.

• Korean Journal of Agricultural and Forest Meteorology
• /
• v.24 no.4
• /
• pp.337-345
• /
• 2022

For data such as rainfall and soil moisture, it is important to obtain the values of all points required as geostatistical data. Spatial interpolation is generally performed in this process, and commercial software such as ArcGIS is often used. However, commercial software has fatal drawbacks due to its high expertise and cost. In this study, R, an open source-based environment with ArcGIS, a commercial software, was used to compare the differences according to the processing environment when performing spatial interpolation. The data for spatial interpolation was weather forecast data calculated through Land-Atmosphere Modeling Package (LAMP)-WRF model, and soil moisture data calculated for each cumulative rainfall scenario. There was no difference in the output value in the two environments, but there was a difference in user interface and calculation time. The results of spatial interpolation work in the test bed showed that the average time required for R was 5 hours and 1 minute, and for ArcGIS, the average time required was 4 hours and 40 minutes, respectively, showing a difference of 7.5%. The results of this study are meaningful in that researchers can derive the same results in a commercial software environment and an open source-based environment, and can choose according to the researcher's environment and level.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.3
• /
• pp.240-248
• /
• 2013

In this paper, we propose a super-resolution algorithm using an adaptive weighted interpolation(AWI) and discrete wavelet transform(DWT). In general, super-resolution algorithms for single-image, probability based operations have been used for searching high-frequency components. Consequently, the complexity of the algorithm is increased and it causes the increase of processing time. In the proposed algorithm, we first find high-frequency sub-bands by using DWT. Then we apply an AWI to the obtained high-frequency sub-bands to make them have the same size as the input image. Now, the interpolated high-frequency sub-bands and input image are properly combined and perform the inverse DWT. For the experiments, we use the down-sampled version of the original image($512{\times}512$) as a test image($256{\times}256$). Through experiment, we confirm the improved efficiency of the proposed algorithm comparing with interpolation algorithms and also save the processing time comparing with the probability based algorithms even with the similar performance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.7C
• /
• pp.601-609
• /
• 2012

In this paper, a limited-view CT image reconstruction method was studied to reduce the scan times and the X-ray dose for the patients. To reduce streak artifacts which is caused by insufficient number of views, we introduce a sinogram interpolation method based on image matching. Image matching is achieved using the characteristics of the neighboring views including intensity, gradient and distance between the pixels. Interpolation is performed using the image matching results.. A numerical phantom and Al-acryl phantom were used for evaluating the effectiveness of the proposed interpolation method. The results showed that streak artifacts were reduced in the reconstructed images while the details of the images were preserved. Moreover, maximum 5% improvements in terms of PSNR were observed.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.1A
• /
• pp.51-57
• /
• 2002

In this paper, a simple interpolation technique in a frequency domain is proposed for the discrete Fourier transform(DFT) algorithm. Frequency and phase resolution capabilities of the DFT algorithm can be significantly improved by the proposed interpolation technique without increase of a DFT size(the number of points for the DFT). The new technique uses a diving point in amplitude and phase spectrums. As an application, the technique can be used for joint estimation of fine frequency and phase offsets in burst mode digital transmission. Simulation results show that the joint estimator using the technique is robust to estimation errors.

• Journal of IKEEE
• /
• v.13 no.4
• /
• pp.110-115
• /
• 2009

The motion compensation is the most time-consuming and complex unit in the H.264 decoder. The performance of the motion compensation is determined by the calculation of pixel interpolation. The quarter-pixel interpolation is achieved using 6-tap horizontal or vertical FIR filters for luminance data and bilinear FIR filters for chroma data. We propose the architecture for interpolation of luminance and chroma data in H.264 decoders. It is composed of dual-channel pipelined processing elements and can interpolate integer-, half- and quarter-pixel data. The number of the processing cycles is different depending on the position. The processing elements are composed of adders and shifters to reduce the complexity while the accuracy of the pixel data are maintained. We design interpolators for luminance and chroma data using Verilog-HDL and verify the function and performance by implementing using an FPGA.