• Journal of KIISE:Information Networking
• /
• v.28 no.4
• /
• pp.559-569
• /
• 2001

With the growth of the Internet, applications using the reliable multicast protocol are increasing. Two important requirements of reliable multicasting are reliability and scalability. To enhance scalability, many methods have been proposed. A typical method is a local recovery scheme. This paper proposes a new stable and effective protocol with the following features. The first is to apply the discipline of the separations of concerns to NAK message. By dividing the functions of the NAK message into the error recovery request and the NAK-suppression, each function can be optimized. Second, a local representative, which is selected gradually and distributively, executes error recovery in somewhat deterministic manner. Finally, by dynamically adjusting the TTL value of the control message, the error recovery domain can be optimized. The proposed scheme has been implemented and experimented on Network Simulator. Compared to the existing schemes, the performance results show that scalability has not only been enhanced but also error recovery time and network overhead have been reduced.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.11C
• /
• pp.1098-1107
• /
• 2005

The emerging H.264/AVC video coding standard improves coding performance significantly by adopting many advanced techniques. This is achieved at the expense of great increasing encoder complexity. Specifically the intra prediction using RDO examines all possible combinations of coding modes, which depend on spatial directional correlation with adjacent blocks. For 4${\times}$4 luma blocks, there are 9 modes, and for 16${\times}$16 luma and 8${\times}$8 chroma blocks, there are 4 modes, respectively. Therefore the number of mode combinations for each macroblock is 592. This paper presents a method to reduce the RDO complexity using simple directional masks and neighboring modes. According to the proposed method, we reduce the number of mode combinations to 132 at the most. Experimental results show the proposed method reduces the encoding time up to $70\%$ with negligible loss of PSNR and bitrate increase compared to the H.264/AVC exhaustive search.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.26 no.5
• /
• pp.445-454
• /
• 2015

In this paper, we propose an optimal design method for a dual reflector antenna(DRA) using the Genetic algorithm. In order to reduce the computational burden during the optimal design, we exploit the iterative physical optics(IPO) to calculate the surface current distribution at each reflector antenna. To improve the accuracy, we consider the shadow effect by the structure and the coupling effect by the multi-reflection based on the iterative MFIE(Magnetic Field Integral Equation). To reduce the number of design variables and generate a smooth surface, we use the Bezier function with the control points, which become the design variables in this paper. We adopt the HPBW(Half Power Beam Width), the FNBW(First Null Beam Width), and the SLL(Side Lobe Level) as the objective or cost functions. To verify the results, we compare them with the those of the commercial tool.

• The Journal of the Acoustical Society of Korea
• /
• v.11 no.3
• /
• pp.53-60
• /
• 1992

Many adaptive beamforming methods have been studied for interference cancellation and speech signal enhancement in telephone conference and auditorium. Main aspect of adaptive beamforming methods for speech signal processing is different from radar, sonar and seismic signal processing because desire output signal should be apt to the human ear. Considering that phase of speech is quite insensible to the human ear, Sondhi proposed a nonlinear constrained optimization technique whose constraint was on the magnitude transfer function from the source to the output. In real environment the phase response of the speech signal affects the human auditorium system. So it is desirable to design linear phase system. In this paper, linear phase beamformer is proposed and sample processing algorithm is also proposed for real time consideration Simulation results show that the proposed algorithm yields more consistent beam patterns and deep nulls to the noise direction than Sondhi's.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.8
• /
• pp.691-700
• /
• 2000

The standard volume ray-tracing, optimized with octree, needs to repeatedly traverse hierarchical structures for each ray that often leads to redundant computations. It also employs the expensive 3D interpolation for producing high quality images. In this paper, we present a new ray-casting method that efficiently computes shaded colors and opacities at resampling points by traversing octree only once. This method traverses volume data in object-order, finds resampling points on slices incrementally, and performs resampling based on 2D interpolation. While the early ray-termination, which is one of the most effective optimization techniques, is not easily combined with object-order methods, we solved this problem using a dynamic data structure in image space. Considering that our new method is easy to implement, and need little additional memory, it will be used as very effective volume method that fills the performance gap between ray-casting and shear-warping.

