• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2006.05a
• /
• pp.107-110
• /
• 2006

This work presents a low complexity maximum-likelihood decoder for signal detection in VBLAST-STBC system, which employs non-square O-STBC code rate 3/4. By stacking received symbols from different received symbolduration and applying QR decomposition resulting the special format of upper triangular matrix R, the proposed decoder is able to provide not only ML-like BER performance but also very low computational load. The low computational load and ML-like BER performance properties of the proposed decoder are verified by computer simulations.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.5 no.5
• /
• pp.409-412
• /
• 2004

This paper shows that the proposed Turbo TCM(Turbo Trellis Coded Modulation) has a good performance with a little complexity of decoder. The encoder structure, which is connected with Turbo Codes, is the proposed modulation technique for an efficient bandwidth, This method is used symbol by symbol MAP decoder of iteration similar to binary Turbo Codes in the receiver. The result shows that the BER performance according to iteration is improved about 2,5dB at $BER=10^{-2}$ compared to Turbo Codes with Gray mapping.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.13-16
• /
• 1999

Many of the currently used PN code acquisition algorithms detect the phase of the incoming PN signal on the basis of ML estimation principle and utilize statistics grounded in taking inner products. As an extension of PN code acquisition algorithm using one auxiliary code introduced by Salih in 1996, we propose a more and optimal (hardware / time / space complexity wise) algorithm by using a vector space approach. We outline some important differences between our algorithm and that introduced by Salih and in the process point out some advantages of our algorithm.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.47 no.6
• /
• pp.66-74
• /
• 2010

Recently distributed video coding (DVC) is spotlighted for the environment which has restriction in computing resource at encoder. Wyner-Ziv (WZ) coding is a representative scheme of DVC. The WZ encoder independently encodes key frame and WZ frame respectively by conventional intra coding and channel code. WZ decoder generates side information from reconstructed two key frames (t-1, t+1) based on temporal correlation. The side information is regarded as a noisy version of original WZ frame. Virtual channel noise can be removed by channel decoding process. So the performance of WZ coding greatly depends on the performance of channel code. Among existing channel codes, Turbo code and LDPC code have the most powerful error correction capability. These channel codes use stochastically iterative decoding process. However the iterative decoding process is quite time-consuming, so complexity of WZ decoder is considerably increased. Analysis of the complexity of LPDCA with real video data shows that the portion of complexity of LDPCA decoding is higher than 60% in total WZ decoding complexity. Using the HDA (Hard Decision Aided) method proposed in channel code area, channel decoding complexity can be much reduced. But considerable RD performance loss is possible according to different thresholds and its proper value is different for each sequence. In this paper, we propose an adaptive HDA method which sets up a proper threshold according to sequence. The proposed method shows about 62% and 32% of time saving, respectively in LDPCA and WZ decoding process, while RD performance is not that decreased.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.13 no.5
• /
• pp.465-472
• /
• 2013

This paper presents a low-complexity triple-error-correcting parallel Bose-Chaudhuri-Hocquenghem (BCH) decoder architecture and its efficient design techniques. A novel modified step-by-step (m-SBS) decoding algorithm, which significantly reduces computational complexity, is proposed for the parallel BCH decoder. In addition, a determinant calculator and a error locator are proposed to reduce hardware complexity. Specifically, a sharing syndrome factor calculator and a self-error detection scheme are proposed. The multi-channel multi-parallel BCH decoder using the proposed m-SBS algorithm and design techniques have considerably less hardware complexity and latency than those using a conventional algorithms. For a 16-channel 4-parallel (1020, 990) BCH decoder over GF($2^{12}$), the proposed design can lead to a reduction in complexity of at least 23 % compared to conventional architecttures.

• KIPS Transactions on Computer and Communication Systems
• /
• v.8 no.2
• /
• pp.35-40
• /
• 2019

Traditional Malware Detection is susceptible for detecting malware which is modified by polymorphism or obfuscation technology. By learning patterns that are embedded in malware code, machine learning algorithms can detect similar behaviors and replace the current detection methods. Data must collected continuously in order to learn malicious code patterns that change over time. However, the process of storing and processing a large amount of malware files is accompanied by high space and time complexity. In this paper, an HDFS-based distributed processing system is designed to reduce space complexity and accelerate feature extraction time. Using a distributed processing system, we extract two API features based on filtering basis, 2-gram feature and APICFG feature and the generalization performance of ensemble learning models is compared. In experiments, the time complexity of the feature extraction was improved about 3.75 times faster than the processing time of a single computer, and the space complexity was about 5 times more efficient. The 2-gram feature was the best when comparing the classification performance by feature, but the learning time was long due to high dimensionality.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.2C
• /
• pp.181-186
• /
• 2004

Recently, there has been intensive focus on Turbo Product Codes(TPCs) which have low decoding complexity and achieve near-optimum performances at high code-rate. This paper present a parallel algorithm of turbo product codes enable simultaneous decoding of row and column. The row and column decoders operate in parallel and update each other after row and column has been decoded. simulation results show that the performance of proposed parallel turbo code is almost the same as that conventional scheme for several turbo product codes.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.215-218
• /
• 1998

This paper proposes a blind multi-user detector using Code-Constrained Minimum Variance (CCMV) method which directly detects the DS-CDMA signals in a multipath fading channel without estimating the channels. This algorithm reduces the complexity of computation by making a small size data matrix with the order of the channel length. Advantageously it requires to know the spreading code and the time delay of only the desired user.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.12 no.1
• /
• pp.27-33
• /
• 1975

The required minimum size of character diode matrix of Korean letters is estimated from the topological complexity of letter structure. The OR aombination of three letter boards (diode matrice) gives all possible Hangout whole letters in proper traditional combined form with minimum required discernibility. Two forms of first consonants (centre located ones for horizontal vowels and leftward displaced ones for vertical and composed vowels) are switched by only 1 bit of the vowel code. The vowel pattern length is modified by again the last four bits of the code. A new 15bit sized inner code is proposed which permits considerably small sized decoding mechanism.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.17 no.5
• /
• pp.51-59
• /
• 2017

In this paper, we propose a gray code order of antenna index permutations for differential spatial modulation (DSM). To facilitate the implementation, the well-known Trotter-Johnson ranking and unranking algorithms are adopted, which result in similar computational complexity to the existing DSM that uses the lexicographic order. The signal-to-noise ratio gain achieved by the proposed gray code order over the lexicographic order is also analyzed and verified via simulations. Based on the gray coding framework, we further propose a diversity-enhancing scheme named intersected gray (I-gray) code order, where the permutations of active antenna indices are selected directly from the odd (or even) positions of the full permutations in the gray code order. From analysis and simulations, it is shown that the I-gray code order can harvest an additional transmit diversity order with respect to the gray code order.