• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.7A
• /
• pp.1046-1051
• /
• 1999

It is well known that Parallel Concatenated Convolutional Codes(turbo codes) has a good performance for long block sizes. This thesis has analyzed the performance of turbo code which is based on voice or control frames with short frame sizes in the future mobile communication system. Also, at the similar decoding complexity, the performance of turbo code and convolutional codes in the speech/control frames, and the applicability of this system are considered. As a result, turbo code in short frame sizes present the performance of a BER of $10^{-3}$ or more over 3 iterations in the future mobile communication system. However, at a BER of $10^{-3}$ , if the same complexity is considered, the performance of rate 1/2 turbo code with K = 5 is better than that of convolutional code with K = 9 at low $E_b/N_0$, and the performance of turbo code with K = 3 is superior to that of convolutional code with K = 7. Rate 1/3 turbo code with K = 3 and 5 have similar to performance of rate 1/2 turbo code.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.10
• /
• pp.14-27
• /
• 2009

Polar Code was proposed by Turkish professor Erdal Arikan in 2006 as an idea that splitted input channel is increasing the cutoff rate. The channel polarization consisted of code sequences with symmetric high rate capacity in a given B-DMC(Binary-input Discrete Memoryless Channel) W. The symmetric capacity is the highest rate achievable subject to using the input letters of the channel with equal probability. The channel polarization is said to a set of given N independent outputs of B-DMC W. In other word, N increases when N is a set of binary-input channels {$W^{(i)}_N\;:\;1{\leq}\;i\;{\leq}\;N$}, in I{WN(i)} as the fraction of indices is near to 1, which is approaching to I(W), and it is near to 0, then to 1-I(W), where I(W) presents high rates in reliable wireless communication channel as inputs of W with equal frequences. After all, {WN(i)} is shown to be a state of channel coding. On the based on this Polar codes, this paper analyzes Polar coding and decoding of Arikan and propose Radix4 Polar coding newly.

• Journal of Broadcast Engineering
• /
• v.24 no.7
• /
• pp.1221-1227
• /
• 2019

This paper describes a low-density parity-check (LDPC) coded index modulated orthogonal frequency division multiplexing with quasi-orthogonal sequence (IM-OFDM-QOS) and provides performance evaluations of the proposed system. By using QOS as the spreading code, IM-OFDM-QOS scheme can improve the reception performance than IM-OFDM-SS scheme for a given data rate. On the other hand, LDPC code is widely used to the latest wireless communication systems as forward error correction (FEC) scheme and has Shannon-limit approaching performance. Therefore, by applying LDPC code to IM-OFDM-QOS system as FEC scheme, the reception performance can be further improved. Simulation results show that significant signal-to-noise ratio (SNR) gains can be obtained for LDPC coded IM-OFDM-QOS system compared to the LDPC coded IM-OFDM-SS system and the SNR gain increases with the higher code rate.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.10a
• /
• pp.655-658
• /
• 2008

In this paper, we explain the combined scheme of multi-code modulation and trans-orthogonal modulation. The name of the explained scheme is the multi-code trans-orthogonal modulation. Additionally, we propose a multi-code trans-biorthogonal modulation scheme, which is a little more improved multi-code trans-orthogonal modulation. We show the performance of the proposed schemes and compare the performance of the proposed schemes with the orthogonal modulation by using the computer simulation. According to the computer simulations, we can know that the bandwidth efficiency of the proposed schemes is better than that of the conventional orthogonal modulation. The proposed schemes can be used in physical layer of digital wireless telecommunication system to provide high speed data rate.

• Journal of Korea Society of Industrial Information Systems
• /
• v.23 no.4
• /
• pp.1-12
• /
• 2018

Currently, a large amount of printed matter associated with code authentication method are diffused widely, however, they have been reproduced with great precision and distributed successively in illegal ways. In this paper, we propose an efficient code authentication method which classifies authentic or counterfeit with smart-phone, effectively. The proposed method stores original image code in the server side and then extracts multiple comparison measures describing the original image. Based on these multiple measures, a code authentication algorithm is designed in such a way that counterfeit printed images may be effectively classified and then the recognition rate may be highly improved. Through real experiments, it is shown that the proposed method can improve the recognition rate greatly and lower the mis-recognition rate, compared with single measure method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.4A
• /
• pp.519-527
• /
• 2000

This paper suggests and analyzes the Serially Concatenated Space-Time Code(SCSTC) with the possibility of a efficient high-speed transmission in a band limited channel. The suggested code has a structure that uses the interleaver to connect the space-time code as an inner code and the convolutional code as a outer code serially. This code keeps the advantage of high-speed transmission and also has the high BER performance. The performance of the suggested system is compared with the conventional bandwidth efficient trellis coded modulation, such as a Serially Concatenated Trellis Coded Modulation (SCTCM) and a Turbo-Trellis Coded Modulation(Turbo-TCM). The results show that the suggested system has a 2.8dB and 3dB better BER performance than SCTCM and Turbo-TCM respectively in case of the transmission rate 2b/s/Hz in fading channel.

• Journal of Korea Multimedia Society
• /
• v.20 no.11
• /
• pp.1759-1767
• /
• 2017

Although Open API has been invigorated by advancements in the software industry, diverse types of malicious code have also increased. Thus, many studies have been carried out to discriminate the behaviors of malicious code based on API data, and to determine whether malicious code is included in a specific executable file. Existing methods detect malicious code by analyzing signature data, which requires a long time to detect mutated malicious code and has a high false detection rate. Accordingly, in this paper, we propose a method that analyzes and detects malicious code using association rule mining and an Naive Bayes classification. The proposed method reduces the false detection rate by mining the rules of malicious and normal code APIs in the PE file and grouping patterns using the DHP(Direct Hashing and Pruning) algorithm, and classifies malicious and normal files using the Naive Bayes.

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

In this paper, we propose performance improvement algorithm for high data rate wireless personal area network (HDR-WPAN) system using turbo code. Turbo code increase detection delay and computation according to iterate counts. However, turbo code has been shown to be very close th the Shanon limit, can be classified as a block-based error correction code. Turbo code has gain about E$_b$/N$_o$=5.8dB at 10$^{-4}$ in the multipath indoor channel. In the result, HDR-WPAN system adopted turbo code has reliable communication by low power.

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.1915-1919
• /
• 2003

A practical method of adaptive rate allocation to source and channel codings for an independent loss channel is proposed for Internet video. It is based on the observations that the values of residual loss probabilities at the optimal code rates for different packet loss probabilities are closely clustered to the average residual loss probability for a transmission frame size n in RS(n,k) code and for a total bit rate R. These observations aye then exploited to find the code rate for maximum PSNR. Simulation results demonstrate that the proposed method achieves a near-optimal bit-rate allocation in the joint source-channel coding of H.263 and RS(n,k) codings.

• Journal of Communications and Networks
• /
• v.11 no.5
• /
• pp.455-463
• /
• 2009

We consider the challenges of finding good puncturing patterns for rate-compatible low-density parity-check code (LDPC) codes over additive white Gaussian noise (AWGN) channels. Puncturing is a scheme to obtain a series of higher rate codes from a lower rate mother code. It is widely used in channel coding but it causes performance is lost compared to non-punctured LDPC codes at the same rate. Previous work, considered the role of survived check nodes in puncturing patterns. Limitations, such as single survived check node assumption and simulation-based verification, were examined. This paper analyzes the performance according to the role of multiple survived check nodes and multiple dead check nodes. Based on these analyses, we propose new algorithm to find a good puncturing pattern for LDPC codes over AWGN channels.