• International Journal of Computer Science & Network Security
• /
• v.21 no.8
• /
• pp.111-118
• /
• 2021

Banking systems are sensitive to data privacy since users' data, if not well protected, may be used to perform fake transactions. Blockchains, public and private, are frequently used in such systems thanks to their efficiency and high security. Public blockchains fail to fully protect users' data, despite their power in the accuracy of the transactions. The private blockchain is better used to protect the privacy of the sensitive data. They are not open and they apply authorization to login into the blockchain. However, they have a lower security compared to public blockchain. We propose in this paper a hybrid public-private architecture that profits from network virtualization. The main novelty of this proposal is the use of network virtualization that helps to reduce the complexity and efficiency of the computations. Simulations have been conducted to evaluate the performance of the proposed solution. Findings prove the efficiency of the scheme in reducing complexity and enhancing data privacy by guarantee high security. The contribution conducted by this proposal is that the results are verified by the centralized controller that ensures a correct validation of the resulted blockchains. In addition, computation complexity is to be reduced by profiting from the cooperation performed by the virtual agents.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.12
• /
• pp.103-112
• /
• 2011

Motion estimation (ME) is regarded as an important component in a video encoding process, because it consumes a large computation complexity. H.264/AVC requires additional computation overheads for fractional search and interpolation. This causes a problem that computational complexity is increased. In Motion estimation, SATD(Sum of Transform Difference) has the characteristics of a parabolic based on the minimum point. In this paper, we propose new prediction algorithm to reduce search point in motion estimation by sub-pixel interpolation characteristics. The proposed algorithm reduces the time of encoding process by decreasing computational complexity. Experimental results show that the proposed method reduces 20% of the computation complexity of motion estimation, while the degradation in video quality is negligible.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.42 no.2
• /
• pp.432-443
• /
• 2017

The primary goal of the MPEG-H 3D Audio standard is to provide immersive audio environments for high-resolution broadcasting services such as UHDTV. This standard incorporates a wide range of technologies such as encoding/decoding technology for multi-channel/object/scene-based signal, rendering technology for providing 3D audio in various playback environments, and post-processing technology. The reference software decoder of this standard is a structure combining several modules and can operate in various modes. Each module is composed of independent executable files and executed sequentially, real time decoding is impossible. In this paper, we make DLL library of the core decoder, format converter, object renderer, and binaural renderer of the standard and integrate them to enable frame-based decoding. In addition, by measuring the computation complexity of each mode of the MPEG-H 3D-Audio decoder, this paper also provides a reference for selecting the appropriate decoding mode for various hardware platforms. As a result of the computational complexity measurement, the low complexity profiles included in Korean broadcasting standard has a computation complexity of 2.8 times to 12.4 times that of the QMF synthesis operation in case of rendering as a channel signals, and it has a computation complexity of 4.1 times to 15.3 times of the QMF synthesis operation in case of rendering as a binaural signals.

• Journal of Information Technology Services
• /
• v.3 no.2
• /
• pp.99-104
• /
• 2004

Conventional and public-key cryptography has been widely accepted as a base technology for the design of computer security systems. D-classes have the potential for application to conventional and public-key cryptography. However, there are very few results on D-classes because the computational complexity of D-class computation is NP-complete. This paper discusses the design of algorithms for the efficient computation of D-classes and the Java implementation of them. In addition, the paper implements the same D-class computation algorithms in C and shows the performance of C and Java programming languages for the computation-intensive applications by comparing their execution results.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.7C
• /
• pp.681-686
• /
• 2009

In H.264/Ave, an intra prediction added to the P-frame coding slightly improves both of image quality and bit rate, but greatly increases an amount of computation. In order to reduce the increase in computation, this paper proposes an image contents based intra prediction coding using characteristics that the best intra block mode depends on the image content of a macro block. The proposed algorithm estimates the image content with image complexity and the best inter block mode, and then selects or excludes a intra block mode on the basis of it. The simulation results show that the proposed algorithm reduces average O.OldB in image quality, and increases average 0.38% in the bit rate, but reduces average 37.02% in computation time compared with the conventional algorithm.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.10 no.3
• /
• pp.119-125
• /
• 2014

