• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.9
• /
• pp.1635-1641
• /
• 2017

In this paper, a trellis-coded 3-dimensional (3-D) orthogonal frequency division multiplexing (OFDM) system is presented and its performance is analyzed. Here, a set-partitioning technique for trellis coding with respect to a 3-D signal constellation is also presented. We show theoretically that the proposed system, which exploits a trellis coding scheme with recursive systematic convolutional codes (RSC) of code rate R = 1/3 and 2/3, can improve symbol error rate (SER) up to 7.8 dB as compared with the uncoded OFDM system in an additive white Gaussian noise (AWGN) channel. Computer simulation confirms that the theoretical analysis of the proposed system is very accurate. It is, therefore, considered that the proposed trellis-coded 3-D OFDM system is well suited for the high quality digital transmission system without increase in the available bandwidth.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.10a
• /
• pp.808-811
• /
• 2015

Cognitive radio has been proposed as a promising dynamic spectrum allocation paradigm. In cognitive radio, spectrum sensing is a fundamental procedure that enables secondary users (unlicensed) employing unused portion of spectrum of primary users (licensed) without causing harmful interference. However, the performance of single-user spectrum-sensing scheme was limited by fading, noise uncertainty shadowing and hidden node problem. Cooperative spectrum sensing was proposed to mitigate these problem. In this paper, we observe cooperative sensing scheme with energy detection using three adaptive thresholds for local decision, which can mitigate sensing failure problem and improve sensing performance at local node. In cooperative scheme we employed OR rules as decision combining at fusion center. We evaluate our scheme through computer simulation, and the results show that with OR combination rule our scheme can achieve best performance than other schemes.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.22 no.1
• /
• pp.1-8
• /
• 2018

Recently, the convolutional neural network shows high performance in many computer vision tasks. However, convolutional neural networks require enormous amount of operation, so it is difficult to adopt them in the embedded environments. To solve this problem, many studies are performed on the ASIC or FPGA implementation, where an efficient representation method is required. The fixed-point representation is adequate for the ASIC or FPGA implementation but causes a performance degradation. This paper proposes a separate optimization of representations for the convolutional layers and the batch normalization layers. With the proposed method, the required bit width for the convolutional layers is reduced from 16 bits to 10 bits for the ResNet-50 neural network. Since the computation amount of the convolutional layers occupies the most of the entire computation, the bit width reduction in the convolutional layers enables the efficient implementation of the convolutional neural networks.

• The Transactions of the Korean Institute of Power Electronics
• /
• v.16 no.6
• /
• pp.610-617
• /
• 2011

This paper proposes a novel and direct dead-time compensation method of the 3-phase inverter using space vector pulse width modulation(SVPWM) topology. The proposed dead-time compensation method directly compensates the dead-time to the turn-on time of the effective voltage vector according to the current direction of the medium voltage reference. Each phase voltages are determined by the switching times of the effective voltage vectors, and the practical switching times have loss according to the current direction by the dead-time effect in the 3-phase inverter. The proposed method adds the dead-time to the switching time of the effective voltage vector according to the current direction, so it does not require complex d-q transform and controller to compensate the voltage error. The proposed dead-time compensation scheme is verified by the computer simulation and experiments of 3-phase R-L load.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.10
• /
• pp.1889-1899
• /
• 2015

In this paper, we propose a multiple slot reservation scheme to transmit data rapidly in the satellite random access channel. In the R-CRDSA (Reservation scheme with Contention Resolution Diversity Slotted ALOHA), each satellite terminal can use only one slot in a frame. Therefore, many slots are wasting in the low traffic load and the satellite terminals which have large date needs many frame to transmit their data although there are unused slots. In the multiple slot reservation scheme, each satellite terminal transmits a packet with their data size and reserves many slots in the light of data size and slot reservation status. Therefore, each satellite terminal transmits their data faster than R-CRDSA. This is because they can reserve many slots in a frame. Furthermore, we simulate proposed scheme and validate the performance of proposed scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37A no.9
• /
• pp.762-771
• /
• 2012

