• Journal of Electrical Engineering and Technology
• /
• v.11 no.4
• /
• pp.1020-1026
• /
• 2016

Motion estimation (ME) algorithms supporting quarter-pixel accuracy have been recently introduced to retain detailed motion information for high quality of video in the state-of-the-art video compression standard of H.264/AVC. Conventional sub-pixel ME algorithms in the spatial domain are faced with a common problem of computational complexity because of embedded interpolation schemes. This paper proposes a low-complexity sub-pixel motion estimation algorithm in the transform domain utilizing shifting matrix. Simulations are performed to compare the performances of spatial-domain ME algorithms and transform-domain ME algorithms in terms of peak signal-to-noise ratio (PSNR) and the number of bits per frame. Simulation results confirm that the transform-domain approach not only improves the video quality and the compression efficiency, but also remarkably alleviates the computational complexity, compared to the spatial-domain approach.

• ETRI Journal
• /
• v.35 no.5
• /
• pp.739-747
• /
• 2013

This paper investigates the multifarious nature of the long-term evolution (LTE) scheme and that of the modified LTE scheme for symbol timing synchronization (STS). This investigation allows us to propose a new replica correlation-based STS scheme to overcome the inherent weaknesses of the other two schemes. The proposed STS signal combines a gold sequence and a half sine wave in the time domain, whereas conventional STS signals specify either binary sequences or complex sequences in the time domain or in the frequency domain. In the proposed scheme, a sufficient correlation property is realized by the gold sequence, and robustness against the frequency offset (FO) is achieved through the sine wave. Compared to the existing LTE-related schemes, the proposed scheme can better achieve immunity to FO and reduction in detector complexity, as well as a low peak-to-average power ratio and a low detection error rate. Performance evaluations through analysis and simulation are provided in the paper to demonstrate these attributes.

• ETRI Journal
• /
• v.32 no.4
• /
• pp.622-625
• /
• 2010

In this letter, we assess the scalability of a path computation flooding (PCF) approach to compute optimal end-to-end inter-domain paths in a path computation element-based multi-domain network. PCF yields a drastically reduced network blocking probability compared to a blind per-domain path computation but introduces significant network control overhead and path computation complexity. In view of this, we introduce and compare an alternative low overhead PCF (LoPCF) solution. From the obtained results, LoPCF leads to similar blocking probabilities to PCF while exhibiting around 50% path computation complexity and network control overhead reduction.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.7C
• /
• pp.954-961
• /
• 2004

In this paper, we propose a STF(Space-Time-Frequency) coded OFDM(Orthogonal Frequency Division Multiplexing) transmission scheme as an attractive solution for high bit rate data transmission in a multipath fading environment. The STF-OFDM transmission scheme that we propose in this paper is a simple transmission cheme for achieving frequency diversity gain with low complexity. Using preceding in frequency domain, we obtain frequency diversity gain and improve the SER performance of conventional ST-OFDM. The preceding scheme proposed in this paper is a very simple method that can be encoded and decoded with low complexity.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.7
• /
• pp.1654-1667
• /
• 1996

The conventional fractal image compression methods have high computational complexity at encoding reduce PSNR at low bit rate and havehighly visible blocking effects in a reconstructed image. In this paper we propose a fractal image compression method based on disctete wavelet transform domain, which takes the absolute value of discrete wavelet transform coefficient, and assembles the discrete wavelet tranform coefficients of different highpass subbands corresponding to the same spatial block and then applies "0" encoding according to the energy of each range blocks. The proposed method improved PSNR at low bit rate and reduced computational complexity at encoding distinctly. Also, this method can achieve a blockless reconstructed image and perform hierarchical decoding without recursive constractive transformation. Computer simulations with several test images show that the proposed method shows better performance than convnetional fractal coding methods for encoding still pictures. pictures.

• Journal of computational fluids engineering
• /
• v.11 no.3 s.34
• /
• pp.1-7
• /
• 2006

