• Journal of the Korean Institute of Electrical and Electronic Material Engineers
• /
• v.13 no.4
• /
• pp.273-279
• /
• 2000

Electrical repair method which has replaced laser repair method can replace defective cell by redundancy’s in the redundancy scheme of conventional high density memory. This electrical repair circuit consists of the antifuse program/read/latch circuits, a clock generator a negative voltage generator a power-up pulse circuit a special address mux and etc. The measured program voltage of made antifuses was 7.2~7.5V and the resistance of programmed antifuses was below 500 Ω. The period of clock generator was about 30 ns. The output voltage of a negative voltage generator was about 4.3 V and the current capacity was maximum 825 $mutextrm{A}$. An antifuse was programmed using by the electric potential difference between supply-voltage (3.3 V) and output voltage generator. The output pulse width of a power-up pulse circuit was 30 ns ~ 1$mutextrm{s}$ with the variation of power-up time. The programmed antifuse resistance required below 44 ㏀ from the simulation of antifuse program/read/latch circuit. Therefore the electrical repair circuit behaved safely and the yield of high densitymemory will be increased by using the circuit.

• Journal of Institute of Control, Robotics and Systems
• /
• v.6 no.7
• /
• pp.568-577
• /
• 2000

In this paper for an object grasped by a robot hand to work in stiffness control domain we first investigate the number of fingers for successful stiffness modulation in the object operational space. Next we propose a new compliance control method for robot hands which consist of two steps. RIFDS(Resolved Inter-Finger Decoupling Solver) is to decompose the desired compliance characteristic specified in the op-erational space into the compliance characteristic in the fingertip space without inter-finger coupling and RIJDS(Resolved Inter-Joint Decoupling Solver) is to decompose the fingertip space without inter-finger coupling and RIJDS(Resolved inter-Joint Decoupling Solver) is to decompose the compliance characteristic in the finger-tip space into the compliance characteristic given in the joint space without inter-joint coupling. Based on the analysis results the finger structure should be biominetic in the sense that either kniematic redundancy or force redundancy are required to implement the proposed compliance control scheme, Five-bar fingered robot hands are used as an illustrative example to implement the proposed compliance control method. To show the effectiveness of the proposed compliance control method simulations are performed for two-fingered and three-fingered robot hands.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.05a
• /
• pp.503-506
• /
• 2010

In this paper, we apply the system in VMEbus to increase the stability and viability to implement a redundant network protocol. Typically, methods for increasing the viability of the system applied by the redundancy scheme between the two processes by configuring the network in between the two is to implement redundancy. However, the physical network in the process of the failure or when the loss function may not perform properly. These issues are complementary processes as a way to ensure stability between the VMEbus communication protocol is presented through a redundant network. In this paper, a direct implementation of the protocol and experimental results confirm the validity of these measures is to.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.7B
• /
• pp.745-759
• /
• 2011

In this paper, we propose the global handover mechanism that is able to provide the unlimited range of next-generation multimedia mobile services in an integrated environment. This mechanism consists of a multicast source based forwarding scheme and a global session management scheme. Global session management scheme provides LMA session information management, global mobility and route optimization. Multicast source based forwarding scheme delivers data between previously attached LMA and newly attached LMA without packet loss. In addition, this scheme removes the redundancy of buffered data. We present a performance evaluation and features analysis by the simulations using the ns-2. Global session management scheme has a less handover latency, propagation delay and signaling cost than the conventional methods. Multicast source based forwarding scheme can deliver buffer data without loss and it has less buffer size than conventional method.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.9
• /
• pp.26-37
• /
• 2016

The core technologies of the current transport network are OAM and protection switching to meet the sub-50ms protection switching time via a path redundancy when a link or node failure occurs. The transport networks owned by public network operators, central/local governments, and major enterprises are individually configured and managed with service resiliency in each own protected sub-network. When such networks are cascaded, it is also important to provide a node resiliency between two protected sub-networks. However, the linear protection switching in packet transport networks, such as MPLS-TP and Carrier Ethernet, does not define a solution of dual node interconnection. Although Ethernet ring protection switching covers the dual node interconnection scheme, a large amount of duplicated data frames may be flooded when a failure occurs on an adjacent (sub) ring. In this paper, we suggest a dual node interconnection scheme with linear protection switching technology in multiple protected sub-networks. And we investigate how various protected sub-network combinations with a proposed linear or ring protection process impact the service resiliency of multiple protected sub-networks through extensive experiments on link and interconnected node failures.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.10B
• /
• pp.1912-1920
• /
• 1999

