• Journal of applied mathematics & informatics
• /
• v.32 no.3_4
• /
• pp.529-537
• /
• 2014

The paper introduces a new product of polynomials defined over a field. It is a generalization of the ordinary product with inner polynomial getting non-overlapping segments obtained by multiplying with coefficients and variable with expanding powers. It has been called 'Ordered Power Product' (OPP). Considering two rings of polynomials $R_m[x]=F[x]modulox^m-1$ and $R_n[x]=F[x]modulox^n-1$, over a field F, the paper then considers the newly introduced product of the two polynomial rings. Properties and algebraic structure of the product of two rings of polynomials are studied and it is shown to be a ring. Using the new type of product of polynomials, we define a new product of two cyclic codes and devise a method of getting a cyclic code from the 'ordered power product' of two cyclic codes. Conditions for the OPP of the generators polynomials of component codes, giving a cyclic code are examined. It is shown that OPP cyclic code so obtained is more efficient than the one that can be obtained by Kronecker type of product of the same component codes.

• Journal of Internet Computing and Services
• /
• v.7 no.4
• /
• pp.11-22
• /
• 2006

Software product-lines methodology is the software development paradigm to build the target system by customizing the variable part of software assets according to requirements. To attain this, the commonalities and variabilities of the system family should be modeled explicitly at early stage. Although the researches on general software product-lines are active, the researches on component-based real-time embedded software product-lines are rather inactive. In this paper a code generation system to support the functional variabilities via feature model and generate the code for synchronization via state model is proposed to increase the productivity of the development of the real-time embedded software product-lines.

• KIPS Transactions on Software and Data Engineering
• /
• v.12 no.1
• /
• pp.1-18
• /
• 2023

Similar software is often developed with the Clone-And-Own (CAO) approach that copies and modifies existing artifacts. The CAO approach is considered as a bad practice because it makes maintenance difficult as the number of cloned products increases. Software product line engineering is a methodology that can solve the issue of the CAO approach by developing a product family through systematic reuse. Migrating product families that have been developed with the CAO approach to the product line engineering begins with finding, integrating, and building them as reusable assets. However, cloning occurs at various levels from directories to code lines, and their structures can be changed. This makes it difficult to build product line code base simply by finding clones. Successful migration thus requires unifying the source code's file path, class name, and method signature. This paper proposes a clustering method that identifies a set of similar codes scattered across product variants and some of their method full paths are different, so path unification is necessary. In order to show the effectiveness of the proposed method, we conducted an experiment using the Apo Games product line, which has evolved with the CAO approach. As a result, the average precision of clustering performed without preprocessing was 0.91 and the number of identified common clusters was 0, whereas our method showed 0.98 and 15 respectively.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.9
• /
• pp.1095-1102
• /
• 2016

In this paper, we propose a decoding scheme that can apply to a three dimensional turbo product code(TPC) with a single parity check code(SPC). In general, SPC is used an axis with shortest code length in order to maximize a code rate of the TPC. However, SPC does not have any error correcting capability, therefore, the error correcting capability of the three-dimensional TPC results in little improvement in comparison with the two-dimensional TPC. We propose two schemes to improve performance of three dimensional TPC decoder. One is $min^*$-sum algorithm that has advantages for low complexity implementation compared to Chase-Pyndiah algorithm. The other is a modified serial iterative decoding scheme for high performance. In addition, the simulation results for the proposed scheme are shown and compared with the conventional scheme. Finally, we introduce some practical considerations for hardware implementation.

• The Journal of the Korea Contents Association
• /
• v.18 no.10
• /
• pp.431-442
• /
• 2018

2-dimensional barcode, QR code has been used for containing various information such as image, video, map, and business cards. Currently, a smartphone is used as a QR code scanner, displaying the code and converting it to a standard URL for a website. However, QR codes are not very common in encrypted application and so have a few applications. This paper proposes a new color-code, which integrates the conventional QR code and color design, and can be effectively used in some product certification system. The proposed method exploits the fact that genuine code is produced by CMYK color model, but the counterfeit is captured by RGB color model and during this process, color information of the code is changed. This paper introduces the color matrix model to measure the distortion between genuine code and counterfeit code. By investigating the statistical characteristics of color matrix, an effective detection of print image forgeries are designed. Various experiments with color codes show that the proposed system can be effectively used in product certification systems.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.9C
• /
• pp.721-728
• /
• 2010

CAMC (constant amplitude multi-code) has a better performance of error correction in iterative decoding than SPCPC (single parity check product code). CAMC benefits from a processing gain since it belongs to a spread spectrum signal. We show that the processing gain enhances the performance of CAMC. Additional correction of bit errors is achieved in the de-spreading of iteratively decoded signal. If the number of errors which survived the iterative decoding is less than or equal to ($\sqrt{N}/2-1$), all of the bit errors are removed after the de-spreading. We also propose a stopping criterion in the iterative decoding, which is based on the histogram of EI (extrinsic information). The initial values of EI are randomly distributed, and then they converge to ($-E_{max}$) or ($+E_{max}$) over the iterations. The strength of the convergence reflects how successfully error correction process is performed. Experimental results show that the proposed method achieves a gain of 0.2 dB in Eb/No.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.54 no.5
• /
• pp.3-7
• /
• 2017

Holographic data storage system (HDSS) features short access times, high storage capacities, and fast transfer rates, since the data is recorded and read not by lines but by pages within a volume of holographic material. Burst error caused by physical impact on the high density storage system becomes very longer than that of conventional storage systems. This paper proposes an LDPC product code using two LDPC code to resolve burst error. When a total code rate is similar, the performance of two LDPC code having high code rate is better than that of one LDPC code having low code rate. Also, with error factors of two-dimensional intersysbol interference and misalignment, the proposed scheme can improve the performance in holographic data storage system.

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

This paper presents low latency and/or computation algorithms of iterative codes of turbo codes, turbo product codes and low density parity check codes for use in wireless broadband communication systems. Due to high coding complexity of iterative codes, this paper focus on lower complexity and/or latency algorithms that are easily implementable in hardware and further accelerate the decoding speed.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.12 no.4
• /
• pp.569-574
• /
• 2017

In order to transmit information in a channel environment in which noise exists, a coding technique of information is required. One of the coding techniques used for error detection and correction close to the Shannon limit is Low Density Parity Code(LDPC). LDPC and decoding characteristic features by Sum-product algorithm are matched for the performance to Turbo Code, RA(Repeat Accumulate) code, in case of very long code length of LDPC surpass their performance. This paper explains LDPC coding scheme of image data and decoding scheme, implements LDPC decoder in FPGA.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.6
• /
• pp.135-140
• /
• 2016

In this paper, we analyze the [UC;AG] code which is genetic information standard DNA code, with 64 trigram. DNA which contains human genetic information, is a shape of adding three billion pairs of four bases which are A(adenine), C(cytosine), G(guanine) and T(thymine) to phosphoric acid and glucose. We present standard DNA code to 64 trigram which is $64{\times}4$ matrix with Kronecker product. This $64{\times}4$ matrix has double helix duplex property, and we can get the $4{\times}4$ matrix RNA code by removing the duplex of it. We present the DNA double helix to matrices and analysis the trigram array code of genetic information and the examples of it are presented in example 5, 6.