• ETRI Journal
• /
• v.38 no.2
• /
• pp.227-234
• /
• 2016

Herein, we demonstrate clipping distortion suppression of directly modulated multi-IF-over-fiber links using a simple shunt diode predistorter. The dynamic range of a directly modulated analog fiber optic link is limited by nonlinear distortions caused by laser-diode clipping. We investigate the link performance in the context of carrie-to-noise and distortion ratio (CNDR) and error vector magnitude (EVM) requirements when supporting LTE-A services. We also design an analog predistorter with a shunt-diode structure, and demonstrate experimentally that the predistorter has the ability to suppress clipping-induced third-order intermodulation distortions of the link by at most 14 dB. It also improves the CNDR and EVM of the 4-IF-multiplexed LTE-A carriers by 7 dB and 2.9%, respectively.

• Journal of Mechanical Science and Technology
• /
• v.14 no.10
• /
• pp.1028-1040
• /
• 2000

A numerical method is presented for the dynamic analysis of military tracked vehicles of high mobility. To compute the impulsive dynamic contact forces which occur when a vehicle passes on a ground obstacle, the track is modeled as the combination of elastic links interconected by pin joints. The mass of each track link, the elastic elongation of a track link between pin joints by the track tension, and the elastic spring effects on the upper and lower surfaces of each track link have been considered in the equations of motion. And the chassis, torsion bar arms, and road wheels of the vehicle are modeled as the rigid multi bodies connected with kinematic constraints. The contact positions and the contact forces between the road wheels and track, and the ground and the the track are simultaneously computed with the solution of the equations of motions of the vehicle consisting of the multibodies. The iterative scheme for the solution of the multi body dynamics of the tracked vehicle is presented and the numerical simulations are conducted.

• Journal of Korean Society of Transportation
• /
• v.24 no.3 s.89
• /
• pp.177-187
• /
• 2006

It is known that over one million car navigation devices are being currently used in Korea. Most. if not all, route guidance systems, however, Provide only one "best" route to users, not providing any options for various types of users to select. The current practice dose not consider each individual's different preferences. These days, a vast amount of information became available due to the rapid development in information processing technology. Thus, users Prefer choices to be given and like to select the one that suits him/her the "best" among available information. To provide such options in this Paper, we developed an algorithm that provides alternative routes that may not the "least cost" ones, but ones that are close to the "least cost" routes for users to select. The algorithm developed and introduced in the paper utilizes a link-based search method, rather than the traditional node-based search method. The link-based algorithm can still utilize the existing transportation network without any modifications, and yet enables to provide flexible route guidance to meet the various needs of users by allowing transfer to other modes and/or restricting left turns. The algorithm developed has been applied to a toy network and demonstrated successful implementation of the multi-path search algorithm for multi-purpose activities.

• Journal of Korean Society of Transportation
• /
• v.26 no.1
• /
• pp.127-135
• /
• 2008

Generally, optimum shortest path algorithms adopt single attribute objective among several attributes such as travel time, travel cost, travel fare and travel distance. On the other hand, multi-objective shortest path algorithms find the shortest paths in consideration with multi-objectives. Up to recently, the most of all researches about multi-objective shortest paths are proceeded only in single transportation mode networks. Although, there are some papers about multi-objective shortest paths with multi-modal transportation networks, they did not consider transfer problems in the optimal solution level. In particular, dynamic programming method was not dealt in multi-objective shortest path problems in multi-modal transportation networks. In this study, we propose a multi-objective shortest path algorithm including dynamic programming in order to find optimal solution in multi-modal transportation networks. That algorithm is based on two-objective node-based label correcting algorithm proposed by Skriver and Andersen in 2000 and transfer can be reflected without network expansion in this paper. In addition, we use non-dominated paths and tree sets as labels in order to improve effectiveness of searching non-dominated paths. We also classifies path finding attributes into transfer and link travel attribute in limited transit networks. Lastly, the calculation process of proposed algorithm is checked by computer programming in a small-scaled multi-modal transportation network.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.101-104
• /
• 2000