Euler and Navier-Stokes flow analyses for helicopter rotor in hover were performed as low and high fidelity analysis models respectively for the future multidisciplinary design optimization(MDO). These design-oriented analyses possess several attributes such as variable complexity, sensitivity-computation capability and modularity which analysis models involved in MDO are recommended to provide with. To realize PC-based analyses for both fidelity models, reduction of flow domain was made by appling farfield boundary condition based on 3-dimensional point sink with simple momentum theory and also periodic boundary condition in the azimuthal direction. Correlations of thrust, torque and their sensitivities between low and high complexity models were tried to evaluate the applicability of these analysis models in MDO process. It was found that the low-fidelity Euler analysis model predicted inaccurate sensitivity derivatives at relatively high angle of attack.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.4
• /
• pp.1837-1860
• /
• 2020

We propose a general framework for studying resource allocation problem and the tradeoff between spectral efficiency (SE) and energy efficiency (EE) for downlink traffic in power domain-non-orthogonal multiple access (PD-NOMA) and device to device (D2D) based heterogeneous cloud radio access networks (H-CRANs) under imperfect channel state information (CSI). The aim is jointly optimize radio remote head (RRH) selection, spectrum allocation and power control, which is formulated as a multi-objective optimization (MOO) problem that can be solved with weighted Tchebycheff method. We propose a low-complexity algorithm to solve user association, spectrum allocation and power coordination separately. We first compute the CSI for RRHs. Then we study allocating the cell users (CUs) and D2D groups to different subchannels by constructing a bipartite graph and Hungrarian algorithm. To solve the power control and EE-SE tradeoff problems, we decompose the target function into two subproblems. Then, we utilize successive convex program approach to lower the computational complexity. Moreover, we use Lagrangian method and KKT conditions to find the global optimum with low complexity, and get a fast convergence by subgradient method. Numerical simulation results demonstrate that by using PD-NOMA technique and H-CRAN with D2D communications, the system gets good EE-SE tradeoff performance.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.4
• /
• pp.1048-1056
• /
• 1998

In this paper, a fractal image coding based on discrete wavelet transform is proposed to improve PSNR at low bit rates and reduce computational complexity of encoding process. The proposed method takes the absolute value of discrete wavelet transform coefficients, and then constructs significant coefficients trees, which indicate the positions and signs of the significant coefficients. This method improves PSNR and reduces computational complexity of mapping contracted domain pool onto range block, by matching only the significant coefficients of range block to coefficients of contracted domain block. Also, this paper proposes a classification scheme which minimizes the number of contracted domain blocks compared with range block. This scheme significantly reduces the number of range and contracted domain block comparison.

• ETRI Journal
• /
• v.44 no.2
• /
• pp.346-354
• /
• 2022

The SYN flooding attack is widely used in cyber attacks because it paralyzes the network by causing the system and bandwidth resources to be exhausted. This paper proposed a self-information approach for detecting the SYN flooding attack and provided a detection algorithm with a hierarchical policy on a detection time domain. Compared with other detection methods of entropy measurement, the proposed approach is more efficient in detecting the SYN flooding attack, providing low misjudgment, hierarchical detection policy, and low time complexity. Furthermore, we proposed a detection algorithm with limiting system resources. Thus, the time complexity of our approach is only (log n) with lower time complexity and misjudgment rate than other approaches. Therefore, the approach can detect the denial-of-service/distributed denial-of-service attacks and prevent SYN flooding attacks.

• Proceedings of the IEEK Conference
• /
• 2002.06d
• /
• pp.385-388
• /
• 2002

This paper proposes a new GSC (Generalized Sidelobe Canceller) structure, called HLMS-GSC. Compared to Griffiths and Jim's GSC structure, the number of complex multiplication required is reduced to one half. The simulation results show that the minimum mean square errors and performance of nulling jammers by using HLMS-GSC are almost the same compared to Griffiths and Jim's GSC, although the complexity is reduced significantly. As a result, the proposed adaptive beamformer is good for real time implementation, since it has low complexity compared to previous GSC structures.