• Journal of Biomedical Engineering Research
• /
• v.25 no.6
• /
• pp.589-598
• /
• 2004

We propose a new algorithm to extract the fetal electrocardiogram (FECG) from a multi-channel electrocardiogram (ECG) recorded at the chest and abdomen of a pregnant woman. To extract the FECG from the composite abdominal ECG, the classical time-domain method based on singular value decomposition (SVD) has been generally used. However, this method has some disadvantages, such as its high degree of computational complexity and the necessary assumption that vectors between the FECG and the maternal electrocardiogram (MECG) should be orthogonal. The proposed algorithm, which uses SVD in a discrete cosine transform (DCT) domain, compensates for these disadvantages. To perform SVD with lower computational complexity, DCT coefficients corresponding to high-frequency components were eliminated on the basis of the properties of the DCT coefficients and the frequency characteristics of the FECG. Moreover, to extract the pure FECG with little influence of the direction of the vectors between the FECG and MECG, three new channels were made out of the MECG suppressed in the composite abdominal ECG, and the new channels were appended to the original multi-channel ECG. The performance of the proposed algorithm and the classical time-domain method based on SVD were compared using simulated and real data. It was experimentally verified that the proposed algorithm can extract the pure FECG with reduced computational complexity.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.10
• /
• pp.2091-2101
• /
• 1997

Conventional method for fractal image decoding requires high-degree computational complexity in decoding propocess, because of iterated contractive transformations applied to whole range blocks. In this paper, we propose a fast decoding algorithm of fractal image using data depence in order to reduce computational complexity for iterated contractive transformations. Range of reconstruction image is divided into a region referenced with domain, called referenced range, and a region without reference to domain, called unreferenced range. The referenced range is converged with iterated contractive transformations, and the unreferenced range can be decoded by convergence of the referenced range. Thus the unreferenced range is called data dependence region. We show that the data dependence region can be deconded by one transformation when the referenced range is converged. Consequently, the proposed method reduces computational complexity in decoding process by executing iterated contractive transformations for the referenced range only.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.8C
• /
• pp.790-800
• /
• 2009

For the improvement of coding efficiency, the H.264/AYC standard uses new coding tools such as 1/4-pel-accurate motion estimation, multiple references, intra prediction, loop filter, variable block size etc. Using these coding tools, H.264/AYC has achieved significant improvements from rate-distortion point of view compared to existing standards. However, the encoder complexity was greatly increased due to these coding tools. We focus on the complexity reduction method of intra macroblock mode selection. The proposed algorithm for fast intra mode selection calculates the edge activity in transform domain, and performs fast encoding of intra frame in H.264/AYC through the fast prediction mode selection of intra4x4 and chrominance blocks. Simulation results show that the proposed method saves about 59.76% for QCIF sequences and 65.03% for CIF sequences of total encoding time, while bitrate increase and PSNR decrease are very small.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.8A
• /
• pp.583-591
• /
• 2009

OFDM(orthogonal frequency division multiplexing) signal with high PAPR(peak to average power ratio) produces the nonlinear distortion and/or decreases down the power efficiency of HPA(high power amplifier). So, the IMD(inter-modulation distortion) reduction method was proposed to reduce the nonlinear distortion, which shows better BER(bit error rate) performance than the PAPR reduction methods. However, IMD reduction method has inherent problem which system complexity and processing time increases because the FFT(fast Fourier transform) processor is added in transmitter and decision criterion of IMD reduction method is computed in frequency domain,. In this paper, therefore, we propose a new IMD reduction method to reduce the computational complexity and structure of IMD computation. And we apply this proposed method into OFDM system using PTS(partial transmit sequence) scheme and compare the computational complexity between conventional and proposed IMD reduction method. This method can reduce the system size and computational complexity. Also, the proposed has almost same BER performance with the conventional IMD reduction method.

• Journal of Satellite, Information and Communications
• /
• v.6 no.1
• /
• pp.86-96
• /
• 2011

