• Title/Summary/Keyword: Binary code

Search Result 509, Processing Time 0.031 seconds

The Robustness of Coding and Modulation for Body-Area Networks

  • Biglieri, Ezio;Alrajeh, Nabil
    • Journal of Communications and Networks
    • /
    • v.16 no.3
    • /
    • pp.264-269
    • /
    • 2014
  • We consider transmission over body area networks. Due to the difficulty in assessing an accurate statistical model valid for multiple scenarios, we advocate a system design technique favoring robustness. Our approach, which is based on results in [12] and generalizes them, examines the variation of a performance metric when the nominal statistical distribution of fading is replaced by the worst distribution within a given Kullback-Leibler divergence from it. The sensitivity of the performance metric to the divergence from the nominal distribution can be used as an indication of the design robustness. This concept is applied by evaluating the error probability of binary uncoded modulation and the outage probability-the first parameter is useful to assess system performance with no error-control coding, while the second reflects the performance when a near-optimal code is used. The usefulness of channel coding can be assessed by comparing its robustness with that of uncoded transmission.

Proposal of Image Noise Improvement Algorithm for Implementing Hand Gestures

  • Moon, Yu-Sung;Choi, Ung-Se;Kim, Jung-Won
    • Journal of IKEEE
    • /
    • v.23 no.4
    • /
    • pp.1465-1468
    • /
    • 2019
  • The image noise improvement algorithm proposed in this paper extracts the boundary line by using the window of the binarized image to detect the gesture motion. Boundary line blurring is prevented by improving Gaussian noise generated during video output. To improve gesture recognition in low-light environments, an image noise enhancement algorithm has been designed to provide an output image close to the base image. Analyzing the experimental results, we found almost 10% improvement in the results compared to the results of the existing Median filter.

Packet Scheduling in Interactive Satellite Return Channels for Mobile Multimedia Services Using Hybrid CDMA/TDMA

  • Lee Ki-Dong;Kim Ho-Kyom;Lee Ho-Jin
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2003.05a
    • /
    • pp.744-748
    • /
    • 2003
  • Developing an interactive satellite multi­media system, such as a digital video broadcasting (DVB) return channel via satellite (RCS) system, is gaining popularity over the world To accommodate the increasing traffic demand we are motivated to investigate an alternative for improving return channel utilization We develop an efficient method for optimal packet scheduling in an interactive satellite multimedia system using hybrid CDMA/TDMA channels. We formulate the timeslot-code assignment problem as a binary integer programming (BIP) problem, where the throughput maximization is the objective, and decompose this BIP problem into two sub-problems for the purpose of solution efficiency. With this decomposition, we promote the computational efficiency in finding the optimal solution of the original BIP problem Since 2001, ETRI has been involved in a development project where we have successfully completed an initial system integration test on broadband mobile Internet access via Ku-band channels using the proposed resource allocation algorithm.

  • PDF

A 10-bit 40-Msample/s Folding & Interpolating A/D Converter with two-step Architecture (투스텝 구조를 가진 10비트 40Msample/s 폴딩&인터폴레이팅 아날로그-디지털 변환기)

  • 김수환;성준제;김태형;김석기;임신일
    • Proceedings of the IEEK Conference
    • /
    • 1999.11a
    • /
    • pp.255-258
    • /
    • 1999
  • This paper describes a 40-Msample/s 10-bit CMOS folding and interpolating analog-to-digital converter (ADC). A new 2-step architecture is proposed. The proposed architecture is composed of a coarse ADC bloch for the 6bits of MSBs and a fine ADC block for the remaining 4bits. The amplified folding analog signals in the coarse ADC are selectively chosen for the fine ADC. In the fine ADC, the bubble errors of the comparators are corrected by using the BGM(binary-gray-mixed) code[1] and extra two comparators are used to correct underflow and overflow errors. The proposed ADC was simulated using CMOS 0.25${\mu}{\textrm}{m}$ parameters and occupies 1.0mm$\times$1.0mm. The power consumption is 48㎽ at 40MS/s with 2.5-V power supply. The INL is under $\pm$2.0LSB and the DNL. is under $\pm$1.0LSB by Matlab simulations.

  • PDF

A Polynomial-Time Algorithm for Breaking the McEliece's Public-Key Cryptosystem (McEliece 공개키 암호체계의 암호해독을 위한 Polynomial-Time 알고리즘)

  • Park, Chang-Seop-
    • Proceedings of the Korea Institutes of Information Security and Cryptology Conference
    • /
    • 1991.11a
    • /
    • pp.40-48
    • /
    • 1991
  • McEliece 공개키 암호체계에 대한 새로운 암호해독적 공격이 제시되어진다. 기존의 암호해독 algorithm이 exponential-time의 complexity를 가지는 반면, 본고에서 제시되어지는 algorithm은 polynomial-time의 complexity를 가진다. 모든 linear codes에는 systematic generator matrix가 존재한다는 사실이 본 연구의 동기가 된다. Public generator matrix로부터, 암호해독에 사용되어질 수 있는 새로운 trapdoor generator matrix가 Gauss-Jordan Elimination의 역할을 하는 일련의 transformation matrix multiplication을 통해 도출되어진다. 제시되어지는 algorithm의 계산상의 complexity는 주로 systematic trapdoor generator matrix를 도출하기 위해 사용되는 binary matrix multiplication에 기인한다. Systematic generator matrix로부터 쉽게 도출되어지는 parity-check matrix를 통해서 인위적 오류의 수정을 위한 Decoding이 이루어진다.

  • PDF

