• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.5
• /
• pp.971-980
• /
• 1994

The need increased capacity in the cellular system has resulted in the adoption of digital technology with CDMA as the channel access method. It has been recognized that the distinction of the base station is important for its performance in CDMA, since the same spreading sequences are used by the all base stations. Time offset of the pseudo-random noise binary code are used to distinguish signals received at a mobile station from different base station. But the start of the zero offset PN sequence is chosen arbitrary without the background of the systematic and mathematical elaboration. This paper proposes a mothed that define the start of the zero offset PN sequence mathematically. This paper also discusses a method that can easily calculate the time offset of the received spreading sequence with respect to the zero offset PN sequence.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.8B
• /
• pp.677-686
• /
• 2012

In the presence of a high power cellular network, picocells are added to a Macro-cell layout aiming to enhance total system throughput from cell-splitting. While because of the different transmission power between macrocell and picocell, and co-channel interference challenges between the existing macrocell and the new low power node-picocell, these problems result in no substantive improvement to total system effective throughput. Some works have investigated on these problems. Pico Cell Range Expansion (CRE) technique tries to employ some methods (such as adding a bias for Pico cell RSRP) to drive to offload some UEs to camp on picocells. In this work, we propose two solution schemes (including cell selection method, channel allocation and serving process) and combine new adaptive frequency partitioning reuse scheme to improve the total system throughput. In the simulation, we evaluate the performances of heterogeneous networks for downlink transmission in terms of channel utilization per cell (pico and macro), call blocking probability, outage probability and effective throughput. The simulation results show that the call blocking probability and outage probability are reduced remarkably and the throughput is increased effectively.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.7A
• /
• pp.548-553
• /
• 2009

The aim of 4G mobile communication systems is to connect arbitrary devices to high-speed network anytime, anywhere. Cellular system must solve the problem of inter-cell interference caused by frequency reuse for meeting needs of 4G. In this paper, to solve interference problem we propose the algorithm, the so-called Threshold-Based Region Decision (TBRD) and analyze characteristics and performance of the proposed algorithm through simulation. The proposed technique has high applicability and flexibility due to simple construction using only existing UE measurement, and achieves performance improvement through the threshold that can be easily controlled.

• Journal of Communications and Networks
• /
• v.7 no.1
• /
• pp.21-28
• /
• 2005

In this paper, we analyze the performance of code division multiple access (CDMA) systems with orthogonal frequency division multiplexing (OFDM) that employ random spreading sequences in an additive white Gaussian noise (AWGN) channel. We obtain the probability density function (pdf) of the multiple access interference and extend the results to OFDM-CDMA systems to determine the pdf of multiple access and inter-carrier interference in terms of the number of users, the spreading length, the number of sub-carriers, and the frequency offset. We consider the synchronous downlink of cellular multi-carrier CDMA and derive a Gaussian approximation of the multiple access and inter-carrier interference. Overall the effect of frequency offset is shown to vary with the system loading. The analysis in this paper is critical for further development into fading channels and frequency selective multipath channels.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.14 no.3
• /
• pp.235-239
• /
• 1989

A multiplier is proposed for computing multiplication of two arbitrary elements in the finite fields GF($2^m$), and the operation process is described step by step. The modified type of the circuit which is constructed with m-stage feedgack shift register, m-1 flip-flop, m AND gate, and m-input XOR gate is presented by referring to the conventional shift-register multiplier. At the end of mth shift, the shift-register multiplier stores the product of two elements of GF($2^m$); however the proposed circuit in this paper requires m-1 clock times from first input to first output. This circuit is simpler than cellulra-array or systolic multiplier and moreover it is faster than systolic multiplier.

• Journal of Communications and Networks
• /
• v.18 no.3
• /
• pp.513-522
• /
• 2016

