• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.3A
• /
• pp.271-280
• /
• 2007

This paper presents a power control scheme for OFDM based wireless communication systems in a multicell environment with co-channel interference which enables each system to achieve its target level of transmission bit rate. Generally, the optimal or near optimal power control scheme for multicarrier systems is Down to control the power level of each subcarrier in accordance with the associated channel status, which may be found in WF(waterfilling) and WF(iterative waterfilling) schemes. However, this requires the channel state information associated with every subchannel to be fed back from the receiver to its transmitter for successful power control. If the wireless channel exhibits relatively fast fading or the number of subcarriers is large, this may result in a considerable overhead. Here, in order to alleviate this problem, we propose a power control strategy for an OFDM systems maintaining the same power level over all the subcarriers. Also we prove its convergence, compare its complexity with that of the existing IWF algorithm, and examine its convergence characteristic through computer simulations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.7C
• /
• pp.611-617
• /
• 2010

In this paper, we investigate the performances of the serial concatenated convolutional codes (SCCC) and low-density parity-check (LDPC) codes on perpendicular magnetic recording (PMR) channels. We discuss the performance of two systems when user bit-densities are 1.7, 2.0, 2.4 and 2.8, respectively. The SCCC system is less complex than LDPC system. The SCCC system consists of recursive systematic convolutional (RSC) codes encoder/decoder, precoder and random interleaver. The decoding algorithm of the SCCC system is the soft message-passing algorithm and the decoding algorithm of the LDPC system is the log domain sum-product algorithm (SPA). When we apply the iterative decoding between channel detector and the error control codes (ECC) decoder, the SCCC system is compatible with the LDPC system even at the high user bit density.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.3 s.357
• /
• pp.41-50
• /
• 2007

In this paper, a new Dual Round-Robin (DRR) based iterative SLIP (iSLIP) scheduling scheme, called DiSLIP is proposed for IP switching systems. By using DRR followed by iSLIP, DiSLIP can exploit desynchronization effect of DRR and high performance of iSLIP, while the drawbacks of two schemes are minimized. 'Through computer simulation, we verify the switch throughput and total waiting time of the proposed scheme under nonuniform and correlated self-similar traffic. Moreover, the proposed scheme can considerably reduce the complexity of parallel matching logics compared to iSLIP. From the result, we observe that the proposed scheme outperforms DRR on throughput as well as iSLIP schemes on complextiy.

• Journal of Nuclear Fuel Cycle and Waste Technology(JNFCWT)
• /
• v.21 no.1
• /
• pp.165-173
• /
• 2023

Various linear system solvers with multi-physics analysis schemes are compared focusing on the near-field region considering thermal-hydraulic-chemical (THC) coupled multi-physics phenomena. APro, developed at KAERI for total system performance assessment (TSPA), performs a finite element analysis with COMSOL, for which the various combinations of linear system solvers and multi-physics analysis schemes should to be compared. The KBS-3 type disposal system proposed by Sweden is set as the target system and the near-field region, which accounts for most of the computational burden is considered. For comparison of numerical analysis methods, the computing time and memory requirement are the main concerns and thus the simulation time is set up to one year. With a single deposition hole problem, PARDISO and GMRES-SSOR are selected as representative direct and iterative solvers respectively. The performance of representative linear system solvers is then examined through a problem with an increasing number of deposition holes and the GMRES-SSOR solver with a segregated scheme shows the best performance with respect to the computing time and memory requirement. The results of the comparative analysis are expected to provide a good guideline to choose better numerical analysis methods for TSPA.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.11
• /
• pp.3876-3895
• /
• 2014