Performance of hybrid spead spectrum systems in rayleigh fading channel (레일레이 페이딩 채널에서 하이브리드 확산대역 시스팀의 성능)

  • 조현욱;박상규
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.21 no.8
    • /
    • pp.2023-2032
    • /
    • 1996
  • In this paper, we calculate average bit error probabilities of asynchronous hybrid DS/FH-SSMA systems in AWGN chnnel and nonselective Rayleigh fading channel. We analyze and compare the performance of systems in AWGN channel and Rayleigh fading channel by using linear correlation receiver and hard limiting correlation receiver(nonlinear correlation receiver). Binary PSK scheme is considered and random spreading code sequences and random hopping patterns are used. Bit error probabilities of the systems with/without near-far problem under the same bandwidth expansion are calculated. the result shows that the performance of hard limiting correlation receiver is better than that of linear correlation receiver over nonselective Rayleigh fading channel.

  • PDF

Memory-Efficient NBNN Image Classification

  • Lee, YoonSeok;Yoon, Sung-Eui
    • Journal of Computing Science and Engineering
    • /
    • v.11 no.1
    • /
    • pp.1-8
    • /
    • 2017
  • Naive Bayes nearest neighbor (NBNN) is a simple image classifier based on identifying nearest neighbors. NBNN uses original image descriptors (e.g., SIFTs) without vector quantization for preserving the discriminative power of descriptors and has a powerful generalization characteristic. However, it has a distinct disadvantage. Its memory requirement can be prohibitively high while processing a large amount of data. To deal with this problem, we apply a spherical hashing binary code embedding technique, to compactly encode data without significantly losing classification accuracy. We also propose using an inverted index to identify nearest neighbors among binarized image descriptors. To demonstrate the benefits of our method, we apply our method to two existing NBNN techniques with an image dataset. By using 64 bit length, we are able to reduce memory 16 times with higher runtime performance and no significant loss of classification accuracy. This result is achieved by our compact encoding scheme for image descriptors without losing much information from original image descriptors.

Generalized Joint Channel-Network Coding in Asymmetric Two-Way Relay Channels

  • Shen, Shengqiang;Li, Shiyin;Li, Zongyan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.12
    • /
    • pp.5361-5374
    • /
    • 2016
  • Combining channel coding and network coding in a physical layer in a fading channel, generalized joint channel-network coding (G-JCNC) is proved to highly perform in a two-way relay channel (TWRC). However, most relevant discussions are restricted to symmetric networks. This paper investigates the G-JCNC protocols in an asymmetric TWRC (A-TWRC). A newly designed encoder used by source nodes that is dedicated to correlate codewords with different orders is presented. Moreover, the capability of a simple common non-binary decoder at a relay node is verified. The effects of a power match under various numbers of iteration and code lengths are also analyzed. The simulation results give the optimum power match ratio and demonstrate that the designed scheme based on G-JCNC in an A-TWRC has excellent bit error rate performance under an appropriate power match ratio.

A compatibility verification environment for HDL-modeled microprocessors

  • 이문기;김영완;서광수;손승일
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.21 no.2
    • /
    • pp.409-416
    • /
    • 1996
  • This paper describes the simulation environment that verifies whether a new microporcessor described with HDL is compatible with an existing microprocessor. The compatibility verification is done by showing that the new microprocessor executes the OS(Operating System) program used in the existing microprocessor without any modification of its binary code. The proposed verification environment consists of a virtual system and a graphic user interface (GUI) module. Each module is independently designed based on serve-client model and three exists a communication part for information interchange between the two modules. This paper describes the method of constructing the verification environment and presents the compatibility verification environment of the x86 microprocessor as the simulation result.

  • PDF

Unequal Error Control Properties of Convolutional Codes (길쌈부호의 부등오류제어 특성)

  • Lee, Soo-In;Lee, Sang-Gon;Moon, Sang-Jae
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.27 no.2
    • /
    • pp.1-8
    • /
    • 1990
  • The unequal bit-error control of rate r=b/n binary convolutional code is analyzed. The error protection afforded to each digit of the viterbi decoded b-tuple information word can be different from that afforded to other digit. The property of the unequal protection can be applied for improvement of SNR in transmitting sampled data of DPCM system.

  • PDF