• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37A no.10
• /
• pp.895-902
• /
• 2012

In this paper, we propose a novel equalizer to compensate for the group delay including AM/PM nonlinear distortion characteristics by the nonlinear power amplifier (PA). The group delay characteristic is a nonlinear non-constant time delay that appears differently depending on each frequency component. The phase distortion by AM/PM characteristics arising from the power amplifier is a major factor to increase group delay. By the group delay distortion, the signal in the constellation expands and is rotated. Considering the problem mentioned above, the nonlinear time delay that appears differently depending on each frequency component is classified as a static group delay and AM/PM characteristic of PA, the different phase transitions depending on the size of input signal as a dynamic group delay. Static group delay estimates and compensate for phase distortions in the frequency domain with type-based method and dynamic group delay compensates for phase rotation in the time domain. We confirmed that the group delay compensation techniques were enough to compensate the group delay characteristics including AM/PM characteristics of the power amplifier.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.12
• /
• pp.2626-2634
• /
• 1997

The purpose of multicasting is to reduce the network costs for transmitting the same traffic to multiple destinations. In this paper, an efficient delay-bounded multicasting routing algorithm is proposed, which satistifies the network conditions of cost minimization and can adjust the dynamic events, such as 'leave and/or join ones' from the multicast group. Also, our algorithm is designed for various network requirements such as the efficiet dynamic group support, high-quality data distribution, and adaptability to variable situation. After the delay tolerance and the maximum group size are determined according to network state and requirements for delay and cost, the dynamic delay-bounded multicast tree is constructed using partial multicast routing. We evaluate the performance of the proposed algorithm by running simulations on randomly generated test networks using a Sun Sparc 20 workstation. We were able to obtain good simulation resutls, which means solutions that lies between the minimum cost solution and the minimum delay one.

• Journal of Electrical Engineering and Technology
• /
• v.9 no.1
• /
• pp.334-343
• /
• 2014

In this paper, we suggest a method to improve the fusion of an accelerometer and gyro sensor by using a Kalman filter to produce a more high-quality respiration signal to supplement the weakness of using a single accelerometer. To evaluate our proposed algorithm's performance, we developed a chest belt-type module. We performed experiments consisting of aerobic exercise and muscular exercises with 10 subjects. We compared the derived respiration signal from the accelerometer with that from our algorithm using the standard respiration signal from the piezoelectric sensor in the time and frequency domains during the aerobic and muscular exercises. We also analyzed the time delay to verify the synchronization between the output and standard signals. We confirmed that our algorithm improved the respiratory rate's detection accuracy by 4.6% and 9.54% for the treadmill and leg press, respectively, which are dynamic. We also confirmed a small time delay of about 0.638 s on average. We determined that real-time monitoring of the respiration signal is possible. In conclusion, our suggested algorithm can acquire a more high-quality respiration signal in a dynamic exercise environment away from a limited static environment to provide safer and more effective exercises and improve exercise sustainability.

• Proceedings of the IEEK Conference
• /
• 1999.06a
• /
• pp.118-121
• /
• 1999

Multicast addresses cannot be permanently assigned to particular application or group combination, but need to be available for re-use. So, this requires a dynamic multicast address allocation and release mechanism. For a dynamic multicast address allocation and release mechanism, we must consider low blocking probability, low delay, low control traffic overhead. In this paper, we suggest a efficient dynamic multicast address allocation and release mechanism based on the multicast scope

• Journal of KIISE
• /
• v.43 no.5
• /
• pp.606-612
• /
• 2016

The multi-view video service based on the DASH(Dynamic Adaptive Streaming over HTTP) switches the viewpoint or object which is selected by the user among the multiple video streams captured by multiple cameras. However, the problem is that the conventional DASH-based multi-view video service takes a long time to switch the viewpoint. The reason is that the conventional scheme switches to the new video stream after consuming all buffered segments of the previous video stream. In this paper, we propose a video streaming scheme for minimizing the viewpoint switching delay in the DASH-based multi-view video service. In order to minimize the viewpoint switching delay, the proposed scheme configures the video streams by controlling the GoP (Group of Pictures) size and controls the client buffer based on bandwidth estimation and playback buffer occupancy. Through the experimental results, we prove that the proposed scheme reduces the viewpoint switching delay.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.3
• /
• pp.65-75
• /
• 1998

