• Title/Summary/Keyword: Discrete information

Search Result 1,922, Processing Time 0.03 seconds

Multiple Description Coding Using Directional Discrete Cosine Transform

  • Lama, Ramesh Kumar;Kwon, Goo-Rak
    • Journal of information and communication convergence engineering
    • /
    • v.11 no.4
    • /
    • pp.293-297
    • /
    • 2013
  • Delivery of high quality video over a wide area network with large number of users poses great challenges for the video communication system. To ensure video quality, multiple descriptions have recently attracted various attention as a way of encoding and visual information delivery over wireless network. We propose a new efficient multiple description coding (MDC) technique. Quincunx lattice sub-sampling is used for generating multiple descriptions of an image. In this paper, we propose the application of a directional discrete cosine transform (DCT) to a sub-sampled quincunx lattice to create an MDC representation. On the decoder side, the image is decoded from the received side information. If all the descriptions arrive successfully, the image is reconstructed by combining the descriptions. However, if only one side description is received, decoding is executed using an interpolation process. The experimental results show that such the directional DCT can achieve a better coding gain as well as energy packing efficiency than the conventional DCT with re-alignment.

Analysis of Real-time Error for Geo/D/1/1 Model (Geo/D/1/1 모형에서의 실시간 원격 추정값의 오차 분석)

  • Yutae, Lee
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.27 no.1
    • /
    • pp.135-138
    • /
    • 2023
  • In this paper, we study real-time error in the context of monitoring a binary information source through a delay system. To derive the average real-time error, we model the delay system as a discrete time Geo/D/1/1 queueing model. Using a discrete time three-dimensional Markov chain with finite state space, we analyze the queueing model. We also perform some numerical analysis on various system parameters: state transition probabilities of binary information source; transmission times; and transmission frequencies. When the state changes of the information source are positively correlated and negatively correlated, we investigate the relationship between transmission time and transmission frequency.

Video Coding Algorithm Based on High Efficiency Video Coding (HEVC) and Hybrid Transforms

  • Wang, Chengyou;Shan, Rongyang;Zhou, Xiao
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.9
    • /
    • pp.4448-4466
    • /
    • 2018
  • In recent years, due to its high efficiency and better performance, the high efficiency video coding (HEVC) has become the most common compression standard in the field of video coding. In this paper, the framework of HEVC is deeply analyzed, and an improved HEVC video coding algorithm based on all phase biorthogonal transform (APBT) is proposed, where APBT is utilized to replace the discrete cosine transform (DCT) and discrete sine transform (DST) in original HEVC standard. Based on the relationship between APBT and DCT, the integer APBT is deduced. To further improve the coding performance, an optimal HEVC video coding algorithm based on hybrid APBT is proposed. The coding performance of the proposed HEVC coding algorithm is improved without increasing the complexity. Experimental results show that compared with HEVC standard algorithm, the improved HEVC video coding algorithm based on hybrid APBT can improve the coding performance of chrominance components by about 0.3%.

Generalized Kullback-Leibler information and its extensions to censored and discrete cases

  • Park, Sangun
    • Journal of the Korean Data and Information Science Society
    • /
    • v.23 no.6
    • /
    • pp.1223-1229
    • /
    • 2012
  • In this paper, we propose a generalized Kullback-Leibler (KL) information for measuring the distance between two distribution functions where the extension to the censored case is immediate. The generalized KL information has the nonnegativity and characterization properties, and its censored version has the additional property of monotonic increase. We also extend the discussion to the discrete case and propose a generalized censored measure which is comparable to Pearson's chi-square statistic.

Discrete Event Model Conversion Algorithm for Systematic Analysis of Ladder Diagrams in PLCs (PLC 래더다이어그램의 체계적인 분석을 위한 이산사건모델 변환 알고리즘)

  • Kang, Bong-Suk;Cho, Kwang-Hyun
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.8 no.5
    • /
    • pp.401-406
    • /
    • 2002
  • As product lifecycles become shorter, factories are pushed to develop small batches of many different products. The highly flexible control systems has become a necessity. The majority of existing automated industrial systems are controlled by programmable logic controllers(PLCs). In most cases, the control programs for PLCs are developed based on ladder diagrams(LDs). However, it is difficult to debug and maintain those LDs because the synthesis of LD itself mainly depends on the experience of the industrial engineer via trial-and-error methods. Hence, in this paper, we propose a discrete event model conversion algorithm for systematic analysis of LDs. The proposed discrete event model conversion algorithm is illustrated by an example of a conveyor system.

