• Title/Summary/Keyword: binary sequences

Search Result 155, Processing Time 0.021 seconds

NEW FAMILY OF BINARY SEQUENCES WITH FOUR-VALUED CROSS-CORRELATION

  • Kim, Han-Doo;Cho, Sung-Jin;Kwon, Min-Jeong;Choi, Un-Sook
    • East Asian mathematical journal
    • /
    • v.29 no.5
    • /
    • pp.529-536
    • /
    • 2013
  • In this paper, we find the values and the number of occurrences of each value of the cross-correlation function $C_d({\tau})$ when $d=\frac{2^{k-1}}{2^s-1}(2^{k(i+1)}-2^{ki}+2^{s+1}-2^k-1)$, where n = 2k, s is an integer such that 2s divides k, and i is odd.

The Molecular Complexes (ⅩI). The Complexes of Toluidines and N-Methyltoluidines with Iodine in Carbon Tetrachloride$^*$

  • Lee, Dong-Choo;Lee, Ki-Chang
    • Bulletin of the Korean Chemical Society
    • /
    • v.1 no.3
    • /
    • pp.101-104
    • /
    • 1980
  • A sequential copolypeptide with repeating unit sequences, in which a glycyl residue is flanked progressively by two ${\gamma}$-benzyl-L-glutamyl residues, has been synthesized by poymerizing p-nitrophenyl ester of ${\gamma}$-benzyl-L-glutamyl-${\gamma}$ -benzyl-L-gutamyl-glycine. Polymers obtained were characterized by viscosity and infra-red spectral data. The highest molecular weight obtained was 21,000. Molecular conformation in solid state was found to be a mixed form of and |${\beta}$-structure. Polymers obtained were insoluble in the most of the organic solvents except in a strong acid like dichloroacetic acid, but in binary mixtures of solvents such as dichloroacetic acid-ethylene dichloride or dichloroacetic acid-chloroform, they were soluble within certain ranges of solvent compositions.

Encoding & Decoding of Radix 4 Polar Code (Radix 4 Polar code의 부호 및 복호)

  • Lee, Moon-Ho;Choi, Eun-Ji;Yang, Jae-Seung;Park, Ju-Yong
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.46 no.10
    • /
    • pp.14-27
    • /
    • 2009
  • Polar Code was proposed by Turkish professor Erdal Arikan in 2006 as an idea that splitted input channel is increasing the cutoff rate. The channel polarization consisted of code sequences with symmetric high rate capacity in a given B-DMC(Binary-input Discrete Memoryless Channel) W. The symmetric capacity is the highest rate achievable subject to using the input letters of the channel with equal probability. The channel polarization is said to a set of given N independent outputs of B-DMC W. In other word, N increases when N is a set of binary-input channels {$W^{(i)}_N\;:\;1{\leq}\;i\;{\leq}\;N$}, in I{WN(i)} as the fraction of indices is near to 1, which is approaching to I(W), and it is near to 0, then to 1-I(W), where I(W) presents high rates in reliable wireless communication channel as inputs of W with equal frequences. After all, {WN(i)} is shown to be a state of channel coding. On the based on this Polar codes, this paper analyzes Polar coding and decoding of Arikan and propose Radix4 Polar coding newly.

