• ETRI Journal
• /
• v.37 no.2
• /
• pp.380-386
• /
• 2015

Guaranteeing quality of service over a multihop wireless network is difficult because end-to-end (ETE) delay is accumulated at each hop in a multihop flow. Recently, research has been conducted on network coding (NC) schemes as an alternative mechanism to significantly increase the utilization of valuable resources in multihop wireless networks. This paper proposes a new section-based joint NC and scheduling scheme that can reduce ETE delay and enhance resource efficiency in a multihop wireless network. Next, this paper derives the average ETE delay of the proposed scheme and simulates a TDMA network where the proposed scheme is deployed. Finally, this paper compares the performance of the proposed scheme with that of the conventional sequential scheduling scheme. From the performance analysis and simulation results, the proposed scheme gives more delay-and energy-efficient slot assignments even if the NC operation is applied, resulting in a use of fewer network resources and a reduction in ETE delay.

• Journal of Broadcast Engineering
• /
• v.7 no.1
• /
• pp.37-44
• /
• 2002

In this paper. we propose a new video coding scheme with multi-resolution motion compensation and residual quantization. The main functional blocks of the proposed scheme include multi-level wavelet decomposition. motion estimation and motion compensation. raster scanning within each subband. formation of block trees and blocking partitioning. and adaptive arithmetic coding. Although the proposed ceding scheme is simple and requires low computational complexity, it produces bitstreams tilth good features. such as the embedded structure and SNR scalability. Experimental results demonstrate that the proposed coding scheme is quote competitive to and often outperforms other wavelet-based video coding schemes in the literature.

• International Journal of Internet, Broadcasting and Communication
• /
• v.13 no.3
• /
• pp.17-24
• /
• 2021

Recently, a lossless non-orthogonal multiple access (NOMA) implementation without successive interference cancellation (SIC) has been proposed in the literature of NOMA. This lossless non-SIC NOMA was achieved via correlated superposition coding (CSC), in contrast to conventional independent superposition coding (ISC). However, only the achievable data rates for CSC NOMA were investigated. Thus, this paper proposes a practical CSC NOMA scheme under Rayleigh fading channel environments. First, we design the practical CSC NOMA scheme, namely quadrature correlated superposition modulation (CSM) NOMA, without channel coding, i.e., uncoded systems. In addition, we calculate the symbol error rates (SERs) for this quadrature CSM NOMA scheme. Then, simulations demonstrate that for the weak channel gain's user, the SER performance of the proposed quadrature CSM NOMA is shown to be improved greatly, compared to that of the conventional quadrature amplitude modulation (QAM) NOMA, whereas for the strong channel gain's user, the SER performance of the proposed quadrature CSM NOMA degrades a little, compared to that of the conventional QAM NOMA. As a result, the proposed quadrature CSM NOMA scheme could be considered as a practical NOMA scheme for CSC NOMA schemes toward the fifth-generation (5G) and next generation communications.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.8
• /
• pp.2003-2012
• /
• 1996

The 16- and 32-state Trellis-coded M-ary 4-dimensional (4-D) orthogonal modulation scheme with a frequency-reuse technique have been investigated. Here, 5 coded bits form a rate 4/5 convolutional encoder provide 32 possible symbols. Then the signals are mapped by a M-ary 4-D orthogonal modulator, where each signal has equal energy and is PSK modulated. In the M-ary 4-D modulator, we have employed the vectors which is derived by the optimization technique of signal waveforms in a 4-D sphere. This technique is usedin maximizing the minimum Euclidean distance between a set of signal poits on a multidimensional sphere. By combinig trellis coding with M-ary 4-D modulation and proper set-partitioning, we have obtained a considerable impeovement in the free minimum distance of the system over an AWGN channel. The 16-state scheme obtains coding gains up to 5.5 dB over the uncoded two-independent QPSK scheme and 2.5 dB over the two-independent 2-D TCM scheme. And, the 32-state scheme obtains coding gains up to 6.4 dB over the uncoded two-independent QPSK schemeand 3.4 dB over the two-independent 2-D TCM scheme.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.4
• /
• pp.104-115
• /
• 1993