In this paper, we propose an adaptive power control scheme employing a self-optimization concept in femtocell systems, in order to improve system capacity, thereby reducing call-drop probability. In the proposed scheme, each femto base station(FBS) controls individual channel's transmission power base on two parameters; the neighboring cell's transmission power for each individual channel which is delivered from a femto-gateway and the received power strength from neighboring cells which is periodically measured by means of a spectrum sensing. Adaptive adjustment of individual channel's transmission power in accordance with femto mobile station(FMS) mobility features can also reduce undesirable handovers and evenly distribute traffic load over all femtocells. In addition, the manipulative control of channel's transmission power is able to keep the system coverage and the call-drop probability within an acceptable range, regardless of density of femtocells. Computer simulation shows that the proposed scheme outperforms existing schemes in terms of the system coverage and the call-drop probability.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.6C
• /
• pp.462-468
• /
• 2012

In this paper, an adaptive digital automatic gain control(AGC) algorithm with two stages is proposed. AGC technique is crucial for mobile communication equipment because path loss in wireless channel and gain fluctuation in receiver front-end continuously change the received signal strength. Furthermore, adaptive criteria should be applied to the design of AGC algorithm in order to support many waveforms with one SDR communication device. With these reasons, a two-stage structure is proposed to satisfy both flexibility and adaptiveness. Compared with conventional method, it also requires shorter convergence time. Numerical results show that the gain value of variable gain amplifier(VGA) is converged within proper time and proposed scheme controls the input level of analog to digital converter(ADC) to be stable during long range of time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.6B
• /
• pp.867-874
• /
• 2010

Since high packet losses occur in multi-hop transmission of wireless sensor networks, reliable data transmission is required. Especially, in case of event-driven data, a loss recovery mechanism should be provided for lost packets. Because retransmission for lost packets is requested to a node that caches the packets, the caching node should maintains all of data for transmission in its buffer. However, nodes of wireless sensor networks have limited resources. Thus, both a loss recovery mechanism and a buffer management technique are provided for reliable data transmission in wireless sensor networks. In this paper, we propose a buffer management technique at a caching position determined by a loss recovery mechanism. The caching position of data is determined according to desirable reliability for the data. In addition, we validate the performance of the proposed method through computer simulations.

• The KIPS Transactions:PartB
• /
• v.18B no.4
• /
• pp.193-200
• /
• 2011

This paper proposes a low-cost visual analyzer algorithm of human body motion for real-time applications such as human-computer interfacing, virtual reality applications in medicine and telemonitoring of patients. To reduce cost of its use, we design the algorithm to use a single camera. To make the proposed system to be used more conveniently, we avoid from using optical markers. To make the proposed algorithm be convenient for real-time applications, we design it to have a closed-form with high accuracy. To design a closed-form algorithm, we propose an idea that formulates motion of a human body joint as a 2D universal joint model instead of a common 3D spherical joint model, without any kins of approximation. To make the closed-form algorithm has high accuracy, we formulates the estimation process to be an optimization problem. Thus-desined algorithm is applied to each joint of the human body one after another. Through experiments we show that human body motion capturing can be performed in an efficient and robust manner by using our algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.1A
• /
• pp.62-69
• /
• 2005

Efforts for standardization of medium access control (MAC) protocol in IEEE802.11e have been made to support quality of service (QoS) in IEEE802.11e MAC protocol. Enhanced disoibuted coordination function (EDCF) of 802.11e MAC protocol is modified to support QoS for packets that have differentiated priority. However, EDCF still has the problem of throughput optimization and priority support. Therefore, we have proposed a scheme called adaptive EDCF for both supporting priority of packets and throughput optimization. We have derived the relation between the number of nodes and contention window size for throughput optimization. Based on the analytic results, we have evaluated the performance of the proposed scheme using OPNET simulations. The simulation results show that using the proposed scheme can improve the overall throughput regardless of the number of nodes and the decrement of the throughput with increasing the number of nodes can be alleviated. Additionally, we have shown that the adaptive EDCF can support priority of packets more effectively than existing EDCF.