• The Journal of the Korea institute of electronic communication sciences
• /
• v.15 no.5
• /
• pp.865-872
• /
• 2020

In the fifth generation (5G) mobile networks, non-orthogonal multiple access (: NOMA) has been considered as a promising technology, to increase the channel capacity. In NOMA, the multiple users share the channel resources and multiplex simultaneously. Recently, for the stronger channel user, it was reported that the bit-error rate (: BER) performance with interactive mobile users is degraded, compared to the BER of non-interactive users. In this paper, in order to improve such degraded BER performance, we propose the maximum-likelihood (: ML) receiver. First, the closed-form expression for the BER of the ML receiver is derived, and then it is shown that the BER of the ML receiver is improved, compared with the BER of the ideal perfect successive interference cancellation (: SIC) receiver. Additionally, based on the analytical expression, Monte Carlo simulations validates the above-mentioned results.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.6
• /
• pp.1313-1320
• /
• 2015

In this paper, we propose a user detection technique based on parallel orthogonal matching pursuit (POMP) for uplink multi-user random access networks (RANs) with a number of users and receiver antennas. In general RANs, it is difficult to estimate the number of users simultaneously transmitting packets at the receiver because users with data send the data without grant of BS. In this paper, therefore, we modify the original POMP for the RAN and evaluate its performances through extensive computer simulations. Simulation results show that the proposed POMP can effectively detect activated users more than about 2%~8% compared with the conventional OMP in RANs.

• Journal of KIISE:Software and Applications
• /
• v.30 no.3_4
• /
• pp.293-307
• /
• 2003

Object-oriented development has been generalized, but object-oriented project planning and scheduling techniques have not been studied enough. Furthermore, it is difficult to apply the conventional software management techniques to object-oriented projects. Especially, the large scaled projects are increasing, but the project planing techniques for these large scaled projects have not been proposed enough. In this paper, we propose systematic techniques for OO based project scheduling. We suggest a 7 step-process for deriving the OO project schedule from the use-case diagram which is describing the functional requirements of the system. The proposed process includes identifying use-cases, drawing preliminary chart through interdependency analysis, identifying characteristics of each use case, determining the number of iteration, assigning use-cases to iteration, considering available resource and constraints, drawing revised PERT chart. Each step has the explanation of the input, output, and the guidelines needed to perform the step. The project scheduling technique proposed in this paper ran be used effectively in the planning phase which the purpose is to plan a development schedule to yield the high quality software in minimum time.

• Journal of Korea Multimedia Society
• /
• v.12 no.10
• /
• pp.1418-1426
• /
• 2009

There has been a lot of interest in an effective method for background subtraction in an effort to separate foreground objects from a predefined background image. Promising results on background subtraction using statistical methods have recently been reported are robust enough to operate in dynamic environments, but generally require very large computational resources and still have difficulty in obtaining clear segmentation of objects. We use a simple running-average method to model a gradually changing background, instead of using a complicated statistical technique. We employ a single global threshold vector, optimized by a genetic algorithm, instead of pixel-by-pixel thresholds. A new fitness function is defined and trained to evaluate segmentation result. The system has been implemented on a PC with a webcam, and experimental results on real images show that the new method outperforms an existing method based on a mixture of Gaussian.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.6 no.2
• /
• pp.257-263
• /
• 2002

A graph embedding problem has been studied for applications of resource allocation and mapping the underlying data structure of a parallel algorithm into the interconnection architecture of massively parallel processing systems. In this paper, we consider the embedding problem of the pyramid into the regular 2-dimensional mesh interconnection network topology. We propose a new embedding function which can embed the pyramid of height N into 2$^{N}$ x2$^{N}$ 2-dimensional mesh with dilation max{2$^{N1}$-2. [3.2$^{N4}$＋1)/2, 2$^{N3}$＋2. [3.2$^{N4}$＋1)/2]}. This means an improvement in the dilation measure from 2$^{N}$ $^1$in the previous result into about (5/8) . 2$^{N1}$ under the same condition.condition.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.46 no.7
• /
• pp.22-28
• /
• 2009