A fast M-band discrete wavelet transform algorithm using factorization of lossless matrix when the length of bases equals to 2M (기저의 길이 L=2M인 경우 무손실 행렬의 분해를 이용한 고속 M-대역 이산 웨이브렛 변환 알고리즘)

  • 권상근;이동식
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.12
    • /
    • pp.2706-2713
    • /
    • 1997
  • The fast implementation algorithm of M-band discrete wavelet transform is propsed using the factorization of lossless matrix when the length of discrete orthogonal wavelet bases equals to 2M. In computational complexity when direct filtering method is employed, the number of multiplicationand addition is (2M$^{2}$) and (2M$^{2}$ -M), respectively. But by proposed algorithm, it can be reduced to (M$^{2}$+M) and (M$^{2}$+2M-1), respectively. and it is possible to reduce the compuatational complexity further when unitary matrix employed to design the discrete or thogonal wavelet basis has the fast algorithm.

  • PDF

Low Complexity Discrete Hartley Transform Precoded OFDM System over Frequency-Selective Fading Channel

  • Ouyang, Xing;Jin, Jiyu;Jin, Guiyue;Li, Peng
    • ETRI Journal
    • /
    • v.37 no.1
    • /
    • pp.32-42
    • /
    • 2015
  • Orthogonal frequency-division multiplexing (OFDM) suffers from spectral nulls of frequency-selective fading channels. Linear precoded (LP-) OFDM is an effective method that guarantees symbol detectability by spreading the frequency-domain symbols over the whole spectrum. This paper proposes a computationally efficient and low-cost implementation for discrete Hartley transform (DHT) precoded OFDM systems. Compared to conventional DHT-OFDM systems, at the transmitter, both the DHT and the inverse discrete Fourier transform are replaced by a one-level butterfly structure that involves only one addition per symbol to generate the time-domain DHT-OFDM signal. At the receiver, only the DHT is required to recover the distorted signal with a single-tap equalizer in contrast to both the DHT and the DFT in the conventional DHT-OFDM. Theoretical analysis of DHT-OFDM with linear equalizers is presented and confirmed by numerical simulation. It is shown that the proposed DHT-OFDM system achieves similar performance when compared to other LP-OFDMs but exhibits a lower implementation complexity and peak-to-average power ratio.

High Speed 2D Discrete Cosine Transform Processor

  • Kim, Ji-Eun;Hae Kyung SEONG;Kang Hyeon RHEE
    • Proceedings of the IEEK Conference
    • /
    • 2002.07c
    • /
    • pp.1823-1826
    • /
    • 2002
  • On modern computer culture, the high quality data is required in multimedia systems. So, the technology of data compression fur data transmission is necessary now. This paper presents the pipeline architecture for the low and column address generator of 2D DCT/IDCT (Discrete Cosine Transform/Inverse Discrete Cosine Transform. In the proposed architecture, the area of hardware is reduced by using the DA (distributed arithmetic) method and applies the concepts of pipeline to the parallel architecture. As a result the designed pipeline of the low and column address generator for 2D DCT/IDCT architecture is implemented with an efficiency and high speed compared with the non-pipeline architecture.

  • PDF

A high reliable optical image encryption system which combined discrete chaos function with permutation algorithm (이산 카오스 함수와 Permutation Algorithm을 결합한 고신뢰도 광영상 암호시스템)

  • 박종호
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.9 no.4
    • /
    • pp.37-48
    • /
    • 1999
  • Current encryption methods have been applied to secure communication using discrete chaotic system whose output is a noise-like signal which differs from the conventional encryption methods that employ algebra and number theory[1-2] We propose an optical encryption method that transforms the primary pattern into the image pattern of discrete chaotic function first a primary pattern is encoded using permutation algorithm, In the proposed system we suggest the permutation algorithm using the output of key steam generator and its security level is analyzed. In this paper we worked out problem of the application about few discrete chaos function through a permutation algorithm and enhanced the security level. Experimental results with image signal demonstrate the proper of the implemented optical encryption system.

Discrete model reduction of bounded real transfer functions (Bounded real 전달함수의 이산모델 차수줄임)

  • 오도창;정은태;박홍배
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.33B no.5
    • /
    • pp.33-40
    • /
    • 1996
  • In this paper, we propose the discrete model reduction method of bounded real transfer functions. From the discrete bounded real lemma, we obtain the two riccati equations and define the disrete bounded real balancing using solutions of these two riccati equations. And we get the reduced order discrete model from the GSPA of full order model. Especially, when free parameter of GSPA is .+-.1, we show that the reduced order discrete model retains minimality, stability, and bounded real and BR-balancing properties. And we derive the .inf.-norm error bound between full order model and reduced order model. Finally to illustrate the validity of proposed method, we give an example.

  • PDF