Design and Analysis of Code Sequence Generating Algorithms using Almost Perfect Nonlinear Functions (APN 함수를 이용한 부호계열 발생 알고리즘 설계 빛 분석)

  • Lee, Jeong-Jae
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.11 no.1
    • /
    • pp.47-52
    • /
    • 2010
  • For cryptographic systems, nonlinearity is crucial since most linear systems are easily decipherable. C.Bracken, Z.Zhaetc., propose the APN(Almost Perfect Nonlinear) functions with the properties similar to those of the bent functions with perfect nonlinearity. We design two kinds of new code sequence generating algorithms using the above APN functions. And we find that the out of phase ${\tau}\;{\neq}\;0$, autocorrelation functions, $R_{ii}(\tau)$ and the crosscorrelation functions, $R_{ik}(\tau)$ of the binary code sequences generated by two new algorithms over GF(2), have three values of {-1, $-1-2^{n/2}$, $-1+2^{n/2}$}. We also find that the out of phase ${\tau}\;{\neq}\;0$, autocorrelation functions, $R_{p,ii}(\tau)$ and the crosscorrelation functions, $R_{p,ik}(\tau)$ of the nonbinary code sequences generated by the modified algorithms over GF(p), $p\;{\geq}\;3$, have also three values of {$-1+p^{n-1}$, $-1-p^{(n-1)/2}+p^{n-1}$, $-1+p^{(n-1)/2}p^{n-1}$}. We show that these code sequences have the characteristics of the correlation functions similar to those of Gold code sequences.

An Efficient Search Method for Binary-based Block Motion Estimation (이진 블록 매칭 움직임 예측을 위한 효율적인 탐색 알고리듬)

  • Lim, Jin-Ho;Jeong, Je-Chang
    • Journal of Broadcast Engineering
    • /
    • v.16 no.4
    • /
    • pp.647-656
    • /
    • 2011
  • Motion estimation using one-bit transform and two-bit transform reduces the complexity for computation of matching error; however, the peak signal-to-noise ratio (PSNR) is degraded. Modified 1BT (M1BT) and modified 2BT (M2BT) have been proposed to compensate degraded PSNR by adding conditional local search. However, these algorithms require many additional search points in fast moving sequences with a block size of $16{\times}16$. This paper provides more efficient search method by preparing candidate blocks using the number of non-matching points (NNMP) than the conditional local search. With this NNMP-based search, we can easily obtain candidate blocks with small NNMP and efficiently search final motion vector. Experimental results show that the proposed algorithm not only reduces computational complexity, but also improves PSNR on average compared with conventional search algorithm used in M1BT, M2BT and AM2BT.

A Dynamic Approach to Extract the Original Semantics and Structure of VM-based Obfuscated Binary Executables (가상 머신 기반으로 난독화된 실행파일의 구조 및 원본의미 추출 동적 방법)

  • Lee, Sungho;Han, Taisook
    • Journal of KIISE
    • /
    • v.41 no.10
    • /
    • pp.859-869
    • /
    • 2014
  • In recent years, the obfuscation techniques are commonly exploited to protect malwares, so obfuscated malwares have become a big threat. Especially, it is extremely hard to analyze virtualization-obfuscated malwares based on unusual virtual machines, because the original program is hidden by the virtual machine as well as its semantics is mixed with the semantics of the virtual machine. To confront this threat, we suggest a framework to analyze virtualization-obfuscated programs based on the dynamic analysis. First, we extract the dynamic execution trace of the virtualization-obfuscated executables. Second, we analyze the traces by translating machine instruction sequences into the intermediate representation and extract the virtual machine architecture by constructing dynamic context flow graphs. Finally, we extract abstract semantics of the original program using the extracted virtual machine architecture. In this paper, we propose a method to extract the information of the original program from a virtualization-obfuscated program by some commercial obfuscation tools. We expect that our tool can be used to understand virtualization-obfuscated programs and integrate other program analysis techniques so that it can be applied to analysis of the semantics of original programs using the abstract semantics.

Flame Detection Using Haar Wavelet and Moving Average in Infrared Video (적외선 비디오에서 Haar 웨이블릿과 이동평균을 이용한 화염검출)

  • Kim, Dong-Keun
    • The KIPS Transactions:PartB
    • /
    • v.16B no.5
    • /
    • pp.367-376
    • /
    • 2009
  • In this paper, we propose a flame detection method using Haar wavelet and moving averages in outdoor infrared video sequences. Our proposed method is composed of three steps which are Haar wavelet decomposition, flame candidates detection, and their tracking and flame classification. In Haar wavelet decomposition, each frame is decomposed into 4 sub- images(LL, LH, HL, HH), and also computed high frequency energy components using LH, HL, and HH. In flame candidates detection, we compute a binary image by thresholding in LL sub-image and apply morphology operations to the binary image to remove noises. After finding initial boundaries, final candidate regions are extracted using expanding initial boundary regions to their neighborhoods. In tracking and flame classification, features of region size and high frequency energy are calculated from candidate regions and tracked using queues, and we classify whether the tracked regions are flames by temporal changes of moving averages.

