• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.1
• /
• pp.40-52
• /
• 2020

In this paper, we consider a precoder design problem for multiuser interference channel. Most of the conventional schemes for precoder design utilize a signal-to-interference-plus-noise ratio (SINR) as a cost function. However, since the SINR metric of a desired transmitter-receiver pair is a function of precoding vectors of all transmitters in the multiuser interference channel, an analytic closed-form solution is not available for the precoding vector of a desired transmitter that maximizes the SINR metric. To eliminate coupling between the precoding vectors of all transmitters and to find a closed-form solution for the precoding vector of the desired transmitter, we use a signal-to-leakage-plus-noise ratio (SLNR) instead as a cost function because the SLNR at a transmitter is a function of the precoding vector of the desired transmitter only. In addition, channel estimation errors for undesired links are considered when designing the precoding vector because they are inevitable in a multiuser interference channel. In this case, we propose a design scheme for the precoding vector that is robust to the channel estimation error. In the proposed scheme, the precoding vector is designed to maximize the worst-case SLNR. Through computer simulation, we show that the proposed scheme has better performance than the conventional scheme in terms of SLNR, SINR, and sum rate of all users.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.29 no.1
• /
• pp.32-35
• /
• 2018

Massive multiple-input multiple-output (MIMO) transmission is an essential technique for achieving the high bandwidth efficiency required in 5G mobile communication systems. Various forms of arrays can be used as the number of antenna elements increases for massive MIMO transmission. In this letter, we propose a beamforming algorithm applicable to multiuser MIMO transmission using uniform circular arrays. By employing quasi-orthogonal beam pairs obtained from the inter-beam correlation information, we minimize inter-user interference and evaluate the resulting performance gain.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.12
• /
• pp.2800-2804
• /
• 2015

Recently, device-to-device (D2D) direct communication is attracting much interest and many researches have been conducted. In this paper, we investigated an algorithm to support the D2D direct communication in cellular mobile communication networks. We investigated the optimal D2D scheduling algorithm which can achieve the maximal sum-rate in cellular uplink frequency. We also proposed a simple scheduling algorithm which can considerably reduce the computational complexity, compared to the optimal scheme. Finally, we analyzed the performance of the proposed scheme based on computer simulations.

• Journal of the Korea Computer Industry Society
• /
• v.9 no.4
• /
• pp.149-156
• /
• 2008

There is the temporal correlation of a animation sequence between the motion vector of current block and the motion vector of previous block. In this paper, we propose the scene change detection algorithm for block matching using the temporal correlation of the animation sequence and the center-biased property of motion vectors. The proposed algorithm determines the location of a better starting point for the search of an exact motion vector using the point of the smallest SAD(sum of absolute difference) value by the predicted motion vector from the same block of the previous frame and the predictor candidate point on each search region. Simulation results show that the proposed algorithm has better detection performance, such as recall rate, then the existing method. The algorithm has the advantage of speed, simplicity and accuracy. In addition, it requires less amount of storage.

• Journal of the Korean Data and Information Science Society
• /
• v.26 no.1
• /
• pp.261-269
• /
• 2015

Nowadays the application of change point analysis has been indispensable in a wide range of areas such as quality control, finance, environmetrics, medicine, geographics, and engineering. Identification of times where process changes would help minimize the consequences that might happen afterwards. The main objective of this paper is to compare the change-point detection capabilities of Bayesian estimate and maximum likelihood estimate. We applied Bayesian and maximum likelihood techniques to formulate change points having a step change and multiple number of change points in a Poisson rate. After a signal from c-chart and Poisson cumulative sum control charts have been detected, Monte Carlo simulation has been applied to investigate the performance of Bayesian and maximum likelihood estimation. Change point detection capacities of Bayesian and maximum likelihood estimation techniques have been investigated through simulation. It has been found that the Bayesian estimates outperforms standard control charts well specially when there exists a small to medium size of step change. Moreover, it performs convincingly well in comparison with the maximum like-lihood estimator and remains good choice specially in confidence interval statistical inference.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.42 no.2
• /
• pp.338-344
• /
• 2017

