• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.5C
• /
• pp.317-325
• /
• 2011

For OFDM (Orthogonal Frequency Division Multiplexing) systems, 2-D MMSE (2-Dimensional Minimum Mean Square Error) channel estimation provides optimal performance in frequency/time selective fading channel environment. However, the 2-D MMSE channel estimation has high computational complexity due to the large matrix size, because the 2-D MMSE channel estimation considers time as well as frequency axis for channel estimation. To reduce the computational complexity, we propose a modified 2-D MMSE channel estimator which is based on 1-D MMSE channel estimation with weighted sum. Furthermore, we consider RMS delay spread and Doppler frequency estimation for 2-D MMSE channel estimation. We show that the proposed method can significantly reduce computational complexity as well as that it can perform close to 2-D MMSE channel estimation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.5A
• /
• pp.726-742
• /
• 2000

A novel rte control algorithm consisting of two major components, i.e. a variable encoding frame rate method and a hybrid DCT/wavelet I-frame coding scheme, is proposed in this work for low bit rate video coding. Most existing rate control algorithms for low bit rate video focus on bit allocation at the macroblock level under a constant frame rate assumption. The proposed rate control algorithm is able to adjust the encoding frame rate at the expense of tolerable time-delay. Furthermore, an R-D optimized hybrid DCT/wavelet scheme is used for effective I-frame coding. The new rate-control algorithm attempts to achieve a good balance between spatial quality and temporal quality to enhance the overall human perceptual quality at low bit rates. It is demonstrated that the rate control algorithm achieves higher coding efficiency at low bit rates with a low additional computational cost. The variable frame rate method and hybrid I-frame coding scheme are compatible with the bi stream structure of H.263+.

• Proceedings of the IEEK Conference
• /
• 2002.07a
• /
• pp.188-191
• /
• 2002

To reduce the bit-rate of video sequences by removing temporal redundancy, motion estimation techniques have been developed. However, the high computational complexity of the problem makes such techniques very difficult to be applied to high-resolution applications in a real time environment. For this reason, low computational complexity motion estimation algorithms are viable solutions. If a priori knowledge about the motion of the current block is available before the motion estimation, a better starting point for the search of n optimal motion vector on be selected and also the computational complexity will be reduced. In this paper, we present an adaptive block matching algorithm based on temporal correlations of consecutive image frames that defines the search pattern and the location of initial starting point adaptively to reduce computational complexity. Experiments show that, comparing with DS(Diamond Search) algorithm, the proposed algorithm is about 0.1∼0.5(㏈) better than DS in terms of PSNR and improves as much as 50% in terms of the average number of search points per motion estimation.

• Structural Engineering and Mechanics
• /
• v.85 no.1
• /
• pp.89-104
• /
• 2023

This work presents a proposal for employing reduced numerical integration in the formulation of the 4-node quadrilateral solid finite element. The use of these low-order integration rules leads to numerical instabilities such as those producing the hourglass effect. The proposed procedure allows evaluating a given constitutive model only in one integration point, achieving an attractive computational cost reduction and, also, successfully controls the hourglass effect. A validation of the proposal is included and discussed throughout the paper. To show the efficiency of the proposal, several application examples of masonry structures are studied and discussed. To represent the non-linear mechanical behaviour of masonry a plastic-damage model is implemented within the application of this sub-integration scheme. Also, in order to have a full and computationally efficient strategy to determine the behaviour of masonry structures, involving its evolution to collapse, a homogenization technique with a macro-modeling approach is used. The methodology discussed throughout this paper demonstrates a substantial computational cost reduction and an improved approximation of the non-linear problem evidenced by a reduction of up to 85% of the computational time for some cases.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.53 no.12
• /
• pp.793-798
• /
• 2004

In this paper, the problem of adaptively identifying time-varying nonlinear systems is considered. For that purpose, the discrete time-varying Volterra series is employed as a system model, and the filtered weighted least squares (FWLS) algorithm, developed for adaptive identification of linear time-varying systems, is utilized for the adaptive identification of time-varying quadratic Volterra systems. To demonstrate the performance of the proposed approach, some simulation results are provided. Note that the FWLS algorithm, decomposing the conventional weighted basis function (WBF) algorithm into a cascade of two (i.e., estimation and filtering) procedures, leads to fast parameter tracking with low computational burden, and the proposed approach can be easily extended to the adaptive identification of time-varying higher-order Volterra systems.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.5
• /
• pp.868-874
• /
• 2007

A real-time frame-layer rate control algorithm with a token bucket traffic shaper is proposed for minimizing video duality variation. The proposed rate control method uses a non-iterative optimization method for low computational complexity, and performs bit allocation at the frame level to minimize variation in distortion between frames. In order to reduce the quality fluctuation, we use a sliding window scheme which does not require the pre-analysis process. Therefore, the proposed algorithm does not produce the delay from encoding, and is suitable for real-time low-complexity video encoder. Experimental results indicate that the proposed control method provides better PSNR performance than the existing rate control method.

