• Title/Summary/Keyword: Binary sequences

Search Result 154, Processing Time 0.032 seconds

New Decimations with 4-Valued Cross-Correlations (상호상관관계 함숫값이 4개인 새로운 데시메이션)

  • Kwon, Min-Jeong;Cho, Sung-Jin;Kwon, Sook-Hee;Kim, Jin-Gyoung;Kim, Han-Doo;Choi, Un-Sook
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.7 no.4
    • /
    • pp.827-832
    • /
    • 2012
  • In this paper, we present a new decimated Gold-like m-sequence with a binary m-sequence of period $2^n-1$. And we show that the cross-correlation function of the proposed sequence is four-valued.

An Integrated Package for Randomness Tests of Binary Sequences (이진 수열의 임의성 검정을 위한 통합용 패키지)

  • Shin, Weon;Kim, Hea-Jeong;Rhee, Kyung-Hyune;Shin, Jong-Tae
    • Proceedings of the Korea Multimedia Society Conference
    • /
    • 1998.10a
    • /
    • pp.55-61
    • /
    • 1998
  • 본 논문에서는 비밀성 메커니즘의 암호학적인 안전성에 대한 체계적인 분석을 통하여 난수열의 각종 암호학적, 통계적 성질에 기반한 평가 기법을 소개하고 이를 패키지로써 구현하였다. 본 패키지는 기존의 알려진 통계적 검정 기법들 뿐만 아니라 다양한 암호학적 특성에 기반한 검정 기법들을 종합적으로 분석하여 구현함으로써 차후 개발이 예상되는 새로운 스트림 및 블록 암호 알고리즘의 설계와 안전성 평가에 유용하게 적용될 수 있다.

  • PDF

Malay Syllables Speech Recognition Using Hybrid Neural Network

  • Ahmad, Abdul Manan;Eng, Goh Kia
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2005.06a
    • /
    • pp.287-289
    • /
    • 2005
  • This paper presents a hybrid neural network system which used a Self-Organizing Map and Multilayer Perceptron for the problem of Malay syllables speech recognition. The novel idea in this system is the usage of a two-dimension Self-organizing feature map as a sequential mapping function which transform the phonetic similarities or acoustic vector sequences of the speech frame into trajectories in a square matrix where elements take on binary values. This property simplifies the classification task. An MLP is then used to classify the trajectories that each syllable in the vocabulary corresponds to. The system performance was evaluated for recognition of 15 Malay common syllables. The overall performance of the recognizer showed to be 91.8%.

  • PDF

BINARY TRUNCATED MOMENT PROBLEMS AND THE HADAMARD PRODUCT

  • Yoo, Seonguk
    • East Asian mathematical journal
    • /
    • v.36 no.1
    • /
    • pp.61-71
    • /
    • 2020
  • Up to the present day, the best solution we can get to the truncated moment problem (TMP) is probably the Flat Extension Theorem. It says that if the corresponding moment matrix of a moment sequence admits a rank-preserving positive extension, then the sequence has a representing measure. However, constructing a flat extension for most higher-order moment sequences cannot be executed easily because it requires to allow many parameters. Recently, the author has considered various decompositions of a moment matrix to find a solution to TMP instead of an extension. Using a new approach with the Hadamard product, the author would like to introduce more techniques related to moment matrix decompositions.

ON SECURE BINARY SEQUENCES GENERATED BY A FUNCTION f(x) = x + (g(x)2 ∨ C) mod 2n

  • Rhee, Min Surp
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.22 no.4
    • /
    • pp.789-797
    • /
    • 2009
  • Invertible transformations over n-bit words are essential ingredients in many cryptographic constructions. When n is large (e.g., n = 64) such invertible transformations are usually represented as a composition of simpler operations such as linear functions, S-P networks, Feistel structures and T-functions. Among them we will study T-functions which are probably invertible transformation and are very useful in stream ciphers. In this paper we will show that $f(x)=x+(g(x)^2{\vee}C)$ mod $2^n$ is a permutation with a single cycle of length $2^n$ if both the least significant bit and the third significant bit in the constant C are 1, where g(x) is a T-function.

  • PDF

Frame Based Classification of Underwater Transient Signal Using MFCC Feature Vector and Neural Network (MFCC 특징벡터와 신경회로망을 이용한 프레임 기반의 수중 천이신호 식별)

  • Lim, Tae-Gyun;Kim, Il-Hwan;Kim, Tae-Hwan;Bae, Keun-Sung
    • Proceedings of the IEEK Conference
    • /
    • 2008.06a
    • /
    • pp.883-884
    • /
    • 2008
  • This paper presents a method for classification of underwater transient signals using, which employs a binary image pattern of the mel-frequency cepstral coefficients(MFCC) as a feature vector and a neural network as a classifier. A feature vector is obtained by taking DCT and 1-bit quantization for the square matrix of the MFCC sequences. The classifier is a feed-forward neural network having one hidden layer and one output layer, and a back propagation algorithm is used to update the weighting vector of each layer. Experimental results with some underwater transient signals demonstrate that the proposed method is very promising for classification of underwater transient signals.

  • PDF

Data hiding in partially encrypted HEVC video

  • Xu, Dawen
    • ETRI Journal
    • /
    • v.42 no.3
    • /
    • pp.446-458
    • /
    • 2020
  • In this study, an efficient scheme for hiding data directly in partially encrypted versions of high efficiency video coding (HEVC) videos is proposed. The content owner uses stream cipher to selectively encrypt some HEVC-CABAC bin strings in a format-compliant manner. Then, the data hider embeds the secret message into the encrypted HEVC videos using the specific coefficient modification technique. Consequently, it can be used in third-party computing environments (more generally, cloud computing). For security and privacy purposes, service providers cannot access the visual content of the host video. As the coefficient is only slightly modified, the quality of the decrypted video is satisfactory. The encrypted and marked bitstreams meet the requirements of format compatibility, and have the same bit rate. At the receiving end, data extraction can be performed in the encrypted domain or decrypted domain that can be adapted to different application scenarios. Several standard video sequences with different resolutions and contents have been used for experimental evaluation.

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

M-ary orthogonal CDMA Using Time Hopping Codes (시간도약부호를 사용하는 M진직교 부호분할 다원접속)

  • 김일규;김동인;노종선
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.19 no.7
    • /
    • pp.1374-1389
    • /
    • 1994
  • In this paper, a novel M-ary orthogonal CDMA scheme which utilizes time hopping codes and binary orthogonal sequences is proposed for personal communication system. Its modulated output signal has the characteristics of greater bandwidth occupancy and lower spectral density level as well. So this scheme is useful for spectrum overlay with existing narrowband communication systems which occupy current radio frequency channels. This paper investigates system characteristics through the analysis of modulated output signal power spectrum, and demonstrates the possibility of spectrum overlay.

  • PDF

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.