• 한국통신학회논문지
• /
• 제25권10A호
• /
• pp.1590-1597
• /
• 2000

This paper describes a CMOS data recovery circuit using oversampling technique. Digital oversampling is done using a delay locked loop circuit locked to multiple clock periods. The delay locked loop circuit generates the vernier delay resolution less than the gate delay of the delay chain. The transition and non-transition counting algorithm for 4x oversampling was implemented for data recovery and verified through FPGA. The chip has been fabricated with 0.6um CMOS technology and measured results are presented.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1996년도 한국자동제어학술회의논문집(국내학술편); 포항공과대학교, 포항; 24-26 Oct. 1996
• /
• pp.1201-1204
• /
• 1996

The previous results on LTR methods for time delay systems need the solution of the operator-type Riccati equation. In addition, it can be difficult to make the target loop shape representing the design specification. This paper proposes a new LTR method for input-delayed systems using well-established LTR method for non-delay systems. For doing this, a time delay margin is derived and the time delay of the input-delayed systems is assumed less than equal to the time delay margin. A simple example is presented for illustrations.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권4호
• /
• pp.1006-1025
• /
• 2012

Improving the quality of service in IP networks is a major challenge for real-time voice communications. In particular, packet arrival-delay variation, so-called "jitter," is one of the main factors that degrade the quality of voice in mobile devices with the voice-over Internet protocol (VoIP). To resolve this issue, a receiver-based enhanced timing recovery algorithm combined with active jitter estimation is proposed. The proposed algorithm copes with the effect of transmission jitter by expanding or compressing each packet according to the predicted network delay and variations. Additionally, the active network jitter estimation incorporates rapid detection of delay spikes and reacts to changes in network conditions. Extensive simulations have shown that the proposed algorithm delivers high voice quality by pursuing an optimal trade-off between average buffering delay and packet loss rate.

• 대한의용생체공학회:의공학회지
• /
• 제29권1호
• /
• pp.8-16
• /
• 2008

The aim of this study was to evaluate the motor recovery in 4 chronic hemiparetic patients with Fugl-Meyer (FM) and EMG characteristics before and after the training program. The training was performed at 1hr/day, 5days/week during 6 weeks in 4 chronic stroke patients. Electromyographic activities of the affected hand were recorded during isometric wrist flexion/ extension movements. In all patients, FM was significantly improved after the 6-week training. Onset/offset delay of muscle contraction significantly decreased in the affected wrist after the training. The co-contraction ratio of flexor/extensor muscles decreased significantly. Also, onset/offset delay of muscle contraction and co-contraction ratio correlates significantly with upper limb motor impairment and motor recovery. This EMG technique allows an objective evaluation of changes in muscle activity in post-stroke patients, providing easily measurable, quantitative indices of muscle characteristics.

• 대한전자공학회논문지
• /
• 제25권6호
• /
• pp.629-636
• /
• 1988

The reduction of recovery time for delay, in the train movements, is generally realized through train operations in the shortest running time and it leads to maximum energy consumption. At the region of this shortest running time, the amount of energy consumption is sharply reduced according to the running time. So the effect for the energy savings can be largely obtained by furnishing a little spare time on train operations. In this paper, it has been modelized the delay and it's enlargement phenomena and formualted the relief patterns in order to restore the delay by restraint and relief of precedent traints. Also it has been proved the number of relief trains for minimum energy consumption exists and then represented one example of relief patterns.

• 한국정보과학회논문지:정보통신
• /
• 제31권2호
• /
• pp.233-241
• /
• 2004

본 논문에서는 MPLS(Multiprotocol Label Switching) 망에서 패킷 손실 없이 장애를 복구하는 기존의 fast rerouting 기법 적용 시 ingress 노드 버퍼에서 발생하는 누적 지연 문제를 해결하는 방안을 제안한다. 제안된 기법은 사용자 트래픽을 복구하기 위해서 사전에 설정된 대체 LSP(Label Switched Path)와 각 노드에 설치된 버퍼를 사용한다. Ingress 노드에서 발생하는 버퍼 지연 문제를 해결하기 위해서 본 논문에서는 두 가지 해결방안을 제안하였다. 첫 번째 방안은 대체 LSP가 보호되는 working LSP보다 일정기간동안 큰 대역폭을 가지도록 제어하는 것이다. 장애가 복구된 후, 대체 LSP에 설정된 대역폭은 working LSP와 동일하도록 재조정된다. 두 번째 방안은 세그먼트 기반의 장애복구 기법을 적용하여 보호되는 working LSP의 길이를 줄이는 것이다. 본 논문에서 제안한 방안들은 장애 복구 후 ingress 노드에서 버퍼 지연 문제가 발생하지 않으며, ingress 노드에서 필요로 하는 버퍼의 크기도 기존 방안보다 작다는 장점을 가진다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권11호
• /
• pp.5200-5222
• /
• 2017

