• Title/Summary/Keyword: Discrete information

Search Result 1,922, Processing Time 0.024 seconds

Complex Discrete Systems Graph Simulation

  • Kadirova, Delovar;Kadirova, Aziza
    • Journal of Multimedia Information System
    • /
    • v.2 no.3
    • /
    • pp.263-274
    • /
    • 2015
  • The subject of this work is the complex discrete systems simulation special features with the aid of dynamic graph models. The proposed simulation technique allows to determine the ways for tasks solutions in terms of discrete systems analysis and synthesis of various complication: one-dimensional and multidimensional, steady and unstable, with the pulse elements abnormal operating mode and others. Often complex control systems analysis and synthesis task solutions, via classical approach comes out to be insolvent, because of the computational problems. The application of graph models allows to perform clear and strict characterization and computer procedures automation. The optimal controls synthesis algorithm presented in this paper, transferring the discrete system from target initial state to target final state within the minimum time, allows to consider the zero initial conditions systems, with the initial potential energy, with the control actions limitations and complex pulse elements operating mode.

Efficient Computation of the DFT and IDFT in Communication Systems Using Discrete Multitone Modulation

  • Fertner, Antoni;Hyll, Mattias;Orling, Anders
    • Journal of Communications and Networks
    • /
    • v.1 no.2
    • /
    • pp.86-88
    • /
    • 1999
  • The Discrete Fourier Transform (DFT) and the Inverse Discrete Fourier Transform (IDFT) are commonly used in signal processing applications, in particular in digital communication sys-tems using the multi-carrier modulation principle. In such systems an IDFT is computed at the transmitter end, and a DFT at the re-ceiver end. This paper examines a technique of computations, for which only negligible differences appear between the DFT and the IDFT calculations while the number of arithmetic operations re-quired is substantially reduced. This offers significant advantages for the design of an IDFT/DFT processor for Discrete Multitone(DMT) systems.

  • PDF

Sensitivity Analysis of Discrete MIMO Systems Using singular Values (Singular Value를 이용한 이산계 다중입출력 시스템의 Sensitivity분석)

  • 강치우;이쾌희
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.26 no.10
    • /
    • pp.1507-1517
    • /
    • 1989
  • Singular values and their gradients have been used to analyze the stability and sensitivity of continuous multiloop systems. But this method has been limited to the discrete systems. This method is extended in this paper to analyze discrete systems directly in discrete domain. To do this, derived is the relationship in the disrete system between the stability margins and the minimum singular value of the return differene matrix, and also implemented is a method which computes singular value gradients. This method is applied to the lateralattitude control loop of a remotely piloted vehide both in continuous case and discrete case for verification of its utility.

  • PDF

DISCRETE TORSION AND NUMERICAL DIFFERENTIATION OF BINORMAL VECTOR FIELD OF A SPACE CURVE

  • Jeon, Myung-Jin
    • The Pure and Applied Mathematics
    • /
    • v.12 no.4 s.30
    • /
    • pp.275-287
    • /
    • 2005
  • Geometric invariants are basic tools for geometric processing and computer vision. In this paper, we give a linear approximation for the differentiation of the binormal vector field of a space curve by using the forward and backward differences of discrete binormal vectors. Two kind of discrete torsion, say, back-ward torsion $T_b$ and forward torsion $T_f$ can be defined by the dot product of the (backward and forward) discrete differentiation of binormal vectors that are linear approximations of torsion. Using Frenet formula and Taylor series expansion, we give error estimations for the discrete torsions. We also give numerical tests for a curve. Notably the average of $T_b$ and $T_f$ looks more stable in errors.

  • PDF

Efficient key generation leveraging wireless channel reciprocity and discrete cosine transform

  • Zhan, Furui;Yao, Nianmin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.5
    • /
    • pp.2701-2722
    • /
    • 2017
  • Key generation is essential for protecting wireless networks. Based on wireless channel reciprocity, transceivers can generate shared secret keys by measuring their communicating channels. However, due to non-simultaneous measurements, asymmetric noises and other interferences, channel measurements collected by different transceivers are highly correlated but not identical and thus might have some discrepancies. Further, these discrepancies might lead to mismatches of bit sequences after quantization. The referred mismatches significantly affect the efficiency of key generation. In this paper, an efficient key generation scheme leveraging wireless channel reciprocity is proposed. To reduce the bit mismatch rate and enhance the efficiency of key generation, the involved transceivers separately apply discrete cosine transform (DCT) and inverse discrete cosine transform (IDCT) to pre-process their measurements. Then, the outputs of IDCT are quantified and encoded to establish the bit sequence. With the implementations of information reconciliation and privacy amplification, the shared secret key can be generated. Several experiments in real environments are conducted to evaluate the proposed scheme. During each experiment, the shared key is established from the received signal strength (RSS) of heterogeneous devices. The results of experiments demonstrate that the proposed scheme can efficiently generate shared secret keys between transceivers.

