• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.6B
• /
• pp.1082-1091
• /
• 2000

In this paper, the efficient equalization method for OFDM(Orthogonal Frequency Division Multiflexing) System using the QAM(Quadrature Amplitude Modulation) in multipath fading channel is proposed in order to faster and more efficiently equalize the received signals that are sent over real channel. In generally, the one-tap linear equalizers have been used in the frequency-domain as the existing equalization method for OFDM system. In this technique, if characteristics of the channel are changed fast, the one-tap linear equalizers cannot compensate for the distortion due to time variant multipath channels. Therefore, in this paper, we use one-tap non-linear equalizers instead of using one-tap linear equalizers in the frequency-domain, and also use the linear equalizer in the time-domain to compensate the rapid performance reduction at the low SNR(Signal-to-Noise Ratio) that is the disadvantage of the non-linear equalizer. In the frequency-domain, when QAM signals, consisting of in-phase components and quadrature (out-phase) components, are sent over the complex channel, the only in-phase and quadrature components of signals distorted by the multipath fading are changed the same as signals distorted by the noise. So the cross components are canceled in the frequency-domain equalizer. The time-domain equalizer and the adaptive algorithm that has lower-error probability and fast convergence speed are applied to compensate for the error that is caused by canceling the cross components in the frequency-domain equalizer. In the time-domain, To compensate for the performance of frequency-domain equalizer the time-domain equalizes the distorted signals at a frame by using the Gold-code as a training sequence in the receiver after the Gold-codes are inserted into the guard signal in the transmitter. By using the proposed equalization method, we can achieve faster and more efficient equalization method that has the reduced computational complexity and improved performance.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.43 no.11 s.353
• /
• pp.26-36
• /
• 2006

In this paper, we propose a cost-effective color filter may (CFA) demosaicing method for digital still cameras in which a single CCD or CMOS image sensor is used. Since a CFA is adopted, we must interpolate missing color values in the red, green and blue channels at each pixel location. While most state-of-the-art algorithms invest a great deal of computational effort in the enhancement of the reconstructed image to overcome the color artifacts, we focus on eliminating the color artifacts with low computational complexity. Using spatial correlation of the adjacent pixels, the edge-directional information of the neighbor pixels is used for determining the edge direction of the current pixel. We apply our method to the state-of-the-art algorithms which use edge-directed methods to interpolate the missing color channels. The experiment results show that the proposed method enhances the demosaiced image qualify from $0.09{\sim}0.47dB$ in PSNR depending on the basis algorithm by removing most of the color artifacts. The proposed method was implemented and verified successfully using verilog HDL and FPGA. It was synthesized to gate-level circuits using 0.25um CMOS standard cell library. The total logic gate count is 12K, and five line memories are used.

• Journal of Korea Multimedia Society
• /
• v.14 no.5
• /
• pp.669-680
• /
• 2011

R-trees are widely used in various areas such as geographical information systems, CAD systems and spatial databases in order to efficiently index multi-dimensional data. As data sets used in these areas grow in size and complexity, however, range query operations on R-tree are needed to be further faster to meet the area-specific constraints. To address this problem, there have been various research efforts to develop strategies for acceleration query processing on R-tree by using the buffer mechanism or parallelizing the query processing on R-tree through multiple disks and processors. As a part of the strategies, approaches which parallelize query processing on R-tree through Graphics Processor Units(GPUs) have been explored. The use of GPUs may guarantee improved performances resulting from faster calculations and reduced disk accesses but may cause additional overhead costs caused by high memory access latencies and low data exchange rate between GPUs and the CPU. In this paper, to address the overhead problems and to adapt GPUs efficiently, we propose a novel approach which uses a GPU as a buffer to parallelize query processing on R-tree. The use of buffer algorithm can give improved performance by reducing the number of disk access and maximizing coalesced memory access resulting in minimizing GPU memory access latencies. Through the extensive performance studies, we observed that the proposed approach achieved up to 5 times higher query performance than the original CPU-based R-trees.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.18 no.12
• /
• pp.126-134
• /
• 2017

There have been numerous studies on extracting the R-peak from electrocardiogram (ECG) signals. However, most of the detection methods are complicated to implement in a real-time portable electrocardiograph device and have the disadvantage of requiring a large amount of calculations. R-peak detection requires pre-processing and post-processing related to baseline drift and the removal of noise from the commercial power supply for ECG data. An adaptive filter technique is widely used for R-peak detection, but the R-peak value cannot be detected when the input is lower than a threshold value. Moreover, there is a problem in detecting the P-peak and T-peak values due to the derivation of an erroneous threshold value as a result of noise. We propose a robust R-peak detection algorithm with low complexity and simple computation to solve these problems. The proposed scheme removes the baseline drift in ECG signals using an adaptive filter to solve the problems involved in threshold extraction. We also propose a technique to extract the appropriate threshold value automatically using the minimum and maximum values of the filtered ECG signal. To detect the R-peak from the ECG signal, we propose a threshold neighborhood search technique. Through experiments, we confirmed the improvement of the R-peak detection accuracy of the proposed method and achieved a detection speed that is suitable for a mobile system by reducing the amount of calculation. The experimental results show that the heart rate detection accuracy and sensitivity were very high (about 100%).