• Proceedings of the Korean Information Science Society Conference
• /
• 2012.06b
• /
• pp.330-332
• /
• 2012

시계열 데이터 모델링은 시간 간격의 길이에 따라 단기적인 패턴이 주로 반영된다. 특히, 모델에 마코프 가정을 적용하였을 경우 이전 시간의 값에 따라 현재값이 결정된다. 시계열 데이터의 장기적인 변화를 다루기 위해, 특정 길이의 순차적 패턴을 부호화 하고, 이를 상위 모델의 입력으로 사용하는 과정을 통해 추상화를 시도하고자 한다. 실제로 사람의 감각기억은 200~500 밀리초 가량의 짧은 기억 유지기간을 갖는데, 이 기간의 정보를 상위 처리기의 입력 단위로 보고자 하는 것이다. 이에 본 고에서는 에너지기반 모델링 기법을 이용하여 반복적으로 나타나는 순차적 패턴을 부호화 하는 방법을 제안한다. 이 부호화 방법은 시간 순서에 따른 패턴의 유사도를 이용하여 확률적으로 다음 패턴과의 관계를 표현할 수 있으며, 이는 향후 시계열 데이터를 간략하게 표현하여 분석 및 시각화에 도움을 줄 수 있다.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.11 no.3
• /
• pp.115-122
• /
• 2008

Wu and Tsai's pixel-value differencing method and Chang and Tseng's side-match method are based on the theory that the number of bits which can be embedded is determined by the degree of the pixel's smoothness, or its proximity to the edge of the image. If pixels are located in the edge area, they may tolerate larger changes than those in smooth areas. However, both methods are subject to the fall off the boundary problem(FOBP). This study proposes a new scheme that can solve the FOBP. The experimental results demonstrate that the proposed method resolves the problem, and achieves a higher image quality index value than other methods.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2012.11a
• /
• pp.64-66
• /
• 2012

본 논문에서는 각기 다른 자료를 지닌 두 송신자가 하나의 수신자에게 릴레이를 거쳐 자료를 전송하는 Ynetwork 시스템에서 Polar code 의 구조적인 특징을 이용해 오류율을 줄여 전송할 수 있는 방법을 제안한다. Polar code 는 부호의 길이 N 이 커짐에 따라 임의의 B-DMC(Binary-Discrete Memoryless Channel)에 대해 채널 용량을 달성할 수 있는 부호이며 반복적인 구조로 인해 부호화와 복호화 복잡도가 낮은 장점을 가진 부호이다. 이러한 성질을 이용해 Y-network 시스템의 릴레이에서 간단한 이진 모듈로 덧셈으로 전체 부호의 길이를 늘려 전송효율을 높일 수 있다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.11
• /
• pp.2397-2404
• /
• 2012

Underwater acoustic communication has multipath error because of reflection by sea-level and sea-bottom. The multipath of underwater channel causes signal distortion and error floor. In order to improve the performance, it is necessary to employ an iterative coding scheme. Among the iterative coding scheme, turbo codes and LDPC codes are dominant channel coding schemes in recent. This paper concluded that turbo coding scheme is optimal for underwater communications system in aspect to performance, coded word length, and equalizer combining. Also, decision directed phase recovery was used for correcting phase offset induced by multipath. Based on these algorithms, we confirmed the performance in the environment of oceanic experimentation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38C no.3
• /
• pp.303-310
• /
• 2013

Underwater acoustic communication has multipath error because of reflection by sea-level and sea-bottom. The multipath of underwater channel causes signal distortion and error floor. In order to improve the performance, it is necessary to employ an iterative coding scheme. Among the iterative coding scheme, turbo codes and LDPC codes are dominant channel coding schemes in recent. This paper concluded that turbo coding scheme is optimal for underwater communications system in aspect to performance, coded word length, and equalizer combining. Also, we confirmed the performance in the environment of oceanic experimentation using turbo equalizer based on distance 5Km, data rate 1Kbps.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.7
• /
• pp.13-23
• /
• 2009