The motion compensated coding (MCC) technique, which exploits the temporal redundancies in the moving images with the motion estimation technique,is one of the most popular techniques currently used. Recently, a variable block size(VBS) motion estimation scheme has been utilized to improve the performance of the motion compensted coding. This scheme allows large blocks to the used when smaller blocks provide little gain, saving rates for areas containing more complex motion. Hence, a new VBS motion estimation scheme with a hierarchical structure is proposed in this paper, in order to combine the motion vector coding technique efficiently. Topmost level motion vector, which is obtained by the gain/cost motion estimation technique with selective motion prediction method, is always transmitted. Thus, the hierarchical VBS motion estimation scheme can efficiently exploit the redundancies among neighboring motion vectors, providing an efficient motion vector encoding scheme. Also, a restricted search with respect to the topmost level motion vector enables more flexible and efficient motion estimation for the remaining lower level blocks. Computer simulations on the high resolution image sequence show that, the VBS motion estimation scheme provides a performance improvement of 0.6~0.7 dB, in terms of PSNR, compared to the fixed block size motion estimation scheme.

• Proceedings of the IEEK Conference
• /
• 2002.07b
• /
• pp.900-903
• /
• 2002

This paper proposes the use of wavelet packet transform in a transform based video coding scheme, which is mainly used in low/very low bit-rate video coding schemes i.e. H.263 standard. In the experiments, the discrete cosine transform in the video coding scheme is replaced by the wavelet packet transform, and the improved performance in term of peak signal to noise ratio is measured and compared with the results obtained from the coding scheme implementing the ordinary wavelet transform. The experimental results show an impressive improvement obtained from the use of wavelet packet transform.

• Journal of Advanced Navigation Technology
• /
• v.9 no.2
• /
• pp.192-199
• /
• 2005

Adaptive Modulation & Coding (AMC) is the method of varying the modulation and coding scheme for the changeable wireless channel environment. WiBro use AMC method because it has a very large variation caused by mobility interference and other cell interference. In this paper, we will compare and analysis the method of selecting the optimum MCS level for the efficiently use of mobile power consumption.

• Journal of Korea Multimedia Society
• /
• v.7 no.5
• /
• pp.658-667
• /
• 2004

For digital image compression, various fractal image coding schemes using the self-similarity of image have been studied extensively. This paper discusses the problem that occurs during the calculating process of adaptive orthogonal transformation and provides improvements of LIFS coding scheme using the transformation. This proposed scheme has a better performance than JPEG for a wide range of compression ratio. This research also proposes an image composition method consisting of all domains of the transformation. The results show that the arithmetic operation processes of the encoder and the decoder become much smaller even without the distortion of the coding performance.

• Journal of Communications and Networks
• /
• v.12 no.4
• /
• pp.366-374
• /
• 2010

Coded cooperation is a promising user cooperation scheme. In this paper, we first propose a novel network-coding-based coded cooperation scheme. When a user decodes its partner's information correctly in the first frame, it transmits the combination of the partner's parity bits and its own parity bits through network coding in the second frame. This is distinct from the classical scheme, where the user only transmits the partner's parity bits during cooperation. We analyze the outage probability of the proposed scheme, and show that it achieves a full diversity order. Numerical evaluations reveal that the proposed scheme outperforms the classical scheme when the inter-user channel is poor, yet is worse when the inter-user channel is strong. Also, the results show that the proposed scheme always outperforms that of no cooperation in various channel conditions while the performance of classical scheme is worse than that of no cooperation with the poor inter-user channels. This means that the performance of the proposed scheme is more stable than the classical scheme and the proposed scheme is more tolerant to the poor inter-user channels. To combine the advantages of the proposed scheme and the classical scheme under different inter-user channel conditions, we propose an adaptive solution. This adaptive scheme enhances the system performance considerably in all channel conditions in spite of the inter-user channel quality, at the expense of only one acknowledgement or non-acknowledgement bit.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.8
• /
• pp.2875-2893
• /
• 2015

Existing coding aware routing algorithms focused on novel routing metric design that captures the characteristics of network coding. However, in packet coding algorithm, they use opportunistic coding scheme which didn't consider the queue state of the coding node and are equivalent to the conventional store-and-forward method in light traffic load condition because they never delay packets and there are no packets in the output queue of coding node, which results in no coding opportunity. In addition, most of the existing algorithms assume that all flows participating in the network have equal rate. This is unrealistic since multi-rate environments are often appeared. To overcome above problem and expand network coding to light traffic load scenarios, we present an enhanced coding-aware routing algorithm based on queue state and local topology (OQMCAR), which consider the queue state of coding node in packet coding algorithm where the control policy is of threshold-type. OQMCAR is a unified framework to merge single rate case and multiple rate case, including the light traffic load scenarios. Simulations results show that our scheme can achieve higher throughput and lower end-to-end delay than the current mechanisms using COPE-type opportunistic coding policy in different cases.