• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.2
• /
• pp.53-60
• /
• 2014

The recent electric power shortage has led to the vigorous study for energy conservation in the many different fields. In this paper, cell zooming technology, which can reduce the energy loss at the base stations controlling the transmission power of the stations depending on the changing trffic density for reduce energy consumption that occurs when there is little or no trffic in the service area, is proposed and energy conservation is confirmed by comparing base stations' service scenario depending on traffic change.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.5
• /
• pp.499-503
• /
• 2016

We study algorithms that can efficiently find cube roots by modifying Cipolla-Lehmer algorithm. In this paper, we present two type algorithms for finding cube roots in finite field, which improves Cipolla-Lehmer algorithm. If the number of multiplications of two type algorithms has a little bit of a difference, then it is more efficient algorithm which have less storage variables.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.8
• /
• pp.1515-1517
• /
• 2015

The effects of the reference sample size on the detection probability of the two-sample rank detector is investigated in this paper. The larger reference sample size shows the better performance of the detector. The effect is also shown to be saturated as the reference sample size becomes larger.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.8
• /
• pp.1518-1520
• /
• 2015

This letter considers a problem of associating users to small-cell base stations (sBSs) and selecting a set of operating sBSs in a small-cell network to minimize the power consumption. We derive a message passing algorithm to obtain a solution distributively. Simulation results show that the proposed algorithm is superior to the conventional schemes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.7A
• /
• pp.552-559
• /
• 2012

In this paper, we introduce a frame structure of the satellite TDMA network and the synchronization method thereof. The primary station transmits a special burst called reference burst which provides reference time to network. By using this reference burst all nodes achieve initial acquisition and synchronization. We consider time drift due to the node and satellite mobility, time shift due to the node position, Doppler shift due to the node mobility and frequency offsets as important factors of the frame structure. Simulation results show that the proposed frame structure and synchronization method guarantee accurate synchronization performance when the node is even in low SNR as well as 25 kHz frequency offsets.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.6B
• /
• pp.414-422
• /
• 2012

In the paper we present optimized implementation method over sensor mote for HUMMINGBIRD2 algorithm, ultra-light symmetric cryptography. For efficient implementation we maximized the register usage and used optimized addressing method to reduce the encryption and decryption time. With the optimized encryption implementation, we can utilize the efficient secure network over resource constrained sensor mote.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.3C
• /
• pp.170-174
• /
• 2011

We introduce the network coding which cooperative communication for two-way relay channel. We propose a new network coding scheme using orthogonality for cooperative communication system. The proposed network coding scheme via orthogonal mapping shows better BER performance because proposed scheme weakens error propagation which is disadvantage of DF scheme. And proposed scheme maintains same throughput compared to conventional scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.7A
• /
• pp.522-527
• /
• 2012

In this paper, union upper bound on convolutional coded bit error rates (BER) is derived for downlink orthogonal frequency division multiple access (OFDMA) networks. According to the numerical results, for the small network loads, the BER performance with Laplacian decoding metric outperforms the BER performance with Gaussian decoding metric under downlink OFDMA networks with Viterbi decoder.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.3C
• /
• pp.163-169
• /
• 2011

Partial transmit sequence (PTS) algorithm is known as one of the most efficient ways to reduce the peak-to-average power ratio (PAPR) in the orthogonal frequency division multiplexing (OFDM) system. The PTS algorithm, however, requires large numbers of computation to implement. Thus there has been a trade-off between performance of PAPR reduction and computational complexity. In this paper, the performance of PAPR reduction and computation complexity of PTS algorithms are analyzed and compared through computer simulations. Subsequently, a new PTS algorithm is proposed which can be a reasonable method to reduce the PAPR of OFDM when both the performance of PAPR reduction and computational complexity are considered simultaneously.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37B no.10
• /
• pp.956-964
• /
• 2012

An opportunistic interference alignment based on dynamic cell selection is proposed. Since the proposed method can switch the desired signal space and the interference space of received signals, an additional selective diversity gain increases. The performance analysis using probabilistic models provides a mathematical expression for the sum-rate capacity. Simulation examples show that the proposed method achieves the higher sum-rate capacity than that of the conventional opportunistic interference alignment.