Nowadays, the issue of congestion control in high-speed communication networks becomes critical in view of the bandwidth-delay products for efficient data flow. In particular, the fact that the congestion is often accompanied by the data flow from the high-speed link to low-speed link is important with respect to the stability of closed-loop congestion control. The Virtual-Connection Network (VCN) in Gigabit Ethernet networks is a packet-switching based network capable of implementing cell- based connection, link-by-link flow-controlled connection, and single- or multi-destination virtual connections. VCN described herein differ from the virtual channel in ATM literature in that VCN have link-by-link flow control and can be of multi-destination. VCNs support both connection-oriented and connectionless data link layer traffic. Therefore, the worst collision scenario in Ethernet CSMA/CD with virtual collision brings about end-to-end delay. Gigabit Ethernet networks based on CSMA/CD results in non-deterministic behavior because its media access rules are based on random probability. Hence, it is difficult to obtain any sound mathematical formulation for congestion control without employing random processes or fluid-flow models. In this paper, an analytical method for the design of a congestion control scheme is proposed based on Smith＇s principle to overcome instability accompanied with the increase of end-to-end delays as well as to avoid cell losses. To this end, mathematical analysis is provided such that the proposed control scheme guarantees the performance improvement with respect to bandwidth and latency for selected network links with different propagation delays. In addition, guaranteed bandwidth is to be implemented by allowing individual stations to burst several frames at a time without intervening round-trip idle time.

• Proceedings of the KIPE Conference
• /
• 2001.10a
• /
• pp.529-533
• /
• 2001

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2010.05a
• /
• pp.541-542
• /
• 2010

• Journal of Institute of Control, Robotics and Systems
• /
• v.19 no.10
• /
• pp.915-920
• /
• 2013

Payload capacity and transition ability are essential for climbing robots to apply the robots to various applications such as inspection and exploration. This paper presents a new climbing robotic platform with multi-link structure of track-wheel modules to enhance payload capacity and transition ability, and its tracking controller design and experimental results. The compliances between track-wheel modules achieve stable internal and external transitions while the large adhesion area of the track-wheel module enhances the payload capacity of the robot. Kinematic model-based tracking controller is designed and implemented for autonomous internal transition, and the gains of the controller are optimized by experimental design. Experiments on the automatic internal transitions are performed and the results guarantee autonomous internal transition with little tracking error.

• Journal of information and communication convergence engineering
• /
• v.11 no.2
• /
• pp.69-81
• /
• 2013

Maintaining connectivity is essential in multi-hop wireless networks since the network topology cannot be pre-determined due to mobility and environmental effects. To maintain the connectivity, a critical point in the network topology should be identified where the critical point is the link or node that partitions the network when it fails. In this paper, we propose a new critical point identification algorithm and also present numerical results that compare the critical points of the network and H-hop sub-network illustrating how effectively sub-network information can detect the network-wide critical points. Then, we propose two localized topological control resilient schemes that can be applied to both global and local H-hop sub-network critical points to improve the network connectivity and the network resilience. Numerical studies to evaluate the proposed schemes under node and link failure network conditions show that our proposed resilient schemes increase the probability of the network being connected in variety of link and node failure conditions.

• ETRI Journal
• /
• v.24 no.3
• /
• pp.251-254
• /
• 2002

We developed a method for optimal superframe design in the multi-frequency time division multiple access (MF-TDMA) return-link of a satellite multimedia interactive network called a digital video broadcasting return channel over satellite (DVB-RCS) sub-network. To find the optimal superframe pattern with the maximum data throughput, we formulated the design problem as a non-linear combinatorial optimization problem. We also devised the proposed simple method so that it would have field applicability for improving radio resource utilization in the MF-TDMA return link.