• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.8C
• /
• pp.801-805
• /
• 2006

A normalization approach to coefficient adaptation in the escalator(ESC) filter structure that conventionally employs least mean square(LMS) algorithm is introduced. Using Taylor's expansion of the local error signal, a normalized form of the ESC-LMS algorithm is derived. Compared with the computational complexity of the conventional ESC-LMS algorithm employs input power estimation for time-varying convergence coefficient using a single-pole low-pass filter, the computational complexity of the proposed method can be reduced by 50% without performance degradation.

• Korean Management Science Review
• /
• v.15 no.2
• /
• pp.239-257
• /
• 1998

Facing the globalization of world economy, intense market competition, radical change of information technology, firms are obliged to create a new type of organizations characterized by flexibility and adaptability to new and dynamic environments. This paper reviews the theories of complexity in physics briefly and discusses the implications of them on the management of business organizations. It analogizes the core concepts from complexity theories such as cooperative phenomena, self-organization, adaptation, positive feedback, and butterfly effect, and attempts to identify their implications on business management. Particularly, it suggests principles of 'Fractal' management which apply the fractal structure to the business organization.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2000.11a
• /
• pp.467-470
• /
• 2000

Vector quantization (VQ) is widely used in many high-quality and high-rate data compression applications such as speech coding, audio coding, image coding and video coding. When the size of a VQ codebook is large, the computational complexity for the full codeword search method is a significant problem for many applications. A number of complexity reduction algorithms have been proposed and investigated using such properties of the codebook as the triangle inequality. This paper proposes a new structured VQ search algorithm that is based on a multi-stage structure for searching for the best codeword. Even using only two stages, a significant complexity reduction can be obtained without any loss of quality.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.17 no.11
• /
• pp.20-25
• /
• 2016

This study addresses a low complexity and lossless frame memory compression algorithm based on block-buffer structure for efficient high resolution video processing. Our study utilizes the block-based MHT (modified Hadamard transform) for spatial decorrelation and AGR (adaptive Golomb-Rice) coding as an entropy encoding stage to achieve lossless image compression with low complexity and efficient hardware implementation. The MHT contains only adders and 1-bit shift operators. As a result of AGR not requiring additional memory space and memory access operations, AGR is effective for low complexity development. Comprehensive experiments and computational complexity analysis demonstrate that the proposed algorithm accomplishes superior compression performance relative to existing methods, and can be applied to hardware devices without image quality degradation as well as negligible modification of the existing codec structure. Moreover, the proposed method does not require the memory access operation, and thus it can reduce costs for hardware implementation and can be useful for processing high resolution video over Full HD.

• Journal of Broadcast Engineering
• /
• v.16 no.4
• /
• pp.624-634
• /
• 2011

Recently, the JCT-VC is developing the next generation video coding standard that is called HEVC. HEVC has adopted many coding technologies increasing coding efficiency. For chroma interpolation, DCT-based interpolation filter showing better performance than the linear filter in H.264/AVC was adopted in HEVC. In this paper, a combined filter that utilizes the FIR filter and the linear filter in H.264/AVC is proposed to increase coding efficiency. When the proposed method is compared with DCT-based interpolation filter, the experimental results for various sequences show that the average BD-rate improvements on chroma U and V components are 0.9% and 1.1%, respectively, in the high efficiency case of random access structure, those on U and V components are 1.1% and 1.1%, respectively, in the low complexity case of random access structure, those on U and V components are 0.9% and 1.4%, respectively, in the high efficiency case of low delay structure, and those on U and V components are 1.8% and 1.8%, respectively, in the low complexity case of low delay structure.

• Proceedings of the Korean Society for Emotion and Sensibility Conference
• /
• 1998.04a
• /
• pp.70-74
• /
• 1998

Liner complexity(LC), which could quantify the modal structure, were calculated from electroencephalograms(EEGs) in four states such as a pleasant and relaxed, a pleasant and aroused, an unpleasant and relaxed, and an unpleasant and aroused state. Each state was evoke by visual stimuli of relaxed or aroused state, LC could discriminate statistically state(t-test; p<0.01). LCs in pleasant states were larger than those in unpleasant ones.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.4C
• /
• pp.303-309
• /
• 2006