We consider connection-oriented wireless cellular networks such as the second generation wireless cellular networks and wirelss ATM networks. In these networks, a separate forward signaling channel is provided for the transmission of paging and channel allocation packets. When a call destined to a user is requested, all the base stations in the user's current location area broadcast the corresponding paging packet across forward signaling channels. By slot mode operation and paging group allocation for fusers in a location area, we can reduce relative power consumption level at battery-operated terminals. However, a sthe number of paging groups is increased for lowering relative power consumption level, a paging packet experiences higher delay to access the forward signaling channel. For the pre-negotiated quality-of-service level, paging packet delay level must be limited. In this paper, we consider static and dynamic multiplexing schemes for paging packets, and develop an analytical method for calculating paging packet delay and relative power consumption levels. Using this analytial method, we investigate the effect of network parameters on the paging packet delay and relative power consumption levels.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.11 no.8
• /
• pp.1376-1385
• /
• 2000

The phase characteristic of delay line in feedfarward linearizer has been changed due to variation of operating temperature. In this paper, design method of fixed phase control circuit of group delay line using adaptive vector control is derived. To maintain transfer characteristics of nominal operating temperature, the error correlated signals, which are changed adaptively due to changing of temperature, are added to main signals. The proposed method maintains transfer characteristics under 0.06dB of insertion loss and 0.36$^{\circ}$ of phase variation in case of 1-tone(880 MHz) and under 0.07 dB of insertion loss and 0.35$^{\circ}$ of phase variation in case of 2-tones(877 MHz, 882 MHz) for 10dB input power dynamic range and +/-10$^{\circ}$ phase variation respectively.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.1
• /
• pp.17-27
• /
• 2012

Broadcast-based data dissemination has become a widely accepted approach of communication in the mobile computing environment. However, with a large set of data items, the expected delay of receiving a desired data increases due to the sequential nature of the broadcast channel. This paper explores the issue of designing proper data allocation on multiple broadcast channels to reduce this wait time, and proposes a new data allocation scheme named near optimal data allocation(NODA). The proposed scheme first partitions all data items in K group based on the theoretical lower-bound of the average expected delay to determine data items which each broadcast channel has to broadcast. Then, NODA further partitions each group of data items in B groups using extended dynamic programming algorithm to broadcast data items allocated on the same broadcast channel in different frequencies. The proposed scheme is capable of minimizing the average expected delay time since it can broadcast data items allocated on the same channel reflecting their popularities.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.17 no.3
• /
• pp.327-335
• /
• 2014

In this paper, we propose a group distributed dynamic address assignment scheme suitable for tactical mobile ad hoc networks(MANET). Efficient address assignment is an important issue in the MANET because a node may frequently leave the current network and join another network owing to the mobility of the node. The conventional schemes do not consider the features of the tactical networks: existence of a leader node and network activity on a group basis. Thus, they may not be suitable for military operations. In our proposed scheme, called grouped units dynamic address assignment protocol(G-DAAP), a leader node maintains the address information for the members in the network and any of the nodes can exploit the information for the assignment or request of the IP address by a simple message exchange procedure. This leads to fast address assignment with small overheads. In addition, G-DAAP based on the modified IEEE 802.11e Enhanced Distributed Channel Access(EDCA) can assign addresses more quickly. We describe the delay performance of the G-DAAP and compare it with conventional schemes by numerical analysis and computer simulations. The results show that the G-DAAP significantly improves the delay performance as compared with the conventional schemes.

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

In this paper, we propose an enhanced handoff support scheme based on network-based mobility management protocol, Proxy Mobile IPv6 (PMIPv6), which is actively standardized by the IETF NETLMM working group. By utilizing the dynamic virtual hierarchy network architecture between mobile access gateways (MAGs), the proposed scheme can support network scalability and reliability to wireless access network. In addition, we propose pre-authentication process based on the policy store (PS) to support a fast and seamless handoff. We evaluate the performance of the proposed scheme in terms of handoff delay and end-to-end delay thru computer simulation. Thru, various computer simulation results, we verified the superior performance of the proposed scheme by comparing with the results of other schemes.