In this paper we propose a Pre-rake system applied with a frequency domain equalizer in TDD/CDMA multi-code transmission. The Pre-rake system has been well known technique in TDD/CDMA to make a receiver simple. However, it still has residual losses of path diversity and signal to noise ratio (SNR). However, gathering all the residual paths demands an additional hardware such as a rake combiner at the receiver. For the reason Pre/Post-rake system has already been proposed at up/downlink correlated channel conditionunder the assumption of noisier channel. There is a trade-off between the first purpose of Pre-rake that makes hardware simple at the receiver and the performance improvement. From the point the frequency domain equalizer (FDE) can be considered in Pre/Post-rake to supply the receiver with the flexible equalizing methods with rather reduced complexity compared with time domain rake combiner or equalizers. Pre-rake itself increases the number of multipath, which results from the convolution of Pre-rake filter and wireless channel, and FDE must be well matched to Pre/Post-rake, while it considers the relationship of hardware complexity and the performance. In this paper, the Pre-rake/Post-FDE system is introduced at TDD/CDMA multi-code transmission. In addition, the cyclic prefix reduction method in the proposed system is introduced, and the theoretical analysis to the proposed system is given by assuming Gaussian approximation, and finally the numerical simulation results are provided.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.3C
• /
• pp.158-166
• /
• 2005

Even though post-processing methods based on projections onto convex sets (POCS) have shown good performance for blocking artifact reduction, it is infeasible to implement POCS for real-time practical applications. This paper proposes DCT domain post-processing method based on POCS. The proposed method shows very similar performance compared to the conventional POCS method, while it reduces tremendously the computational complexity. DCT domain POCS performs the lowpass filtering in the DCT domain, and it removes the inverse DCT and forward DCT modules. Through the investigation of lowpass filtering in the iterative POCS method, we define kth order lowpass filtering which is equivalent to the lowpass filtering in the kth iteration, and the corresponding kth order DCT domain POCS. Simulation results show that the kth order DCT domain POCS without iteration gives very similar performance compared to the conventional POCS with k iterations, while it requires much less computations. Hence the proposed DCT domain POCS method can be used efficiently in the practical post-processing applications with real-time constraints.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.11C
• /
• pp.917-924
• /
• 2008

Motion estimation and compensation in the spatial domain check the searching area of specified size in the previous frame and search block to minimize the difference with current block. When we check the searching area, it consumes the most encoding times due to increasing the complexity. We can solve this fault by means of motion estimation using shifting matrix in the transform domain instead of the spatial domain. We derive so the existed shifting matrix to a new recursion equation that we decrease more computations. We modify simply vertical shifting matrix and horizontal shifting matrix in the transform domain for motion estimation of half-pixel accuracy. So, we solve increasing computation due to bilinear interpolation in the spatial domain. Simulation results prove that motion estimation by the proposed algorithm in DCT-based transform domain provides higher PSNR using fewer bits than results in the spatial domain.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.6
• /
• pp.990-996
• /
• 2015

This paper proposes an enhanced scheme adding a sign detector at the front of the correlator in STDR (sequence time domain reflectometry) system. We have executed simulations to show the improvement of detection performance in two fault types and various fault locations. Consequently, it can be shown that the proposed scheme improves the detection performance of the location of far-fault without increasing the computational complexity.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.3 s.333
• /
• pp.9-14
• /
• 2005

OFDM(Orthogonal Frequency Division Multiplexing) is widely used in wideband wireless communication systems due to its excellent performance. However, OFDM has a disadvantage of high peak-to-average power ratio and SC-FDE(Single-Carrier with Frequency-Domain Equalization) was introduced to overcome the drawback. SC-FDE is less sensitive to nonlinear power amplifiers than OFDM while its complexity and performance is comparable. This paper proposes a frequency diversity technique for single-antenna BPSK SC-FDE systems using repeated QPSK transmissions with rearranged transmission patterns.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.7
• /
• pp.1437-1446
• /
• 2012

In this paper we propose a new stereo matching algorithm which is suitable for application to obtain depth information with high-speed in stereoscopic camera environment. For satisfying these condition we propose a new adaptive stereo matching technique using frequency information in discrete wavelet (DWT) domain and variable matching window. The size of the matching window is selected by analysis of the local property of the image in spatial domain and the feature and scaling factor of the matching window is selected by the frequency property in the frequency domain. For using frequency information we use local DWT and global DWT. We identified that the proposed technique has better peak noise to signal ratio (PSNR) than the fixed matching techniques with similar complexity.