• Title/Summary/Keyword: binary encoding

Search Result 130, Processing Time 0.025 seconds

Study on Performance of Double Binary Turbo Code for Power Line Communication Systems Base on OFDM (OFDM 기반의 전력선 통신 시스템에서 이중 이진 터보 부호 성능 연구)

  • Kim, Jin-Young;Cha, Jae-Sang;Kim, Seong-Kweon;Lee, Jong-Joo;Kim, Jae-Hyun;Lee, Chong-Hoon;Kim, Eun-Cheol
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.9 no.3
    • /
    • pp.193-199
    • /
    • 2009
  • Powerline communications (PLC) technology has been discussed and analyzed as a highly potential candidate of wireline access network solutions. In this paper, performance of double binary turbo coded orthogonal frequency division multiplexing (OFDM) system is analyzed and simulated in power line communications channel. In order to make power line channel environments, Bernoulli-Gaussian noise is considered. The performance is evaluated in terms of bit error probability. From the simulation results, it is demonstrated that the double binary turbo coding scheme offers considerable coding gain with reasonable encoding complexity. It is also shown that the system performance can be substantially improved by increasing the number of iterations.

  • PDF

A New Flash A/D Converter Adopting Double Base Number System (2개의 밑수를 이용한 Flash A/D 변환기)

  • Kim, Jong-Soo;Kim, Man-Ho;Jang, Eun-Hwa
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.9 no.1
    • /
    • pp.54-61
    • /
    • 2008
  • This paper presents a new TIQ based CMOS flash 6-bit ADC to process digital signal in real time. In order to improve the conversion speed of ADC by designing new logic or layout of ADC circuits, a new design method is proposed in encoding logic circuits. The proposed encoding circuits convert analog input into digitally encoded double base number system(DBNS), which uses two bases unlike the normal binary representation scheme. The DBNS adopts binary and ternary radix to enhance digital arithmetic processing capability. In the DBNS, the addition and multiplication can be processed with just shift operations only. Finding near canonical representation is the most important work in general DBNS. But the main disadvantage of DBNS representation in ADC is the fan-in problem. Thus, an equal distribution algorithm is developed to solve the fan-in problem after assignment the prime numbers first. The conversion speed of simulation result was 1.6 GSPS, at 1.8V power with the Magna $0.18{\mu}m$ CMOS process, and the maximum power consumption was 38.71mW.

  • PDF

A Study on the Encoding between ASN.1 and XML for Fast Web Services (Fast Web Services를 위한 ASN.1과 XML간의 인코딩에 관한 연구)

  • Yu, Seong-Jae;Yoon, Haw-Mook;Song, Jong-Chul;Choi, Il-sun;Jung, Hoe-Kyung
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • v.9 no.2
    • /
    • pp.959-962
    • /
    • 2005
  • Recently, business integration and interoperability of between the heterogeneous applications are requested by rapid growth of web. Web Services that self-contained for platform and programming language is appeared used to XML of standard data format. Such amid Fast Web Services attract attention at fields necessary to bring rapid communication like Mobile and RFID. In this paper, we inquired about ASN.1 of ITU-T and IS0/IEC standard that a central role of data transform. And we studied encoding process of between ASN.1 and XML for transform SOAP massage of a massage transfer mode of Web Services to binary data.

  • PDF

