• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.12C
• /
• pp.1224-1231
• /
• 2006

This paper proposes a fast encoding algorithm of H.264/AVC multi-view video coding. The amount of data to be encoded for a multi-view video is much more than normal video's data, and the amount of information to be predicted is enormous because of the multi-view video coding uses inter-disparity prediction in addition to inter-motion prediction in conventional video coding. We noticed through an experiment that the efficiency of prediction is getting better in order of intra, inter-disparity, inter-motion, and inter-skip, and proposes a early termination algorithm by means of estimate the adaptive threshold within a GOP unit. In the experiments, the proposed algorithm shows improved processing speed about 32% compared to existing method, and increased amount of bits and distortions are relatively disregardable.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.45 no.1
• /
• pp.1-6
• /
• 2008

There are many possible representations in denoting both positive and negative numbers in the binary number system to be applicable to the complexity of the hardware implementation, arithmetic speed, appropriate application, etc. Among many possibilities, the signed-magnitude representation, which keeps one sign bit and magnitude bits separately, is intuitively appealing for humans, conceptually simple, and easy to negate by flipping the sign bit. However, in the signed-magnitude representation, the actual arithmetic operation to be performed may require magnitude comparison and depend on not only the operation but also the signs of the operands, which is a major disadvantage. In a simple conceptual approach, addition/subtraction of two signed-magnitude numbers, requires comparator circuits, selective pre-complement circuits, and the adder circuits. In this paper circuits to obtain the difference of two numbers are designed without adopting explicit comparator circuits. Then by using the difference circuits, a universal signed-magnitude adder/subtracter is designed for the most general operation on two signed numbers.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.7
• /
• pp.99-108
• /
• 2008

For video compression, we have to consider two performance factors that are the search speed and coded video's quality. In this paper, we propose an enhanced fast block matching algorithm using the spatial correlation of the video sequence and the center-biased characteristic of motion vectors(MV). The proposed algorithm first finds a predicted motion vector from the adjacent macro blocks of the current frame and determines an exact motion vector using the cross pattern and a flat hexagon search pattern. From the performance evaluations, we can see that our algorithm outperforms both the hexagon-based search(HEXBS) and the cross-hexagon search(CHS) algorithms in terms of the search speed and coded video's quality. Using our algorithm, we can improve the search speed by up to 31%, and also increase the PSNR(Peak Signal Noise Ratio) by at most 0.5 dB, thereby improving the video quality.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.5
• /
• pp.1042-1050
• /
• 2014

The performance of underwater acoustic(UWA) communication system is sensitive to the Inter-Symbol Interference(ISI) due to delay spread develop of multipath signal propagation. And due to limited frequency using acoustic wave, UWA is a low transmission rate. Thus, it is necessary technique of Space-time code, equalizer and channel code to improve transmission speed and eliminate ISI. In this paper, UWA communication system were analyzed by simulation using these techniques. In the result of simulation, the proposed Turbo Equalization method based on layered Space Time Codes has improved performance compared to conventional UWA communication.

• KIPS Transactions on Software and Data Engineering
• /
• v.2 no.7
• /
• pp.495-502
• /
• 2013

Motion estimation (ME) that limits the performance of image quality and encoding speed has been developed to reduce temporal redundancy in video sequences and plays an important role in digital video compression. But it is computational demanding part of the encoder. Multi-view video is obtained by capturing one three-dimensional scene with many cameras at different positions. ME for Multi-view video requires high computational complexity. To reduce computational complexity and maintain the image quality, a fast motion estimation method is proposed in this paper. The proposed method uses a hierarchical search strategy. This strategy method consists of modified diamond search patten, multi gird diamond search pattern, and raster search pattern. These search patterns place search points symmetrically and evenly that can cover the overall search area not to fall into the local minimum or exploits the characteristics of the distribution of motion vectors to place the search points. Experiment results show that the speedup improvement of the proposed method over TZ search method (JMVC) can be up to 1.2 ~3 times faster while maintaining similar video quality and bit rates.

• Journal of Korea Multimedia Society
• /
• v.16 no.5
• /
• pp.539-548
• /
• 2013

Although Motion estimation (ME) plays an important role in digital video compression, it requires a complicated search procedure to find an optimal motion vector. Multi-view video is obtained by capturing one three-dimensional scene with many cameras at different positions. The computational complexity of motion estimation for Multi-view video coding increases in proportion to the number of cameras. To reduce computational complexity and maintain the image quality, a low complexity motion estimation search method is proposed in this paper. The proposed search method consists of four-grid diamond search patten, two-gird diamond search pattern and TZ 2 Point search pattern. These search patterns exploit the characteristics of the distribution of motion vectors to place the search points. Experiment results show that the speedup improvement of the proposed method over TZ search method (JMVC) can be up to 1.8~4.5 times faster by reducing the computational complexity and the image quality degradation is about to 0.01~0.24 (dB).

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.5
• /
• pp.39-47
• /
• 2007