Rebuilding of Image Compression Algorithm Based on the DCT (discrete cosine transform) (이산코사인변환 기반 이미지 압축 알고리즘에 관한 재구성)

  • Nam, Soo-Tai;Jin, Chan-Yong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.23 no.1
    • /
    • pp.84-89
    • /
    • 2019
  • JPEG is a most widely used standard image compression technology. This research introduces the JPEG image compression algorithm and describes each step in the compression and decompression. Image compression is the application of data compression on digital images. The DCT (discrete cosine transform) is a technique for converting a time domain to a frequency domain. First, the image is divided into 8 by 8 pixel blocks. Second, working from top to bottom left to right, the DCT is applied to each block. Third, each block is compressed through quantization. Fourth, the matrix of compressed blocks that make up the image is stored in a greatly reduced amount of space. Finally if desired, the image is reconstructed through decompression, a process using IDCT (inverse discrete cosine transform). The purpose of this research is to review all the processes of image compression / decompression using the discrete cosine transform method.

Network Selection Algorithm for Heterogeneous Wireless Networks Based on Multi-Objective Discrete Particle Swarm Optimization

  • Zhang, Wenzhu;Kwak, Kyung-Sup;Feng, Chengxiao
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.7
    • /
    • pp.1802-1814
    • /
    • 2012
  • In order to guide users to select the most optimal access network in heterogeneous wireless networks, a network selection algorithm is proposed which is designed based on multi-objective discrete particle swarm optimization (Multi-Objective Discrete Particle Swarm Optimization, MODPSO). The proposed algorithm keeps fast convergence speed and strong adaptability features of the particle swarm optimization. In addition, it updates an elite set to achieve multi-objective decision-making. Meanwhile, a mutation operator is adopted to make the algorithm converge to the global optimal. Simulation results show that compared to the single-objective algorithm, the proposed algorithm can obtain the optimal combination performance and take into account both the network state and the user preferences.

Generating Chaos from Discrete TS Fuzzy System

  • Zhong Li;Park, Jin-Bae;Joo, Young-Hoon
    • Proceedings of the Korea Inteligent Information System Society Conference
    • /
    • 2001.01a
    • /
    • pp.111-115
    • /
    • 2001
  • In this paper, a simple and systematic control design method is proposed for a discrete-time Takagi-Sugeno(TS) fuzzy system, which employs the parallel distributed compensation(PDC) to determine the structure of a fuzzy controller so as to mark all the Lyaunov exponents of the controlled TS fuzzy system strictly positive. This approach is proven to be mathematically rigorous for anticontrol of chaos for a TS fuzzy system in the sense that any given discrete-time TS fuzzy system can be made chaotic by the designed PDC controller along with the-operation. A numerical example is included to visualize the anticontrol effect.

  • PDF

DISTURBANCE ATTENUATION FOR A CLASS OF DISCRETE-TIME SWITCHED SYSTEMS WITH EXPONENTIAL UNCERTAINTY

  • Li, Changlin;Long, Fei;Ren, Guohui
    • Journal of the Korean Mathematical Society
    • /
    • v.48 no.4
    • /
    • pp.775-795
    • /
    • 2011
  • The disturbance attenuation problem for a class of discretetime switched linear systems with exponential uncertainties via switched state feedback and switched dynamic output feedback is investigated, respectively. By using Taylor series approximation and convex polytope technique, exponentially uncertain discrete-time switched linear system is transformed into an equivalent switched polytopic model with additive norm bounded uncertainty. For such equivalent switched model, one designs its switching strategy and associated state feedback controllers and dynamic output feedback controllers so that whole switched model is asymptotical stabilization with H-in nity disturbance attenuation base on switched Lyapunov function and LMI approach. Finally, two numerical examples are presented to illustrate our results.

Performance Analysis of a Finite-Buffer Discrete-Time Queueing System with Fixed-Sized Bulk-service

  • Chang, Seok-Ho;Kim, Tae-Sung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.9B
    • /
    • pp.783-792
    • /
    • 2003
  • We consider a finite-buffer discrete-time queueing system with fixed-size bulk-service discipline: Geo/ $G^{B}$1/K+B. The main purpose of this paper is to present a performance analysis of this system that has a wide range of applications in Asynchronous Transfer Mode (ATM) and other related telecommunication systems. For this purpose, we first derive the departure-epoch probabilities based on the embedded Markov chain method. Next, based on simple rate in and rate out argument, we present stable relationships for the steady-state probabilities of the queue length at different epochs: departure, random, and arrival. Finally, based on these relationships, we present various useful performance measures of interest such as the moments of number of packets in the system at three different epochs and the loss probability. The numerical results are presented for a deterministic service-time distribution - a case that has gained importance in recent years.s.