• Title/Summary/Keyword: BINARY CODE

Search Result 511, Processing Time 0.025 seconds

Adaptive-learning Code Allocation Technique for Improving Dimming Level and Reducing Flicker in Visible Light Communication (가시광통신에서 Dimming Level 향상 및 Flicker 감소를 위한 적응-학습 코드할당 기법)

  • Lee, Kyu-Jin;Han, Doo-Hee
    • Journal of Convergence for Information Technology
    • /
    • v.12 no.2
    • /
    • pp.30-36
    • /
    • 2022
  • In this paper, when the lighting and communication functions of the visible light communication system are used at the same time, we propose a technique to reduce the dimming level and flicker of the lighting. Visible light communication must satisfy both communication and lighting performance. However, the existing data code method results in reducing the brightness of the entire lighting. This causes deterioration of lighting performance and flicker phenomenon. To solve this problem, in this paper, we propose an adaptive learning code allocation technique that allocates binary codes to transmitted characters and optimizes and matches the binary codes allocated according to the frequency of occurrence of alphabets in character strings. Through this, we studied a technique that can faithfully play the role of lighting as well as communication function by allocating codes so that the 'OFF' pattern does not occur continuously while maintaining the maximum dimming level of each character string. As a result of the performance evaluation, the frequency of occurrence of '1' increased significantly without significantly affecting the overall communication performance, and on the contrary, the frequency of consecutive '0' decreased, indicating that the lighting performance of the system was greatly improved.

Analyzing Differences of Binary Executable Files using Program Structure and Constant Values (프로그램의 구조와 상수 값을 이용하는 바이너리 실행 파일의 차이점 분석)

  • Park, Hee-Wan;Choi, Seok-Woo;Seo, Sun-Ae;Han, Tai-Sook
    • Journal of KIISE:Software and Applications
    • /
    • v.35 no.7
    • /
    • pp.452-461
    • /
    • 2008
  • Binary diffing is a method to find differences in similar binary executables such as two different versions of security patches. Previous diffing methods using flow information can detect control flow changes, but they cannot track constant value changes. Biffing methods using assembly instructions can detect constant value changes, but they give false positives which are due to compiling methods such as instruction reordering. We present a binary diffing method and its implementation named SCV which utilizes both structure and value information. SCV summarizes structure and constant value information from disassembled code, and matches the summaries to find differences. By analyzing a Microsoft Windows security patches, we showed that SCV found necessary differences caused by constant value changes which the state-of-the-art binary diffing tool BinDiff failed to find.

Lossy Source Compression of Non-Uniform Binary Source via Reinforced Belief Propagation over GQ-LDGM Codes

  • Zheng, Jianping;Bai, Baoming;Li, Ying
    • ETRI Journal
    • /
    • v.32 no.6
    • /
    • pp.972-975
    • /
    • 2010
  • In this letter, we consider the lossy coding of a non-uniform binary source based on GF(q)-quantized low-density generator matrix (LDGM) codes with check degree $d_c$=2. By quantizing the GF(q) LDGM codeword, a non-uniform binary codeword can be obtained, which is suitable for direct quantization of the non-uniform binary source. Encoding is performed by reinforced belief propagation, a variant of belief propagation. Simulation results show that the performance of our method is quite close to the theoretic rate-distortion bounds. For example, when the GF(16)-LDGM code with a rate of 0.4 and block-length of 1,500 is used to compress the non-uniform binary source with probability of 1 being 0.23, the distortion is 0.091, which is very close to the optimal theoretical value of 0.074.

Binary CDMA based Wireless Home Audio System (Binary CDMA 기반의 무선 홈 오디오 시스템)

  • Ji, Choong-Won;Choi, Hyeon-Seok;Kim, Jung-Sun
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2007.10d
    • /
    • pp.417-421
    • /
    • 2007
  • 최근 홈 네트워크에 대한 관심이 높아짐에 따라 관련 기술을 이용하여 실생활에 적용하려는 연구가 활발히 진행되고 있다. 이러한 홈 네트워크 기술들 중에 무선 통신 기술인 Binary CDMA(Code Division Multiple Access)는 2.4Ghz의 RF영역을 사용하여 데이터를 전송한다. Binary CDMA는 Bluetooth보다 전송거리가 길며, 기존의 CDMA와 비슷한 성능을 보이면서 회로가 단순하여 가격이 저렴하다는 장점이 있다. 본 논문은 이러한 Binary CDMA 기술을 기반으로 가정 내 Multi Zone/Multi Source 오디오 시스템의 설계 및 구현을 제안한다. 구현된 시스템은 신뢰성 있는 무선 홈 오디오 시스템 구축을 위해 이 논문에서 제시하고 있는 무선 오디오 시스템 기기간의 망 구성 및 초기화 메커니즘을 적용하였다.

  • PDF