Echo cancellation is required for a dual-duplex high speed communication such as digital subscriber line(DSL), in order to allow each individual loop to operate in a full duplex fashion. Echo cancellation was one of the most difficult aspects of DSL design, requiring high linearity and total echo return loss in excess of 70 dB. For a long and rapidly changing echo response, if the echo is cancelled by an adaptive echo canceller, the echo canceller needs more taps and its performance is decreased. But if the response is divided into several responses, which response is estimated by a adaptive digital filter and combined, the computation complexities are decreased and the performance is increased. Therefore, the adaptive multi-stage echo canceller is proposed to decrease the computation complexity and increase the performance of echo return loss, in which the echo canceller is composed of several stage echo canceller estimating each divided echo response. Through computer simulations, this multi-stage echo canceller is verified to have merits for high speed communications such as DSL application.

• ETRI Journal
• /
• v.25 no.6
• /
• pp.475-488
• /
• 2003

In this paper, we propose an efficient and simple fair queuing algorithm, called new starting potential fair queuing (NSPFQ), which has O(1) complexity for virtual time computation and also has good delay and fairness properties. NSPFQ introduces a simpler virtual time recalibration method as it follows a rate-proportional property. The NSPFQ algorithm recalibrates the system virtual time to the minimum virtual start time among all possible virtual start times for head-of-line packets in backlogged sessions. Through analysis and simulation, we show that the proposed algorithm has good delay and fairness properties. We also propose a hardware implementation framework for the scheduling algorithm.

• Journal of information and communication convergence engineering
• /
• v.7 no.4
• /
• pp.501-506
• /
• 2009

In the H.264/ AVC video coding standard, the intra-prediction coding with various block sizes offers a considerably high improvement in coding efficiency compared to previous standards. In order to achieve this, H.264/AVC uses the Rate-distortion optimization (RDO) technique to select the best intraprediction mode for a macroblock, and it brings about the drastic increase of the computation complexity of H.264 encoder. To reduce the computation complexity and stabilize the coding performance on visual quality, this paper proposed a fast intra-prediction mode decision algorithm using non-parametric thresholds and simplified directional masks. The use of nonparametric thresholds makes the intra-coding performance not be dependent on types of video sequences and simplified directional masks reduces the compuation loads needed by the calculation of local edge information. Experiment results show that the proposed algorithm is able to reduce more than 55% of the whole encoding time with a negligible loss in PSNR and bitrates and provides the stable performance regardless types of video sequences.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.12
• /
• pp.2315-2325
• /
• 2011

We propose a novel reduced-state maximum-likelihood sequence detection (MLSD) structure using the Viterbi algorithm based on the second-order Volterra kernel modeling nonlinear distortion due to square law detection of multipath channels commonly occurring in chromatic dispersion (CD) or polarization mode dispersion (PMD) in optical communication systems. While all existing MLSD methods for square-law detection receivers are based on direct computation of branch metrics, the proposed algorithm provides an efficient and structured way to implement reduced-state MLSD with almost the same complexity of a MLSD for linear channels. As a result, the proposed algorithm reduces the number of parameters to be estimated and the complexity of computation.

• Journal of Broadcast Engineering
• /
• v.27 no.7
• /
• pp.1011-1020
• /
• 2022

Recent high-performance panoptic segmentation models are based on transformer architectures. However, transformer-based panoptic segmentation methods are basically slower than convolution-based methods, since the attention mechanism in the transformer requires quadratic complexity w.r.t. image resolution. Also, sine and cosine computation for positional embedding in the transformer also yields a bottleneck for computation time. To address these problems, we adopt three modules to speed up the inference runtime of the transformer-based panoptic segmentation. First, we perform channel-level reduction using depth-wise separable convolution for inputs of the transformer decoder. Second, we replace sine and cosine-based positional encoding with convolution operations, called conv-embedding. We also apply a separable self-attention to the transformer encoder to lower quadratic complexity to linear one for numbers of image pixels. As result, the proposed model achieves 44% faster frame per second than baseline on ADE20K panoptic validation dataset, when we use all three modules.