• Proceedings of the KIEE Conference
• /
• 2005.10b
• /
• pp.529-531
• /
• 2005

A block-based fast motion estimation algorithm is proposed in this paper to perform motion estimation based on the efficiently reduced search ranges in MPEG-4(ERS). This algorithm divides the search areas into several small search areas and the candidate small search area that has the lowest average of sum norm difference between current macroblock and candidate macroblock is chosen to perform block motion estimation using the Nobel Successive Elimination Algorithm (NSEA). Experimental results of the proposed algorithm show that the averaging PSNR improvement is better maximum 0.125 dB than other tested algorithms and bit saving effect is maximum 20kbps for some tested sequences in low-bit rate circumstance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.1
• /
• pp.23-36
• /
• 2016

We propose a new type of OFDM-CDMA scheme which allows large inter-user timing offset using zero correlation zone(ZCZ) code in conjunction with block spreading technique. Moreover to maximize spectral efficiency, the proposed OFDMA does not have guard time(GT). This is opposite to the trends in the conventional schemes where GT are supposed to be larger to allow larger inter-user timing offset. It is remarkable that the proposed GT-free OFDM-CDMA scheme completely cancels inter-user interference in the multipath fading simply by despreading process. This inter-user interference-free feature still remains even there exist inter-user timing offsets as large as multiple OFDM symbols. Although the self-user interference exists due to no GT, it can be effectively suppressed by simple successive interference cancellation(SIC) from the first symbol in spread block as it is free from inter symbol interference(ISI).

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.4
• /
• pp.350-359
• /
• 2013

In this paper, Inter user interference elimination algorithm based on Block Diagonal Geometric Mean Decomposition(BD-GMD) for eliminating inter user interference apply to Zero-Forcing in the Successive Signal to Leakage plus Noise Ratio(SSLNR) in Coordinated Multi-Point Coordinated Beamforming system(CoMP CB). As a result, the leakage power is eliminated. The inter user interference elimination algorithm, however, cannot guarantee the enough desired signal power therefore we perform the channel ordering to overcome this disadvantage and increase the desired signal power. The simulation results show that the proposed scheme provides the improved Bit Error Rate(BER) performance compared with existing SSLNR-Zero-Forcing-Tomlinson Harashima precoding(SSLNR-ZF-THP).

• Journal of Korea Multimedia Society
• /
• v.10 no.11
• /
• pp.1439-1445
• /
• 2007

In this paper, we propose a fast motion estimation algorithm using initial matching errors by sorting square sub-blocks to find complex sub-block area adaptively based on partial calculation of SAD(sum of absolute difference) while keeping the same prediction quality compared with the PDE(partial distortion elimination) algorithm. We reduced unnecessary calculations with square sub-block adaptive matching scan based initial SAD calculation of square sub-block in each matching block. Our algorithm reduces about 45% of computations for block matching error compared with conventional PDE(partial distortion elimination) algorithm without any degradation of prediction quality, and for algorithm will be useful to real-time video coding applications using MPEG-4 AVC or MPEG-2.

• Proceedings of the IEEK Conference
• /
• 2000.06d
• /
• pp.143-146
• /
• 2000

Motion Estimation/compensation(ME/MC) is one of the efficient interframe ceding techniques for its ability to reduce the high redundancy between successive frames of an image sequence. Calculating the blocking matching takes most of the encoding time. In this paper a new fast block matching algorithm(BMA) is developed for motion estimation and for reduction of the computation time to search motion vectors. The feature of the new algorithm comes from the center-biased checking concept and the trend of pixel movements. At first, Motion Vector(MV) is searched in ${\pm}$1 of search area and then the motion estimation is exploited in the rest block. The ASP and MSE of the proposed search algorithm show good performance.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.4
• /
• pp.130-137
• /
• 1993

In this paper, A progressive coding of mean difference pyramid by Hadamard transform of the difference between two successive pyramid levels has been studied. A block adaptive bit allocation method based on ac energy of each sub-block has been proposed, which efficiently reduces the final distortion in the progressive transmission of image parameters. In our scheme, the dc energy equals the sum of the quantization errors of the Hadamard transform coefficients at previous level. Therefore proposed allocation method includes the estimation of dc energy at each pyramid level. Computer simulation results show some improvements in terms of MSE and picture quality over the conventional fixed allocation scheme.

• 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.

• International Journal of Internet, Broadcasting and Communication
• /
• v.12 no.1
• /
• pp.67-72
• /
• 2020

The fifth generation (5G) mobile communication has an impact on the human life over the whole world, nowadays, through the artificial intelligence (AI) and the internet of things (IoT). The low latency of the 5G new radio (NR) access is implemented by the state-of-the art technologies, such as non-orthogonal multiple access (NOMA). This paper investigates a practical issue that in NOMA, for the practical channel models, such as fading channel environments, the successive interference cancellation (SIC) should be performed on the stronger channel users with low power allocation. Only if the SIC is performed on the user with the stronger channel gain, NOMA performs better than orthogonal multiple access (OMA). Otherwise, NOMA performs worse than OMA. Such the superiority requirement can be easily implemented for the channel being static or slow varying, compared to the block interval time. However, most mobile channels experience fading. And symbol by symbol channel estimations and in turn each symbol time, selections of the SIC-performing user look infeasible in the practical environments. Then practically the block of symbols uses the single channel estimation, which is obtained by the training sequence at the head of the block. In this case, not all the symbol times the SIC is performed on the stronger channel user. Sometimes, we do perform the SIC on the weaker channel user; such cases, NOMA performs worse than OMA. Thus, we can say that by what percent NOMA is better than OMA. This paper calculates analytically the percentage by which NOMA performs better than OMA in the practical mobile communication systems. We show analytically that the percentage for NOMA being better than OMA is only the function of the ratio of the stronger channel gain variance to weaker. In result, not always, but almost time, NOMA could perform better than OMA.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2012.11a
• /
• pp.180-183
• /
• 2012

본 논문에서는 고속 움직임 예측(Fast Motion Estimation)방법의 일종인 다단계 연속 제거 알고리즘(MSEA : Multi-level Successive Elimination Algorithm)에 움직임의 역동성 정도를 고려하여 적응적인 가중치를 적용하는 방안에 대해 제안하였다. 움직임을 예측하는 과정에서 영상의 화질 손상이 발생하는 방식(Lossy Motion Estimation Algorithm)에서 모든 단위 블록(Macro Block)에 고정된 가중치만을 적용하는 기존의 방식과 달리 주위 블록의 움직임 벡터(Motion Vector)를 통해 움직임의 정도를 가정하여 적응적인 가중치를 적용함으로써 화질 손상을 줄이는 것이 목적이다. 제안하는 알고리즘으로 설계한 실험으로부터 MSEA에 적응적 가중치를 사용할 경우의 효율성을 확인하였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.6
• /
• pp.1554-1561
• /
• 1998

When the superposition of realtime traffic and non-realtime traffic is applied to the ATM network, the successive cell loss(block loss) is more influential on the quality of service (QoS) of two traffic streams than the single loss in case of bursty traffic. Block loss can be identified as an important performance measure because of delay-oriented policy for realtime traffic. In this paper, we consider the system with the two-level overload control reducing of the recurrence of shut-down periods and develop a recursive algorithm to obtain both block loss and cell loss probabilities of both traffic. We can see that it gives the more precise and diverse investigations on performance analysis of queuing strategy.