• Title/Summary/Keyword: Information input algorithm

Search Result 2,435, Processing Time 0.036 seconds

Wiretapping Strategies for Artificial Noise Assisted Communication in MU-MIMO wiretap channel

  • Wang, Shu;Da, Xinyu;Chu, Zhenyong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.5
    • /
    • pp.2166-2180
    • /
    • 2016
  • We investigate the opposite of artificial noise (AN)-assisted communication in multiple-input-multiple-output (MIMO) wiretap channels for the multiuser case by taking the side of the eavesdropper. We first define a framework for an AN-assisted multiuser multiple-input-multiple-output (MU-MIMO) system, for which eavesdropping methods are proposed with and without knowledge of legitimate users' channel state information (CSI). The proposed method without CSI is based on a modified joint approximate diagonalization of eigen-matrices algorithm, which eliminates permutation indetermination and phase ambiguity, as well as the minimum description length algorithm, which blindly estimates the number of secret data sources. Simulation results show that both proposed methods can intercept information effectively. In addition, the proposed method without legitimate users' CSI performs well in terms of robustness and computational complexity.

On the Complex-Valued Recursive Least Squares Escalator Algorithm with Reduced Computational Complexity

  • Kim, Nam-Yong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.5C
    • /
    • pp.521-526
    • /
    • 2009
  • In this paper, a complex-valued recursive least squares escalator filter algorithm with reduced computational complexity for complex-valued signal processing applications is presented. The local tap weight of RLS-ESC algorithm is updated by incrementing its old value by an amount equal to the local estimation error times the local gain scalar, and for the gain scalar, the local input autocorrelation is calculated at the previous time. By deriving a new gain scalar that can be calculated by using the current local input autocorrelation, reduced computational complexity is accomplished. Compared with the computational complexity of the complex-valued version of RLS-ESC algorithm, the computational complexity of the proposed method can be reduced by 50% without performance degradation. The reduced computational complexity of the proposed algorithm is even less than that of the LMS-ESC. Simulation results for complex channel equalization in 64QAM modulation schemes demonstrate that the proposed algorithm has superior convergence and constellation performance.

Heuristic Algorithm for Facility Layout Design with Fixed Input and Output Points (입력점과 출력점이 고정된 설비배치설계를 위한 휴리스틱 알고리즘)

  • Jeong, Dong-Hwa;Seo, Yoon-Ho
    • IE interfaces
    • /
    • v.20 no.2
    • /
    • pp.121-132
    • /
    • 2007
  • The facility layout problem (FLP) involves the positioning of facilities within a given workplace in order to minimize the material flow distance between facilities. In this paper, we focus on the FLP in which the each facility has a rectangular shape and an input and output points. We develop a heuristic algorithm in which the facilities are arranged according to the layout algorithm using center of gravity and then simulated annealing algorithm is applied to improve the solution. A comparison of the computational results with exiting algorithms shows that the proposed algorithm provides better solutions in reasonable range of computational time.

IMM Method Using Intelligent Input Estimation for Maneuvering Target Tracking

  • Lee, Bum-Jik;Joo, Young-Hoon;Park, Jin-Bae
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2003.10a
    • /
    • pp.1278-1282
    • /
    • 2003
  • A new interacting multiple model (IMM) method using intelligent input estimation (IIE) is proposed to track a maneuvering target. In the proposed method, the acceleration level for each sub-model is determined by IIE-the estimation of the unknown acceleration input by a fuzzy system using the relation between maneuvering filter residual and non-maneuvering one. The genetic algorithm (GA) is utilized to optimize a fuzzy system for a sub-model within a fixed range of acceleration input. Then, multiple models are composed of these fuzzy systems, which are optimized for different ranges of acceleration input. In computer simulation for an incoming ballistic missile, the tracking performance of the proposed method is compared with those of the input estimation (IE) technique and the adaptive interacting multiple model (AIMM) method.

  • PDF

Minimal Leakage Pattern Generator

  • Kim, Kyung-Ki
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.16 no.5
    • /
    • pp.1-8
    • /
    • 2011
  • This paper proposes a new input pattern generator for minimal leakage power in the nanometer CMOS technology considering all the leakage current components (sub-threshold leakage, gate tunneling leakage, band-to-band tunneling leakage). Using the accurate macro-model, a heuristic algorithm is developed to generate a input pattern for the minimum leakage. The algorithm applies to ISCAS85 benchmark circuits, and the results are compared with the results of Hspice. The simulation result shows that our method's accuracy is within a 5% difference of the Hspice simulation results. In addition, the simulation time of our method is far faster than that of the Hspice simulation.