As multiprocessors have been widely adopted in embedded systems, task computation energy consumption should be minimized with several low power techniques supported by the multiprocessors. This paper proposes an energy-aware task scheduling algorithm that adopts both dynamic voltage scaling and power shutdown in multiprocessor environments. Considering the timing and energy overhead of power shutdown, the proposed algorithm performs an iterative task assignment and task ordering for multiprocessor systems. In this case, the iterative priority-based task scheduling is adopted to obtain the best solution with the minimized total energy consumption. Total energy consumption is calculated by considering a linear programming model and threshold time of power shutdown. By analyzing experimental results for standard task graphs based on real applications, the resource and timing limitations were analyzed to maximize energy savings. Considering the experimental results, the proposed energy-aware task scheduling provided meaningful performance enhancements over the existing priority-based task scheduling approaches.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.48 no.1
• /
• pp.72-79
• /
• 2011

The importance of parallel programming seriously emerges ever since the modern microprocessor architecture has been shifted to the multi-core system. Transactional Memory has been proposed to address synchronization which is usually implemented by using locks. However, the lock based synchronization method reduces the parallelism and has the possibility of causing deadlock. In this paper, we propose an efficient method to utilize transactional memory for the situation which has high contention. The proposed idea is based on the theoretical analysis and it is verified with simulation results. The simulation environment has been implemented using HTM(Hardware Transactional Memory) systems. We also propose a model of the dining philosopher problem to discuss the efficient resource management using the transactional memory technique.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.5
• /
• pp.1464-1473
• /
• 2000

In this paper, we analyze the cycle property of the (n,k)-star graph that has an attention as an alternative interconnection network topology in recent years. Based on the graph-theoretic properties in (n,k)-star graphs, we show the pancyclic property of the graph and also present the corresponding algorithm. Based on the recursive structure of the graph, we present such top-down approach that the resulting cycle can be constructed by applying series of "dimension expansion" operations to a kind of cycles consisting of sub-graphs. This processing naturally leads to such property that the resulting cycles tend to be integrated compactly within some minimal subset of sub-graphs, and also means its applicability of another classes of the disjoint-style cycle problems. This result means not only the graph-theoretic contribution of analyzing the pancyclic property in the underlying graph model but also the parallel processing applications such a as message routing or resource allocation and scheduling in the multi-computer system with the corresponding interconnection network.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37B no.12
• /
• pp.1138-1147
• /
• 2012

IEEE standard 802.16, often referred to as WiMAX, is considered a "last mile" broadband wireless access alternative to conventional DSL and Cable Internet. One extension that is recently receiving great attention is the IEEE 802.16j Mobile Multihop Relay (MMR) amendment. The focus of this amendment is the development of simple and lower cost relay stations (RSs) that can enhance network coverage and capacity. We use our proposed simple scheduling scheme for serving the SSs in a fair manner and evaluate the performance of WiMAX networks with relays, especially we analyze the impact of interference between RSs on cell throughput Through simulations and numerical analysis, we make several fundamental observations about interference aware cost effective coverage extension in such networks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.4C
• /
• pp.460-468
• /
• 2009

Multiple-input multiple-output (MIMO) technology applied with orthogonal frequency division multiplexing (OFDM) is considered as the ultimate solution to increase channel capacity without any additional spectral resources. At the receiver side, the challenge resides in designing low complexity detection algorithms capable of separating independent streams sent simultaneously from different antennas. In this paper, we introduce an upper-lower bounded-complexity QRD-M algorithm (ULBC QRD-M). In the proposed algorithm we solve the problem of high extreme complexity of the conventional sphere decoding by fixing the upper bound complexity to that of the conventional QRD-M. On the other hand, ULBC QRD-M intelligently cancels all unnecessary hypotheses to achieve very low computational requirements. Analyses and simulation results show that the proposed algorithm achieves the performance of conventional QRD-M with only 26% of the required computations.