We propose a mechanism for monitoring load in quality of service (QoS)-enabled wireless networks and show how it can be used for network management as well as for dynamic pricing. Mobile network traffic, especially video, has grown exponentially over the last few years and it is anticipated that this trend will continue into the future. Driving factors include the availability of new affordable, smart devices, such as smart-phones and tablets, together with the expectation of high quality user experience for video as one would obtain at home. Although new technologies such as long term evolution (LTE) are expected to help satisfy this demand, the fact is that several other mechanisms will be needed to manage overload and congestion in the network. Therefore, the efficient management of the expected huge data traffic demands is critical if operators are to maintain acceptable service quality while making a profit. In the current work, we address this issue by first investigating how the network load can be accurately monitored and then we show how this load metric can then be used to provide creative pricing plans. In addition, we describe its applications to features like traffic offloading and user satisfaction tracking.

• Journal of Communications and Networks
• /
• v.18 no.3
• /
• pp.420-428
• /
• 2016

In this paper, we investigate the scheduling and power allocation for coordinated multi-point transmission in downlink long term evolution advanced (LTE-A) systems, where orthogonal frequency division multiple-access is used. The proposed scheme jointly optimizes user selection, power allocation, and modulation and coding scheme (MCS) selection to maximize the weighted sum throughput with fairness consideration. Considering practical constraints in LTE-A systems, the MCSs for the resource blocks assigned to the same user need to be the same. Since the optimization problem is a combinatorial and non-convex one with high complexity, a low-complexity algorithm is proposed by separating the user selection and power allocation into two subproblems. To further simplify the optimization problem for power allocation, the instantaneous signal-to-interference-plus-noise ratio (SINR) and the average SINR are adopted to allocate power in a single cell and multiple coordinated cells, respectively. Simulation results show that the proposed scheme can improve the average system throughput and the cell-edge user throughput significantly compared with the existing schemes with limited feedback.

• Journal of Communications and Networks
• /
• v.18 no.1
• /
• pp.95-104
• /
• 2016

Massive multiple-input multiple-output (MIMO) is a promising approach for cellular communication due to its energy efficiency and high achievable data rate. These advantages, however, can be realized only when channel state information (CSI) is available at the transmitter. Since there are many antennas, CSI is too large to feed back without compression. To compress CSI, prior work has applied compressive sensing (CS) techniques and the fact that CSI can be sparsified. The adopted sparsifying bases fail, however, to reflect the spatial correlation and channel conditions or to be feasible in practice. In this paper, we propose a new sparsifying basis that reflects the long-term characteristics of the channel, and needs no change as long as the spatial correlation model does not change. We propose a new reconstruction algorithm for CS, and also suggest dimensionality reduction as a compression method. To feed back compressed CSI in practice, we propose a new codebook for the compressed channel quantization assuming no other-cell interference. Numerical results confirm that the proposed channel feedback mechanisms show better performance in point-to-point (single-user) and point-to-multi-point (multi-user) scenarios.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.11A
• /
• pp.815-821
• /
• 2009

In this paper, we propose a new type of mutually cooperative relaying (MCR) scheme based on a spatially coordinate-interleaved orthogonal design (SCID), in which two cooperative users are spatially multiplexed without bandwidth expansion. It provides not only diversity gain (with order of two) as in the existing MCR scheme, but also additional coding gain. Our simulation results demonstrate that the proposed SCID scheme is useful for improving the uplink performance as long as one user can find another active user as a close neighbor that is simultaneously communicating with the same destination, e.g., a base station in the cellular network.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.6A
• /
• pp.624-631
• /
• 2007

This paper presents inter-cell cooperation methods with two transmit antennas for broadcast services in a coded OFDM cellular system. In the method, cells are divided into multiple cell groups and a coded packet is partitioned into the subparts. Then, a different cell group and antenna combination is assigned to each subpart for transmission of two orthogonal branches of the diversity code. For the method, we derive the bound on the pairwise error probability to predict the coded performance and verify the performance gain of the proposed method through the simulation using turbo code and analytically derived bound.