Compensation Algorithm of Arrival Time Mismatch in the Space-Time Coded Systems

  • Kim, Min-Hyuk;Choi, Suk-Soon;Jung, Ji-Won;Lee, Seong-Ro;Cho, Han-Na;Choi, Myeong-Soo
    • Journal of information and communication convergence engineering
    • /
    • v.6 no.3
    • /
    • pp.353-357
    • /
    • 2008
  • One objective in developing the next generation of wireless communication systems is to increase data rates and reliability. A promising way to achieve this is to combine multiple-input and multiple-output signal processing with a space-time coding scheme, which offers higher coding and diversity gains and improves the spectrum efficiency and reliability of a wireless communication system. It is noted, however, that time delay differences and phase differences among different channels increase symbol interference and degrade system performance. In this letter, we investigate phase differences and their effects on multiple-input and multiple-output systems, and propose a compensation algorithm for the Rayleigh fading model to minimize their effects.

Features Detection in Face eased on The Model (모델 기반 얼굴에서 특징점 추출)

  • 석경휴;김용수;김동국;배철수;나상동
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2002.05a
    • /
    • pp.134-138
    • /
    • 2002
  • The human faces do not have distinct features unlike other general objects. In general the features of eyes, nose and mouth which are first recognized when human being see the face are defined. These features have different characteristics depending on different human face. In this paper, We propose a face recognition algorithm using the hidden Markov model(HMM). In the preprocessing stage, we find edges of a face using the locally adaptive threshold scheme and extract features based on generic knowledge of a face, then construct a database with extracted features. In training stage, we generate HMM parameters for each person by using the forward-backward algorithm. In the recognition stage, we apply probability values calculated by the HMM to input data. Then the input face is recognized by the euclidean distance of face feature vector and the cross-correlation between the input image and the database image. Computer simulation shows that the proposed HMM algorithm gives higher recognition rate compared with conventional face recognition algorithms.

  • PDF

Matching Algorithm for Hangul Recognition Based on PDA

  • Kim Hyeong-Gyun;Choi Gwang-Mi
    • Journal of information and communication convergence engineering
    • /
    • v.2 no.3
    • /
    • pp.161-166
    • /
    • 2004
  • Electronic Ink is a stored data in the form of the handwritten text or the script without converting it into ASCII by handwritten recognition on the pen-based computers and Personal Digital Assistants(PDA) for supporting natural and convenient data input. One of the most important issue is to search the electronic ink in order to use it. We proposed and implemented a script matching algorithm for the electronic ink. Proposed matching algorithm separated the input stroke into a set of primitive stroke using the curvature of the stroke curve. After determining the type of separated strokes, it produced a stroke feature vector. And then it calculated the distance between the stroke feature vector of input strokes and one of strokes in the database using the dynamic programming technique.

Development of Apple Color Sorting Algorithm using Neural Network (신경회로망을 이용한 사과의 색택선별 알고리즘 개발에 관한 연구)

  • 이수희;노상하;이종환
    • Journal of Biosystems Engineering
    • /
    • v.20 no.4
    • /
    • pp.376-382
    • /
    • 1995
  • This study was intended to develop more reliable fruit sorting algorithm regardless of the feeding positions of fruits by using the neural network in which various information could be included as input data. Specific objectives of this study were to select proper input units in the neural network by investigating the features of input image, to analyze the sorting accuracy of the algorithm depending on the feeding positions of Fuji apple and to evaluate the performance of the algorithm for practical usage. the average value in color grading accuracy was 90%. Based on the computing time required for color grading, the maximum sorting capacity was estimated to approximately 10, 800 apples per hours. Finally, it is concluded that the neuro-net based color sorting algorithm developed in this study has feasibility for practical usage.

  • PDF

A Constant Time Algorithm for Deterministic Finite Automata Problem on a Reconfigurable Mesh (재구성 가능한 메쉬에서 결정적 유한 자동장치 문제에 대한 상수시간 알고리즘)

  • Kim, Yeong-Hak
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.11
    • /
    • pp.2946-2953
    • /
    • 1999
  • Finite automation is a mathematical model to represent a system with discrete inputs and outputs. Finite automata are a useful tool for solving problems such as text editor, lexical analyzer, and switching circuit. In this paper, given a deterministic finite automaton of an input string of length n and m states, we propose a constant time parallel algorithm that represents the transition states of finite automata and determines the acceptance of an input string on a reconfigurable mesh of size [nm/2]$\times$2m.

  • PDF