• Title/Summary/Keyword: BINARY CODE

Search Result 511, Processing Time 0.023 seconds

Efficient Evaluation of Path Algebra Expressions

  • Lee, Tae-kyong
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.5 no.1
    • /
    • pp.1-15
    • /
    • 2000
  • In this paper, an efficient system for finding answers to a given path algebra expression in a directed acylic graph is discussed more particulary, in a multimedia presentration graph. Path algebra expressions are formulated using revised versions of operators next and until of temporal logic, and the connected operator. To evaluate queries with path algebra expressions, the node code system is proposed. In the node code system, the nodes of a presentation graph are assigned binary codes (node codes) that are used to represent nodes and paths in a presentation graph. Using node codes makes it easy to find parent-child predecessor-sucessor relationships between nodes. A pair of node codes for connected nodes uniquely identifies a path, and allows efficient set-at-a-time evaluations of path algebra expressions. In this paper, the node code representation of nodes and paths in multimedia presentation graphs are provided. The efficient algorithms for the evaluation of queries with path algebra expressions are also provided.

  • PDF

An Architecture Design of a Multi-Stage 12-bit High-Speed Pipelined A/D Converter (다단 12-비트 고속 파이프라인 A/D 변환기의 구조 설계)

  • 임신일;이승훈
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.32A no.12
    • /
    • pp.220-228
    • /
    • 1995
  • An optimized 4-stage 12-bit pipelined CMOS analog-to-digital converter (ADC) architecture is proposed to obtain high linearity and high yield. The ADC based on a multiplying digital-to-analog converter (MDAC) selectively employs a binary-weighted-capacitor (BWC) array in the front-end stage and a unit-capacitor (UC) array in the back-end stages to improve integral nonlinearity (INL) and differential nonlinearity (DNL) simultaneously whil maintaining high yield. A digital-domain nonlinear error calibration technique is applied in the first stage of the ADC to improve its accuracy to 12-bit level. The largest DNL error in the mid-point code of the ADC is reduced by avoiding a code-error symmetry observed in a conventional digitally calibrated ADC is reduced by avoiding a code-error symmetry observed in a conventional digitally calibrated ADC is simulated to prove the effectiveness of the proposed ADC architecture.

  • PDF

Construction of Polar codes for Efficient Data Transmission in Y-Network System (Polar code 를 이용하여 Y-network 시스템에서 효율적인 정보 전송을 위한 구조 설계)

  • Park, Choong Hun;Heo, Jun
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2012.11a
    • /
    • pp.64-66
    • /
    • 2012
  • 본 논문에서는 각기 다른 자료를 지닌 두 송신자가 하나의 수신자에게 릴레이를 거쳐 자료를 전송하는 Ynetwork 시스템에서 Polar code 의 구조적인 특징을 이용해 오류율을 줄여 전송할 수 있는 방법을 제안한다. Polar code 는 부호의 길이 N 이 커짐에 따라 임의의 B-DMC(Binary-Discrete Memoryless Channel)에 대해 채널 용량을 달성할 수 있는 부호이며 반복적인 구조로 인해 부호화와 복호화 복잡도가 낮은 장점을 가진 부호이다. 이러한 성질을 이용해 Y-network 시스템의 릴레이에서 간단한 이진 모듈로 덧셈으로 전체 부호의 길이를 늘려 전송효율을 높일 수 있다.

  • PDF

Physical Layer Design of Dual-Band Guardian Modem based on Quasi-Orthogonal Code (유사 직교 부호 기반 이중 대역 Guardian 모뎀의 물리계층 설계)

  • Lee, Hyeon-Seok;Cho, Jin-Woong;Hong, Dae-Ki
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.62 no.1
    • /
    • pp.127-132
    • /
    • 2013
  • In this paper, we design the physical layer of Guardian modem for wireless public networks. The physical layer is composed of a dual-band RF (Radio Frequency) transceiver and a baseband-processor with quasi-orthogonal codes. The 2.4/5GHz dual-band RF transceiver can overcome the communication difficulty of dense 2.4GHz band for wireless public environment. Also the quasi-orthogonal code can reduce the required ASIC (Application Specific Integrated Circuit) design area. Finally, we analyze the performance of the developed system in viewpoint of data rate, BER (Bit Error Rate), PER (Packet Error Rate). Moreover we verify the performance of the dual-band RF communication.

A Study on the Structure of Turbo Trellis Coded Modulation with an Effectively Reduced Complexity in Wireless Communication Channel (무선통신채널에서 효과적으로 감소된 복잡도를 갖는 Turbo Trellis Coded Modulation 구조 연구)

  • Kim Jeong-su
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.5 no.5
    • /
    • pp.409-412
    • /
    • 2004
  • This paper shows that the proposed Turbo TCM(Turbo Trellis Coded Modulation) has a good performance with a little complexity of decoder. The encoder structure, which is connected with Turbo Codes, is the proposed modulation technique for an efficient bandwidth, This method is used symbol by symbol MAP decoder of iteration similar to binary Turbo Codes in the receiver. The result shows that the BER performance according to iteration is improved about 2,5dB at $BER=10^{-2}$ compared to Turbo Codes with Gray mapping.

  • PDF

