• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.5C
• /
• pp.479-486
• /
• 2010

In this paper, we propose a novel low-complexity Alamouti coded orthogonal frequency division multiplexing (OFDM) scheme for asynchronous cooperative communications. Exploiting the combination of OFDM symbols at the source node and simple operations including sign change and complex product at the relay node, the proposed scheme can achieve cooperative diversity gain without use of time-reversion and shifting operations that the conventional scheme proposed by Li and Xia needs. In addition, by using the cyclic prefix (CP) removal and insertion operations at the relay node, the proposed scheme does not suffer from a considerable degradation of bit-error-rate (BER) performance even though perfect timing synchronization is not achieved at the relay node. From the simulation results, it is demonstrated that the BER performance of the proposed scheme is much superior to that of the conventional scheme in the presence of timing synchronization error at the relay node. It is also shown that the proposed scheme obtains two times higher diversity gain compared with the conventional scheme at the cost of half reduction in transmission efficiency.

• Journal of Korea Multimedia Society
• /
• v.9 no.1
• /
• pp.59-72
• /
• 2006

The rapid growth of technology for network and terminal devices is able to service multimedia contents in mobile environments. But as the environment of networks and the performance of devices is varied, the same quality service is very difficult to be provided for user in internet and mobile environment. Therefore, multimedia streaming system must provide an adaptive service in considering network and device environment. Video transcoding techniques are the good solution that can provide video streaming service in various network environments adaptively. This paper proposes a dynamic frame-skipping transcoding scheme to provide adaptive streaming service in various network environments. This scheme uses the prediction period for transcoding. A proposed transcoding scheme can reduce time complexity through combination of prediction period and skipping period to control frame-skipping rate in encoder. In simulation results, the performance of proposed scheme is similar to the performance of a traditional dynamic frame-skipping scheme in PSNR value. But the performance of proposed scheme outperforms the performance of traditional scheme in time complexity.

• The KIPS Transactions:PartD
• /
• v.15D no.5
• /
• pp.713-720
• /
• 2008

Fingerprinting scheme uses digital watermarks to trace originator of unauthorized or pirated copies, however, multiple users may collude and escape identification by creating an average or median of their individually watermarked copies. Previous research works are based on ACC (anti-collusion code) for identifying each user, however, ACC are shown to be resilient to average and median attacks, but not to LCCA and cannot support large number of users. In this paper, we propose a practical SACC (scalable anti-collusion code) scheme and its angular decoding strategy to support a large number of users from basic ACC (anti-collusion code) with LCCA (linear combination collusion attack) robustness. To make a scalable ACC, we designed a scalable extension of ACC codebook using a Gaussian distributed random variable, and embedded the resulting fingerprint using human visual system based watermarking scheme. We experimented with standard test images for colluder identification performance, and our scheme shows good performance over average and median attacks. Our angular decoding strategy shows performance gain over previous decoding scheme on LCCA colluder set identification among large population.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.1C
• /
• pp.37-47
• /
• 2011

In this paper, we propose a novel ML decoding scheme based on the combination of depth- and breadth-first search methods on a partitioned tree for multiple input multiple output systems. The proposed scheme first partitions the searching tree into several stages, each of which is then searched by a depth- or breadth-first search method, possibly exploiting the advantages of both the depth- and breadth-first search methods in an organized way. Numerical results indicate that, when the depth- and breadth-first search algorithms are adopted appropriately, the proposed scheme exhibits substantially lower computational complexity than conventional ML decoders while maintaining the ML bit error performance.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.5
• /
• pp.1013-1027
• /
• 2011

In this paper we propose ATCS, a practical TCP protocol coding scheme based on network coding for satellite IP networks. The proposal is specially designed to enhance TCP performance over satellite networks. In our scheme, the source introduces a degree of redundancy and transmits a random linear combination of TCP packets. Since the redundant packets are utilized to mask packet loss over satellite links, the degree of redundancy is determined by the link error rates. Through a simple and effective method, ATCS estimates link error rates in real time and then dynamically adjusts the redundant factor. Consequently, ATCS is adaptable to a wide range of link error rates by coding TCP segments with a flexible redundancy factor. Furthermore, the scheme is compatible with traditional TCP variants. Simulation results indicate that the proposal improves TCP performance considerably.

• The Journal of Advanced Prosthodontics
• /
• v.3 no.3
• /
• pp.132-135
• /
• 2011

