• 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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.2B
• /
• pp.178-187
• /
• 2009

Cognitive radio (CR) technology is to maximize the spectrum utilization by allocating the unused spectrums to the unlicensed users. In CR environment, it is strictly required for the unlicensed users not to interference with the licensed users. Thus, it is essential to rely on the scheduling algorithm to avoid the interference when utilizing spectrum holes that are changing in time and frequency. However, the existing scheduling algorithms that are applied for the wireless communication environment considering the licensed users only is not appropriate for CR environment. In this paper, we propose downlink scheduling algorithm based on probability of incumbent user presence for cognitive radio networks. With computer simulations, it is shown that the proposed scheduling algorithm outperforms the conventional scheduling algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.2A
• /
• pp.99-106
• /
• 2009

In this paper, we propose UCA algorithms that are applied to the unified inter-cell interference mitigation through frequency plannings in OFDMA cellular systems. Under three frequency plannings, UCA algorithms allocate frequency channels to UEs(User Equipments). Proposed UCA algorithms require the information of received signal power from home sector and neighbor sectors respectively. We compare all possible combinations of UCA algorithms and frequency plannings through compute simulation. A primary performance measure is the low 5th percentile of SINR at UEs. The proposed UCA algorithms can avoid the interference to neighbor cells by allocating relatively low transmit power to centrally-located UEs and cancel inter-cell interference at cell-edge UEs by a coordinated symbol repetition. We show that UCA algorithm 2 applied in frequency planning 1 is promising among other combinations of UCA algorithms and frequency palnnings in terms of the low 5th percentile of SINR at UEs.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.11A
• /
• pp.1120-1127
• /
• 2007

In this paper, we propose a generalized processor sharing - dynamic resource allocation (GPS-DRA) scheme which allocates the required amount of resources to each hop dynamically in cellular-based multi-hop systems. In the hybrid-distributed system considered in this paper, a central controller such as a base station (BS) should allocate resources properly to each hop. However, due to changing channel condition with time, it is difficult to allocate as much amount of resources as each hop needs for transmission. GPS-DRA scheme allocates the required amount of resources dynamically to each hop based on the amount of resources used in previous frames by each hop. The amount of control overhead generated by GPS-DRA scheme can be very small because a central controller doesn't need to collect all link information for resource allocation. Our simulation results show that channel utilization increased about 16% and cell capacity increased about 65% compared to those of fixed resource allocation (FRA) scheme.

• Journal of KIISE:Information Networking
• /
• v.36 no.4
• /
• pp.286-296
• /
• 2009

A major challenge in next generation optical Internet (NGOI) networks based on dense-wavelength division multiplexing (DWDM) is the provision of guaranteed quality-of-service (QoS) for a wide variety of multimedia applications. One of the critical issues in NGOI is the routing and wavelength assignment problem that is embossed as very important and plays a key role in improving the global efficiency for capacity utilization. But the previous researches had the delay problem, and the path routed by higher priority nodes may be congested and interfere with potential future multicast session requests. To overcome these problems, in this research we suggest a Priority-based Minimum Interference Path Multicast Routing (PMIPMR) algorithm, a new routing algorithm which finds alternative routes based on node priorities and Virtual Source (VS) nodes that has both splitting and wavelength conversion, and then chooses a path that does not interfere with potential future multicast session requests when congestions occur in the network. The PMIPMR algorithm reduces blocking rate significantly and increases the wavelength utilization by avoiding congestion in future multicast session requests.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.46 no.4
• /
• pp.9-15
• /
• 2009

This paper proposes a cancellation algorithm of impulse noise using a rank-order method. The proposed method is a fast and simple algorithm that is composed of two parts. The first part involves noise detection using a fuzzy technique, where an image is divided into RGB color channels. Then every pixel in each color channel is investigated and assigned a probability indicating its chances of being a noise pixel. At this time, the rank order method using a noise-detection mask is utilized for accurate noise detection. Thereafter, the second part involves noise-cancellation, where each noise-pixel value in an image is replaced in proportion to its fuzzy probability. Through the experiments, both the conventional and proposed methods were simulated and compared. As a result, it is shown that proposed method is able to detect noisy pixels more accurately, and produce resulting images with high PSNR values.

