• Title/Summary/Keyword: Information input algorithm

Search Result 2,444, Processing Time 0.029 seconds

An Adjustable Round Robin Scheduling Algorithm for the High Data Rate Mobile Communication System (고속 이동 통신을 위한 적응 가능한 라운드 로빈 스케줄링 방식)

  • Bae, Jeong-Min;Song, Young-Keum;Kim, Dong-Woo
    • Journal of KIISE:Information Networking
    • /
    • v.34 no.1
    • /
    • pp.27-32
    • /
    • 2007
  • Next-generation wireless networks are expected to support a wide range of services, including high-rate data applications, Various service types request differentiated QoSs(Qualities of Service) such as minimum data rate, accuracy, fairness and so on. Although resources of radio systems are limited, for many applications, it is important that certain QoS targets are required to be met. In this paper, we propose a QoS based scheduling algorithm for next generation systems, based on analyzing previous researches, and we develop the proposed QoS algorithm only for MIMO(multi-Input Multi-Output) systems. Moreover, we subsequently prove that the proposed algorithm optimize throughput relative to prespecified target values and converge to certain throughput.

An Acoustic Echo Canceler under 3-Dimensional Synthetic Stereo Environments (3차원 합성 입체음향 환경에서의 음향반향제거기)

  • 김현태;박장식
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.7A
    • /
    • pp.520-528
    • /
    • 2003
  • This paper proposes a method of implementing synthetic stereo and an acoustic echo cancellation algorithm for multiple participant conference system. Synthetic stereo is generated by HRTF and two loudspeakers. A robust adaptive algorithm for synthetic stereo echo cancellation is proposed to reduce the weight misalignment due to near-end speech signals and ambient noises. The proposed adaptive algorithm is modified version of SMAP algorithm and the coefficients of adaptive filter is updated with cross correlation of input and estimation error signal normalized with sum of the autocorrelation of input signal and the power of the estimation error signal multiplied with projection order. This is more robust to projection order and ambient noise than conventional SMAP. Computer simulation show that the proposed algorithm effectively attenuates synthetic stereo acoustic echo.

Implementation of RFID Reader System using the Data Encryption Standard Algorithm (표준 암호화 알고리즘을 이용한 RFID 판독 시스템의 구현)

  • 박성욱
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.8 no.1
    • /
    • pp.55-61
    • /
    • 2003
  • The Data Encryption Standard(DES) has been a worldwide standard for over 20 years. DES is one of the block encryption techniques which ciphers 64-bit input data blocks using a 56-bit private key. The DES algorithm transforms 64-bit input in a series of steps into a 64-bit output. Thus, it is impossible to deduce the plaintext from the ciphertext which encrypted by this algorithm without the key. This paper presents an implementation of RFID roader system using the DES algorithm. An implemented system enhances the credibility of the encryption algorithm by using the Cipher Block Chining(CBC). Experimental results also show that the implemented system has better performance over the conventional commercial product.

  • PDF

Depth-adaptive Sharpness Adjustments for Stereoscopic Perception Improvement and Hardware Implementation

  • Kim, Hak Gu;Kang, Jin Ku;Song, Byung Cheol
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.3 no.3
    • /
    • pp.110-117
    • /
    • 2014
  • This paper reports a depth-adaptive sharpness adjustment algorithm for stereoscopic perception improvement, and presents its field-programmable gate array (FPGA) implementation results. The first step of the proposed algorithm was to estimate the depth information of an input stereo video on a block basis. Second, the objects in the input video were segmented according to their depths. Third, the sharpness of the foreground objects was enhanced and that of the background was maintained or weakened. This paper proposes a new sharpness enhancement algorithm to suppress visually annoying artifacts, such as jagging and halos. The simulation results show that the proposed algorithm can improve stereoscopic perception without intentional depth adjustments. In addition, the hardware architecture of the proposed algorithm was designed and implemented on a general-purpose FPGA board. Real-time processing for full high-definition stereo videos was accomplished using 30,278 look-up tables, 24,553 registers, and 1,794,297 bits of memory at an operating frequency of 200MHz.

Regional Linear Warping for Image Stitching with Dominant Edge Extraction

  • Yoo, Jisung;Hwang, Sung Soo;Kim, Seong Dae;Ki, Myung Seok;Cha, Jihun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.10
    • /
    • pp.2464-2478
    • /
    • 2013
  • Image stitching techniques produce an image with a wide field-of-view by aligning multiple images with a narrow field-of-view. While conventional algorithms successfully stitch images with a small parallax, structure misalignment may occur when input images contain a large parallax. This paper presents an image stitching algorithm that aligns images with a large parallax by regional linear warping. To this end, input images are first approximated as multiple planar surfaces, and different linear warping is applied to each planar surface. For approximating input images as multiple planar surfaces, the concept of dominant edges is introduced. Dominant edges are defined as conspicuous edges of lines in input images, and extracted dominant edges identify the boundaries of each planar surface. Dominant edge extraction is conducted by detecting distinct changes of local characteristics around strong edge pixels. Experimental results show that the proposed algorithm successfully stitches images with a large parallax without structure misalignment.

