• 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.

• ETRI Journal
• /
• v.28 no.2
• /
• pp.235-238
• /
• 2006

In this letter, a block code that minimizes the peak-to-average power ratio (PAPR) of orthogonal frequency division multiplexing (OFDM) signals is proposed. It is shown that peak envelope power is invariant to cyclic shift and codeword inversion. The systematic encoding rule for the proposed code is composed of searching for a seed codeword, shifting the register elements, and determining codeword inversion. This eliminates the look-up table for one-to-one correspondence between the source and the coded data. Computer simulation confirms that OFDM systems with the proposed code always have the minimum PAPR.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.8
• /
• pp.656-661
• /
• 2013

In Guided Scrambling (GS) encoding for the holographic storage, after scrambling augmented source word into codeword, the best codeword satisfying modulation constraint is determined. Modulation constraints considered in this paper are strength which is the minimum number of transition between '0' and '1' in each row and column of codeword array and the symbol balancedness of codeword array. In this paper, we show that GS encoding procedure can be formulated as an integer programming model and develop a fast neighborhood search heuristic for fast computation of control bits. In the simulation, we compared the performance of heuristic algorithm with the integer programming model for various array and control bit size combinations.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.34C no.3
• /
• pp.23-36
• /
• 1997

In tis paper, sthe new data model for the hardware implementation of lempel-ziv compression algorithm was proposed. Traditional model generates the codeword which consists of 3 bytes, the last symbol, the position and the matched length. MSB (most significant bit) of the last symbol is the comparession flag and the remaining seven bits represent the character. We confined the value of the matched length to 128 instead of 256, which can be coded with seven bits only. In the proposed model, the codeword consists of 2 bytes, the merged symbol and the position. MSB of the merged symbol is the comression flag. The remaining seven bits represent the character or the matched length according to the value of the compression flag. The proposed model reduces the compression ratio by 5% compared with the traditional model. The proposed model can be adopted to the existing hardware architectures. The incremental factors of the compression ratio are also analyzed in this paper.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2002.11a
• /
• pp.766-769
• /
• 2002

In this paper, we propose new orthogonal modulation method to enhance the performance of CCK adapted in 802.l1b WLAN. To maintain the orthogonality of codewords produced by CCK modulator, we devide 256 codewords into 8 subset by trellis coding and codewords On a subset are orthogonal each other. In result, this method restricts maximum data rate to 9.625Mbps, however, it is better about 1.5dB than original UK modulation at BER 10$^{-5}$ .

• Journal of Broadcast Engineering
• /
• v.1 no.1
• /
• pp.35-43
• /
• 1996

In this paper, we present efficient six-connected contour coding algorithms which can uniquely reconstruct any contour image and efficiently compress the contour data. We first design chain difference codes using two onward direction states, based on the fact that the probability distribution of the direction vectors of horiwntal/vertical direction state is different from that of the direction vectors of diagonal direction state. In order to increase coding efficiency, we also design chain difference codes using five states which are classified according to current and previous onward direction vectors. In addition, we also remove the END codeword to reduce total codeword occurrency. Experimental results show that when using 2 states and 5 states without END codeword total entropy decreases by about 12% and 14% for real images and by about 10% and 26% for a synthetic image, respectively.

• ETRI Journal
• /
• v.36 no.6
• /
• pp.905-912
• /
• 2014

In this paper, a new architecture is proposed to achieve complexity efficiency in implementing variable pulse position modulation (VPPM). VPPM, specified in IEEE 802.15.7, can support wireless communication and dimming control simultaneously using visible light. The proposed architecture is based on the VPPM signal property in which the transition point of the modulated output is obtained by counting the sample index and comparing it to both the assigned dimming factor and the transmitting data. Therefore, the proposed architecture can be composed of simple logics, including a counter, a comparator, and an inverter, all of which are insensitive to the dimming resolution in contrast to a conventional codeword-table method. This paper describes the verification of the proposed algorithm through a register-transfer level implementation of the codeword and proposed architectures. In comparison with the codeword-table method, the proposed method gains a nine-fold complexity reduction at a 1% dimming-step resolution.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.11
• /
• pp.1199-1205
• /
• 1992

In this paper, a Korean word recognition method which usese Neural Network and Hidden Markov Models(HMM) is proposed to improve a recognition rate with a small amount of learning data. The method reduces the fluctuation due to personal differences which is a problem to a HMM recognition system. In this method, effective recognizer is designed by the complement of each recognition result of the Hidden Markov Models(HMM) and Neural Network. In order to evaluate this model, word recognition experiment is carried out for 28 cities which is DDD area names uttered by two male and a female in twenties. As a result of testing HMM with 8 state, codeword is 64, the recognition rate 91[%], as a result of testing Neural network(NN) with 64 codeword the recognition rate is 89[%]. Finally, as a result of testing NN-HMM with 64 codeword which the best condition in former tests, the recognition rate is 95[%].

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.5
• /
• pp.677-690
• /
• 1995

In this paper, we propose the high efficiency data compression capable of error control using block-sorting, move to front(MTF) and arithmetic code with variable length in to fixed out. First, the substring with is parsed into length N is shifted one by one symbol. The cyclic shifted rows are sorted in lexicographical order. Second, the MTF technique is applied to get the reference of locality in the sorted substring. Then the preprocessed sequence is coded using VF(variable to fixed) arithmetic code which can be limited the error propagation in one codeword. The key point is how to split the fixed length codeword in proportion to symbol probabilities in VF arithmetic code. We develop the new VF arithmetic coding that split completely the codeword set for arbitrary source alphabet. In addition to, an extended representation for symbol probability is designed by using recursive Gray conversion. The performance of proposed method is compared with other well-known source coding methods with respect to entropy, compression ratio and coding times.

• Journal of the Korea Convergence Society
• /
• v.4 no.4
• /
• pp.21-29
• /
• 2013

Two-dimensional QR Code has improved greatly the limits on the capacity, size, direction of the one-dimensional bar code. And it has the capacity of compressing and storing the massive amount of data and is widely used in many applications. Recently, the two-dimensional QR Code has been spread rapidly because of introducing the smart phones and increasing the amount of using them. However, there is little documentations about decoding the QR Code in which can store the large amount of information. In this paper, therefore, we present specific processing procedures and algorithms on decoding the two-dimensional QR Code and then make us understand their decoding process by explaining some examples.