• The Journal of the Korea institute of electronic communication sciences
• /
• v.10 no.7
• /
• pp.831-836
• /
• 2015

This paper studied scrambling occurrence in the line coder for UTF-8 hangul syllable code based on unicode. The paper suggested that scrambling is occurred when consecutive four "0" bit is entered into the line coder from the source codes. Currently, ITU-T is applying HDB-3 scrambling method in AMI line coder, According to the study result, scrambling is occurred about 39% in UTF-8 code on Unicoe Hangul syllable.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.6 no.5
• /
• pp.657-664
• /
• 2011

This paper proposes the revised ASCII code. The study started with consideration whether the ASCII code is proper or not in the side of the transmission efficiency in data communications. In data communications, when the consecutive "0" bits from the information devices input into the line coder, its consecutive "0" bits are scrambled to the predetermined patterns not to the consecutive "0" signal. The paper used to study with the statistical data for the frequency of the letters of the alphabets and the proposed rule of characters coding in reference. As a result of the study, when the proposed ASCII code is applied, the operation efficiency of the scrambler in the line coder is improved upto average 30%.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.7 no.4
• /
• pp.761-776
• /
• 2012

This paper proposes the revised Roman character code system using Unicode 3.0. The background of the paper is whether the Latin character code system th using in the world in Unicode V.3 is proper or not in the side of the transmission efficiency in data communications. In data communications, when the consecutive 4 bits or 8 bits of "0" bit from the information devices input into the line coder, its consecutive "0" bits are scrambled to the predetermined bit patterns to avoid the syncronization loss. The paper was based on the statistical data for the using frequency of the alphabet letter and the proposed rule for characters coding in [1]. The paper was focused to improve of Unicode itself and UTF-8 code system. As a result of the paper, when the proposed coding systems for Latin character in Unicode 3.0 itself and UTF-8 code system, the scrambler efficiency using HDB-3 in the line coder of the data transmission system could be improved about 3645 ~ 31400% and 480 ~ 1700% respectively.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.10 no.9
• /
• pp.1019-1026
• /
• 2015

This paper studied the source coding rule of the characters to minimize the HDB-3 scrambling for UTF-8 code. An existing source coding rule of the characters to minimize the HDB-3 scrambling in the line coder is for the source codes which are directly entered into the line coder without any transformation. Therefore the existing source coding rule can't apply the UTF-8 code which is directly came into an input of line coder. The reason is that the scrambling code in the source codes are not same as UTF-8 codes. So, if they want to analysis the scrambling occurrence situation in UTF-8 codes and make an unscrambling UTF-8 code, they should make a UTF-8 code table for the source codes, find out the scrambling occurrence codes and then encode the unscrambling source code. The source coding rule for UTF-8 code showing this paper can omit such a complicated procedure to encode an unscrambling source code.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.10 no.1
• /
• pp.39-46
• /
• 2015

The paper studied possibility of improvement of efficient of data processing in the line coder when Hangul syllables in Unicode system is used for the source code. The scrambling in the line coder is to solve the problem happened due to the source code. The study is based on the HDB-3 scrambling method in ITU-T standards that is applied to AMI line coder. The referred data of Hangul syllables and its use frequency which are required to analysis was used the data extracted from the source data of the National Korean Language Institute. According to the analysis, the average 24% scrambling was generated in source code of Hangul syllables in Unicode system. When the referred Hangul syllables was applied to Unicode system, the average 27% scrambling was producted. Total 8,924ea Hangul syllables in 11,172ea Hangul syllables in Unicode system were not scrambled. Therefore the referred Hangul syllables 1,540ea were accepted in the unscrambled code areas. As a result, the existing Unicode Hangul syllable codes can't prevent the scrambling, but it is possible to completely remove the 27% scrambling with new source coding system. And then, it can be improved the data processing efficient upto minimum 27% in line coder by software in presentation layer instead of physical layer.

• Journal of Advanced Navigation Technology
• /
• v.19 no.2
• /
• pp.153-160
• /
• 2015

This paper has studied about the scrambling occurrence frequency in UTF-8 coding system for Unicode Hangul Jamo codes. The scrambling methode applied in the study is HDB-3 in AMI line coding that is international transmission standard. In the study, the source coding rule was applied to analysis the scrambling occurrence. The quantity of the scrambling occurrence was calculated by the number of times and frequency rate of the scrambling occurrence in Hangul Jamo and Compatibity Hangul Jamo. In the case of Hangul Jamo, the number of times and frequency rate in Unicode and UTF-8 were 24times, 52% and 148times, 228% respectively. In the case of Compatibility Hangul Jamo, that were 10times, 14% and 83times, 131% respectively. As a result, when Hangul Jamo and Compatibility Hangul Jamo in UNICODE were transformed to UTF-8, the scrambling frequency rates were increased 340% and 851% respectively.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.8 no.7
• /
• pp.1011-1015
• /
• 2013

This paper analyses the violation rate of CJK joint Chines character Unicode to the source code rule. In the paper, Chinese character 150ea in Chinese Unicode which have relatively a higher frequency in use of a character was chosen to study. The frequency rate in use of the 150ea characters is about 50% of the total frequency rate of the Chinese characters. The study was applied the AMI/HDB-3 line coding/scrambling and HDLC protocol, According to the analyses, the number of violated characters were 77ea of 150 ea, frequency rate in use 29%. Therefore, when the violated 77ea characters are replaced to the matched character codes to the source coding rule, the processing rate of the line coder can be improved about 37%.

• The KIPS Transactions:PartA
• /
• v.11A no.1
• /
• pp.1-10
• /
• 2004

A cellular array parallel multiplier with parallel-inputs and parallel-outputs for performing the multiplication of two polynomials in the finite fields GF$(2^m)$ is presented in this paper. The presented cellular way parallel multiplier consists of three operation parts: the multiplicative operation part (MULOP), the irreducible polynomial operation part (IPOP), and the modular operation part (MODOP). The MULOP and the MODOP are composed if the basic cells which are designed with AND Bates and XOR Bates. The IPOP is constructed by XOR gates and D flip-flops. This multiplier is simulated by clock period l${\mu}\textrm{s}$ using PSpice. The proposed multiplier is designed by 24 AND gates, 32 XOR gates and 4 D flip-flops when degree m is 4. In case of using AOP irreducible polynomial, this multiplier requires 24 AND gates and XOR fates respectively. and not use D flip-flop. The operating time of MULOP in the presented multiplier requires one unit time(clock time), and the operating time of MODOP using IPOP requires m unit times(clock times). Therefore total operating time is m+1 unit times(clock times). The cellular array parallel multiplier is simple and regular for the wire routing and have the properties of concurrency and modularity. Also, it is expansible for the multiplication of two polynomials in the finite fields with very large m.