• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38C no.11
• /
• pp.1051-1059
• /
• 2013

This paper proposes a complexity reduced list sphere decoding (LSD) scheme for joint iterative soft detection scheme for coded MIMO system. The conventional LSD scheme is based on searching the candidates with a fixed radius. However, once the candidate list is full, it is highly probable that the radius can be reduced. By reducing the radius, the complexity can be also reduced. We propose a simple and efficient radius update method for complexity reduction of list version sphere decoding and its application to iterative soft MIMO detection. We evaluate the performance of the proposed scheme with a joint soft-input-soft-ouput iterative MIMO detection in combination with turbo codes. Simulation results show that the proposed methods provide substantial complexity reduction while achieving similar bit error rate (BER) performance as the conventional LSD scheme.

• Proceedings of the KIEE Conference
• /
• 2000.07d
• /
• pp.3166-3168
• /
• 2000

This paper proposed variable threshold dual rate ADPCM coding method which is modified from the standard ADPCM of ITU G.726 for speech quality improvement. The speech quality of variable threshold dual rate ADPCM is better than single rate ADPCM at noisy environment without increasing the complexity by using ZCR(Zero Crossing Rate). In this case, ZCR is used to divide input signal samples into two categories(noisy & speech). The samples with higher ZCR is categorized as the noisy region and the samples with lower ZCR is categorized as the speech region. Noisy region uses higher threshold value to be compressed by 16Kbps for reduced bit rates and the speech region uses lower threshold value to be compressed by 40Kbps for improved speech quality. Comparing with the conventional ADPCM, which adapts the fixed coding rate. the proposed variable threshold dual rate ADPCM coding method improves noise character without increasing the bit rate. For real time applications, ZCR calculation was considered as a simple method to obtain the background noise information for preprocess of speech analysis such as FFT and the experiment showed that the simple calculation of ZCR can be used without complexity increase. Dual rate ADPCM can decrease the amount of transferred data efficiently without increasing complexity nor reducing speech quality. Therefore result of this paper can be applied for real-time speech application such as the internet phone or VoIP.

• Journal of Electrical Engineering and Technology
• /
• v.9 no.4
• /
• pp.1411-1417
• /
• 2014

An MPEG-2 AAC Huffman decoding method based on the fixed length compacted codeword tables, where each codeword can contain multiple number of Huffman codes, was proposed. The proposed method enhances the searching efficiency by finding multiple symbols in a single search, i.e., a direct memory reading of the compacted codeword table. The memory usage is significantly saved by separately handling the Huffman codes that exceed the length of the compacted codewords. The trade-off relation between the computational complexity and the amount of memory usage was analytically derived to find the proper codeword length of the compacted codewords for the design of MPEG-2 AAC decoder. To validate the proposed algorithm, its performance was experimentally evaluated with an implemented MPEG-2 AAC decoder. The results showed that the computational complexity of the proposed method is reduced to 54% of that of the most up-to-date method.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.14 no.3
• /
• pp.118-124
• /
• 2004

KASUMI is a 64-bit iterated block cipher with a 128-bit key size and 8 rounds Feistel structure. In this paper, we describe saturation attacks on the five round KASUMI, which requires 10 $\times$$2^{32}$ chosen plaintexts and $2^{115}$ computational complexity We also improve this attack using meet-in-the-middle technique. This attack requires 7$\times$$2^{32}$ chosen plaintexts and $2^{90}$ computational complexity. Futhermore, we attack KASUMI by controlling the value of the fixed part of the key. This attack needs 3$\times$$2^{32}$ chosen plaintexts and $2^{57}$ computational complexity.

• Journal of Korea Trade
• /
• v.25 no.7
• /
• pp.41-55
• /
• 2021

