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

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.6 no.1
• /
• pp.53-60
• /
• 1996

오증 요소로부터 오류위치다항식의 계수를 계산함으로서 (23,12) Golay 부호를 복호할 수 있는 대수적 복호법이 최근 증명되었다. GF(2)상에서의 3중 오류정정 BCH부호의 복호법을 이 부호에 완벽하게 적용하여 해석하는 것을 소개한다. 그리고 GF(2)에 대한 최적의 정규기저를 구하여 이를 유한체 연산에 적용하며 단계별로 복호 회로의 구성을 제시한다. 이는 기존의 복호기보다 논리회로적으로 간단하며, 복호된 정보를 얻기까지 35번의 치환이 필요하다.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.7 no.1
• /
• pp.33-44
• /
• 1997

BISDN(Broadband Integrated Service Digital Network)의 AAL-1(ATM Adaptation Layer-1)에서는 오류정정능력이 2인 (128,124) RS(Reed Slomon) 부호를 이용하여 ATM 셀에서 발생하는 오류를 정정하고 있다. 본 논문에서는 기존의 RS 복호 알고리즘을 분석한 후, 이를 바탕으로 AAL-1 기본오류정정 모드에 적용 가능한 복잡도가 낮고 고속 동작이 가능한 복호 알고리즘을 제시하고, 부호기와 보호기를 VHDL로 부호화하고 설계한 후, 관련 회로를 시뮬레이션한다. 또한 시뮬레이션된 회로를 XACT을 이용하여 XC 4025 FPGA에 실현하여 제안되 복호 알고리즘의 타당성을 확인한다.

• Annual Conference on Human and Language Technology
• /
• 1995.10a
• /
• pp.73-79
• /
• 1995

현재 정보 관련 응용 분야 가운데 ISO 2022 를 따르는 분야가 아주 않은데, 현재 쓰고 있는 한글 부호계들은 ISO 2022 를 절대로 지원하지 못하거나, ISO 2022를 지원하더라도 한글을 재대로 지원하지 못하는 문제가 있다. 이러한 문제를 해결하기 위해서 ISO 2022 를 지원하면서 한글을 제대로 지원하는 새로운 한 바이트 한글 부호계를 만들었다. 새로운 한 바이트 한글 부호계는 요즘 한글 11,172 소리마디를 모두 표현 할 수 있으며, 불완전한 소리마디를 나타내는 방법으로 기존의 채움 글자 방식을 버리고 자연스럽고 한글의 특성에 맞는 뗌 글자 방식을 택하였다. 본 연구에서는 새로운 한 바이트 한글 부호계를 지원하는 X-Window용 한글 문서 편집기를 개발해 봄으로써 그 운용 가능성을 검증하였다. 한 바이트 한글 부호계를 지원하는 문서 편집기의 운용 환경으로 유닉스 운영체제 하에서 돌아가는 X-Window 시스템을 택하였고, 한글 입출력 부분을 모티프 (Motif)의 위짓 (widget) 형태로 구현하여 다른 응용 프로그램에서도 쉽게 한 바이트 한글 부호계를 지원할 수 있게 하였다.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.48 no.10
• /
• pp.831-835
• /
• 2020

By automatically generating HDL codes from C/C++ source codes, HLS makes it possible to shorten FPGA system developing period through easy timing control and structure change. We designed LDPC encoder for telemetry standard 106-17 with Xilinx Vivado HLS and showed hardware structure can be easily adapted for different purposes through minor C code modification. Synthesis results targeting Spartan-7 xc7s100 device are presented for throughput and hardware complexity comparison.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.14 no.1
• /
• pp.65-74
• /
• 1989

This paperr presetns the Direct Decoding Method for binary BCH codes which can find the error locattion number directly from the syndrome without calculating the error locator polynomical. Also in this paper, the triple and quadruple error correcting BCH decoder are designed using this method. As an example, the triple error correcting (63.45) BCH decoder is implemented with TTL ICs. It is shown from our results that this decoder can be implemented with relatively simple hardware.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.6
• /
• pp.990-996
• /
• 2015

This paper proposes an enhanced scheme adding a sign detector at the front of the correlator in STDR (sequence time domain reflectometry) system. We have executed simulations to show the improvement of detection performance in two fault types and various fault locations. Consequently, it can be shown that the proposed scheme improves the detection performance of the location of far-fault without increasing the computational complexity.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.2
• /
• pp.352-358
• /
• 2004

This paper is studied the improvement of performance for moving picture encoder using H.263. This is used the new motion vector search algorithm using a relation with neighborhood search point and is applied the integer DCT for the encoder. The integer DCT behaves DCT by the addition operation of the integer using WHT and a integer lifting than conventional DCT that needs the multiplication operation of a floating point number. Therefore, the integer Dn can reduce the operation amount than basis DCT with having an equal PSNR. The new motion vector search algorithm is showed almost similar PSNR as reducing the operation amount than the conventional motion vector search algorithm. To experiment a compatibility of the integer DCT and the conventional DCT, according to result compare case that uses a method only and case that uses the alternate two methods of the integer DCT or the conventional DCT to H.263 encoder and decoder, case that uses the alternate two methods is showed doing not deteriorate PSNR-and being each other compatible visually than case that uses an equal method only.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.5C
• /
• pp.454-463
• /
• 2010

After the efficiency of H.264 video compression has been announced, it replaced MPEG-2 standard in several applications. So transcoding methods of MPEG-2 to H.264 have been studying because there are variety devices and contents followed by MPEG-2. Although H.264 supported various service such as IPTV, DMB, digital broadcasting etc, but users using MPEG-2 devices cannot accessible to them. This paper propose H.264 to MPEG-2 transcoding for users of MPEG-2 devices without displacement H.264. The proposed method predicted a motion vector for MPEG-2 encoder after it extracted from motion vectors of variable blocks in H.264 to improve processing time. Also it predicted a optimal motion vector using modified boundary matching algorithm after grasped a special character for boundary and background of object. The experimental results from proposed method show a considerable reduction in processing time, as much as 68% averagely, with a small objective quality reduction in PSNR.