In this paper, we propose a layered video coding scheme which can generate multi-layered bitstream for heterogeneous environments. A new motion prediction structure with temporal hierarchy of frames is developed to afford temporal resolution scalability and the wavelet decomposition is adopted to offer spatial acalability. The proposed scheme can have a higher compression ratio than replenishment schemes by using motion estimation and compensation which can further reduce the temporal redundancy, and it effectively works with dynamic adaption or errors using dispersive intra-subband update (DISU). Moreover, data rate scalability can be attained by employing embeded zerotree wavelet (EZW) technique which can produce embeded bitstream. Therefore, the proposed scheme is expected to be effectively used in heterogeneous environments such as the Internet, ATM, and mobile networks where interoperability are required.

• Journal of the Institute of Electronics Engineers of Korea TE
• /
• v.42 no.1
• /
• pp.41-46
• /
• 2005

A new multiple description selective coding is proposed to overcome noisy channels. Our algorithm adopts an embedded coding scheme, in which subband coefficients are encoded one bit plane at a time using a non-adaptive arithmetic encoder. According to the importance ratio for each region, we code interest regions with more passes than background in order to reconstruct interest regions with higher quality. To overcome channel errors, we adopt multiple description scheme which adds controlled amounts of redundancy to the original data during the compression process. Proposed algorithm achieves better qualify compared with other algorithms especially in the circumstances where very low bit rate coding is required and some regions are more important than other regions.

• Journal of KIISE:Computer Systems and Theory
• /
• v.37 no.3
• /
• pp.161-171
• /
• 2010

As embedded systems adopt monolithic kernels, NAND flash memory is used for swap space of virtual memory systems. While flash memory has the advantages of low-power consumption, shock-resistance and non-volatility, it requires garbage collections due to its erase-before-write characteristic. The efficiency of garbage collection scheme largely affects the performance of flash memory. This paper proposes a novel garbage collection technique which exploits data redundancy between the main memory and flash memory in flash memory-based virtual memory systems. The proposed scheme takes the locality of data into consideration to minimize the garbage collection overhead. Experimental results demonstrate that the proposed garbage collection scheme improves performance by 37% on average compared to previous schemes.

• ETRI Journal
• /
• v.32 no.4
• /
• pp.493-502
• /
• 2010

The operation time of an encoder is one of the critical implementation issues for satisfying the timing requirements of Long Term Evolution (LTE) systems because the encoder is based on binary operations. In this paper, we propose a design and implementation of a latency efficient encoder for LTE systems. By virtue of 8-bit parallel processing of the cyclic redundancy checking attachment, code block (CB) segmentation, and a parallel processor, we are able to construct engines for turbo codings and rate matchings of each CB in a parallel fashion. Experimental results illustrate that although the total area and clock period of the proposed scheme are 19% and 6% larger than those of a conventional method based on a serial scheme, respectively, our parallel structure decreases the latency by about 32% to 65% compared with a serial structure. In particular, our approach is more latency efficient when the encoder processes a number of CBs. In addition, we apply the proposed scheme to a real system based on LTE, so that the timing requirement for ACK/NACK transmission is met by employing the encoder based on the parallel structure.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.4B
• /
• pp.170-177
• /
• 2005

Due to the redundant rebroadcast packets, network-wide broadcasting is a costly operation in wireless mobile ad hoc networks. To reduce this redundancy, most of previous approaches implicitly or explicitly require periodic refreshing of neighborhood information which continuously imposes additional broadcast overheads. In this paper, we propose a practical broadcast pruning scheme based on the local prediction of a remained coverage area. As the proposed scheme uses only information available in the on-going broadcast process, it can minimize the overheads prevalent in previous approaches.