Performance Analysis of Double Binary Turbo Coded PPM-TH UWB Systems (이중 이진 터보 부호화된 펄스 위치변조-시간도약 초광대역 무선 통신 시스템의 성능 분석)

  • Kim, Eun-Cheol;Kwak, Do-Young;Park, Jae-Sung;Kim, Jin-Young
    • 한국정보통신설비학회:학술대회논문집
    • /
    • 2008.08a
    • /
    • pp.429-432
    • /
    • 2008
  • In this paper, performance of a double binary turbo coded ultra wide band (UWB) system is analyzed and simulated in an indoor wireless channel. Binary pulse position modulation-time hopping (BPPM-TH) signals are considered. The indoor wireless channel is modeled as a modified Saleh and Valenzuela (SV) channel. The performance is evaluated in terms of bit error probability (BER). From the simulation results, it is seen that double binary turbo coding offers considerable coding gain with reasonable encoding complexity. It is also demonstrated that the performance of the UWB system can be substantially improved by increasing the number of iterations.

  • PDF

Secure and Efficient Code Encryption Scheme Based on Indexed Table

  • Cho, Sung-Kyu;Shin, Dong-Hwi;Jo, Hea-Suk;Choi, Dong-Hyun;Won, Dong-Ho;Kim, Seung-Joo
    • ETRI Journal
    • /
    • v.33 no.1
    • /
    • pp.60-70
    • /
    • 2011
  • Software is completely exposed to an attacker after it is distributed because reverse engineering is widely known. To protect software, techniques against reverse engineering are necessary. A code encryption scheme is one of the techniques. A code encryption scheme encrypts the binary executable code. Key management is the most important part of the code encryption scheme. However, previous schemes had problems with key management. In an effort to solve these problems in this paper, we survey the previous code encryption schemes and then propose a new code encryption scheme based on an indexed table. Our scheme provides secure and efficient key management for code encryption.

ON REVERSIBLE ℤ2-DOUBLE CYCLIC CODES

  • Nupur Patanker
    • Bulletin of the Korean Mathematical Society
    • /
    • v.60 no.2
    • /
    • pp.443-460
    • /
    • 2023
  • A binary linear code is said to be a ℤ2-double cyclic code if its coordinates can be partitioned into two subsets such that any simultaneous cyclic shift of the coordinates of the subsets leaves the code invariant. These codes were introduced in [6]. A ℤ2-double cyclic code is called reversible if reversing the order of the coordinates of the two subsets leaves the code invariant. In this note, we give necessary and sufficient conditions for a ℤ2-double cyclic code to be reversible. We also give a relation between reversible ℤ2-double cyclic code and LCD ℤ2-double cyclic code for the separable case and we present a few examples to show that such a relation doesn't hold in the non-separable case. Furthermore, we list examples of reversible ℤ2-double cyclic codes of length ≤ 10.

Performance Improvement of UWB System using Turbo Code in Narrowband Interference Environment (협대역 간섭 환경에서 Turbo Code를 사용한 UWB 시스템의 성능 개선)

  • 강병규;이양선;강희조
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2003.05a
    • /
    • pp.578-581
    • /
    • 2003
  • UWB 시스템은 매우 넓은 주파수 대역에 걸쳐 스펙트럼이 발생하기 때문에 기존에 공존하는 협대역 시스템의 신호로부터 간섭의 영향을 받게 된다. 이는 협대역 신호가 UWB 신호 대역폭에 유입되는 부분 대역 간섭으로 고려 할 수 있다. 따라서, 본 논문에서는 협대역 간섭 모델을 대역 점유율에 따른 부분대역 간섭으로 모델링 하였으며, 협대역 간섭 점유율에 따른 TH binary PPM UWB 시스템의 성능을 분석하였다. 또한 강력한 오류 정정능력을 갖는 Turbo code를 사용함으로써 성능 개선 정도를 평가하였다.

  • PDF

Type Ibc Supernova Progenitors in Binary Systems: Observational Constraints on the Progenitor Candidate of the Supernova iPTF13bvn

  • Kim, Hyun-Jeong;Yoon, Sung-Chul;Koo, Bon-Chul
    • The Bulletin of The Korean Astronomical Society
    • /
    • v.39 no.2
    • /
    • pp.85.1-85.1
    • /
    • 2014
  • The progenitors of Type Ibc supernovae (SNe Ibc) have been believed to be massive Wolf-Rayet (WR) stars, formed either through stellar wind mass loss or Roche-lobe outflow in a binary system. But observations indicate that ordinary SNe Ibc have relatively low ejecta masses (~2 Msun), which is not compatible with the WR star scenario for SN Ibc progenitors. On the other hand, helium stars in binary systems which can be produced via mass transfer are also suggested as a possible candidate for SN Ibc progenitors. Binary star evolution models predict that SN Ibc progenitors having final masses of 3-7 Msun can be produced, but their observational properties are not well understood. In this study, we present the parameter study on the observational constraints of helium stars of 3-5 Msun in binary systems using evolutionary models and the atmospheric radiative transfer code CMFGEN. We present the predicted magnitudes and spectra of helium stars in optical bands for different wind velocity profiles and mass loss rates. We also present those observables of the progenitor binary system considering O-type companion stars. Based on the results, we discuss the expected observational properties of SN Ibc progenitors in binary systems. In particular, we discuss the constraints on the progenitor of the SN Ib iPTF13bvn of which progenitor candidate has been identified for the first time in pre-explosion images among SNe Ibc.

  • PDF