• The KIPS Transactions:PartC
• /
• v.13C no.3 s.106
• /
• pp.369-374
• /
• 2006

This paper related with the performance improvement of adaptive equalizer that is a based on the tricepstrum eqalization algorithm by using the received signal. Adaptive equalizer used for the improvement of communication performance, like as high speed, maintain of synchronization, BER, at the receive side in the environment of communication channel of the presence of the aditive noise, phase distortion and frequency selective fading, mainly. It's characteristics are nearly same as the inverse characterstics of the communication channel. In this paper, the TEA algorithm using the HOS and the 16-QAM which is 2-dimensional signaling method for being considered signal was used. For the precoding of 16-QAM singnal in the assignment of the signal costellation, Gray code was used, and the improvement of performance was gained by computer simulation in the residual intersymbol interence and mean squared error which is representive measurement of adaptive equalizer.

• The KIPS Transactions:PartB
• /
• v.11B no.6
• /
• pp.661-666
• /
• 2004

In the wireless communication systems, transmission errors degrade the reconstructed image quality severely. Error concealment in video communication is becoming increasingly important because transmission errors can cause single or multiple loss of macroblocks in video delivery over unreliable channels such as wireless networks and internet. Among various techniques which can reduce the degradation of video quality, the error concealment techniques yield good performance without overheads and the modification of the encoder. In this paper, lost image blocks can be concealed with the OBMC(Overlapped Block Motion Compensation) after new motion vectors of the lost image blocks are allocated by median values using the adaptive selection with motion vectors of adjacent blocks. We know our algorithm is more effective in case of continuous GOB loss. The results show a significant improvement over the zero motion error concealment and other temporal concealment methods such as Motion Vector Rational Interpolation or Median＋OBMC by 3dB gain in PSNR.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.9A
• /
• pp.853-866
• /
• 2008

In this paper, a multi-hop relaying transmission scheme is analyzed regarding its feasibility and potentiality in the IEEE 802.22-based cognitive radio (CR) environment. Shortly, basic design issues are addressed such as relay station (RS) deployment and a frame structure of physical channel to escape inter-hop interference. This paper mainly develops a radio resource management scheme based on spectrum sensing results aggregated from CR secondary nodes and improves the opportunistic spectrum sharing efficiency. In particular, a decision rule about a channel availability is made using a distributed sensing method. Subsequently, spectrum allocation and routing path decision procedures are proposed to establish a link from source to destination with a hop-by-hop manner. Simulation results show that the proposed multi-hop relaying scheme is substantially profitable in CR environments if the number of hops and RS deployment are designed in such a way that the spectrum sharing gain is larger than spectrum division loss which is inherently induced in multi-hop relaying systems.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.6
• /
• pp.10-21
• /
• 2010

In the cluster-tree network which covers wide area network and has many nodes for monitoring purpose traffic is concentrated around the sink. There are long transmit delay and high data loss due to the intensive traffic when IEEE 802.15.4 is adapted to the cluster-tree network. In this paper we propose Dynamic Channel Allocation algorithm which dynamically allocates channels to increase the channel usage and the transmission success rate. To evaluate the performance of DCA, we assumed the monitoring network that consists of a cluster-tree in which sensing data is transmitted to the sink. Analysis uses the traffic data which is generated around the sink. As a result, DCA is superior when much traffic is generated. During the experiment assuming the least amount of traffic, IEEE 802.15.4, has the minimum length of active period and 90% data transmission success rate. However DCA maintains 11.8ms of active period length and results in 98.9% data transmission success rate.