PURPOSE. To study the distribution of various occlusal schemes as well as associated static occlusal relationship among Thais. MATERIALS AND METHODS. The subjects'occlusal schemes on the left and right sides were classified as canine protected occlusion, group function, or unclassified according to the definition from Glossary of Prosthodontic Terms ($8^{th}$ edition). In addition, the presence of occlusal interferences during mandibular excursions were recorded. The measurement of the horizontal overlap and vertical overlap was also performed. Chi-square, One-way ANAVA and Mann-Whitney U statistical tests were used with level of significance set at P=.05. RESULTS. Total of 104 subjects were included in this study. The ratio for male to female was 1.8 to 1. Average age of the population was $25.01{\pm}6.87$ years old. The mean vertical overlap and horizontal overlap were $1.94{\pm}1.20$ and $2.41{\pm}1.32$ mm respectively. The majority of the populations (68.3%) possessed group function occlusal scheme. For the remaining, 17.3% possess canine protected occlusion and 12.5% possess combination of both occlusal schemes. We also found that occlusal interference was presented in 20.2% of the population. The most common was protrusive interference (57.14%), the second was balancing interference (38.1%) and the third was working interference (4.1%). CONCLUSION. Among Thais, the most common occlusal scheme was group function, however there were no significant occlusal factors related to any particular occlusal scheme.

• ETRI Journal
• /
• v.33 no.2
• /
• pp.184-193
• /
• 2011

Tailored for wireless local area networks, the present paper proposes a cross-layer resource allocation scheme for multiple-input multiple-output orthogonal frequency-division multiplexing systems. Our cross-layer resource allocation scheme consists of three stages. Firstly, the condition of sharing the subchannel by more than one user is studied. Secondly, the subchannel allocation policy which depends on the data packets' lengths and the admissible combination of users per subchannel is proposed. Finally, the bits and corresponding power are allocated to users based on a greedy algorithm and the data packets' lengths. The analysis and simulation results demonstrate that our proposed scheme not only achieves significant improvement in system throughput and average packet delay compared with conventional schemes but also has low computational complexity.

• Journal of Communications and Networks
• /
• v.14 no.1
• /
• pp.91-103
• /
• 2012

Network mobility (NEMO) based on mobile IP version 6 has been proposed for networks that move as a whole. Route optimization is one of the most important topics in the field of NEMO. The current NEMO basic support protocol defines only the basic working mode for NEMO, and the route optimization problem is not mentioned. Some optimization schemes have been proposed in recent years, but they have limitations. A new NEMO route optimization scheme-involving a combination of the optimized route cache protocol (ORC) and reverse routing header (RRH) and the use of a quota mechanism for optimized sessions (OwR)-is proposed. This scheme focuses on balanced performance in different aspects. It combines the ORC and RRH schemes, and some improvements are made in the session selection mechanism to avoid blindness during route optimization. Simulation results for OwR show great similarity with those for ORC and RRH. Generally speaking, the OwR's performance is at least as good as that of the RRH, and besides, the OwR scheme is capable of setting up optimal routing for a certain number of sessions, so the performance can be improved and the cost of optimal routing in nested NEMO can be decreased.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.4
• /
• pp.1961-1974
• /
• 2019

In this letter, a harmonic-mean-based dual-antenna selection scheme at relay node is proposed in two-way relaying networks (TWRNs). With well-designed distributed orthogonal concatenated Alamouti space-time block code (STBC), a dual-antenna selection problem based on the instantaneous achievable sum-rate criterion is formulated. We propose a low-complexity selection algorithm based on the harmonic-mean criterion with linearly complexity $O(N_R)$ rather than the directly exhaustive search with complexity $O(N^2_R)$. From the analysis of network outage performance, we show that the asymptotic diversity gain function of the proposed scheme achieves as $1/{\rho}{^{N_R-1}}$, which demonstrates one degree loss of diversity order compared with the full diversity. This slight performance gap is mainly caused by sacrificing some dual-antenna selection freedom to reduce the algorithm complexity. In addition, our proposed scheme can obtain an extra coding gain because of the combination of the well-designed orthogonal concatenated Alamouti STBC and the corresponding dual-antenna selection algorithm. Compared with the common-used selection algorithms in the state of the art, the proposed scheme can achieve the best performance, which is validated by numerical simulations.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.6
• /
• pp.2908-2924
• /
• 2019

Multiple input multiple output orthogonal frequency division multiplexing (MIMO-OFDM) is widely applied in wireless communication by virtue of its excellent properties in data transmission rate and transmission accuracy. However, as a major drawback of MIMO-OFDM systems, the high peak-to-average power ratio (PAPR) complicates the design of the power amplifier at the receiver end. Some available PAPR reduction methods such as selective mapping (SLM) suffer from high computational complexity. In this paper, a low-complexity SLM method based on active constellation extension (ACE) and joint space-time selective mapping (AST-SLM) for reducing PAPR in Alamouti STBC MIMO-OFDM systems is proposed. In SLM scheme, two IFFT operations are required for obtaining each transmission sequence pair, and the selected phase vector is transmitted as side information(SI). However, in the proposed AST-SLM method, only a few IFFT operations are required for generating all the transmission sequence pairs. The complexity of AST-SLM is at least 86% less than SLM. In addition, the SI needed in AST-SLM is at least 92.1% less than SLM by using the presented blind detection scheme to estimate SI. We show, analytically and with simulations, that AST-SLM can achieve significant performance of PAPR reduction and close performance of bit error rate (BER) compared to SLM scheme.