Efficient Vertex-based Shape Coding using One-dimensional Vertex and Vertex Reordering (1차원 정점과 정점 재배열 이용한 효율적 정점기반 모양정보 부호화)

  • 정재원;문주희;김재균
    • Journal of Broadcast Engineering
    • /
    • v.2 no.2
    • /
    • pp.94-104
    • /
    • 1997
  • This paper presents a new vertex-based binary shape coding scheme using one-dimensional vertex selection/encoding and vertex reordering. In compared with the conventional object-adaptive vertex encoding(OA VEL the extracted vertices are, firstly, classified into one-dimensional(lD) vertices and two-dimensional (2D) vertices in the proposed method. For lD vertices, new coding method proposed in this paper is performed. For 2D vertices, the vertex reordering and OA VE are carried out. Experimental results show that the proposed vertex-based coding scheme red.uces coding bits up to 12 % compared with the conventional one and its coding gain depends on the characteristics of contour.

  • PDF

Measuring Methods for Two-dimensional Position Referring to the Target Pattern (참조패턴 기반의 2차원 변위 측정 방법론)

  • Jung, Kwang Suk;Lee, Sang Heon;Park, Sung-Jun
    • Journal of the Korean Society of Manufacturing Technology Engineers
    • /
    • v.22 no.1
    • /
    • pp.77-84
    • /
    • 2013
  • In this paper, we review two-dimensional measuring methods referring to target patterns. The patterns consist of two linearly-repeated patterns or is designed repeatedly in two-dimension. The repeated properties are reflectivity, refractivity, air-gapping distance, capacitance, magnetic reluctance, electrical resistance and sloping gradient, etc. However, the optical methods are generally used for high speed processing and density, and their encoding principles are treated here. In case of two-dimensional pattern, as there is not inherently error between single units encoding the pattern except for the metrology frame errors, the end-effector position of an object accompanying the pattern can be measured with respect of the global frame without via error. Therefore, it is regarded as a substitute for laser interferometer with severe environmental constraints and has been applied to the high-accurate planar actuator.

A Differential Index Assignment Scheme for Tree-Structured Vector Quantization (나무구조 벡터양자화 기반의 차분 인덱스 할당기법)

  • 한종기;정인철
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.2C
    • /
    • pp.100-109
    • /
    • 2003
  • A differential index assignment scheme is proposed for the image encoding system in which a variable-length tree-structured vector quantizer is adopted. Each source vector is quantized into a terminal node of VLTSVQ and each terminal node is represented as a unique binary vector. The proposed index assignment scheme utilizes the correlation between interblocks of the image to increase the compression ratio with the image quality maintained. Simulation results show that the proposed scheme achieves a much higher compression ratio than the conventional one does and that the amount of the bit rate reduction of the proposed scheme becomes large as the correlation of the image becomes large. The proposed encoding scheme can be effectively used to encode R images whose pixel values we, in general, highly correlated with those of the neighbor pixels.

Fast Algorithm for Intra Prediction of HEVC Using Adaptive Decision Trees

  • Zheng, Xing;Zhao, Yao;Bai, Huihui;Lin, Chunyu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.7
    • /
    • pp.3286-3300
    • /
    • 2016
  • High Efficiency Video Coding (HEVC) Standard, as the latest coding standard, introduces satisfying compression structures with respect to its predecessor Advanced Video Coding (H.264/AVC). The new coding standard can offer improved encoding performance compared with H.264/AVC. However, it also leads to enormous computational complexity that makes it considerably difficult to be implemented in real time application. In this paper, based on machine learning, a fast partitioning method is proposed, which can search for the best splitting structures for Intra-Prediction. In view of the video texture characteristics, we choose the entropy of Gray-Scale Difference Statistics (GDS) and the minimum of Sum of Absolute Transformed Difference (SATD) as two important features, which can make a balance between the computation complexity and classification performance. According to the selected features, adaptive decision trees can be built for the Coding Units (CU) with different size by offline training. Furthermore, by this way, the partition of CUs can be resolved as a binary classification problem. Experimental results have shown that the proposed algorithm can save over 34% encoding time on average, with a negligible Bjontegaard Delta (BD)-rate increase.

Implementation of the two-step modified signed digit number adders using joint spatial encoding method (결합 공간 부호화 방법을 이용한 두 단계 변형부호화자리수 가산기 구현)

  • Seo, Dong-Hwan;Kim, Jong-Yun;Park, Se-Jun;Jo, Ung-Ho;No, Deok-Su;Kim, Su-Jung
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.38 no.11
    • /
    • pp.810-820
    • /
    • 2001
  • Conventional binary adder requires a carry propagation to the most significant bit, and leads to serial addition. However, optical adder using a modified signed digit(MSD) number system has been Proposed to reduce the carry propagation chain encountered in binary adder. In this paper, in order to minimize the number of symbolic substitution(SS) rules, nine input patterns were divided into five groups of the same addition results. For recognizing the input reference patterns, serial connections of joint spatial encoded patterns and masks without any other spatial operations are used.

  • PDF

Parameterized IP Core of Complex-Number Multiplier (파라미터화된 복소수 승산기 IP 코어)

  • 양대성;이승기;신경욱
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2001.05a
    • /
    • pp.307-310
    • /
    • 2001
  • A parameterized complex-number multiplier (PCMUL) core IP (Intellectual Property), which can be used as an essential arithmetic unit in baseband signal processing of digital communication systems, is described. The bit-width of the multiplier is parameterized in the range of 8-b~24-b and is user-selectable in 2-b step. The PCMUL_GEN, a core generator with GUI, generates VHDL code of a CMUL core for a specified bit-width. The IP is based on redundant binary (RB) arithmetic and a new radix4 Booth encoding/decoding scheme proposed in this paper. It results in a simplified internal structure, as well as high-speed, low-power, and area-efficient implementation. The designed IP was verified using Xilinx FPGA board.

  • PDF

Efficient Pipeline Architecture of CABAC in H.264/AVC (H.264/AVC의 효율적인 파이프라인 구조를 적용한 CABAC 하드웨어 설계)

  • Choi, Jin-Ha;Oh, Myung-Seok;Kim, Jae-Seok
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.45 no.7
    • /
    • pp.61-68
    • /
    • 2008
  • In this paper, we propose an efficient hardware architecture and algorithm to increase an encoding process rate and implement a hardware for CABAC (Context Adaptive Binary Arithmetic Coding) which is used with one of the entropy coding ways for the latest video compression technique, H.264/AVC (Advanced Video Coding). CABAC typically provides a better high compression performance maximum 15% compared with CAVLC. However, the complexity of operation of CABAC is significantly higher than the CAVLC. Because of complicated data dependency during the encoding process, the complexity of operation is higher. Therefore, various architectures were proposed to reduce an amount of operation. However, they have still latency on account of complicated data dependency. The proposed architecture has two techniques to implement efficient pipeline architecture. The one is quick calculation of 7, 8th bits used to calculate a probability is the first step in Binary arithmetic coding. The other is one step reduced pipeline arcbitecture when the type of the encoded symbols is MPS. By adopting these two techniques, the required processing time was reduced about 27-29% compared with previous architectures. It is designed in a hardware description language and total logic gate count is 19K using 0.18um standard cell library.