Recently, Heterogeneous Network (HetNet) with Coordinated Multi-Point (CoMP) scheme is introduced into Long Term Evolution-Advanced (LTE-A) systems to improve digital services for User Equipments (UEs), especially for cell-edge UEs. However, Radio Resource Management (RRM), including Resource Block (RB) scheduling and Power Allocation (PA), in this scenario becomes challenging, due to the intercell cooperation. In this paper, we investigate the RRM problem for downlink transmission of HetNet system with Joint Processing (JP) CoMP (both joint transmission and dynamic cell selection schemes), aiming at maximizing weighted sum data rate under the constraints of both transmission power and backhaul capacity. First, joint RB scheduling and PA problem is formulated as a constrained Mixed Integer Programming (MIP) which is NP-hard. To simplify the formulation problem, we decompose it into two problems of RB scheduling and PA. For RB scheduling, we propose an algorithm with less computational complexity to achieve a suboptimal solution. Then, according to the obtained scheduling results, we present an iterative Karush-Kuhn-Tucker (KKT) method to solve the PA problem. Extensive simulations are conducted to verify the effectiveness and efficiency of the proposed algorithms. Two kinds of JP CoMP schemes are compared with a non-CoMP greedy scheme (max capacity scheme). Simulation results prove that the CoMP schemes with the proposed RRM algorithms dramatically enhance data rate of cell-edge UEs, thereby improving UEs' fairness of data rate. Also, it is shown that the proposed PA algorithms can decrease power consumption of transmission antennas without loss of transmission performance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.9
• /
• pp.1725-1727
• /
• 2015

In this letter, a QR decomposition based sequential BP detection scheme is proposed for MIMO systems. The proposed scheme performs the sequential updates from the observation node having the smallest degree among all the observation nodes. Our simulation results verify that the proposed scheme achieves an improved error performance with a significantly accelerated detection convergence speed compared to the conventional schemes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.6
• /
• pp.2446-2462
• /
• 2016

In this paper, a frequency domain Expectation-Maximization (EM)-based channel estimation algorithm for Space Time Block Coded-Orthogonal Frequency Division Multiplexing (STBC-OFDM) systems is investigated to support higher data rate applications in wireless communications. The computational complexity of the frequency domain EM-based channel estimation is increased when higher order constellations are used because of the ascending size of the search set space. Thus, a search set reduction algorithm is proposed to decrease the complexity without sacrificing the system performance. The performance results of the proposed algorithm is obtained in terms of Bit Error Rate (BER) and Mean Square Error (MSE) for 16QAM and 64QAM modulation schemes.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.32 no.4
• /
• pp.1-18
• /
• 2007

In this paper, we develop an adaptive genetic algorithm (aGA). The aGA has an adaptive scheme which can automatically determine the use of local search technique and adaptively regulate the rates of crossover and mutation operations during its search process. For the adaptive scheme, the ratio of degree of dispersion resulting from the various fitness values of the populations at continuous two generations is considered. For the local search technique, an improved iterative hill climbing method is used and incorporated into genetic algorithm (GA) loop. In order to demonstrate the efficiency of the aGA, i) a canonical GA without any adaptive scheme and ii) several conventional aGAs with various adaptive schemes are also presented. These algorithms, including the aGA, are tested and analyzed each other using various test problems. Numerical results by various measures of performance show that the proposed aGA outperforms the conventional algorithms.

• Bulletin of the Korean Mathematical Society
• /
• v.48 no.3
• /
• pp.575-584
• /
• 2011

In Shahzad and Zegeye [Nonlinear Anal. 71 (2009), no. 3-4, 838-844], the authors introduced several Ishikawa iterative schemes for xed points of multi-valued mappings in Banach spaces, and proved some strong convergence theorems by using their iterations. In their proofs of the main results, it seems reasonable and simpler to prove for the iteration {$x_n$} to be a Cauchy sequence. In this paper, we modify and improve the proofs of the main results given by Shahzad and Zegeye. Two concrete examples also are given.

• Bulletin of the Korean Mathematical Society
• /
• v.48 no.5
• /
• pp.991-1002
• /
• 2011

An iterative algorithm is provided to find a common element of the set of fixed points of a nonexpansive mapping and the set of solutions of some variational inequality in a Hilbert space. Using this result, we consider a strong convergence result for finding a common fixed point of a nonexpansive mapping and a strictly pseudocontractive mapping. Our results include the previous results as special cases and can be viewed as an improvement and refinement of the previously known results.