• Journal of Broadcast Engineering
• /
• v.10 no.2
• /
• pp.238-246
• /
• 2005

This paper proposes an iterative high-resolution image interpolation algorithm using spatially adaptive constraints and regularization functional. The proposed algorithm adapts adaptive constraints according to the direction of..edges in an image, and can restore high-resolution image by optimizing regularization functional at each iteration, which is suitable for edge directional regularization. The proposed algorithm outperforms the conventional adaptive interpolation methods as well as non-adaptive ones, which not only can restore high frequency components, but also effectively reduce undesirable effects such as noise. Finally, in order to evaluate the performance of the proposed algorithm, various experiments are performed so that the proposed algorithm can provide good results in the sense of subjective and objective views.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.10C
• /
• pp.820-828
• /
• 2008

In order to achieve high coding efficiency, H.264/AVC video coding standard adopts the techniques such as variable block size coding, motion estimation with quarter-pel precision, multiple reference frames, rate-distortion optimization, and etc. However, these coding methods have a defect to greatly increase the complexity for motion estimation. Particularly, from multiple reference frame motion estimation, the computational burden increases in proportion to the number of the searched reference frames. Therefore, we propose the method to reduce the complexity by controlling the number of the searched reference frames in motion estimation. Proposed algorithm uses the optimal reference frame information in both $P16{\times}16$ mode and the adjacent blocks, thus omits unnecessary searching process in the rest of inter modes. Experimental results show the proposed method can save an average of 57.31% of the coding time with negligible quality and bit-rate difference. This method also can be adopted with any of the existing motion estimation algorithm. Therefore, additional performance improvement can be obtained.

• Journal of the Korea Society of Computer and Information
• /
• v.4 no.4
• /
• pp.163-169
• /
• 1999

Mobile-IP has been designed to have mobile computer users move from place to place without changing their IP addresses. Mobile-IP introduces the following entities to support mobility: Home Agent. Foreign Agent, etc., and it uses the techniques such as Agent Discovery, Registration. and Tunnelling. Mobile-IP route optimization provides a mechanism by which correspondent nodes are enable to know the mobile host's care-of address to alleviate the triangle routing problem. As a further performance improvement, to alleviate the overhead resulted from the frequent local mobility within a site hierarchical foreign agents are presented, and as a foreign agent which is willing to participate in communication maintain a buffering mechanism not to loss packets for mobile host, smooth handoffs is presented. In this paper, the problems to be thought to support host's mobility and the existing method to support it is discussed.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.15 no.4
• /
• pp.414-420
• /
• 2004

Partial transmit sequence(PTS) scheme has been widely studied to reduce the peak-to-average power ratio(PAPR) of Orthogonal frequency-division multiplexing(OFDM) signal since it is flexible ad any spectral regrowth is not made. A necessity of the PTS scheme is to transmit the side information about the phase rotation factors for correct OFDM symbol recovery. In this paper, a new side information embedded PTS scheme using the reference symbols is proposed fur the PAPR reduction and the BER(bit error rate) performance is analyzed when the erroneous side information is received. In this proposed method, the information about the rotation factors is expressed by the phase of reference symbols. The proposed method maintains the same PAPR reduction performance as the conventional PTS scheme and OFDM symbols are correctly recovered by the side information to meet the required BER level, which is verified via the computer simulation. Also, it is shown that the proposed method can be easily realized and can be used for all kinds of digital modulation formats in the OFDM communication system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.6C
• /
• pp.512-522
• /
• 2005

In this paper, an optimal determination method of the subband-frame size and mode-switching level is proposed for adaptive OFDM-TDD systems in frequency-selective time-varying channels. The optimization problem considering frequency selectivity. user's mobility, and the signaling overhead caused by the mode change information is formulated in the maximum spectral efficiency sense satisfying the target BER. Assuming that subband-frame size is given, the mode-switching level is first optimized so that the spectral efficiency can be maximized satisfying the target BER. The subband-frame size among candidates is then determined, which maximizes the spectral efficiency. Simulation results show that the proposed scheme outperforms conventional schemes, in terms of the spectral efficiency and the BER.