• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.4 no.3
• /
• pp.643-652
• /
• 2000

In this paper, we analyze the BER performance of OFDM/QPSK system in frequency selective Rayleigh fading channel with impulsive noise and improve its performance by adopting convolutional coding. When the channel delay time is shorter than the guard band, the OFDM/QPSK system shows a good BER performance while, when the channel delay time becomes longer than the guard band, its BER performance is abruptly degraded. Moreover, when the transmitted signal is contaminated by a strong impulsive noise in the channel, the BER performance falls to about $10^{-1}$. Also, without channel coding technique, the system doesn't meet even the voice service requirement while it meets the data service requirement with convolutional coding in frequency selective Rayleigh fading channel with impulsive noise.

• Journal of Communications and Networks
• /
• v.10 no.4
• /
• pp.430-436
• /
• 2008

Recent studies have convinced that network coding can improve the performance of live media streaming in terms of startup delay, resilience to peer dynamics, as well as reduced bandwidth cost on dedicated streaming servers. However, there still exist some strategy drawbacks and neglected problems which need to be further researched. In addition to the commonly used evaluation parameters of the network and user experiences mentioned above, we focus on additional key factors, playback lag and switch lag, which have not been fully explored in previous work. In this paper, we present SonicStream, a novel and fully implemented live peer to peer (P2P) media streaming system with consideration of rich user experiences, including startup delay, playback continuity, playback lag, switch lag, etc. In pursuit of a further enhanced user experience, we revise traditional peer selection/data scheduling methods. Through a series of experimental evaluations and a cautious comparison with the latest similar work $R^2$, the superior performance of SonicStream has been preliminarily verified.

• Journal of Broadcast Engineering
• /
• v.16 no.6
• /
• pp.1069-1072
• /
• 2011

This paper proposes the method which reduces complexity and improves coding efficiency by solving a problem of HEVC bi-prediction. In current HM 3.0, it is frequently occurred that L0 motion information and L1 motion information are identical in blocks which are bi-predicted. In this case, L1 motion vector is replaced by non-zero motion vector which belongs to first available neighbor block of current block. If they are still identical, prediction mode is replaced by uni-prediction. As an experimental result, in LD(Low-Delay) case, decoding time is reduced roughly 2%~5% and coding gain is roughly 0.3%~0.5% compared with the HM 3.0 anchor.

• ETRI Journal
• /
• v.35 no.4
• /
• pp.710-713
• /
• 2013

We propose a new space-time block coding (STBC) for asynchronous cooperative systems in full-duplex mode. The orthogonal frequency division multiplexing (OFDM) transmission technique is used to combat the timing errors from the relay nodes. At the relay nodes, only one OFDM time slot is required to delay for a pair-wise symbol swap operation. The decoding complexity is lower for this new STBC than for the traditional quasi-orthogonal STBC. Simulation results show that the proposed scheme achieves excellent performances.

• Journal of Communications and Networks
• /
• v.9 no.2
• /
• pp.141-149
• /
• 2007

Multiple-input multiple-output (MIMO) transmit pre-coding/beamforming can significantly improve system spectral efficiency. However, several obstacles prevent precoding from wide deployment in early wireless networks: The significant feedback overhead, performance degradation due to feedback delay, and the large storage requirement at the mobile devices. In this paper, we propose a precoding method that addresses these issues. In this approach, only 3 or 6 bits feedback is needed to select a precoding matrix from a codebook. There are fifteen codebooks, each corresponding to a unique combination of antenna configuration (up to 4 antennas) and codebook size. Small codebooks are prestored and large codebooks are efficiently computed from the prestored codebook, modified Hochwald method and Householder reflection. Finally, the feedback delay is compensated by channel prediction. The scheme is validated by simulations and we have observed significant gains comparing to space-time coding and antenna selection. This solution was adopted as a part of the IEEE 802.16e specification in 2005.

• ETRI Journal
• /
• v.30 no.2
• /
• pp.255-260
• /
• 2008

We compare the performance of a wavelength remodulated wavelength-division-multiplexed passive optical network implemented using Manchester-coded or inverse-return-to-zero (IRZ)-coded signal downstream and non-return-to-zero remodulated signal upstream. We investigate the effects of varying differences between downstream and upstream bit rates on the two coding schemes. When the bit rate ratio of upstream to downstream is less than or equal to 50%, the performance of Manchester coding is better than that of IRZ coding. However, when the bit rate ratio of upstream to downstream is higher than 50%, Manchester code requires appropriate time delay between upstream and downstream signals, whereas IRZ code needs reduced extinction ratio in the downstream signal.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.3
• /
• pp.1144-1158
• /
• 2016

In this paper, delay-constrained data transmission is considered over error-prone networks. Network coding is deployed for efficient information exchange, and an approximate decoding approach is deployed to overcome potential all-or-nothing problems. Our focus is on determining the cluster size and its impact on approximate decoding performance. Decoding performance is quantified, and we show that performance is determined only by the number of packets. Moreover, the fundamental tradeoff between approximate decoding performance and data transfer rate improvement is analyzed; as the cluster size increases, the data transfer rate improves and decoding performance is degraded. This tradeoff can lead to an optimal cluster size of network coding-based networks that achieves the target decoding performance of applications. A set of experiment results confirms the analysis.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.9
• /
• pp.2268-2283
• /
• 2013

Scalable video coding can handle peer heterogeneity of P2P streaming applications, but there is still a lack of comprehensive studies on how to use it to improve video playback quality. In this paper we propose a capacity aware scalable video coding mechanism for P2P on demand streaming system. The proposed mechanism includes capacity based neighbor selection, adaptive data scheduling and streaming layer adjustment, and can enable each peer to select appropriate streaming layers and acquire streaming chunks with proper sequence, along with choosing specific peers to provide them. Simulation results show that the presented mechanism can decrease the system's startup and playback delay, and increase the video playback quality as well as playback continuity, and thus it provides a better quality of experience for users.

• Journal of Communications and Networks
• /
• v.12 no.1
• /
• pp.86-94
• /
• 2010

In this paper, we present a decentralized algorithm to find minimum cost quality of service (QoS) flow subgraphs in network coded multicast schemes. The main objective is to find minimum cost subgraphs that also satisfy user-specified QoS constraints, specifically with respect to rate and delay demands. We consider networks with multiple multicast sessions. Although earlier network coding algorithms in this area have demonstrated performance improvements in terms of QoS parameters, the proposed QoS network coding approach provides a framework that guarantees QoS constraints are actually met over the network.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.18 no.10
• /
• pp.1196-1202
• /
• 2007

In this paper, the effects of performance improvement far the OFDM based satellite communications are analyzed with applying the CI(Carrier Interferometry)-OFDM and channel coding scheme considering the group delay and gain ripple characteristic as well as the nonlinear characteristic of the transponder. Comparing the BER between traditional OFDM and CI-OFDM, the degree of performance improvement is presented in AWGN channel environments for specified backoff condition of HPA. The simulations are performed with the 36 MHz bandwidth of transponder channel, 120 Mbps transmission rate, and 16 QAM modulation scheme between ideal and worst case condition. It is shown that the improvement measure by the CI-OFDM and channel coding for the group delay and nonlinear characteristic outperforms that for the gain ripple in terms of performance degradation presented by the individual characteristics. And the simulation results show that the effects of improvement by the CI-OFDM outperforms the effect by the applied channel coding, particularly in worst case condition.