McEliece Type PKC Based on Algebraic Geometry Code over Hyperelliptic Curve (초타원 곡선위에서 생성된 대수기하 부호를 이용한McEliece유형의 공개키 암호시스템)

  • 강보경;한상근
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.12 no.1
    • /
    • pp.43-54
    • /
    • 2002
  • McEliece introduced a public-key cryptosystem based on Algebraic codes, specially binary classical Goppa which have a good decoding algorithm and vast number of inequivalent codes with given parameters. And the advantage of this system low cost of their encryption and decryption procedures compared with other public-key systems specially RSA, ECC based on DLP(discrete logarithm problem). But in [1], they resent new attack based on probabilistic algorithm to find minimum weight codeword, so for a sufficient security level, much larger parameter size [2048, 1608,81]is required. Then the big size of public key make McEliece PKC more inefficient. So in this paper, we will propose New Type PKC using q-ary Hyperelliptic code so that with smaller parameter(1 over 3) but still work factor as hi인 as McEliece PKC and faster encryption, decryption can be maintained.

A Construction Theory of Multiple-Valued Logic Fuctions on GF($(2^m)$ by Bit Code Assignment (Bit Code할당에 의한 GF($(2^m)$상의 다치논리함수 구성 이론)

  • Kim, Heung Soo;Park, Chun Myoung
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.23 no.3
    • /
    • pp.295-308
    • /
    • 1986
  • This paper presents a method of constructing multiple-valued logic functions based on Galois field. The proposed algorithm assigns all elements in GF(2**m) to bit codes that are easily converted binary. We have constructed an adder and a multiplier using a multiplexer after bit code operation (addition, multiplication) that is performed among elements on GF(2**m) obtained from the algorithm. In constructing a generalized multiple-valued logic functions, states are first minimized with a state-transition diagram, and then the circuits using PLA widely used in VLSI design for single and multiple input-output are realized.

  • PDF

Algorithm of Decoding the Base 256 mode in Two-Dimensional Data Matrix Barcode (이차원 Data Matrix 바코드에서 Base 256 모드의 디코딩 알고리즘)

  • Han, Hee June;Lee, Hyo Chang;Lee, Jong Yun
    • Journal of the Korea Convergence Society
    • /
    • v.4 no.3
    • /
    • pp.27-33
    • /
    • 2013
  • Conventional bar code has the appearance of line bars and spaces, called as one-dimensional bar code. In contrast, the information in two-dimensional bar code is represented by either a small, rectangular or square with the types of mosaic and Braille. The two-dimensional bar code is much more efficient than one-dimensional bar code because it can allow to store and express large amounts of data in a small space and so far there is also a little information about decoding the Data Matrix in base 256 mode. According to the ISO international standards, there are four kinds of bar code: QR code, Data Matrix, PDF417, and Maxi code. In this paper, among them, we focus on describing the basic concepts of Data Matrix in base 256 mode, how to encode and decode them, and how to organize them in detail. In addition, Data Matrix can be organized efficiently depending on the modes of numeric, alphanumeric characters, and binary system and expecially, we focus on describing how to decode the Data Matrix code by four modes.

A New BIM Line Code for High Speed Binary Data Transmission (고속 이진 데이터 전송을 위한 새로운 BIM 선로부호)

  • 정희영;오행석;조경록
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.24 no.12A
    • /
    • pp.1939-1947
    • /
    • 1999
  • This paper proposes new line code BIM (Bit Insertion and Manipulation) that is designed to overcome the problems of existing line codes. The block code, one of typical existing line code, has good transmission performance but difficulty in implementation. The other typical existing line code, bit insertion code, is easy to implementation but has bad transmission performance. BIM code in this paper could provide not only good performance but also provides simplicity in the implementation by combining the good points of block code into it of bit insertion code properly. In this paper, 5B6B type BIM code is designed. Designed 5B6B BIM code shows good transmission performance such $\pm$2 DSV, 0 RSD, 7 maximum run length and also it can be implemented under 2000 gates and need only 1 bit redundancy.

  • PDF

Implementation of the Container ISO Code Recognition System for Real-Time Processing (실시간 처리를 위한 컨테이너 ISO코드 인식시스템의 구현)

  • Choi Tae-Wan
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.10 no.8
    • /
    • pp.1478-1489
    • /
    • 2006
  • This paper describes system to extract ISO codes in container image. A container ISO code recognition system for real-time processing is made of 5 core parts which are container ISO code detection and image acquisition, ISO code region extraction, individual character extraction, character recognition and database. Among them, the accuracy of ISO code extraction can affect significantly the accuracy of system recognition rate, and also the more exact extraction of ISO code is required in various weather and environment conditions. The proposed system produces binary of the ISO code's template lesions using an adaptive thresholding, extracts candidate regions containing distribution of ISO code, and recognizes ISO codes as detecting a final region through the verifications by using character distribution characteristics of ISO code among the extracted candidates. Experimental results reveal that ISO codes can be efficiently extracted by the proposed method.