• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.3 s.357
• /
• pp.61-67
• /
• 2007

In Reed Solomon decoder, when there are more than 4 error symbols, we usually use Chien search machine to find those error positions. In this case, classical method requires complex and relatively slow digital circuitry to implement it. In this paper we propose New fast and cost effective Chien search machine design method using Galois Subfield transformation. Example is given to show the method is working well. This new design can be applied to the case where there are more than 5 symbol errors in the Reed-Solomon code word.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.1
• /
• pp.161-169
• /
• 1996

This paper presents a new search region prediction method using vector quantization for the motion estimation. We find motion vectors using the full search BMA from two successive frame images first. Then the motion vectors are used for training a codebook. The trained codebook is the predicted search region. We used the unsupervised neural network for VQ encoding and codebook design. A major advantage of formulating VQ as neural networks is that the large number of adaptive training algorithm that are used for neural networks can be applied to VQ. The proposed method reduces the computation and reduce the bits required to represent the motion vectors because of the smaller search points. The computer simulation results show the increased PSNR as compared with the other block matching algorithms.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.2 s.46
• /
• pp.131-139
• /
• 2007

This paper proposed a multi-resolution algorithm. Its search point and complexity were compared with those of block match algorithm. Also the speed up comparison was made with the block match algorithm. The proposed multi-resolution NTSS-3 Level algorithm was compared again with its targets, TSS-3 Level algorithm and NTSS algorithm. The comparison results showed that the NTSS-3 Level algorithm was superior in search point and speed up. Accordingly, the proposed NTSS-3 Level algorithm was two to three times better in search point and two to four times better in complexity calculation than those of the compared object, the block match algorithm. In speed up, the proposed NTSS-3 Level algorithm was two times better. Accordingly, the proposed multi-resolution NTSS-3 Level algorithm showed PSNR ration portion excellency in search point and speed up.

• Journal of the Korea Computer Industry Society
• /
• v.5 no.9
• /
• pp.987-992
• /
• 2004

There is the temporal correlation of the video sequence between the motion vector of current block and the motion vector of previous block. In this paper, we propose the improved diamond search pattern using an motion vector prediction candidate search point by the predicted motion information from the same block of the previous frame. Simulation results show that PSNR(Peak-to-Signal Noise Ratio) values are improves as high as high as 14~24% in terms of average number of search point per motion vector estimation and improved about 0.02~0.37dB on an average except the full search(FS) algorithm.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2010.07a
• /
• pp.104-107
• /
• 2010

본 논문은 H.264/AVC 디코더의 하드웨어 구현 시 가장 많은 시간을 소비하는 부분이 움직임 추정기를 하드웨어로 구현하였다. 움직임 추정을 함에 있어서 외부메모리 Access 량을 줄이고, SAD연산을 수행할 때 Clock의 손실 없이 계산을 하는 움직임 예측기를 제안한다. 제안한 구조는 재탐색 구간에서 이전 탐색 범위와 공통부분을 이루는 부분을 레지스터에 따로 저장해 두었다가, 재탐색시에 이전 Data를 사용하는 방법을 이용하였다. 움직임 추정을 수행할 때의 SAD (Sum of absolute differences)연산 부분과 Adder-tree를 묶은 PU Array와 SAD 누적기, 선택기를 Pipelining을 통하여 Clock의 손실 없이 연속적으로 계산하는 움직임 예측기를 설계하였다. 구현한 하드웨어는 최대 446.43MHz의 주파수에서 동작할 수 있었고, 탐색영역 64${\times}$64, 참조 프레임 3, 그리고 영상크기 1920${\times}$1080 기준으로 구현한 결과 50 프레임을 처리할 수 있는 성능을 보였다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2003.11a
• /
• pp.43-46
• /
• 2003

본 논문에서는 영상의 특성을 이용하여 TM1300 미디어 프로세서에 적합한 효율적인 움직임 탐색방법을 제안한다. 주위 블록간의 공간 상관 관계를 이용해 예측 움직임 벡터를 구하고 이를 기준으로 탐색 영역을 축소하여 전체 연산량을 줄인다. TMI1300의 특성을 활용하여 메모리 사용 효율 증대 및 비교, 분기의 사용을 줄여 최적화에 유리한 움직임 예측 방법을 제안한다. 제안된 방법을 Philips 140 MHz IM1300 상의 MPEG-4 SP@L3 (Simple Profile Level 3) 부호화기에 적용한 결과 화질은 전역 탐색 방법에 근접하며 기존의 고속 움직임 예측 방법에 비해 메모리 접근 및 처리 속도 면에서 향상된 성능을 보였다.

• The KIPS Transactions:PartB
• /
• v.11B no.6
• /
• pp.633-644
• /
• 2004

In this paper, we notice that the original NTSS algorithm can be proposed as the NTSS-3 Level algorithm by the multi-resolution technique. The fast block matching algorithm affects the speed by the patten combination and this paper proposes the block matching algorithm in different levels by multi-resolution technique, quite different from the original NTSS Patten. The block matching algorithm requires the multi-candidate to reduce the occurrence of low-image quality by the local minima problem. The simulation result compared to FS shows search speed 16 times quicker, and the PSNR 0.11-0.12［dB］ gets improved Image quality compared to the original fast block matching algorithm NTSS, and the speed is improved up to 0.1 times for improved image by the search point portion.

• Journal of Korea Multimedia Society
• /
• v.4 no.5
• /
• pp.390-395
• /
• 2001

In this paper, we propose a fast warping prediction using bit-pattern for motion estimation. Because of the spatial dependency between motion vectors of neighboring node points carrying motion information, the optimization of motion search requires an iterative search. The computational load stemming from the iterative search is one of the major obstacles for practical usage of warping prediction. The motion estimation in the proposed algorithm measures whether the motion content of the area is or not, using bit-pattern. Warping prediction using the motion content of the area make the procedure of motion estimation efficient by eliminating an unnecessary searching. Experimental results show that the proposed algorithm can reduce more 75% iterative search while maintaining performances as close as the conventional warping prediction.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.1 s.307
• /
• pp.1-8
• /
• 2006

This paper presents a fast full search algorithm for motion estimation applicable to multiple reference images. The proposed method is an extended version of the rate constrained successive elimination algorithm (RSEA) for multiple reference frame applications. We will show that motion estimation for the reference images temporally preceding the first reference image can be less intensive in computation compared with that for the first reference image. for computational reduction, we will drive a new condition to lead the smaller number of candidate blocks for the best matched block. Simulation results explain that our method reduces computation complexity although it has the same quality as RSEA.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.3
• /
• pp.594-600
• /
• 2017

This paper proposes a global search based motion estimation algorithm for high performance HEVC encoder and its hardware architecture. To eliminate temporal redundancy, motion estimation in HEVC inter-view prediction uses global search and fast search algorithm to search for a predicted block having a high correlation with the current PU in an interpolated reference picture. The global search method predicts the motion of all candidate blocks in a given search area, thus ensuring optimal results, but has a disadvantage of large computation time. Therefore we propose a new algorithm that reduces computational complexity by reusing SAD operation in global search to reduce computation time of inter prediction. As a result of applying the proposed algorithm to standard software HM16.12, the computation time was reduced by 61%, BDBitrate by 11.81%, and BDPSNR by about 0.5% compared with the existing search algorithm. As a result of hardware design, the maximum operating frequency is 255 MHz and the total number of gates is 65.1K.