• Journal of the Korean Institute of Telematics and Electronics
• /
• v.20 no.2
• /
• pp.16-22
• /
• 1983

In this paper, we obtained PFME(probability for maximum entropy) and entropy when a conditional probability was given in a binary list order Markov Information Source. And, when steady state probability was constant, the influence of change of a conditional probability on entropy was examined, too.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.2
• /
• pp.317-320
• /
• 2022

This paper studies real-time error in the context of monitoring a symmetric binary information source over a delay system. To obtain the average real-time error, the delay system is modeled and analyzed as a discrete time Markov chain with a finite state space. Numerical analysis is performed on various system parameters such as state transition probabilities of information source, transmission times, and transmission frequencies. Given state transition probabilities and transmission times, we investigate the relationship between the transmission frequency and the average real-time error. The results can be used to investigate the relationship between real-time errors and age of information.

• 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.

• 제어로봇시스템학회:학술대회논문집
• /
• 1989.10a
• /
• pp.984-986
• /
• 1989

101 coding scheme, one of sliding block coding techniques, provides practically attractive features in some compression applications for image sources such as facsimile. This paper presents a new simple model of 101 coder. The results show that the entropy of the output of the 101 coder can be reduced close to the rate distortion bound of a binary first-order markov source.

• Journal of Communications and Networks
• /
• v.18 no.1
• /
• pp.40-49
• /
• 2016

In this paper, we present a symbol-level iterative source-channel decoding (ISCD) algorithm for reliable transmission of variable-length codes (VLCs). Firstly, an improved source a posteriori probability (APP) decoding approach is proposed for packetized variable-length encoded Markov sources. Also proposed is a recursive implementation based on a three-dimensional joint trellis for symbol decoding of binary convolutional codes. APP channel decoding on this joint trellis is realized by modification of the Bahl-Cocke-Jelinek-Raviv algorithm and adaptation to the non-stationary VLC trellis. Simulation results indicate that the proposed ISCD scheme allows to exchange between its constituent decoders the symbol-level extrinsic information and achieves high robustness against channel noises.