• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.7A
• /
• pp.1063-1075
• /
• 2000

This paper proposes an adaptive error concealment technique for compressed video. Since redundancy is extracted out during compression process, compressed video is vulnerable to errors which occur during transmission of video over error prone networks such as wireless channels and Internet. Error concealment is a process of reconstructing video out of damaged video bit stream. We proved that scalable encoding is very useful for error concealment. Analysis of experiments shows that some part of image is better concealed by using base layer information and other part of image is better concealed by using previous frame information. We developed a technique which enables to decide which methodology is more effective, adaptively, based on motion vectors and regional spatial activity. We used H.263v2 for scalable encoding, but, our approach could be applied to all DCT based video codec.

• Journal of Communications and Networks
• /
• v.14 no.2
• /
• pp.121-129
• /
• 2012

In this paper, we consider a source node that operates over a time varying channel with energy harvesting capability. The goal of the source is to maximize the average number of successfully delivered packets per time slot. The source is able to choose whether to transmit a packet or defer the transmission in each time slot. The decision which is chosen by the source depends on the channel information available and the length of the energy queue. We formulate the problem of finding the optimal policy as a Markovian decision problem. We show some properties of the value function that represents the discounted number of successfully delivered packets per time slot. We prove that the optimal policy is a threshold type policy depending on the state of the channel and the length of the energy queue. We also derive an upper bound for the average number of packets per time slots successfully received by the destination. We show using numerical results that this bound is a tight bound on the performance of the optimal policy. And we consider the case of time varying channel but without channel state information (CSI). Then, we study the impact of channel time varying nature and the availability of CSI. In this case, we show that the optimal policy is a greedy policy. The performance of this greedy policy is also calculated.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.10b
• /
• pp.1263-1266
• /
• 2000

In this paper, we propose a reliable Image transmission system with Decision Feedback Equalization (DFE), and use diversity combining techniques over multipath fading channels. It is shown that the proposed system has the features of simplicity in implementation with DFE and diversity combining techniques without modifying DFE. This study includes error concealment techniques for reconstruction of missing blocks in JPEG. To verify and compare the performance of our proposed system, the computer simulations have been performed in three diversity combining cases.

• Journal of Communications and Networks
• /
• v.15 no.4
• /
• pp.411-421
• /
• 2013

Digital fountain codes are record-breaking codes for erasure channels. They have many potential applications in both wired and wireless communications. Most existing digital fountain codes operate over binary fields using an iterative belief-propagation (BP) decoding algorithm. In this paper, we propose a new iterative decoding algorithm for both binary and nonbinary fields. The basic form of our proposed algorithm considers both degree-1 and degree-2 check nodes (instead of only degree-1 check nodes as in the original BP decoding scheme), and has linear complexity. Extensive simulation demonstrates that it outperforms the original BP decoding scheme, especially for a small number of source packets. The enhanced form of the proposed algorithm combines the basic form of the algorithm and a guess-based algorithm to further improve the decoding performance. Simulation results demonstrate that it can provide better decoding performance than the guess-based algorithm with fewer guesses, and can achieve decoding performance close to that of the maximum likelihood decoder at a much lower decoding complexity. Last, we show that our nonbinary scheme has the potential to outperform the binary scheme when choosing suitable degree distributions, and furthermore it is insensitive to the size of the Galois field.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.49 no.4
• /
• pp.34-40
• /
• 2012

In wireless communication system, fading is an unavoidable problem. Hence, errors in form of BER are introduced with the transmitted signal. It is necessary to recognize the behavior of these errors in different fading channels. To obtain the mathematical solution for the average bit error rate(BER) of coherent MPSK, some techniques are presented. In this paper, the impact of diversity is also analyzed over slow and flat Rician fading channel. In here, the value of modulation index, M is varied and the effects of its variation are also depicted. So, these performance curves with different diversity values and fading parameter are useful to design and evaluate the radio channel for faithful communication system.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.4
• /
• pp.195-201
• /
• 2011

Cognitive radio (CR), which is proposed as a technology that utilizes the frequency resources effectively, has studied to relive scarcity of the frequency resources. CR provides opportunistically under-utilize licensed frequency to the secondary user. However, in the wireless channels, due to the effect of fading and shadowing environments, spectrum sensing performance is compromised. Besides, to detect and classify various CR systems, a novel spectrum sensing algorithm is needed. Therefore, in this paper, we proposed the spectrum sensing algorithm with water marking scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.1A
• /
• pp.9-12
• /
• 2007

In this paper, we propose and analyze a scheme for wireless channels, which is a combination of a type I hybrid-automatic repeat request (H-ARQ) scheme and a power ramping. The power ramping is considered for more reliable downlink data transmission, in which the transmission power is gradually changed from a small level to a large level when the number of retransmissions increases. The simulation results demonstrate that, when the power ramping step size is 0.5dB, the average throughput gain may be as high as 2% to 5% with properly selected parameters.

• The KIPS Transactions:PartC
• /
• v.13C no.7 s.110
• /
• pp.865-872
• /
• 2006

Cooperative communications (CC) have received a great deal of attention recently as an efficient way to obtain the spatial diversity without physical arrays. Thus, space-time block codes (STBC) which are well-known for use in co-located multi-antenna systems can be still utilized for single-antenna users in a distributed fashion. In this paper, we propose a cooperative signaling structure using the $\frac{3}{4}$-rate STBC and derive closed-form BER expression which takes the effect of network geometry and transmit power constraint into account. A variety of simulated and numerical results demonstrated the cooperation considerably outperforms the direct transmission when partners are located in appropriate positions.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.5 no.3
• /
• pp.169-173
• /
• 2012

This paper investigates the performance of Turbo equalization in wireless multipath channels. Turbo equalization mainly consists of a SISO(soft-in soft-out) equalizer and a SISO decoder. Iterative channel estimators can improve the accuracy of channel estimates by soft information fed back from the SISO decoder. Comparing iterative channel estimators with LMS(least mean square) and RLS(recursive least squares) algorithms, which are the most common algorithms to estimate and track a time-varying channel impulse response, the iterative channel estimator with RLS converges more faster than the one with LMS. However, the difference of BER(bit error rate) performances gradually decreases as the number of iterations for Turbo equalization increases.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2006.05a
• /
• pp.950-953
• /
• 2006

A key issue toward mobile multimedia communications is to create technologies for broadband signal transmission that can support high quality services. Such a broadband mobile communications system should be able to overcome severe distortion caused by time-varying multi-path fading channel, while providing high spectral efficiency and low power consumption. For these reasons, an adaptive suboptimum decision feedback equalizer (DFE) for the single-carrier short-burst transmissions system is considered as one of the feasible solutions. For the performance improvement of the system with the short-burst format including the short training sequence, in this paper, the multiple-training least mean square (MTLMS) based DFE scheme with soft decision feedback is proposed and its performance is investigated in mobile wireless channels throughout computer simulation.