By combining the space-time diversity technique and iterative turbo codes, space-time turbo codes(STTCS) are able to provide powerful error correction capability. However, the multi-path transmission and iterative decoding structure of STTCS make the decoder very complex. In this paper, we propose a low complexity decoder, which can be used to decode STTCS as well as general iterative codes such as turbo codes. The efficient implementation of the backward recursion and the log-likelihood ratio(LLR) update in the proposed algorithm improves the computational efficiency. In addition, if we approximate the calculation of the joint LLR by using the approximate ratio(AR) algorithm, the computational complexity can be reduced even further. A complexity analysis and computer simulations over the Rayleigh fading channel show that the proposed algorithm necessitates less than 40% of the additions required by the conventional Max-Log-MAP algorithm, while providing the same overall performance.

• Journal of Communications and Networks
• /
• v.13 no.1
• /
• pp.63-69
• /
• 2011

In this paper, we propose a fixed-complexity sphere encoder (FSE) for multi-user multi-input multi-output (MU-MIMO) systems. The proposed FSE accomplishes a scalable tradeoff between performance and complexity. Also, because it has a parallel tree-search structure, the proposed encoder can be easily pipelined, leading to a tremendous reduction in the precoding latency. The complexity of the proposed encoder is also analyzed, and we propose two techniques that reduce it. Simulation and analytical results demonstrate that in a $4{\times}4$ MU-MIMO system, the proposed FSE requires only 11.5% of the computational complexity needed by the conventional QR decomposition with M-algorithm encoder (QRDM-E). Also, the encoding throughput of the proposed encoder is 7.5 times that of the QRDM-E with tolerable degradation in the BER performance, while achieving the optimum diversity order.

• Journal of Broadcast Engineering
• /
• v.25 no.3
• /
• pp.305-312
• /
• 2020

As a demand for a new video coding standard having higher coding efficiency than the existing standards is growing, recently, MPEG and VCEG has been developing and standardizing the next-generation video coding project, named Versatile Video Coding (VVC). Many inter prediction techniques have been introduced to increase the coding efficiency, and among them, an adaptive motion vector resolution (AMVR) technique has contributed on increasing the efficiency of VVC. However, the best motion vector can only be determined by computing many rate-distortion costs, thereby increasing encoding complexity. It is necessary to reduce the complexity for real-time video broadcasting and streaming services, but it is yet an open research topic to reduce the complexity of AMVR. Therefore, in this paper, an efficient technique is proposed, which reduces the encoding complexity of AMVR. For that, the proposed method exploits a special VVC tree structure (i.e., multi-type tree structure) to accelerate the decision process of AMVR. Experiment results show that the proposed decision method reduces the encoding complexity of VVC test model by 10% with a negligible loss of coding efficiency.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.11
• /
• pp.1473-1480
• /
• 1995

When the LMS algorithm is employed in the transversal filter structure, the computational complexity can be kept reasonably low. However, if the impulse response to be estimated is very long or signals involved are highly correlated like a speech the convergence speed becomes slow. The lattice filter is an excellent alternative to improve convergence speed since the lattice structure inherently has the orthogonal property among the backward prediction errors, but at the expense of the excessive computational load. If the input signal to be used can be sufficiently well modeled as a .RHO.-th order autoregressive(AR) process, the reflection coefficients after the .RHO.- th stage will be close to zero. Then, instead of employing the full lattice structure, the joint lattice filter structure can be implemented in conjunction with the transversal filter structure after the .RHO.-th stage. We propose, in this paper, this new lattice/transversal joint structure, and we will call it the reduced lattice filter. Using the reduced lattice filter, we are now able to achieve the performance as good as that of the lattice filter, while maintaining the complexity as low as that of the transversal filter. The proposed filter is particularly useful for an acoustic echo canceller due to the highly correlatedness nature of speeches and the long and frequently changing echo paths.