• Journal of Positioning, Navigation, and Timing
• /
• v.10 no.4
• /
• pp.363-369
• /
• 2021

Since the Global Navigation Satellite System (GNSS) signal received from the low Earth orbit (LEO) satellite is only affected by the upper ionosphere, the magnitude of the ionospheric delay of Global Positioning System (GPS) signal received from ground user is different. Therefore, the ground-based two-dimensional ionospheric model cannot be applied to LEO satellites. The NeQuick model used in Galileo provides the ionospheric delay according to the user's altitude, so it can be used in the ionospheric model of the LEO satellites. However, the NeQuick model is not suitable for space receivers because of the high computational cost. A simplified NeQuick model with reduced computing time was recently presented. In this study, the computing time of the NeQuick model and the simplified NeQuick model was analyzed based on the GPS Klobuchar model. The NeQuick and simplified NeQuick model were applied to the GNSS data from GRACE-B, Swarm-C, and GOCE satellites to analyze the performance of the ionospheric correction and positioning. The difference in computing time between the NeQuick and simplified NeQuick model was up to 90%, but the difference in ionospheric accuracy was not as large as within 4.5%.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.8
• /
• pp.2708-2721
• /
• 2014

Data outsourcing in the cloud (DOC) is a promising solution for data management at the present time, but it could result in the disclosure of outsourced data to unauthorized users. Therefore, protecting the confidentiality of such data has become a very challenging issue. The conventional way to achieve data confidentiality is to encrypt the data via asymmetric or symmetric encryptions before outsourcing. However, this is computationally inefficient because encryption/decryption operations are time-consuming. In recent years, a few DOC schemes based on secret sharing have emerged due to their low computational complexity. However, Dautrich and Ravishankar pointed out that most of them are insecure against certain kinds of collusion attacks. In this paper, we proposed a novel DOC scheme based on Shamir's secret sharing to overcome the security issues of these schemes. Our scheme can allow an authorized data user to recover all data files in a specified subset at once rather than one file at a time as required by other schemes that are based on secret sharing. Our thorough analyses showed that our proposed scheme is secure and that its performance is satisfactory.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.8
• /
• pp.3884-3910
• /
• 2016

Intrusion Detection System (IDS) in general considers a big amount of data that are highly redundant and irrelevant. This trait causes slow instruction, assessment procedures, high resource consumption and poor detection rate. Due to their expensive computational requirements during both training and detection, IDSs are mostly ineffective for real-time anomaly detection. This paper proposes a dimensionality reduction technique that is able to enhance the performance of IDSs up to constant time O(1) based on the Principle Component Analysis (PCA). Furthermore, the present study offers a feature selection approach for identifying major components in real time. The PCA algorithm transforms high-dimensional feature vectors into a low-dimensional feature space, which is used to determine the optimum volume of factors. The proposed approach was assessed using HTTP packet payload of ISCX 2012 IDS and DARPA 1999 dataset. The experimental outcome demonstrated that our proposed anomaly detection achieved promising results with 97% detection rate with 1.2% false positive rate for ISCX 2012 dataset and 100% detection rate with 0.06% false positive rate for DARPA 1999 dataset. Our proposed anomaly detection also achieved comparable performance in terms of computational complexity when compared to three state-of-the-art anomaly detection systems.

• 한국전산유체공학회:학술대회논문집
• /
• 2001.05a
• /
• pp.189-194
• /
• 2001

In this paper, non-reacting and reacting flowfields were computed using a preconditioned Navier-Stokes solver. The preconditioning technique of Merkle et al. and TVD scheme or Chakravarthy and Osher was employed and the results obtained using developed code have a good agreement with the previous results and experimental data. The preconditioned Wavier-Stokes equation set with low Reynolds number $\kappa-\epsilon$ equation and species continuity equations, are discretized with strongly implicit manner and time integrated with LU-SSOR scheme. For the purpose of treating unsteady problem the duel-time stepping scheme was employed. For the validation of the code in incompressible flow regime, steady driven square cavity flow was considered and calculation result shows reasonably good agreement with the result of incompressible code. Shock wave/boundary layer interaction problem was considered to show the shock capturing performance of preconditioned-TVD scheme. To validate unsteady flow, acoustic oscillation problem was calculated, and supersonic premix flame of $H_2$-air reaction problem which is calculated with turbulence model, 9-species/18-reaction step reaction model, shows reasonable agreement with the previous results. As a result, the preconditioning method has an advantage to calculate incompressible and compressible flow through one code and preconditioned solver easily developed from standard compressible code with minor efforts. But additional computational time and computer memory is required due to preconditioning matrix.