In this paper, two-way amplify-and-forward relay methods are investigated where two terminals and one relay node are equipped with multiple antennas. In two-way relay channels, it is assumed that one terminal can eliminate its own self-interference but the other cannot. For this channel, we first maximize the sum-rate performance by employing an iterative gradient descent (GD) algorithm. Then, a simple singular value decomposition (SVD) based block triangularization is developed to null the self-interference. Simulation results show the proposed methods outperform the conventional schemes for various environments.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.6
• /
• pp.1996-2013
• /
• 2015

This paper considers a scenario that more D2D users exist in the cell, they compete for cellular resources to increase their own data rates, which may cause transmission interference to cellular users (CU) and the unfairness of resource allocation. We design a resource allocation scheme for selfish D2D users assisted by cooperative relay technique which is used to further enhance the users' transmission rates, meanwhile guarantee the QoS requirement of the CUs. Two transmission modes are considered for D2D users: direct transmission mode and cooperative relay transmission mode, both of which reuses the cellular uplink frequency resources. To ensure the fairness of resource distribution, Nash bargaining theory is used to determine the transmission mode and solve the bandwidth allocation problem for D2D users choosing cooperative relay transmission mode, and coalition formation game theory is used to solve the uplink frequency sharing problem between D2D users and CUs through a new defined "Selfish order". Through theoretical analysis, we obtain the closed Nash bargaining solution under CUs' rate constraints, and prove the stability of the formatted coalition. Simulation results show that the proposed resource allocation approach achieves better performance on resource allocation fairness, with only little sacrifice on the system sum rates.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.11
• /
• pp.5209-5228
• /
• 2016

Device-to-device (D2D) communication underlaying cellular networks can bring significate benefits for improving the performance of mobile services. However, it hinges on elaborate resource sharing scheme to coordinate interference between cellular users and D2D pairs. We formulate a joint mode selection, link allocation and power control optimization problem for D2D communication sharing uplink resources in a multi-user cellular network and consider the efficiency and the fairness simultaneously. Due to the non-convex difficulty, we propose a three-step scheme: firstly, we conduct mode selection for D2D pairs based on a minimum distance metric after an admission control and obtain some cellular candidates for them. And then, a cellular candidate will be paired to each D2D pair based on fairness. Finally, we use Lagrangian Algorithm to formulate a joint power control strategy for D2D pairs and their reused cellular users and a closed-form of solution is derived. Simulation results demonstrate that our proposed algorithms converge in a short time. Moreover, both the sum rate of D2D pairs and the energy efficiency of cellular users are improved.

• Journal of Biosystems Engineering
• /
• v.29 no.6 s.107
• /
• pp.515-520
• /
• 2004

A device far estimating the optimal artificial insemination time consisted of a computer, RS module, and six direct-reflex photo-sensors. Program was written in LabWindows CVI. In order to establish references for estimating optimal artificial insemination time, lying rate of the thirty three $Berkshire{\times}Hampshire crossbred sows (parity 5 to 6) was recorded from 2 days after moving into stalls to artificial insemination using a time lapse VCR and was measured every hour with one minute interval using the scan point sampling method. Twenty low hours in a day were divided into three comparing periods : 21:00 to 06:59, 07:00 to 13:59, and 14:00 to 20:59. If sum of the percentages of tying during a comparing period was less than the reference value, the starting hour of the comparing period was considered as onset of estrus and the optimal artificial insemination time was estimated at 20 to 24 hours after onset of estrus. The experimental device was evaluated with twenty five $Berkshire{\times}Hampshire$ crossbred sows (parity 2 to 7) and 23 of 25 sows $(92\%)$ were pregnant. This result suggests that the experimental device is excellent in performance for estimating optimal artificial insemination time.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.6
• /
• pp.3-9
• /
• 2015

We investigate rate scheduling and power allocation problem for a delay constrained CDMA systems. Specifically, we determine an energy efficient scheduling policy, while each user maintains the short term (n time slots) average throughput. We consider a multirate CDMA system where multirate is achieved by multiple codes. Each code can be interpreted as a virtual user. The aim is to schedule the virtual users into each time slot, such that the sum of transmit energy in n time slots is minimized. We then show that the total energy minimization problem can be solved by a shortest path algorithm. We compare the performance of the optimum scheduling with that of TDMA-type scheduling.