• Journal of the Korea Society of Computer and Information
• /
• v.12 no.1 s.45
• /
• pp.57-65
• /
• 2007

In the fast block matching algorithm. search patterns of different shapes or sizes and the distribution of motion vectors have a large impact on both the searching speed and the image qualify. In this paper, we propose a new fast block matching algorithm using the flat-hexagon search pattern that ate solved disadvantages of the diamond pattern search algorithm(DS) and the hexagon-based search algorithm(HEXBS). Our proposed algorithm finds mainly the motion vectors that not close to the center of search window using the flat-hexagon search pattern. Through experiments, compared with the DS and HEXBS, the proposed f)at-hexagon search algorithm(FHS) improves about $0.4{\sim}21.3%$ in terms of average number of search point per motion vector estimation and improves about $0.009{\sim}0.531dB$ in terms of PSNR(Peak Signal to Noise Ratio).

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.2A
• /
• pp.34-42
• /
• 2005

In orthogonal frequency-division multiple access (OFDMA) uplink environments, asynchronously received signals can cause multiple access interference (MAI). This paper focuses on the performance degradation due to the MAI over frequency-selective fading channels. We first introduce the timing misalignment, which is defined as the relative timing difference between asynchronous timing error of uplink user and reference time of the base station, and analytically derive the MAI using the power delay profile of wide-sense stationary uncorrelated scattering (WSSUS) channel model. Then, the effective signal-to-noise ratio (SNR) and the average symbol error probability (SEP) are derived. The proposed analytical results are verified through simulations with respect to the region of the timing misalignment and the number of asynchronous users.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.10C
• /
• pp.1395-1401
• /
• 2004

In The objective of this paper is to apply blind minimum output energy multiuser detection method to multicarrier direct sequence code division multiple access system. The performance of MC/DS-CDMA is reduced due to multiple access. To increase the performance of system, we need to cancel multiple user components. Blind interference canceller is able to detect the desired's information with the only minimal information of the desired user. We evaluate the performance of the proposed receiver under Gaussian channel. Simulation results show that the proposed receiver has about 6［dB］ gain of signal to noise ratio without multiple user interference and has about 3［dB］ gain of SNR with multiple user interference. Also, the result of comparing the capacity of the active users shows that the proposed method has about 2 times capacity more than conventional method. As a conclusion, simulation results show that the proposed method has better performs better than conventional method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.4
• /
• pp.714-725
• /
• 1997

This paper proposes an image compression method using the wavelet transform and bit-plane coding of wavelet coefficients. The hierarchical application of wavelet transform to an image produces one low resoluation(the subband with lowest frequency) image and several high frequency subbands. In the proposed method, the low resolution image is compressed by a lossless method at 8 bits per each coefficient. However, the high frequency subbands are decomposed into 8 bit planes. With an adptive block coding method, the decomposed bit planes are effectively compressed using localized edge information in each bit plane. In addition, the propsoed method can control bit rates by selectively eliminating lessimportant subbands of low significant bit planes. Experimental results show that the proposed scheme has better performance in the peak signal to noise ratio (PSNR) and compression rate than conventional image coding methods using the wavelet transform and vector quantization.

• Journal of Communications and Networks
• /
• v.18 no.3
• /
• pp.375-386
• /
• 2016

Most existing studies on broadcast services in orthogonal frequency division multiplexing (OFDM) systems have focused on how to allocate the transmission power to the subcarriers. However, because a broadcasting system must guarantee quality of service to all users, the performance of the broadcast service dominantly depends on the channel state of the user who has the lowest received signal-to-noise ratio among users. To reduce the effect of the worst user on the system performance, we propose a joint delivery scheme of unicast and broadcast transmissions in OFDM systems with broadcast and unicast best-effort users. In the proposed joint delivery scheme, the BS delivers the broadcast information using both the broadcast and unicast subcarriers at the same time in order to improve the performance of the broadcast service. The object of the proposed scheme is to minimize the outage probability of the broadcast service while maximizing the sum-rate of best-effort users. For the proposed joint delivery scheme, we develop an adaptive power and subcarrier allocation algorithm under the constraint of total transmission power. This paper shows that the optimal power allocation over each subcarrier in the proposed scheme has a multi-level water filling form. Because the power allocation and the subcarrier assignment problems should be jointly solved, we develop an iterative algorithm to find the optimal solution. Numerical results show that the proposed joint delivery scheme with adaptive power and subcarrier allocation outperforms the conventional scheme in terms of the outage probability of the broadcast service and the sum-rate of best-effort users.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.2
• /
• pp.273-284
• /
• 2015