In this paper, the network performance of a turbo coded optical code division multiple access (CDMA) system with cross-layer, which is between physical and network layers, concept is analyzed and simulated. We consider physical and MAC layers in a cross-layer concept. An intensity-modulated/direct-detection (IM/DD) optical system employing pulse position modulation (PPM) is considered. In order to increase the system performance, turbo codes composed of parallel concatenated convolutional codes (PCCCs) is utilized. The network performance is evaluated in terms of bit error probability (BEP). From the simulation results, it is demonstrated that turbo coding offers considerable coding gain with reasonable encoding and decoding complexity. Also, it is confirmed that the performance of such an optical CDMA network can be substantially improved by increasing e interleaver length and e number of iterations in e decoding process. The results of this paper can be applied to implement the indoor optical wireless LANs.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.5A
• /
• pp.333-340
• /
• 2003

In this paper, we propose a new turbo-coded orthogonal frequency division multiplexing (OFDM) transmission scheme that can improve greatly the performance by making all the turbo-coded symbols have the same reliability for OFDM transmission over a frequency selective fading channel. The same reliability, that is, the same fading can be accomplished through multiplexing of turbo-coded symbols using distinct orthogonal codes and spreading over the whole effective subcarriers (hereafter, called as the orthogonal code multiplexing (OCM)). As for the orthogonal code selection, we choose the set of the discrete Fourier transform (DFT) basis sequences, since the code set holds the orthogonality irrespective of the length and also has the equal energy property. We perform computer simulations using the Log-maximum-a-posteriori (Log-MAP) algorithm for iterative decoding in order to assess the performance of the proposed transmission scheme.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.16 no.10 s.101
• /
• pp.965-972
• /
• 2005

In this paper, we first review LDPC codes in general and a belief propagation algorithm that works in logarithm domain. LDPC codes, which is chosen for second generation digital video broadcasting standard, are required a large number of computation due to large size of coded block and iteration. Therefore, we presented two kinds of low computational algorithm for LDPC codes. First, sequential decoding with partial group is proposed. It has same H/W complexity, and fewer number of iteration's are required at same performance in comparison with conventional decoder algerian. Secondly, early detection method for reducing the computational complexity is proposed. Using a confidence criterion, some bit nodes and check node edges are detected early on during decoding. Through the simulation, we knew that the iteration number are reduced by half using subset algorithm and computational complexity of early detected method is about $50\%$ offs in case of check node update, $99\%$ offs in case of check node update compared to conventional scheme.

• Journal of Navigation and Port Research
• /
• v.37 no.5
• /
• pp.487-492
• /
• 2013

Underwater acoustic communication has multipath error because of reflection by sea-level and sea-bottom. The multipath of underwater channel causes signal distortion and error floor. In order to improve the performance, it is necessary to employ an iterative coding scheme. Among the iterative coding scheme, turbo codes, LDPC codes and convolutional code based on BCJR algorithm are dominant channel coding schemes in recent. Therefore this paper analyzed the performance of iterative codes based on turbo equalizer with the same coding rate and similar codeword length. The performances of three kinds of iterative codes were evaluated in the environment of underwater acoustic communication channel that are real data collected in Korean east sea. The distance of transmitter and receiver was 5Km and data rate was 1Kbps. As a result, convolutional code based on BCJR algorithm has better performance in underwater channel than turbo codes and LDPC codes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.2C
• /
• pp.148-154
• /
• 2010

In this paper, we first review LDPC codes in general and a belief propagation algorithm that works in logarithm domain. LDPC codes, which is chosen 802.11n for wireless local access network(WLAN) standard are required a large number of computation due to large size of coded block and iteration. Therefore, we presented three kinds of low computational algorithm for LDPC codes. First, sequential decoding with partial group is proposed. It has same H/W complexity, and fewer number of iteration's are required at same performance in comparison with conventional decoder algorithm. Secondly, we have apply early stop algorithm. This method is reduced number of unnecessary iteration. Third, early detection method for reducing the computational complexity is proposed. Using a confidence criterion, some bit nodes and check node edges are detected early on during decoding. Through the simulation, we knew that the iteration number are reduced by half using subset algorithm and early stop algorithm is reduced more than one iteration and computational complexity of early detected method is about 30% offs in case of check node update, 94% offs in case of check node update compared to conventional scheme.