• Journal of Broadcast Engineering
• /
• v.12 no.3
• /
• pp.278-288
• /
• 2007

We propose the fast full search algorithm that reduces the computational load of the block matching algorithm which is used for a motion estimation in the video coding. Since the conventional spiral search method starts searching at the center of the search window and then moves search point to estimate the motion vector pixel by pixel, it is good for the slow motion picture. However we proposed the efficient motion estimation method which is good for the fast and slow motion picture. Firstly, when finding the initial threshold value, we use the expanded predictor that can approximately calculate minimum threshold value. The proposed algorithm estimates the motion in the new search order after partitioning the search window and adapt the directional search order in the re-divided search window. At the result, we can check that the proposed algorithm reduces the computational load 94% in average compared to the conventional spiral full search algorithm without any loss of image quality.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.6
• /
• pp.54-62
• /
• 2007

In this paper, we significantly reduces the amount of computation for intra 16$\times$16 mode decision in H.264 by applying the fast algorithm, which obtains the transformed prediction residual with fewer computations. By extending the existing intra 4$\times$4 mode decision, we propose the new algorithm for fast intra 16$\times$16 mode decision. The proposed algorithm uses partial transform coefficients which consist of one DC and three adjacent AC coefficients after 4$\times$4 transform in the intra 16$\times$16 mode decision. Theoretical analysis and experimental results show that the proposed algorithm can reduce computations up to 50% in the intra 16$\times$16 mode decision process with unnoticeable degradation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.10A
• /
• pp.962-968
• /
• 2002

Reliable high-speed data communications over insufficient channel bandwidth is one of the major challenges of harsh wireless environments that push the achievable spectral efficiency far below its theoretical limits. A Quadrature amplitude modulation (QAM) scheme is a userful modulation technique for achieving high data rate transmission without increasing the bandwidth of wireless communication systems. The exact general bit error rate (BER) expression of arbitrary rectangular quadrature amplitude modulation has not yet been derived. In this paper, a generalized closed-form expression for the BER performance of rectangular QAM with Gray code bit mapping is derived and analyzed in the presence of additive white Gaussian noise (AWGN) channel. First we analyze the BER performance of an I-ary PAM scheme. Regular patterns in the k-th bit error probability are observed while developing the EBR expression. From these patterns we provide the exact and general closed-from EBR expression of an I-ary PAM. Then we present a general closed-from expression for BER of an arbitrary IXJ rectangular QAM by considering that this signaling format consists of two PAM scheme, i.e., I-ary and J-ary PAM. A simple approximate BER expression for rectangular QAM is given as well.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.1C
• /
• pp.9-15
• /
• 2007

We propose the fast full search algorithm that reduces the computation of the block matching algorithm which is used for motion estimation of the video coding. Since the conventional spiral search method starts searching at the center of the search window and then moves search point to estimate the motion vector pixel by pixel, it is good for the slow motion pictures. However the proposed method is good for the fast and slow motion because it estimates the motion in the new search order after partitioning the search window. Also, when finding the motion vector, this paper presents the method that reduces the complexity by computing the matching error in the order which is determined by local image complexity. The proposed algorithm reduces the computation up to 99% for block matching error compared with the conventional spiral full search algorithm without any loss of image quality.

• Journal of Broadcast Engineering
• /
• v.9 no.4 s.25
• /
• pp.434-445
• /
• 2004

Motion Estimation is an essential module in video encoders based on international standards such as H.263 and MPEG. Many fast motion estimation algorithms have been proposed in order to reduce the computational complexity of a well-known full search algorithms(FS). However, these fast algorithms can not work efficiently in DSP processors recently developed for video processing. To solve for this. we propose an efficient motion estimation scheme optimized in the DSP processor like Philips TM1300. A motion vector predictor is pre-estimated and a small search range is chosen in the proposed scheme using strong motion vector correlation between a current macro block (MB) and its neighboring MB's to reduce computation time. An MPEG-4 SP@L3(Simple Profile at Level 3) encoding system is implemented in Philips TM1300 to verify the effectiveness of the proposed method. In that processor, we can achieve better performance using our method than other conventional ones while keeping visual quality as good as that of the FS.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.14 no.1
• /
• pp.402-410
• /
• 2013

