• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.7
• /
• pp.1419-1426
• /
• 1997

A new SCEE(Syndrome Check Error Estimation) decoding method for convolutional code and concatenated SCEE/RS (Reed-Solomon) conding scheme are proposed. First, we describe the operation of the decoding steps in the proposed algorithm. Then deterministic values on the decoding operation are drived when some combination of predecoder-reencoder is used. Computer simulation results show that the compuatational complexity of the proposed SCEE decoder is significantly reduced compared to that of conventional Viterbi-decoder without degratation of the $P_{e}$ performance. Also, the concatenated SCEE/RS decoder has almost the same complexity of a RS decoder and its coding gain is higher than that of soft decision Viterbi or RS decoder respectively.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.2
• /
• pp.143-155
• /
• 2013

A low-complexity dual-user multiplexing scheme is proposed for a pair of mobiles equipped with single antenna operating over frequency-selective fading channels. The proposed scheme employs OFDM transmission scheme with a modified version of a space-frequency code and a low-complexity PIC-SIC group detection is invoked at the corresponding receiver. The BER performances of the proposed scheme are studied using LTE-like parameters through simulations and are compared against those of conventional ZF and ML schemes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.6
• /
• pp.1115-1125
• /
• 1994

In this paper, an efficient concatenated coding scheme under the satellite channel is presented. The performance of this scheme in terms of bit error rate versus energy per information bit over white gaussian noise power density E/N has been evaluated via computer simulation as a function of various system parameters. To achieve accuracy in simulation results, the distortions caused from the satellite channel, such as the nonlinearity of the TWTA(traveling wave tube amplifier), signal distortions of the input and output filters, has been considered. The simulation results show that, through using the 2/3 punctured convolutional code as the inner code of the concatenated code system, the coding rate can be improved more over 16%, while maintaining the same system complexity and bit error performance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.3C
• /
• pp.216-225
• /
• 2007

This paper presents bit splitting methods to apply multilevel modulation to iterative codes such as turbo code, low density parity check code and turbo product code. Log-likelihood ratio method splits multilevel symbols to bits using the received in-phase and quadrature component based on Gaussian approximation. However it is too complicate to calculate and implement hardware due to exponential and log calculation. therefore this paper presents Euclidean, MAX and Sector method to reduce the high complexity of LLR method. We propose optimal bit splitting method for three iterative codes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.2
• /
• pp.471-485
• /
• 2023

As data sharing increases explosively, such information encoded in QR code is completely public as private messages are not securely protected. This paper proposes a new 'PROMISE' framework for hiding information based on the QR code projection matrix by using image segmentation without modifying the essential QR code characteristics. Projection matrix mapping, matrix scrambling, fusion image segmentation and steganography with SEL(secret embedding logic) are part of the PROMISE framework. The QR code could be mapped to determine the segmentation site of the fusion image as a binary information matrix. To further protect the site information, matrix scrambling could be adopted after the mapping phase. Image segmentation is then performed on the fusion image and the SEL module is applied to embed the secret message into the fusion image. Matrix transformation and SEL parameters should be uploaded to the server as the secret key for authorized users to decode the private message. And it was possible to further obtain the private message hidden by the framework we proposed. Experimental findings show that when compared to some traditional information hiding methods, better anti-detection performance, greater secret key space and lower complexity could be obtained in our work.

• Journal of KIISE:Software and Applications
• /
• v.32 no.9
• /
• pp.847-852
• /
• 2005

Over the last decade, numerous complexity measurement techniques for Object-Oriented (OO) software system have been proposed for managing the effects of OO codes. These techniques may be based on source code analysis such as WMC (Weighted Methods per Class) and LCOM (Lack of Cohesion in Methods). The techniques are limited to count the number of functions (C++). However. we suggested a new weighted method that checks the number of parameters, the return value and its data type. Then we addressed an effective complexity measurement technique based on the weight of class interfaces to provide guidelines for measuring the class complexity of OO codes in reverse engineering. The results of this research show that the proposed complexity measurement technique ECC(Enhanced Class Complexity) is consistent and accurate in C++ environment.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2006.07a
• /
• pp.226-226
• /
• 2006

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.1A
• /
• pp.34-42
• /
• 2012

Low density parity check (LDPC) code is widely used, since it shows superior performance close to Shannon limit and its decoding complexity is lower than turbo code. Recently, it is used as a channel code to decode Wyner-Ziv frames in distributed video coding (DVC) system. In this paper, we propose an efficient method to design the parity check matrix H of LDPC codes. In order to apply LDPC code to DVC system, the LDPC code should have rate compatibility. Thus, we also propose a method to merge check nodes of LDPC code to attain the rate compatibility. LDPC code is designed using ACE algorithm and check nodes are merged for a given code rate to maximize the error correction capability. The performance of the designed LDPC code is analyzed extensively by computer simulations.

• Journal of Internet Computing and Services
• /
• v.7 no.5
• /
• pp.95-108
• /
• 2006

The digital contents expand into software source code and maintenance of technology and IPR about source code have a very important meaning to international competition, The recognition about software security is very low specially among these Intellectual Property Rights. On occurring disputation property, we have to prove the fact, there is a problem to discriminate the original source code, Also, it is hard to accurate decision that is correct to complexity and the lack of read and understand ability even if software is reproduced. In this paper, we don't enforce distinction about software reproduction by one individual code unit. And we developed digital license prototype of XML that can distinguish reproduction based on structural conformability of whole source codes. Software has Context Free Grammar in structure and presents BNF notation type, it is apt to present hierarchical structure. Then, we can express architecture of software source code by hierarchical structure to discriminate structural conformability. In this paper, we make a study of the digital licence prototype for discriminate the original source code. Reserved words of software source code by parsing express to XML file that have hierarchical structure. Then, we can express architecture of software source code by tree structure form instead of complex source code.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.44 no.4 s.316
• /
• pp.21-27
• /
• 2007

Recently cluster system built from personal computers and network devices are easily and economically constructed. Rapid technological change discloses new processors on the market yielding cluster systems heterogeneity. A parallel system in heterogeneous environment needs work managers for utilizing the full power of the heterogeneous cluster system. In this paper, we compare MPI and Cilk in a heterogeneous cluster system in terms of performance and code complexity. Experimental results show that Cilk is better than MPI with small sizes of data transfers while MPI outperforms Cilk with big sizes of data transfers. Also, We find that Cilk requires less programming efforts to write a parallel program.