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

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

In this paper, we propose an incremental redundancy(IR)-hybrid ARQ(HARQ) scheme which uses double binary turbo codes for error correction. We also propose a methodology for basic analysis of the throughput which is a performance index of HARQ. The proposed double binary turbo IR-HARQ scheme provides higher throughput than binary IR-HARQ, which uses binary turbo codes for error correction, at all $E_s/N_0$. An extra coding gain is also attained by using the proposed HARQ scheme over the coding gain achieved by turbo codes only.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.23 no.3
• /
• pp.309-316
• /
• 1986

A concatenated coding system using a binary code as the inner code and a nonbinary code as the outer code has been constructed for the purpose of error correction. The complexity of a conventional coding system grows exponentially as the code length of a block code becomes longer. To reduce the complexity for ling code, an effective communication system has been proposed by cascading two codes-binary and norbinary codes. Using a parallel-to-serial circuit and a serial-to-parallel circuit, the concatenated coding system has been designed and constructed by empolying a (7,3) burst error correcting code as the inner code and a (7,3) Reed-Solomon code as the outer code. This system has been simulated and tested using a micro-computer. For the (49,9) concatenated coding system, the error probability of the channel has been evaluated and compared to different coding systems.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.44 no.6 s.360
• /
• pp.42-49
• /
• 2007

CABAC(Context-based Adaptive Binary Arithmetic Coding) among various entropy coding schemes which are used to improve compression efficiency in H.264/AVC has a high hardware complexity and the fast calculation is difficult because data dependancy exists in the bit-serial process. In this paper, the proposed architecture efficiently compose the renormalization process of binary arithmetic encoder which is an important part of CABAC used in H.264/AVC. At every clock cycle, the input symbol is encoded regardless of the iteration of the renormalization process for every input symbol. Also, the proposed architecture can deal with the bitsOutstanding up to 127 which is adopted to handle the carry generation problem and encode input symbol without stall. The proposed architecture with three-stage pipeline has been synthesized using the 0.18um Dongbu-Anam standard cell library and can be operated at 290MHz.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.46 no.12
• /
• pp.66-72
• /
• 2009

This paper proposes an efficient binary arithmetic encoder for CABAC which is used one of the entropy coding methods for H.264/AVC. The present binary arithmetic encoding algorithm requires huge complexity of operation and data dependency of each step, which is difficult to be operated in fast. Therefore, renormalization exploits 2-stage pipeline architecture for efficient process of operation, which reduces huge complexity of operation and data dependency. Context model updater is implemented by using a simple expression instead of transIdxMPS table and merging transIdxLPS and rangeTabLPS tables, which decreases hardware size. Arithmetic calculator consists of regular mode, bypass mode and termination mode for appearance probability of binary value. It can operate in maximum speed. The proposed binary arithmetic encoder has 7282 gate counts in 0.18um standard cell library. And input symbol per cycle is about 1.

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

• ETRI Journal
• /
• v.32 no.6
• /
• pp.972-975
• /
• 2010

In this letter, we consider the lossy coding of a non-uniform binary source based on GF(q)-quantized low-density generator matrix (LDGM) codes with check degree $d_c$=2. By quantizing the GF(q) LDGM codeword, a non-uniform binary codeword can be obtained, which is suitable for direct quantization of the non-uniform binary source. Encoding is performed by reinforced belief propagation, a variant of belief propagation. Simulation results show that the performance of our method is quite close to the theoretic rate-distortion bounds. For example, when the GF(16)-LDGM code with a rate of 0.4 and block-length of 1,500 is used to compress the non-uniform binary source with probability of 1 being 0.23, the distortion is 0.091, which is very close to the optimal theoretical value of 0.074.

• 한국정보통신설비학회:학술대회논문집
• /
• 2008.08a
• /
• pp.429-432
• /
• 2008

In this paper, performance of a double binary turbo coded ultra wide band (UWB) system is analyzed and simulated in an indoor wireless channel. Binary pulse position modulation-time hopping (BPPM-TH) signals are considered. The indoor wireless channel is modeled as a modified Saleh and Valenzuela (SV) channel. The performance is evaluated in terms of bit error probability (BER). From the simulation results, it is seen that double binary turbo coding offers considerable coding gain with reasonable encoding complexity. It is also demonstrated that the performance of the UWB system can be substantially improved by increasing the number of iterations.

• International Journal of Control, Automation, and Systems
• /
• v.6 no.4
• /
• pp.488-494
• /
• 2008

This paper proposes an effective approach based on binary coding Particle Swarm Optimization (PSO) to identify the switching operation plan for feeder reconfiguration. The proposed method considers the advantages and disadvantages of existing particle swarm optimization method and redefined the operators of PSO algorithm to fit the application field of distribution systems. Shift operator is proposed to construct the binary coding particle swarm optimization for feeder reconfiguration. A typical distribution system of Taiwan Power Company is used in this paper to demonstrate the effectiveness of the proposed method. The test results show that the proposed method can apply to feeder reconfiguration problems more effectively and stably than existing method.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.1
• /
• pp.425-428
• /
• 2005

This paper is made up Advanced Image Coding(AIC) that combines algorithms from next generation image coding standard, H.264/MPEG-4 Part 10 advanced video coding(AVC) and still image compression standard, JPEG(Joint Photographic Experts Group). AIC combines intra frame block prediction from H.264 with a JPEG style discrete cosine transform and quantization, followed by Context-based Adaptive Binary Arithmetic Coding(CABAC) as used in H.264. In this paper, we analyzes the efficiency of the AIC algorithm and JPEG and JPEG-2000, and it presents of result.