Purpose - This paper empirically investigates the relationship between the Economic Complexity Index (ECI) and the level of development. Moreover, this research attempts to discover the determinants of ECI in the globalization wave. Design/methodology - Our empirical model considers the relationship between ECI and the level of development in middle- and high-income economies from 1995 to 2010 by using systemic qualitative analysis, including OLS, fixed-effects, and system GMM. Next, this research used OLS regression to find the determinants of ECI. In particular, we compared the effects of different factors on ECI in the different development stages. Findings - Our main findings can be summarized as follows: 1. If the ECI increases by 1, it could lead to an increase of about 30% in the level of development in middle- and high-income economies. 2. Human capital plays an important role in the development of and increase in ECI. 3. GVC participation and outflow FDI enhance an increase in ECI, in particular in middle-income economies. 4. The development of manufacturing industries is helpful to increase ECI; however, middle-income economies should pay more attention to their comparative advantage industries. 5. R&D has positive effects on the ECI. Originality/value - To the best of our knowledge, this is the first paper that uses systemic qualitative analysis to investigate the relationship between ECI and the level of development. The paper provides suggestions for policy makers to increase ECI under the current wave of globalization, in particular in middle-income economies.

• The Journal of the Acoustical Society of Korea
• /
• v.20 no.4E
• /
• pp.24-30
• /
• 2001

This paper describes a fast harmonic estimation, referred to as Delta Adjustment (DA), using a low resolution pitch. The presented DA method is based on modification of the Generalized Dual Excitation (GDE) technique[1] which was proposed to improve speech enhancement performance. We introduce the GDE technique and modify it to be suitable for low bit rate harmonic coding that uses only an integer pitch estimate. Unlike the GDE, the DA matches a frequency-warped version of the original spectrum that conforms to a fixed pitch at all harmonic bands. In addition, complexity and performance of the presented method are described in comparison with those of the conventional Fractional Pitch (FP) based harmonic estimation. Experimental results showed that the DA algorithm significantly reduces the complexity of the FP method while maintaining the performance.

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.2467-2470
• /
• 2003

This paper presents a new structure of MPEG-4 AAC encoder. The proposed encoder directly shapes quantization noise distribution according to the energy distribution curve and thereafter performs adjustment of the offset level of the noise distribution to meet the given bit rate. The direct noise shaping and the bit rate matching scheme of the proposed encoder algorithm significantly alleviate the problem of conventional encoder's processing burden related with the employment of the precise psychoacoustic model and iteration intensive quantizer. The encoder algorithm is implemented on ARM processor with fixed-feint arithmetic operations. The audio quality of the implemented system is observed comparable to those of commercially available encoders, white the complexity of the implementation is drastically reduced in comparison to the conventional encoder systems.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.7-10
• /
• 2000

Fast block motion estimation technique is proposed to reduce the computational complexity in video coding. In the conventional methods the size of search region is fixed. For small motion regions like background the small size of sea of search region is enough to find a block motion. But for active motion regions the large size of search region is preferred to figure out the accurate motion vector. Therefore, it is reasonable that a block motion is estimated in the variable search region (both the size and the position of it). That is to say, the search region varies according to the predicted motion characteristics of a block. The block motion in video frames has temporal continuity and then the search region of a current block is predicted using the block motion of previous blocks. The computational complexity of the proposed technique is significantly reduced with a good picture quality compared to the conventional methods.

• Proceedings of the KIEE Conference
• /
• 1999.07g
• /
• pp.3135-3137
• /
• 1999

We propose two robust blind equalization algorithms based on multi-stage clustering blind equalization algorithm, which are called a complex classification update algorithm(CCUA) and an error compensation algorithm(ECA). The first algorithm is a tap-updating algorithm which each computes classified real and imaginary parts in order to reduce computations and the complexity of implementation as a stage increase. The second one is a algorithm which can achieve faster convergence speed because error of equalizer input make always fixed. Test results confirm that the proposed algorithms with faster convergence and lower complexity outperforms both constant modulus algorithm (CMA) and conventional multi-stage blind clustering algorithm(MSA) in reducing the SER as well as the MSE at the equalizer output.

• Journal of information and communication convergence engineering
• /
• v.3 no.2
• /
• pp.76-79
• /
• 2005

In this paper, a low-complexity maximum-likelihood (ML) decoder based on QR decomposition, called real-valued LCMLDec decoder or RVLCMLDec for short, is proposed for the Vertical Bell Labs Layered Space-Time (V-BLAST) architecture, a promising candidate for providing high data rates in future fixed wireless communication systems [1]. Computer simulations, in comparison with other detection techniques, show that the proposed decoder is capable of providing the V­BLAST schemes with ML performance at low detection complexity