The feasibility conditions of interference alignment (IA) are analyzed for reverse duplex systems, in which one cell operates as downlink (DL) while the other cell operates as uplink (UL) assuming one-sid base station (BS) cooperation. Under general multiple-input and multiple-output (MIMO) antenna configurations, a necessary condition and a sufficient condition for one-shot linear IA are established, i.e., linear IA without symbol or time extension. In several example networks, optimal sum degrees of freedom (DoF) is characterized by the derived necessary condition and sufficient condition. For some special class of networks, a sufficient condition is established in a more compact expression, which also yields the necessary and sufficient condition. Simulation results demonstrate that the proposed IA does not only achieve larger DoF but also significantly improves the sum rate in the practical signal-to-noise ratio (SNR) regime.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.4C
• /
• pp.217-225
• /
• 2011

In this paper, we propose an adaptive de-interlacing algorithm that is based on the degree of local complexity. The conventional intra field de-interlacing algorithms show the different performance according to the ways which find the edge direction. Furthermore, FDD (Fine Directional De-interlacing) algorithm has the better performance than other algorithms but the computational complexity of FDD algorithm is too high. In order to alleviate these problems, the proposed algorithm selects the most efficient de-interacing algorithm among LA (Line Average), MELA (Modified Edge-based Line Average), and LCID (Low-Complexity Interpolation Method for De-interlacing) algorithms which have low complexity and good performance. The proposed algorithm is trained by the DoLC (Degree of Local Complexity) for selection of the algorithms mentioned above. Simulation results show that the proposed algorithm not only has the low complexity but also performs better objective and subjective image quality performances compared with the conventional intra-field methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.1A
• /
• pp.34-40
• /
• 2009

In this paper, we derive the average received beampattern at each receive node which is randomly distributed within a disk when considering a collaborative beanforming between transmission nodes which are randomly distributed within another disk for ad hoc sensor network. Numerical results show that the radius of disk at the transmitter determines the beamwidth of mainbeam, and the sidebeam is affected by the number of transmitter nodes. We also consider K receive groups and divide the transmit sensor modes into K groups to support each receive group using beamforming, and derive the SINR at each receive node. Finally, we investigate the effects of beampattern and interference on total sum capacity among all receive node, and numerically determine the number of transmit nodes for each group which can achieve the maximal sum capacity.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.1C
• /
• pp.81-89
• /
• 2009

We propose a D-ATR UWB (Differential-Average Transmitted Reference Ultra Wide Band) system based on impulse radio. The TR-UWB systems including traditional TR (Transmitted Reference) and ATR (Average TR), exhibit a problem of reduced data rate, since reference signals are additionally transmitted. To tackle this issue, the transmitter of the proposed D-ATR system employs a differential coding like the conventional D-TR system. In addition, the receiver of the proposed system has the structure that can improve signal-to-noise ratio of the reference template used in the correlation process, by recursively averaging the received reference signals like the conventional ATR system. The simulation results in the IEEE 802.15.4a UWB multipath channel models reveal that the proposed D-ATR system achieves much better bit error rate performance as compared to the conventional D- TR system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.1A
• /
• pp.12-17
• /
• 2009

We consider an OFDM based multiple AF relaying systems. Since the channel between first hop (source station-relay station) and second hop (relay station -destination station) varies independently, the subcarrier in the first hop can be paired to another subcarrier in the second hop for the increase of the system capacity. The conventional pairing which uses the brute force searching requires large complexity while giving optimal pairing for maximum system capacity. In this paper, we present sub-optimal subcarrier pairing scheme with low complexity. Every RS firstly pairs the subcarrier with the highest channel gain in the first hop to the subcarrier with highest channel gain in the second hop. The pair with the highest SNR among all the pairs is determined as final selected pair and the corresponding subcarriers are not selected at other RSs in the next paring iteration. This process is repeated until all the subcarriers are paired. Simulation results show the proposed pairing scheme achieves near optimal performance with low complexity.