Multiple Pedestrians Detection and Tracking using Color Information from a Moving Camera (이동 카메라 영상에서 컬러 정보를 이용한 다수 보행자 검출 및 추적)

  • Lim, Jong-Seok;Kim, Wook-Hyun
    • The KIPS Transactions:PartB
    • /
    • v.11B no.3
    • /
    • pp.317-326
    • /
    • 2004
  • This paper presents a new method for the detection of multiple pedestrians and tracking of a specific pedestrian using color information from a moving camera. We first extract motion vector on the input image using BMA. Next, a difference image is calculated on the basis of the motion vector. The difference image is converted to a binary image. The binary image has an unnecessary noise. So, it is removed by means of the proposed noise deletion method. Then, we detect pedestrians through the projection algorithm. But, if pedestrians are very adjacent to each other, we separate them using RGB color information. And we track a specific pedestrian using RGB color information in center region of it. The experimental results on our test sequences demonstrated the high efficiency of our approach as it had shown detection success ratio of 97% and detection failure ratio of 3% and excellent tracking.

Facial Recognition Algorithm Based on Edge Detection and Discrete Wavelet Transform

  • Chang, Min-Hyuk;Oh, Mi-Suk;Lim, Chun-Hwan;Ahmad, Muhammad-Bilal;Park, Jong-An
    • Transactions on Control, Automation and Systems Engineering
    • /
    • v.3 no.4
    • /
    • pp.283-288
    • /
    • 2001
  • In this paper, we proposed a method for extracting facial characteristics of human being in an image. Given a pair of gray level sample images taken with and without human being, the face of human being is segmented from the image. Noise in the input images is removed with the help of Gaussian filters. Edge maps are found of the two input images. The binary edge differential image is obtained from the difference of the two input edge maps. A mask for face detection is made from the process of erosion followed by dilation on the resulting binary edge differential image. This mask is used to extract the human being from the two input image sequences. Features of face are extracted from the segmented image. An effective recognition system using the discrete wave let transform (DWT) is used for recognition. For extracting the facial features, such as eyebrows, eyes, nose and mouth, edge detector is applied on the segmented face image. The area of eye and the center of face are found from horizontal and vertical components of the edge map of the segmented image. other facial features are obtained from edge information of the image. The characteristic vectors are extrated from DWT of the segmented face image. These characteristic vectors are normalized between +1 and -1, and are used as input vectors for the neural network. Simulation results show recognition rate of 100% on the learned system, and about 92% on the test images.

  • PDF

Amplitude and Phase Variant SLM Scheme for PAPR Reduction in QAM Modulated OFDM Signals (직교 주파수 분할 다중화 신호의 최대전력 대 평균전력의 비 감소를 위한 크기 및 위상 변이 선택 사상 기법)

  • Jeon, Hyun-Bae;Kim, Ki-Hoon;No, Jong-Seon;Shin, Dong-Joon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.2C
    • /
    • pp.203-209
    • /
    • 2010
  • In this paper, we propose a new selected mapping (SLM) scheme for reducing peak to average power ratio (PAPR) of orthogonal frequency division multiplexing (OFDM) signals modulated with quadrature amplitude modulation (QAM), called amplitude and phase variant SLM (APSLM). Contrary to the conventional SLM which rotates the phases of QAM symbols in the frequency domain, the proposed scheme changes the magnitudes as well as the phases of QAM symbols by applying binary sequences to the binary data sequence before mapped to QAM symbols. Simulation results show that the proposed scheme has better PAPR reduction performance than the conventional SLM scheme for the QAM modulated OFDM signals, especially for the small number of subcarriers.