The separation of control plane and data plane in Software Defined Network (SDN) makes it flexible to control the network behavior, while also causes some inconveniences to the link failure recovery due to the delay between fail point and the controller. To avoid delay and packet loss, pre-defined backup paths are used to reroute the disrupted flows when failure occurs. However, it may introduce large overhead to build and maintain these backup paths and is hard to dynamically construct backup paths according to the network status so as to avoid congestion during rerouting process. In order to realize congestion aware fast link failure recovery, this paper proposes a novel method which installs multi backup paths for every link via source routing and per-hop-tags and spread flows into different paths at fail point to avoid congestion. We carry out experiments and simulations to evaluate the performance of the method and the results demonstrate that our method can achieve congestion aware fast link failure recovery in SDN with a very low overhead.

• 전기학회논문지
• /
• 제61권2호
• /
• pp.324-328
• /
• 2012

A recovered jitter of CDR(Clock and Data Recovery) Circuit based on Dual-loop DLL(Delay Locked Loop) for data recovery in high speed serial data communication is changed by depending on the input data and reference clock frequency. In this paper, 2-step DPC which has constant jitter performance for wide-range input frequency is proposed. The designed prototype 2-step CDR using proposed 2-step DPC has operation frequency between 200Mbps and 4Gbps. Average delay step of 2-step DPC is 10ps. Designed CDR circuit was tested with 0.18um CMOS process.

• 한국항행학회논문지
• /
• 제7권2호
• /
• pp.141-148
• /
• 2003

본 논문에서는 미상 디지털 통신 신호의 심볼율을 검출하기 위한 기술들을 소개하고 그 성능을 비교해 본다. 심볼율은 delay and multiplier, square law 또는 Hilbert 변환을 이용한 방법 등의 회로를 통과한 신호의 전력스펙트럼 밀도에서 검출해 낼 수 있다. 이러한 회로들을 통과한 신호를 이산 푸리에 변환(discrete Fourier Transform) 한 결과에서 많은 스펙트럼 라인과 복수개의 피크(peak)가 검출되고 그 중 첫 번째 피크가 심볼율을 나타내는 주파수에 위치하게 된다. 만약 해당 심볼율이 아닌 다른 주파수상의 스펙트럼 라인의 값이 첫 번째 피크보다 크다면 심볼율은 잘못 검출될 것이다. 그러므로 첫 번째 피크의 값과 가장 큰 주변 스펙트럼 라인의 값의 비를 이용하여 심볼율 검출기의 성능을 비교하였다. MPSK 변조 방식에서는 -20dB 이하의 Es/N0에서는 delay and multiplier가 가장 우수한 성능을 보였고 -20dB 이상의 Es/N0에서는 Hilbert 변환 방식이 더 좋은 성능을 나타내었다. 또한 QAM 변조 방식에서 delay and multiplier 회로는 낮은 Es/N0에서는 심볼율을 검출할 수 없으며 square law 방식은 MPSK 변조 방식에서 보다 우수한 성능을 나타내었다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제2권2호
• /
• pp.82-102
• /
• 2008

Packet losses tend to occur during short error bursts separated by long periods of relatively error-free transmission. There is also a significant spatial correlation in loss among the receiver nodes in a multicast session. To recover packet transmission errors at the transport layer, tree-based protocols construct a logical tree for error recovery before data transmission is started. The current tree construction scheme does not scale well because it overloads the sender node. We propose a scalable recovery tree construction scheme considering these properties. Unlike the existing tree construction schemes, our scheme distributes some tasks normally handled by the sender node to specific nodes acting as repair node distributors. It also allows receiver nodes to adaptively re-select their repair node when they experience unacceptable error recovery delay. Simulation results show that our scheme constructs the logical tree with reduced message and time overhead. Our analysis also indicates that it provides fast error recovery, since it can reduce the number of additional retransmissions from its upstream repair nodes or sender node.