• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1998년도 추계종합학술대회 논문집
• /
• pp.175-178
• /
• 1998

In this paper, turbo codes with the DC-free trellis codes based on partition chain as constituent codes are presente. And efficient methods to design the DC-free turbo codes are introduced. An iterative decoding with the MAP algorithm is used for the decoding of the turbo codes designed by various methods. As results of simulations, the presented DC-free turbo codes show better error performances than the DC-free trellis codes.

• Journal of Communications and Networks
• /
• 제16권6호
• /
• pp.639-644
• /
• 2014

In low-density parity-check (LDPC) coded multiple-input multiple-output (MIMO) communication systems, probabilistic information are exchanged between an LDPC decoder and a MIMO detector. TheMIMO detector has to calculate probabilistic values for each bit which can be very complex. In [1], the authors presented a class of linear block codes named low-density MIMO codes (LDMC) which can reduce the complexity of MIMO detector. However, this code only supports the outer-iterations between the MIMO detector and decoder, but does not support the inner-iterations inside the LDPC decoder. In this paper, a new approach to construct LDMC codes is introduced. The new LDMC codes can be encoded efficiently at the transmitter side and support both of the inner-iterations and outer-iterations at the receiver side. Furthermore they can achieve the design rates and perform very well over MIMO channels.

• 디지털산업정보학회논문지
• /
• 제8권1호
• /
• pp.147-155
• /
• 2012

Fountain codes ensure reliability and robustness for time varying channels in wireless communication. In this paper, the concatenated fountain codes for AWGN and slow fading channels are investigated. Wireless system model, which includes the concatenated fountain code and modulation, is proposed. Maximum achievable rate is used for analyzing the performance of the system model for AWGN and fading channels. Belief Propagation (BP) algorithm is used for exploiting the soft information received at the decoder. Simulation results show that, concatenated fountain codes performs significantly better than that of a conventional Fountain codes with large packet lengths for higher Signal to Noise Ratio (SNR) in slow fading channels.

• Journal of Communications and Networks
• /
• 제13권3호
• /
• pp.205-210
• /
• 2011

This paper presents an approach to the construction of multiple-rate quasi-cyclic low-density parity-check (LDPC) codes. Parity-check matrices of the proposed codes consist of $q{\times}q$ square submatrices. The block rows and block columns of the parity-check matrix correspond to the hyperplanes (${\mu}$-fiats) and points in Euclidean geometries, respectively. By decomposing the ${\mu}$-fiats, we obtain LDPC codes of different code rates and a constant code length. The code performance is investigated in term of the bit error rate and compared with those of LDPC codes given in IEEE standards. Simulation results show that our codes perform very well and have low error floors over the additive white Gaussian noise channel.

• Journal of Communications and Networks
• /
• 제17권1호
• /
• pp.12-20
• /
• 2015

Convolutional codes which are terminated by direct truncation (DT) and zero tail termination provide unequal error protection. When DT terminated convolutional codes are used to encode short messages, they have interesting error protection properties. Such codes match the significance of the output bits of common quantizers and therefore lead to a low mean square error (MSE) when they are used to encode quantizer outputs which are transmitted via a noisy digital communication system. A code construction method that allows adapting the code to the channel is introduced, which is based on time-varying convolutional codes. We can show by simulations that DT terminated convolutional codes lead to a lower MSE than standard block codes for all channel conditions. Furthermore, we develop an MSE approximation which is based on an upper bound on the error probability per information bit. By means of this MSE approximation, we compare the convolutional codes to linear unequal error protection code construction methods from the literature for code dimensions which are relevant in analog to digital conversion systems. In numerous situations, the DT terminated convolutional codes have the lowest MSE among all codes.

• 한국통신학회논문지
• /
• 제31권9C호
• /
• pp.825-830
• /
• 2006

Capacity-approaching codes using iterative decoding have been the main subject of research activities during past decade. Especially, LDPC codes show the best asymptotic performance and density evolution has been used as a powerful technique to analyze and design good LDPC codes. In this paper, we apply density evolution with a Gaussian approximation to the concatenated zigzag (CZZ) codes by considering both flooding and two-way schedulings. Based on this density evolution analysis, the threshold values are computed for various CZZ codes and the optimal structure of CZZ codes for various code rates are obtained. Also, simulation results are provided to conform the analytical results.