In this thesis, a method of generating an adaptable Region-Of-Interest(ROI) Mask for the Region-Of-Interest coding is suggested. In the method, an ROI Mask is generated using the information of the ROI designated by a user. In the existed method of ROI coding, after scanning all the pixels in order and discriminating an ROI, an ROI Mask is generated. But, in our method, after scanning a part of pixels based on the shape pattern of an ROI and discriminating a ROI by one code block unit, an ROI Mask is generated. Moreover, from the method, a pattern number, threshold of a ROI and background threshold parameter are provided. According to the result of its comparing test with the existed methods to show the usability, it is proved that our method is superior in speed to the existed ones.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.11a
• /
• pp.11-14
• /
• 2009

기존의 반이중방식 단방향 중계 네트워크는 하나의 정보를 두 개의 시간 슬롯 동안에 보내므로 주파수 효율에서 감소가 생기게 된다. 이러한 주파수 효율의 감소를 막기 위해 제안된 양방향 중계 네트워크는 중계기에 중첩 부호화 또는 네트워크 부호화를 적용함으로써 단방향 중계 네트워크에 비해 향상된 주파수 효율을 제공한다. 한편, OFDMA 네트워크는 사용자에게 부반송파, 전력 등의 자원을 적응적으로 할당하여 네트워크의 성능 향상을 얻을 수 있다. 본 논문에서는 다중사용자 다중중계기 양방향 OFDMA 중계 네트워크를 위한 새로운 적응적 부반송파 할당 알고리듬을 제안한다. 먼저 모든 사용자 쌍에 대한 달성 합 전송속도(achievable sum-rate over all user pairs)를 최대화하기 위한 최적화 문제를 정형화한다. 시스템의 수명을 늘이고 각 사용자의 최소 전송속도를 보장하기 위해 공정성 제한을 고려한다. 그리고 이로부터 새로운 적응적 부반송파 할당 알고리듬을 제안한다. 모의실험을 통해 제안된 알고리듬이 정적 알고리듬과 그리디 알고리듬, 두 알고리듬 모두 보다 훨씬 낮은 불능확률을 얻음을 확인한다.

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

기존의 반이중방식 단방향 중계 네트워크는 하나의 정보를 두 개의 시간 슬롯 동안에 보내므로 추가적인 자원을 필요로 하며 이로 인해 주파수 효율에서 감소가 생기게 된다. 이러한 주파수 효율의 감소를 막기 위해 제안된 양방향 중계 네트워크는 중계기에 중첩 부호화 또는 네트워크 부호화를 적용함으로써 기존의 단방향 중계 네트워크에 비해 향상된 주파수 효율을 제공한다. 한편, OFDMA 네트워크는 사용자에게 부반송파, 전력 등의 자원을 적응적으로 할당하여 네트워크의 성능 향상을 얻을 수 있다. 본 논문에서는 복호 후 전송 중계 기법을 사용하는 양방향 OFDMA 중계 네트워크를 위한 적응적 부반송파 할당 알고리즘을 제안한다. 제안된 알고리즘은 각 사용자 쌍의 최소 전송속도를 보장하며 모든 사용자 쌍에 대한 달성 합 전송속도를 최대화 하기 위해 부반송파를 사용자 쌍과 중계기에 적응적으로 할당한다. 모의실험을 통해 제안된 알고리즘이 정적 알고리즘과 그리디 알고리즘, 두 알고리즘 모두 보다 훨씬 낮은 불능확률을 얻음을 확인한다.

• Journal of Broadcast Engineering
• /
• v.15 no.6
• /
• pp.783-790
• /
• 2010

A two-way relay network provide improved spectral efficiency compared with a conventional one-way relay network by using either superposition coding or network coding. OFDMA network provides imptoved performance by adaptive resource allocation. In this paper, we propose a adaptive subcarrier allocation for a multiuser two-way OFDMA relay network. In the proposed algorithm, subcarriers are allocated to the user-pairs and relays to maximize the achievable sum-rate over all user-pairs while satisfying the minimum rate requirement for each user-pair. Simulation results show that the proposed algorithm provides improved performance compared with the static and greedy algorithms.