• Journal of Communications and Networks
• /
• v.15 no.1
• /
• pp.71-76
• /
• 2013

A new class of quantum low-density parity-check (LDPC) codes whose parity-check matrices are dual-containing matrices constructed based on lines of Euclidean geometries (EGs) is presented. The parity-check matrices of our quantum codes contain one and only one 4-cycle in every two rows and have better distance properties. However, the classical parity-check matrix constructed from EGs does not satisfy the condition of dual-containing. In some parameter conditions, parts of the rows in the matrix maybe have not any nonzero element in common. Notably, we propose four families of fascinating structure according to changes in all the parameters, and the parity-check matrices are adopted to satisfy the requirement of dual-containing. Series of matrix properties are proved. Construction methods of the parity-check matrices with dual-containing property are given. The simulation results show that the quantum LDPC codes constructed by this method perform very well over the depolarizing channel when decoded with iterative decoding based on the sum-product algorithm. Also, the quantum codes constructed in this paper outperform other quantum codes based on EGs.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.7C
• /
• pp.611-617
• /
• 2010

In this paper, we investigate the performances of the serial concatenated convolutional codes (SCCC) and low-density parity-check (LDPC) codes on perpendicular magnetic recording (PMR) channels. We discuss the performance of two systems when user bit-densities are 1.7, 2.0, 2.4 and 2.8, respectively. The SCCC system is less complex than LDPC system. The SCCC system consists of recursive systematic convolutional (RSC) codes encoder/decoder, precoder and random interleaver. The decoding algorithm of the SCCC system is the soft message-passing algorithm and the decoding algorithm of the LDPC system is the log domain sum-product algorithm (SPA). When we apply the iterative decoding between channel detector and the error control codes (ECC) decoder, the SCCC system is compatible with the LDPC system even at the high user bit density.

• The Journal of Society for e-Business Studies
• /
• v.12 no.3
• /
• pp.97-106
• /
• 2007

A core technology that may realize the Semantic Web is Ontology. The OWL (Web Ontology Language) has been positioned as a standard language. It requires technical expertise to directly represent the domain knowledge in OWL. Based on our experience of analyzing the fundamental relationships of concepts in e-catalog domain, we have developed a visual product information modeler called PROMOD. The modeling editor makes it possible to automatically generate the OWL codes for the given product information. We employ an Extended Entity-Relationship for conceptual modeling, enriched with modeling elements specialized for the product domain. In this paper, we present our translation schemes from EER model to OWL codes, and how to design and implement the modeling editor. We also provide a scenario to demonstrate the usage of the editor in practice.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.22 no.5
• /
• pp.24-28
• /
• 1985

In this paper, the cyclic product codes which are capable of correcting random erros and burst errors simultaneously have been designed and constructed. First, the procedure for product of two cyclic codes is shown and thin the encoder and decoder system using the (7,4) cyclic Hamming code and the (3,1) cyclic code is implemented. The micro-computer is used for experiment and the system consists of encoder, decoder and interface circuits. The encoder of cyclic product code is implemented by interlacing encoders while the decoder is implemented by cascading decoders that interlace error trapping decoders. In conclusion, cyclic product codas are easily decodable and are capable of correcting four random errors and eight-burst errors. Better performance is obtained with low error rate.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.5C
• /
• pp.498-504
• /
• 2009

A high-performance low-complexity decoding algorithm for LDPC codes is proposed in this paper, which has the advantages of both bit-flipping (BF) algorithm and sum-product algorithm (SPA). The proposed soft bit-flipping algorithm requires only simple comparison and addition operations for computing the messages between bit and check nodes, and the amount of those operations is also small. By increasing the utilization ratio of the computed messages and by adopting nonuniform quantization, the signal-to-noise ratio (SNR) gap to the SPA is reduced to 0.4dB at the frame error rate of 10-4 with only 5-bit assignment for quantization. LDPC codes with high column or row weights, which are not suitable for the SPA decoding due to the complexity, can be practically implemented without much worsening the error performance.

• Journal of Fashion Business
• /
• v.19 no.5
• /
• pp.139-156
• /
• 2015

The purpose of this study is to investigate various information relating to research on the dimensions of clothing used in the sale of products via the internet that used to target global SPA((Specialty Store Retailer of Private Label Apparel) brands sold in Korea. A total of 12 SPA brands including seven global SPA brands and five national. SPA brands were surveyed in this study. Brands were chosen net sales and consumer preferences the last three years. In all SPA brands, literal size designation such as S, M, L and numeric size designation such as 0, 2, 4 or 32, 34, 36 etc. were mixed, but in case of Jean, the size codes mark waist circumference were dominant. European size codes were more common in case of European brands while literal codes were more dominantly used for American size codes with in the US brands. By reviewing the measurement information of the body and product size, the product measurement methods of UNIQLO, FOREVER 21 and TOPTEN were much more accountable and excellent than other brands. However, most of the others didn't offer proper information such as pictograms or figures about measurement methods relating body sizes and product sizes. In addition, most of global SPA brands offered size conversion chart which consumers could reference, however of none of the national SPA brands offered a conversion size chart on their website. Regardless of the type of clothing, the coverage of clothing size was higher than in global SPA brands such as H&M GAP compared to national SPA brands. In particular, 8seconds did not present apparel size ranges that fit consumers' individual clothes sizes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.1C
• /
• pp.20-25
• /
• 2006

In this paper, the performance of Tree-LDPC code is presented based on the min-sum algorithm with scaling and the asymptotic performance in the water fall region is shown by density evolution. We presents that the Tree-LDPC code show a significant performance gain by scaling with the optimal scaling factor which is obtained by density evolution methods. We also show that the performance of min-sum with scaling is as good as the performance of sum-product while the decoding complexity of min-sum algorithm is much lower than that of sum-product algorithm. The Tree-LDPC decoder is implemented on a FPGA chip with a small interleaver size.

• ETRI Journal
• /
• v.38 no.2
• /
• pp.326-336
• /
• 2016

We propose and describe new error control algorithms for redundant residue number systems (RRNSs) and residue number system product codes. These algorithms employ search techniques for obtaining error values from within a set of values (that contains all possible error values). For a given RRNS, the error control algorithms have a computational complexity of $t{\cdot}O(log_2\;n+log_2\;{\bar{m}})$ comparison operations, where t denotes the error correcting capability, n denotes the number of moduli, and ${\bar{m}}$ denotes the geometric average of moduli. These algorithms avoid most modular operations. We describe a refinement to the proposed algorithms that further avoids the modular operation required in their respective first steps, with an increase of ${\lceil}log_2\;n{\rceil}$ to their computational complexity. The new algorithms provide significant computational advantages over existing methods.

• 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.

• 한국연소학회:학술대회논문집
• /
• 2013.06a
• /
• pp.91-94
• /
• 2013

Commercial computational fluid dynamics (CFD) codes traditionally rely on the computational efficiency of the simplified single-film apparent char kinetic model to predict char particle temperatures and char conversion rates in pulverized coal boilers. The aim of this study is to evaluate the reliability of the single-film apparent kinetic model and to suggest the importance of proper use of this model. For this, a parametric study was conducted with a consideration of main parameters such as Stefan flow, product species, particle evolution, and kinetic parameters.