• 제목/요약/키워드: ASCII symbol

검색결과 4건 처리시간 0.017초

데이터 전송 효율을 고려한 3×4비트 1 바이트 문자 부호화 규칙에 관한 연구 (Study on the coding rule of Characters by 1 byte of 3×4 bits with consideration for the transmission efficiency of data communications)

  • 홍완표
    • 한국전자통신학회논문지
    • /
    • 제6권4호
    • /
    • pp.499-504
    • /
    • 2011
  • 본 논문은 컴퓨터 등 정보기기에 입력되는 문자나 기호의 부호화 규칙을 제시하였다. 문자나 부호를 부호화할 때 본 논문에서 제시하는 규칙을 적용할 경우, 데이터를 전송로에 전송할 때 회선부호화과정에서 발생하는 스크램블링의 발생으로 인한 전송효율이 떨어지는 것을 감소시킬 수 있다. 본 논문에서는 3비트열 ${\times}$ 4비트행의 1바이트 부호화에 대한 것을 고찰하였다. 이를 위해 대표적인 3비트 열 ${\times}$ 4비트 행의 1바이트 부호체계인 ASCII 부호체계를 적용하였다.

An Efficient DNA Sequence Compression using Small Sequence Pattern Matching

  • Murugan., A;Punitha., K
    • International Journal of Computer Science & Network Security
    • /
    • 제21권8호
    • /
    • pp.281-287
    • /
    • 2021
  • Bioinformatics is formed with a blend of biology and informatics technologies and it employs the statistical methods and approaches for attending the concerning issues in the domains of nutrition, medical research and towards reviewing the living environment. The ceaseless growth of DNA sequencing technologies has resulted in the production of voluminous genomic data especially the DNA sequences thus calling out for increased storage and bandwidth. As of now, the bioinformatics confronts the major hurdle of management, interpretation and accurately preserving of this hefty information. Compression tends to be a beacon of hope towards resolving the aforementioned issues. Keeping the storage efficiently, a methodology has been recommended which for attending the same. In addition, there is introduction of a competent algorithm that aids in exact matching of small pattern. The DNA representation sequence is then implemented subsequently for determining 2 bases to 6 bases matching with the remaining input sequence. This process involves transforming of DNA sequence into an ASCII symbols in the first level and compress by using LZ77 compression method in the second level and after that form the grid variables with size 3 to hold the 100 characters. In the third level of compression, the compressed output is in the grid variables. Hence, the proposed algorithm S_Pattern DNA gives an average better compression ratio of 93% when compared to the existing compression algorithms for the datasets from the UCI repository.

Computer Codes for Korean Sounds: K-SAMPA

  • Kim, Jong-mi
    • The Journal of the Acoustical Society of Korea
    • /
    • 제20권4E호
    • /
    • pp.3-16
    • /
    • 2001
  • An ASCII encoding of Korean has been developed for extended phonetic transcription of the Speech Assessment Methods Phonetic Alphabet (SAMPA). SAMPA is a machine-readable phonetic alphabet used for multilingual computing. It has been developed since 1987 and extended to more than twenty languages. The motivating factor for creating Korean SAMPA (K-SAMPA) is to label Korean speech for a multilingual corpus or to transcribe native language (Ll) interfered pronunciation of a second language learner for bilingual education. Korean SAMPA represents each Korean allophone with a particular SAMPA symbol. Sounds that closely resemble it are represented by the same symbol, regardless of the language they are uttered in. Each of its symbols represents a speech sound that is spectrally and temporally so distinct as to be perceptually different when the components are heard in isolation. Each type of sound has a separate IPA-like designation. Korean SAMPA is superior to other transcription systems with similar objectives. It describes better the cross-linguistic sound quality of Korean than the official Romanization system, proclaimed by the Korean government in July 2000, because it uses an internationally shared phonetic alphabet. It is also phonetically more accurate than the official Romanization in that it dispenses with orthographic adjustments. It is also more convenient for computing than the International Phonetic Alphabet (IPA) because it consists of the symbols on a standard keyboard. This paper demonstrates how the Korean SAMPA can express allophonic details and prosodic features by adopting the transcription conventions of the extended SAMPA (X-SAMPA) and the prosodic SAMPA(SAMPROSA).

  • PDF

데이터 전송 효율을 고려한 4비트행×4비트열 2 바이트 문자 부호화 규칙에 관한 연구 (Coding Rule of Characters by 2 bytes with 4×4 bits to Improve the Transmission Efficiency in Data Communications)

  • 홍완표
    • 한국항행학회논문지
    • /
    • 제15권5호
    • /
    • pp.749-756
    • /
    • 2011
  • 본 논문은 컴퓨터 등 정보기기에 입력되는 문자나 기호의 부호화 규칙을 제시하였다. 문자나 부호를 부호화할 때 본 논문에서 제시하는 규칙을 적용할 경우, 데이터를 전송로에 전송할 때 회선부호화과정에서 발생하는 스크램블링의 발생으로 인한 전송효율이 떨어지는 것을 감소시킬 수 있다. 본 논문에서는 4비트열 ${\times}$ 4비트행의 2 바이트 부호화에 대한 것을 고찰하였다. 본 논문에서는 2바이트(16비트) 원천부호체계로 KS X 1001에 규격화되어 있는 로마 문자용 부호집합에 대한 부호체계를 참고로 하였다.