• Proceedings of the IEEK Conference
• /
• 2000.06a
• /
• pp.5-8
• /
• 2000

In this paper, we present a new cぉnet coding method, so called MLC (Multi-Level Codes), for error detection and correction in digital wireless communication. MLC coding method we the same coding procedure wed in the convolutional coding but it is distinguished from the existing convolutional coding in point of generating the code word by using multi-level information data (M-ary signal) and in point of speed of coding procedure Through computer simulation, we analyze the performance of the coding method suggested here compared to convolutional coding method in case of modulo-operation and in case of non-binary coding Procedure respectively under various channel environments.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.13 no.1
• /
• pp.37-44
• /
• 2003

In this paper, we investigated the performance of both DNA coding method and Genetic Algorithm(GA) in numeric pattern (from 0 to 9) recognition. The performance of the DNA coding method is compared to the that of the GA. GA searches effectively an optimal solution via the artificial evolution of individual group of binary string using binary coding, while DNA coding method uses four-type bases denoted by Adenine(A), Cytosine(C), Guanine(G) and Thymine(T). To compare the performance of both method, the same genetic operators(crossover and mutation) are applied and the probabilities of crossover and mutation are set the same values. The results show that the DNA coding method has better performance over GA. The reasons for this outstanding performance are multiple candidate solution presentation in one string and variable solution string length.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2002.12a
• /
• pp.383-386
• /
• 2002

In this paper, we investigated the pattern recognition performance of the numeric patterns (from 0 to 9) using DNA coding method. The pattern recognition performance of the DNA coding method is compared to the that of the GA(Genetic Algorithm). GA searches effectively an optimal solution via the artificial evolution of individual group of binary string using binary coding, while DNA coding method uses four-type bases denoted by A(Adenine), C(Cytosine), G(Guanine) and T(Thymine), The pattern recognition performance of GA and DNA coding method is evaluated by using the same genetic operators(crossover and mutation) and the crossover probability and mutation probability are set the same value to the both methods. The DNA coding method has better characteristics over genetic algorithms (GA). The reasons for this outstanding performance is multiple possible solution presentation in one string and variable solution string length.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.5
• /
• pp.45-51
• /
• 1997

To trnsmit moving image signals by using an object vased coding technique at the rate of 8kbps~11kbps, it is very important to minimize the bit rates used for the compression of the color information of MF-objects. This paper proposes a hybrid coding method which uses the shpae adaptive coding method and the interframe reference method selectively. Gilge's shape adaptive orthogonal coidng method is utilized for shpae adaptive coding. The interfarame reference method approximates the low-passed signals of the image by gilge's shpae adaptive orthogonalization method and then refers the approximation error signals from the high frequency signal components of th eprevious frame. The proposed method achives the bit rates reduction of 17% compared to the gilge's shape adaptive orthogonalization method and 30% rduction compared to the shape adaptive DCT in average.

• Proceedings of the KIEE Conference
• /
• 1999.11c
• /
• pp.524-526
• /
• 1999

In the construction of successful fuzzy models and/or controllers for nonlinear systems, the identification of a good fuzzy inference system is an important yet difficult problem, which is traditionally accomplished by a time-consuming trial-and-error process. In this paper, we propose a systematic identification procedure for complex multi-input single-output nonlinear systems with DNA coding method. A DNA coding method is optimization algorithm based on biological DNA as conventional genetic algorithms(GAs) are. The strings in the DNA coding method are variable-length strings, while standard GAs work with a fixed-length coding scheme. the DNA coding method is well suited to learning because it allows a flexible representation of a fuzzy inference system. We also propose a new coding method fur applying the DNA coding method to the identification of fuzzy models. This coding scheme can effectively represent the zero-order Takagi-Sugeno(TS) fuzzy model. To acquire optimal TS fuzzy model with higher accuracy and economical size, we use the DNA coding method to optimize the parameters and the number of fuzzy inference system. In order to demonstrate the superiority and efficiency of the proposed scheme, we finally show its application to a Duffing-forced oscillation system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.8
• /
• pp.1691-1697
• /
• 1997

This paper presents a new motion compensated error coding method suitable for region based image coding system. Compared with block based conding, the region based coding improves subjective quality as it estimates and compensates 2D (or 3D) translantional, rotational, and scaling motion for each regions. although the region based coding has this advantage, its merit is reduced as bock-DCT (2D-DCT) is used to encode motion-compensated error. To overcome this problem, a new region adaptive motion compensated error coding technique which improver subjective and objective quality in the region boundary is proposed in this paper. In the proposed method, regions with large error are estimated using contour of the regions and contrast between the regions. The regions estiated as those with large error are coded by arbitrarily shaped image segment coding method. The mask information of the coded regions is not transmitted because it is estimated as the same algorithm in the encoder and the decoder. The proposed region adaptive motion conpensated error coding method improves about 0.5dB when it is compared with conventional block based method.

• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 1998.12a
• /
• pp.537-545
• /
• 1998

This paper is the research about a joint coding system of source and channel coding using VF(Variable-to-fixed length) arithmetic code and BCH code. We propose a VF arithmetic coding method with EDC( Error Detecting Capability) and a joint coding method in that the VF arithmetic coding method with EDC is combined with BCH code. By combining both the VF arithmetic code with EDC and BCH code. the proposed joint coding method corrects a source codeword with t-errors in decoding of BCH code and carries out a improvement of the EDC of a codeword with more than (t＋1)-errors in decoding of the VF arithmetic coding with EDC. We examine the performance of the proposed method in terms of compression ratio and EDC.

• Proceedings of the IEEK Conference
• /
• 2003.11a
• /
• pp.167-170
• /
• 2003

We propose stereoscopic video coding method using the syntax of MAC(Multiple auxiliary component) that was added to the MPEC-4 visual version 2 in order to describe the transparency of the video object. We also define the novel MAC's semantics in MPEG-4 that should support the proposed coding method. The major difference between the existing coding method and the proposed coding method is the addition of the residual texture coding. The proposed coding method assigns disparity map and residual texture to 3 components of MAC: one component for disparity map and the rest 2 components fer the luminance and chrominance data of the residual texture, respectively. The performance of the proposed method is evaluated in terms of PSNR by computer simulations.

• Journal of applied mathematics & informatics
• /
• v.3 no.2
• /
• pp.157-168
• /
• 1996

This paper describes an efficient coding method for Ko-rean characters (alphabet) using a three-state transition graph. Par-allel hangul Dynamic Coding Method (PHDCM) compresses about 3.5 bits per Korean character compared with other coding techinques. When we ran the method on a MasPar machine it achieved a 49.314-fold speedup with 64 processors having 10 million orean characters

• IEIE Transactions on Smart Processing and Computing
• /
• v.5 no.6
• /
• pp.418-429
• /
• 2016

In this paper, we propose a hybrid Wyner-Ziv video coding structure that combines conventional motion predictive video coding and Wyner-Ziv video coding to eliminate the feedback channel, which is a major practical problem in applications using the Wyner-Ziv video coding approach. The proposed method divides a hybrid frame into two regions. One is coded by a motion predictive video coder, and the other by the Wyner-Ziv coding method. The proposed encoder estimates side information with low computational complexity, using the coding information of the motion predictive coded region, and estimates the number of syndrome bits required to decode the region. The decoder generates side information using the same method as the encoder, which also reduces the computational complexity in the decoder. Experimental results show that the proposed method can eliminate the feedback channel without incurring a significant rate-distortion performance loss.