• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.6
• /
• pp.1848-1868
• /
• 2014

Multiple-in multiple-out (MIMO) in long-term evolution (LTE) is an essential factor in achieving high speed data rates and spectral efficiency. The unexpected growth in data rate demand has pushed researchers to extend the benefits of multi-user MIMO. The multi-user MIMO system can take full advantage of channel conditions by employing efficient adjustment techniques for scheduling, and by assigning different modulation and coding rates. However, one of the critical issues affecting this feature is the appropriate estimation of channel quality indicator (CQI) to manage the allocated resources to users. Therefore, an accurate CQI estimation scheme is required for the multi-user MIMO transmission to obtain significant improvements on spectral efficiency. This paper presents overviews of multi-user MIMO in LTE/LTE-advanced systems. The link adaptation, scheduling process, and different factors that affect the reliability of CQI measurements are discussed. State-of-the-art schemes for the post-processing CQI estimation, and the comparisons of various CQI estimation schemes to support multi-user MIMO are also addressed.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.10
• /
• pp.37-42
• /
• 2016

We investigate multi user joint rate scheduling and power allocation problem for a delay sensitive CDMA systems. First, we characterize the existing two user joint rate scheduling and power allocation. We then extend the problem to the case of the multi user systems. In general, there is no simple optimum solution for the multi user scheduling problem. To that end, we propose a sub optimum solution, termed 'virtual user approach'. We show the performance of the virtual user approach to verify the benefit of complexity.

• Proceedings of the KIEE Conference
• /
• 2007.04a
• /
• pp.237-239
• /
• 2007

In the paper, we analyze the performances of random access channels in multi-service multi-user OFDMA systems. The resource of the random access channels in OFDMA systems is the nubmer of available sub-channels and PN-codes. For given available sub-channels and PN-codes. we analyze the performances of the random access channels of OFDMA systems according to three resource allocation methods (resource full sharing, resource partial sharing, resource partition) in tenus of the access success probability, the blocking probability, the access delay and the throughput of each service class. Further, we find the feasible region of the access probability of each service class in which the allowable minimum access success probability, the allowable maximum blocking probability and the allowable maximum access delay are satisfied. The results also can be utilized to find proper region of the access probabilities of each service class for differentiated quality of service(QoS)s, and for the system operations.

• Management & Information Systems Review
• /
• v.25
• /
• pp.371-386
• /
• 2008

In this study, the hypothesized model of internet user satisfaction in e-commerce environment is developed and the relationships among constructs in the model are examined. A Confirmatory factor analysis is employed to analyze the relationships between the multiple dependent variables and independent variables.

• Journal of Communications and Networks
• /
• v.13 no.1
• /
• pp.63-69
• /
• 2011

In this paper, we propose a fixed-complexity sphere encoder (FSE) for multi-user multi-input multi-output (MU-MIMO) systems. The proposed FSE accomplishes a scalable tradeoff between performance and complexity. Also, because it has a parallel tree-search structure, the proposed encoder can be easily pipelined, leading to a tremendous reduction in the precoding latency. The complexity of the proposed encoder is also analyzed, and we propose two techniques that reduce it. Simulation and analytical results demonstrate that in a $4{\times}4$ MU-MIMO system, the proposed FSE requires only 11.5% of the computational complexity needed by the conventional QR decomposition with M-algorithm encoder (QRDM-E). Also, the encoding throughput of the proposed encoder is 7.5 times that of the QRDM-E with tolerable degradation in the BER performance, while achieving the optimum diversity order.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.06a
• /
• pp.489-494
• /
• 1998

This paper describes a design of graphical user interface for a simulated breeding tool with multifield. The term field is used here as a population of visualized individuals that are candidates of selection. Multi-field interface enables the user to breed his/her favorite phenotypes by selection independently in each field, and he/she can copy arbitrary individual into another field. As known on genetic algorithms, a small population likely leads to premature convergence trapped by a local optimum, and migration among plural populations is useful to escape from local optimum. The multi-field user interface provides easy implementation of migration and wider diversity. We show the usefulness of multi-field user interface through an example of a breeding system of 2D CG images.

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

An improved optimal weights based on parallel interference cancellation algorithm has been proposed to cancel for interference induced by multi-user access satellite to ground uplink system. Due to differences in elevation relative motion between the user and the satellite, as well as access between users, resulting in multi-user access interference (Multi-user Access Interference, MUI), which significantly degrade system performance when multi-user access. By steepest gradient method, it obtained based on the MMSE criterion, parallel interference cancellation adjust optimal weights to obtain the maximum SINR. Compared to traditional parallel interference cancellation (Parallel Interference Cancellation, PIC) algorithm or serial interference cancellation ( Successive interference Cancellation, SIC), the accuracy of which is not high and too many complex iterations, we establish the multi-user access to the satellite to ground up link system to demonstrate that the improved WPIC algorithm could be provided with high accuracy and relatively low number of iterations.

• The Journal of the Korea Contents Association
• /
• v.10 no.5
• /
• pp.52-61
• /
• 2010

In recent, the interests of multi-user systems have been increased. Multi-user systems allow a number of users to access the system simultaneously. Security is one of the key issues to be addressed in a multi-user environment. We propose a solution based on the NTFS file system that provides the personal data security and considers the convenience of users. The system increases the convenience of users by simplifying the complexity of the security setting on NTFS. We also propose a variety of policies that prevent from the conflicts incurring when different users set up the personal folders simultaneously and do not set up the important folders such as the window system folders as personal folders. In addition, our system supports the function of setting up the prohibition folder lists so that no one can not set the folder to their personal folders.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.5
• /
• pp.2275-2293
• /
• 2020

This paper focuses on the simplified receiver design for multi-user circular block oversampled filter bank (CB-OSFB) uplink systems. Through application of discrete Fourier transform (DFT), the special banded structure and circular properties of the modulation matrix in the frequency domain of each user are derived. By exploiting the newly derived properties, a simplified zero-forcing (ZF) receiver is proposed for multi-user CB-OSFB uplink systems in the multipath channels. In the proposed receiver, the matrix inversion operation of the large dimension multi-user equivalent channel matrix is transformed into DFTs and smaller size matrix inversion operations. Simulation is given to show that the proposed ZF receiver can dramatically reduce the computational complexity while with almost the same symbol error rate as that of the traditional ZF receiver.

• Journal of Internet Computing and Services
• /
• v.9 no.5
• /
• pp.141-151
• /
• 2008

In the paper, we analyze the performance of random access channels in multi-service multi-user OFDMA systems. The resource of the random access channels in OFDMA systems are available sub-channels and PN-codes. For given available sub-channels and PN-codes,' we analyze the performance of the random access channels of OFDMA systems in terms of the access success probability, the blocking probability, the access delay and the throughput per each service class. Further, we find the feasible region of the access probability of each service class in which the allowable minimum access success probability, the allowable maximum blocking probability and the allowable maximum access delay are satisfied. The results also can be used to find proper region of the access probabilities of each service class for differentiated quality of service(QoS)s, and for the system operations in multi-service multi-user OFDMA systems.