In this paper, we propose a new fast block matching algorithm for block matching using the temporal and spatially correlation of the video sequence and local statistics of neighboring motion vectors. Since the temporal correlation of the video sequence between the motion vector of current block and the motion vector of previous block. The proposed algorithm determines the location of a better starting point for the search of an exact motion vector using the point of the smallest SAD(sum of absolute difference) value by the predicted motion vectors of neighboring blocks around the same block of the previous frame and the current frame and the predictor candidate point on each division region by binary-tree structure. Experimental results show that the proposed algorithm has the capability to dramatically reduce the search points and computing cost for motion estimation, comparing to fast FS(full search) motion estimation and other fast motion estimation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.9A
• /
• pp.1313-1321
• /
• 2000

In recent years LEO(Low Earth Orbit) satellite communication systems have gained a lot of interest as high speed multimedia services by satellite are about to be provided. It is mandatory to use very efficient ECC(Error Correcting Code) to support high speed multimedia services over LEO satellite channel. Turbo codes developed by Berrou et al. in 1993 have been actively researched since it can achieve a performance close to the Shannon limit. In this paper, a LEO satellite channel model is adopted and the fading characteristics of LEO satellite channel are analyzed for the change of elevation angle in various propagation environments. The performance of turbo code is analyzed and compared to that of conventional convolutional code using the satellite channel model. In the simulation results using the Globalstar orbit constellations, performance of turbo codes shows 1.0~2.0dB coding gain compared to that of convolutional codes over all elevation angle and propagation environment ranges we have investigated. The performance difference resulting from the change of elevation angle in various propagation environments and the performance of different ECC are analyzed in detail, so that the results can be applied to choose an appropriate ECC scheme for various system environment.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.10C
• /
• pp.923-929
• /
• 2003

Turbo processing have been known as methods close to Shannon limit in the aspect of wireless multi-input multi-output (MIMO) communications similarly to wireless single antenna communication. The iterative processing can maximize the mutual effect of coding and interference cancellation, but LDPC coding has not been used for turbo processing because of the inherent decoding process delay. This paper suggests a LDPC coded MIMO system with turbo parallel space-time (Turbo-PAST) processing for high-speed wireless communications and proposes a average soft-output syndrome (ASS) check scheme at low signal to noise ratio (SNR) for the Turbo-PAST system to decide the reliability of decoded frame. Simulation results show that the suggested system outperforms conventional system and the proposed ASS scheme effectively reduces the amount of turbo processing iterations without performance degradation from the point of average number of iterations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.6C
• /
• pp.883-892
• /
• 2004

Recently, in order to improve high speed data transmission and spectral efficiency in wireless communication systems, the study on the combination OFDM and space-time coding is active. Also, a solution to improve system capacity in multiuser systems is to use adaptive antennas. In a system using STBC, the signals transmitted from two transmit antennas are superposed at the receive antenna and the interference between two transmit antennas of a user occures. Thus it is difficult to apply the conventional beamforming techniques for single antenna to the systems using space-time coding. In this Paper, we present the MMSE beanforming technique using training sequence for STBC-OFDM systems in reverse link and evaluate the performance by using various parameters in TU and HT channels.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.5 s.335
• /
• pp.13-22
• /
• 2005

IEEE 802.11a is a standard for the high-speed wireless local area network (WLAN), supporting from 6 up to 54 Mbps in a 5 GHz band. We propose a channel equalization algerian and a sampling clock recovery algorithm by utilizing the Viterbi decoder output of the IEEE 802.11a WLAN standard. The proposed channel equalizer adaptively compensates channel variations. The proposed system uses re-encoded Viterbi decoder outputs as reference symbols for the adaptation of the channel equalizer. It also extracts sampling phase information with the Viterbi decoder outputs for fine adjustment of the sampling clock. The proposed sampling clock recovery and equalizer are more robust to noise and frequency selective fading environments than conventional systems using only four pilot samples.