• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.22 no.7
• /
• pp.705-710
• /
• 2011

In this paper, we proposed the low computational complexity soft-decision e-BCH decoding algorithm based on the Chase algorithm. In order to make the test patterns, it is necessary to re-order the least reliable received symbols. In the process of ordering and finding optimal decoding symbols, high computational complexity is required. Therefore, this paper proposes the method of low computational complexity algorithm for soft-decision e-BCH decoding process.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.9
• /
• pp.1895-1902
• /
• 2011

The soft-decision e-BCH decoding algorithm based on the Chase algorithm is adopted in DVB-RCS NG systems. For implementation, it is necessary to decide the number of optimal quantization bits when soft-decision e-BCH decoding algorithm is processed. Also, the performance must be satisfied. Therefore, in this paper, when the soft-decision e-BCH decoder is implemented, we select the number of optimal quantization bits using BER performance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.9
• /
• pp.1095-1102
• /
• 2016

In this paper, we propose a decoding scheme that can apply to a three dimensional turbo product code(TPC) with a single parity check code(SPC). In general, SPC is used an axis with shortest code length in order to maximize a code rate of the TPC. However, SPC does not have any error correcting capability, therefore, the error correcting capability of the three-dimensional TPC results in little improvement in comparison with the two-dimensional TPC. We propose two schemes to improve performance of three dimensional TPC decoder. One is $min^*$-sum algorithm that has advantages for low complexity implementation compared to Chase-Pyndiah algorithm. The other is a modified serial iterative decoding scheme for high performance. In addition, the simulation results for the proposed scheme are shown and compared with the conventional scheme. Finally, we introduce some practical considerations for hardware implementation.

• Journal of Broadcast Engineering
• /
• v.16 no.6
• /
• pp.1026-1035
• /
• 2011

This paper presents generalization and application for the conventional SISO decoding algorithm of Block Turbo Codes. R. M. Pyndiah suggested an iterative SISO decoding algorithm for Product Codes, two-dimensionally combined linear block codes, on AWGN channel. It wascalled Block Turbo Codes. Based on decision of Chase algorithm which is SIHO decoding method, SISO decoder for BTC computes soft decision information and transfers the information to next decoder for iterative decoding. Block Turbo Codes show Shannon limit approaching performance with a little iteration at high code rate on AWGN channel. In this paper we generalize the conventional decoding algorithm of Block Turbo Codes, under BPSK modulation and AWGN channel transmission assumption, to the LLR value based algorithm and suggest an application example such as concatenated structure of LDPC codes and Block Turbo Codes.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10d
• /
• pp.46-48
• /
• 2002

현재 소프트웨어 개발에서 증가적으로 채택되고 있는 컴포넌트 기반 소프트웨어 엔지니어링(CBSE)에서, 새로운 프레임 ？에서의 컴포넌트의 효율적인 동작을 위한 컴포넌트 변형이나, 컴포넌트 통합은 활발히 연구가 진행중이나, 변형이나 통합으로 인하여 발생 할 수 있는 오류들을 테스팅하는 방법이과, 툴은 부족한 현실이다. 본 논문에서는 컴포넌트의 통합, 변경시 발생할수 있는 에러들을 쉽게 검출하기 위하여 본 논문에서 제안한 CCG(Component Calling Graph)를 이용하여 컴포넌트간의 의존성을 추적하고 selection 알고리즘을 거친 테스트 케이스 추출을 통한 컴포넌트의 효율적인 테스팅 방법을 제안하였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.6A
• /
• pp.519-536
• /
• 2007

In this paper, we combine the Hybrid-Automatic Repeat reQuest (HARQ) algorithm with joint Tx and Rx antenna selection based on the reliability of the individual antennas links. The cyclic redundancy check (CRC) is applied on the data before being encoded using the Turbo encoder. In the receiver the CRC is used to detect errors of each antenna stream and to decide whether a retransmission is required or not. The receiver feeds back the transmitter with the Tx antennas ordering and the acknowledgement of each antenna (ACK or NACK). If the number of ACK antennas is higher than the NACK antennas, then the retransmission takes place from the ACK antennas using the Chase Combining (CC). If the number of the NACK antennas is higher than the ACK antennas then the ACK antennas are used to retransmit the data streams using the CC algorithm and additional NACK antennas are used to retransmit the remaining streams using Incremental Redundancy (IR, i.e. the encoder rate is reduced). Furthermore, the HARQ is used with the I-BLAST (Iterative-BLAST) which grantees a high transmission rate.

• Journal of Korean Society of Transportation
• /
• v.25 no.6
• /
• pp.185-196
• /
• 2007

The aim of this research is to develop a signal control algorithm using internal metering to minimize total delay that vehicles go through, in case a network is oversaturated. To calculate total delay on the network, the authors first detect vehicles' arrivals and departures in the network through the detecting system, and chase the vehicles' flow in the links with a platoon dispersion model. Following these, the authors calculate the queue length in all the inks of the network through the chase of vehicles, deduce the stopped time delay, and finally convert the stopped time delay to the approach delay with a time-space diagram. Based on this calculated delay, an algorithm that calculates the level of the internal metering necessary to minimize the deduced approach delay is suggested. To verify effectiveness of this suggested algorithm, the authors also conduct simulation with the micro-simulator VISSIM. The result of the simulation shows that the average delay per vehicle is 82.3 sec/veh and this delay is lower than COSMOS (89.9sec/veh) and TOD (99.1sec/veh). It is concluded that this new signal control algorithm suggested in this paper is more effective in controlling an oversaturated network.

• Proceedings of the Korea Contents Association Conference
• /
• 2011.05a
• /
• pp.339-340
• /
• 2011

본 연구는 N말단 아미노산 종류에 따라 단백질의 수명(half-life)이 결정된다는 N-end rule을 기반으로 단백질 수명을 예측해주는 프로그램인 protparam의 결과와 bleach-chase를 이용한 실험 데이터를 비교 분석하였다. 단백질 수명을 결정하는 여러 요인들을 고려하지 않고 한 가지 요인만을 반영한 protparam의 결과는 실제 측정값과 현격한 차이를 나타낸다. 특히 실제 단백질은 NME(N-terminal Methionine Excision) 현상이 일어나는데 이를 고려하지 않고 유전체에서 번역한 그대로의 아미노산 서열을 가지고 단백질 수명을 계산하는 한계를 가지고 있다. 이에 본 연구에서 N말단 아미노산을 순차적으로 제거하여 N-end rule을 적용한 결과도 실험 데이터와 일치하지 않는 결과를 보여주고 있음을 확인하였다. 따라서 현재 사용되고 있는 단백질 수명 예측 프로그램은 이런 문제점을 가지고 있기 때문에 새로운 예측 알고리즘의 개발이 요구된다.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.1 s.33
• /
• pp.149-156
• /
• 2005

In the actuality that the various services are provided in connection with the network of internet by activating the communication using Propagation, the importance of the feature point and chase of an object is greatly raised to increase the quality of the detection and tracking of the communication service. This paper is to detect the shadow space by using Snakes Algorithms and Present a system's base which tracts the route from start to target points in the detected shadow space as a study for the detection and tracking the shadow space which does not reach the propagation.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2002.05a
• /
• pp.461-465
• /
• 2002

When general software system wants to need continuous Dept of Software Engineering by discovery of specification imperative sentence in some program, programmer analyzes program through practice orbit chase of program about value of input data. This paper that see therefore applies object intention program Slicing to existent program Slicing method, and express practice orbit of program in object intention subordination graph and show process that become Slicing. Proposed algorithm defenses crab extension is possible and can be used advantageously in case program is developed gradually as well as.