• Journal of Communications and Networks
• /
• 제14권4호
• /
• pp.429-433
• /
• 2012

In this paper, we consider nonbinary quasi-cyclic low-density parity-check (QC-LDPC) codes and propose a method to design multiple rate codes with either fixed information bit length or block bit length, tailored to different scenarios in wireless applications. We show that the proposed codes achieve good performance over a broad range of code rates.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권7호
• /
• pp.3353-3370
• /
• 2016

The way of combination of Product Perfect Codes (PPCs) is based on the theory of short codes constructing long codes. PPCs have larger embedding rate than Hamming codes by expending embedding columns in a coding block, and they have been proven to enhance the performance of the F₅ steganographic method. In this paper, the proposed modified product codes called MPCs are introduced as an efficient way to embed more data than PPCs by increasing 2^r₂-1-r₂ embedding columns. Unlike PPC, the generation of the check matrix H in MPC is random, and it is different from PPC. In addition a simple solving way of the linear algebraic equations is applied to figure out the problem of expending embedding columns or compensating cases. Furthermore, the MPCs over ℤ₄ have been proposed to further enhance not only the performance but also the computation speed which reaches O(n₁+σ). Finally, the proposed ℤ₄-MPC intends to maximize the embedding rate with maintaining less distortion , and the performance surpasses the existing improved product perfect codes. The performance of large embedding rate should have the significance in the high-capacity of covert communication.

• 정보보호학회논문지
• /
• 제22권6호
• /
• pp.1325-1336
• /
• 2012

과거 일 평균 10종 내외로 발견되었던 악성코드가 최근 10년 동안 급격히 증가하여 오늘날에는 55,000종 이상의 악성코드가 발견되고 있다. 하지만 발견되는 다수의 악성코드는 새로운 형태의 신종 악성코드가 아니라 과거 악성코드에서 일부 기능이 추가되거나 백신탐지를 피하기 위해 인위적으로 조작된 변종 악성코드가 다수이다. 따라서 신종과 변종이 포함된 다수의 악성코드를 효과적으로 대응하기 위해서는 과거의 악성코드와 유사도를 비교하여 신종과 변종을 분류하는 과정이 필요하게 되었다. 기존의 악성코드를 대상으로 한 유사도 산출 기법은 악성코드가 사용하는 IP, URL, API, 문자열 등의 외형적 특징을 비교하거나 악성코드의 코드단계를 서로 비교하는 방식이 사용되었다. 하지만 악성코드의 유입량이 증가하고 비교대상이 많아지면서 유사도를 확인하기 위해 많은 계산이 필요하게 되자 계산량을 줄이기 위해 최근에는 퍼지해시가 사용되고 있다. 하지만 퍼지해시에 제한사항들이 제시되면서 기존의 퍼지해시를 이용한 유사도 비교방식의 문제점이 제시되고 있다. 이에 본 논문에서는 퍼지해시를 이용하여 유사도 성능을 높일 수 있는 새로운 악성코드간 유사도 비교기법을 제안하고 이를 활용한 악성코드 분류기법을 제시하고자 한다.

• 한국위성정보통신학회논문지
• /
• 제10권3호
• /
• pp.73-77
• /
• 2015

본 논문에서는 반복 복호 과정에서 연판정 정보값들의 변화로 인하여 성능이 개선되는 상황을 분석하기 위하여 사용되는 EXIT(extrinsic information transfer) 차트를 LDPC 부호와 터보 부호에 대하여 생성하는 기법을 소개하고, EXIT 차트 생성과정에서 비트 오류를 제외하였을 경우 나타나는 효과에 대해 살펴보기로 한다. 본 논문에서 제시된 시뮬레이션을 이용한 EXIT 챠트 생성 기법은 매우 간단한 방법으로 반복 복호를 사용하는 오류정정부호의 정보흐름을 파악할 수 있는 효율적인 방법이다. 시뮬레이션 결과 분석을 통하여 비트 오류를 제외할 경우 지나치게 정보량이 높은 구간에서만 EXIT 챠트가 생성된다는 사실을 확인할 수 있었다.