Design of Systolic Array for High Speed Processing of Block Matching Motion Estimation Algorithm (블록 정합 움직임추정 알고리즘의 고속처리를 위한 시스토릭 어레이의 설계)

  • 추봉조;김혁진;이수진
    • Journal of the Korea Society of Computer and Information
    • /
    • v.3 no.2
    • /
    • pp.119-124
    • /
    • 1998
  • Block Matching Motion Estimation(BMME) Algorithm is demands a very large amount of computing power and have been proposed many fast algorithms. These algorithms are many problem that larger size of VLSI scale due to non-localized search block data and problem of non-reuse of input data for each processing step. In this paper, we designed systolic arry of high processing capacity, constraints input output pin size and reuse of input data for small VLSI size. The proposed systolic array is optimized memory access time because of iterative reuse of input data on search block and become independent of problem size due to increase of algorithm's parallelism and total processing elements connection is localized spatial and temporal. The designed systolic array is reduced O(N6) time complexity to O(N3) on moving vector and has O(N) input/output pin size.

  • PDF

Side-Channel Analysis Based on Input Collisions in Modular Multiplications and its Countermeasure (모듈라 곱셈의 충돌 입력에 기반한 부채널 공격 및 대응책)

  • Choi, Yongje;Choi, Dooho;Ha, Jaecheol
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.24 no.6
    • /
    • pp.1091-1102
    • /
    • 2014
  • The power analysis attack is a cryptanalytic technique to retrieve an user's secret key using the side-channel power leakage occurred during the execution of cryptographic algorithm embedded on a physical device. Especially, many power analysis attacks have targeted on an exponentiation algorithm which is composed of hundreds of squarings and multiplications and adopted in public key cryptosystem such as RSA. Recently, a new correlation power attack, which is tried when two modular multiplications have a same input, is proposed in order to recover secret key. In this paper, after reviewing the principle of side-channel attack based on input collisions in modular multiplications, we analyze the vulnerability of some exponentiation algorithms having regularity property. Furthermore, we present an improved exponentiation countermeasure to resist against the input collision-based CPA(Correlation Power Analysis) attack and existing side channel attacks and compare its security with other countermeasures.

Bracketing Input for Accurate Parsing

  • No, Yong-Kyoon
    • Proceedings of the Korean Society for Language and Information Conference
    • /
    • 2007.11a
    • /
    • pp.358-364
    • /
    • 2007
  • Syntax parsers can benefit from speakers' intuition about constituent structures indicated in the input string in the form of parentheses. Focusing on languages like Korean, whose orthographic convention requires more than one word to be written without spaces, we describe an algorithm for passing the bracketing information across the tagger to the probabilistic CFG parser, together with one for heightening (or penalizing, as the case may be) probabilities of putative constituents as they are suggested by the parser. It is shown that two or three constituents marked in the input suffice to guide the parser to the correct parse as the most likely one, even with sentences that are considered long.

  • PDF

Optimal Identification of IG-based Fuzzy Model by Means of Genetic Algorithms (유전자 알고리즘에 의한 IG기반 퍼지 모델의 최적 동정)

  • Park, Keon-Jun;Lee, Dong-Yoon;Oh, Sung-Kwun
    • Proceedings of the KIEE Conference
    • /
    • 2005.05a
    • /
    • pp.9-11
    • /
    • 2005
  • We propose a optimal identification of information granulation(IG)-based fuzzy model to carry out the model identification of complex and nonlinear systems. To optimally identity we use genetic algorithm (GAs) sand Hard C-Means (HCM) clustering. An initial structure of fuzzy model is identified by determining the number of input, the selected input variables, the number of membership function, and the conclusion inference type by means of GAs. Granulation of information data with the aid of Hard C-Means(HCM) clustering algorithm help determine the initial parameters of fuzzy model such as the initial apexes of the membership functions and the initial values of polynomial functions being used in the premise and consequence part of the fuzzy rules. And the initial parameters are tuned effectively with the aid of the genetic algorithms(GAs) and the least square method. Numerical example is included to evaluate the performance of the proposed model.

  • PDF

Fear and Surprise Facial Recognition Algorithm for Dangerous Situation Recognition

  • Kwak, NaeJoung;Ryu, SungPil;Hwang, IlYoung
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.7 no.2
    • /
    • pp.51-55
    • /
    • 2015
  • This paper proposes an algorithm for risk situation recognition using facial expression. The proposed method recognitions the surprise and fear expression among human's various emotional expression for recognizing dangerous situation. The proposed method firstly extracts the facial region using Harr-like technique from input, detects eye region and lip region from the extracted face. And then, the method applies Uniform LBP to each region, detects facial expression, and recognizes dangerous situation. The proposed method is evaluated for MUCT database image and web cam input. The proposed method produces good results of facial expression and discriminates dangerous situation well and the average recognition rate is 91.05%.