• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.5C
• /
• pp.527-539
• /
• 2009

In this paper, we propose an asynchonous ICI (Inter-Cell Interference) mitigation techniques for 3GPP LTE MIMO-OFDMA down-link receiver. An increasing in symbol timing misalignments may occur relative to sychronous network as the result of BS (Base Station) timing differences. Such symbol synchronization errors that exceed the guard interval or the cyclic prefix duration may result in MAI (Multiple Access Interference) for other carriers. In particular, at the cell boundary, this MAI becomes a critical factor, leading to degraded channel throughput and severe asynchronous ICI. Hence, many researchers have investigated the interference mitigation method in the presence of asynchronous ICI and it appears that the knowledge of the SCM (Spatial Covariance Matrix) of the asynchronous ICI plus background noise is an important issue. Generally, it is assumed that the SCM estimated by using training symbols. However, it is difficult to measure the interference statistics for a long time and training symbol is also not appropriate for MIMO-OFDMA system such as LTE. Therefore, a noise reduction method is required to improve the estimation accuracy. Although the conventional time-domain low-pass type weighting method can be effective for noise reduction, it causes significant estimation error due to the spectral leakage in practical OFDM system. Therefore, we propose a time-domain sinc type weighing method which can not only reduce the noise effectively minimizing estimation error caused by the spectral leakage but also implement frequency-domain moving average filter easily. By using computer simulation, we show that the proposed method can provide up to 3dB SIR gain compared with the conventional method.

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

Video-On-Demand system provides electronic video rental services from remote video servers on a broadband communication networks. Most of proposed VOD systems are typically designed for one-to-one conncetion between a user and video server. Therefore, video server stream services to customers individually by allocating a dedicated transmission channel and a set of video server resources for each customer. However, it is inefficiency and wxpensive way when server support multiple users who access the same video stream with a dedicated video channel. Therefore, to achieve cost-effectiveness, batching have studied method that uses multicast communication to simultaneously service all users requesting the same video with a single video with a single video stream. However, the application of the multicast communication by batching detract from the VCR-like function and on-demand nature of the system. In this paepr, we propose a scheme that can support an interactive VCR for all user requesting the same video stream with batching. To reduce a server I/O and network bandwidth requirement, dynamic buffer is allocated to access node which has variable playout poit. Consequently, it makes possible interactive VCR operation as if customer uses true VOD system. Also, this scheme can just deliver a multicast stream without delay after an initial request or VCR action occurred. The policy can guarantee acceptable services to number of users at minimum cost.

• Journal of KIISE:Information Networking
• /
• v.37 no.5
• /
• pp.374-385
• /
• 2010

Wireless mesh networks can be deployed for various networks from home networking to last-mile broadband Internet access. Wireless mesh networks are composed of mesh routers and mesh clients. In these networks, static nodes form a multi-hop backbone of a large wireless access network that provides connectivity to end-users' mobile terminals. The network nodes cooperate with each other to relay data traffic to its destinations. In order to increase connectivity and better performance, researchers are getting interested in multi-channel and multi-interface wireless mesh networks. In these networks, non-overlapping multiple frequency channels are used simultaneously to increase the aggregate bandwidth available to end-users. Recently, researches have focused on finding suitable channel assignments for wireless network interfaces, equiped in a mesh node, together with efficient routing to improve overall system throughput in wireless mesh networks. This goal can be achieved by minimize channel interference. Less interference among using channels in a network guarantees more aggregated channel capacity and better connectivity of the networks. In this thesis, we propose interference aware channel assignment and routing algorithms for multi-channel multi-hop wireless mesh networks. We propose Channel Assignment and Routing algorithms using Traffic Profiles(CARTP) and Routing algorithms allowing detour routing(CARTP+2). Finally, we evaluate the performance of proposed algorithms in comparison to results from previous methods using ns-2 simulations. The simulation results show that our proposed algorithms can enhance the overall network performance in wireless mesh networks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.4B
• /
• pp.593-603
• /
• 2000

In this paper, a dynamic route control scheme to increase speed of data communication over public network is presented. And a new structure of gateway which is suitable for the public network environments is proposed and analyzed. For dynamic allocation of transmission routing resources of the gateway and improvement of call processing ratio of the system, virtual queue is used. As results, route utilization ratio of the proposed scheme can be improved up to 60% as compared to the conventional fixed route control scheme. For the case of limited number of routes, it provides high speed data communication while maintaining delay time as low as possible. In addition, as the allocation period at call access node can be varied with the traffic in the proposed scheme, various traffics can be applied easily. Thus, it can be expected that the presented dynamic route control gateway may be suitable for application in high speed data communication over public network.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.7A
• /
• pp.700-709
• /
• 2007

The heterogeneous wireless access networks has been envisioned to characterize the future wireless networks. In such environments, TCP(Transmission Control Protocol) has to experience poor end-to-end performance because bandwidth and link delay change suddenly when a mobile node moves over different types of wireless networks, which is called vertical handoff. In this paper, we propose a new TCP which maintains each set of congestion control variables, which we call TCP context, for each type of wireless network. The proposed TCP can switch the TCP context against vertical handoff in order to adjust quickly to a newly arrived network. In simulations, the proposed TCP has higher throughput than TCP SACK(Selective Acknowledgment Options) due to its great features to vertical handoff situations.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.8
• /
• pp.34-42
• /
• 2009

Mobile communication traffic is changing from voice to data/internet, e.g. wireless internet access, SMS/MMS. more and more. Therefore many data services are coming out over 3G, Mobile WiMAX(WIBRO), LTE etc. Wireless internet market is growing and MIPv6 is more important and many protocols being studied and developed from MIPv6 to Fast MIPv6, Hierachical MIPv6, Proxy MIPv6, etc. The significant factor over MIPv6 is Hand-over latency and Packet-loss PMIPv6 is efficient for reducing mobility related messages and hand-over latency, but it considers single LMA domain. If mobile node is moving inter-LMAs, hand-over delay time affects the real-time communications. To overcome this hand-over delay, we propose present and new enhanced schemes and analize the performance and show the results.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.6 no.4
• /
• pp.59-70
• /
• 2003

Spatial data base system provides many query types and most of them are required frequent disk I/O and much CPU time. k-NN search is to find k-th closest object from the query point and up to now, several k-NN search methods have been proposed. Among these, MINMAX distance method has an aim not to access unnecessary node by adapting pruning technique. But this method accesses more disks than necessary while pruning unnecessary nodes. In this paper, we propose new k-NN search algorithm based on density of object. With this method, we predict the radius to be expected to contain k-NN objects using density of data set and search those objects within this radius and then adjust radius if failed. Experimental results show that this method outperforms the previous MINMAX distance method. This algorithm visit less disks than MINMAX method by the factor of maximum 22% and average 7%.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.11
• /
• pp.723-729
• /
• 2014

In this paper, we derive the average repair bandwidth and/or read cost for arbitrary repairable linear code ensembles. The repair bandwidth and read cost are the required amount of data and access number of nodes to restore a failed node, respectively. Here, the repairable linear code ensemble is given by such parameters as the number k of data symbols, the number m of parity symbols, and their degree distributions. We further assume that the code is systematic, and no other constraint is assumed, except possibly that the exact repair could be done by the parity check-sum relation with fully connected n=k+m storages. This enables one to apply the result of this paper directly to any randomly constructed codes with the above parameters, such as linear fountain codes. The final expression of the average repair read cost shows that it is highly dependent on the degree distribution of parity symbols, and also the values n and k.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.9
• /
• pp.1734-1740
• /
• 2015

This paper introduces a generalized notion, referred to as joint locality, of the usual locality in distributed storage systems and proposes a code construction of binary locally repairable codes with joint locality ($r_1$=2, $r_2$=3 or 4). Joint locality is a set of numbers of nodes for repairing various failure patterns of nodes. The proposed scheme simplifies the code design problem utilizing complete multipartite graphs. Moreover, our construction can generate binary locally repairable codes achieving (2,t)-availability for any positive integer t. It means that each node can be repaired by t disjoint repair sets of cardinality 2. This property is useful for distributed storage systems since it permits parallel access to hot data.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.8 no.2
• /
• pp.128-133
• /
• 2008

Phase-change random access memory (PRAM) chip cell phase of amorphous state is rapidly changed to crystal state above 160 Celsius degree within several seconds during Infrared (IR) reflow. Thus, on-board programming method is considered for PRAM chip programming. We demonstrated the functional 512Mb PRAM with 90nm technology using several novel core circuits, such as metal-2 line based global row decoding scheme, PN-diode cells based BL discharge (BLDIS) scheme, and PMOS switch based column decoding scheme. The reverse-state standby current of each PRAM cell is near 10 pA range. The total leak current of 512Mb PRAM chip in standby mode on discharging state can be more than 5 mA. Thus in the proposed BLDIS control, all bitlines (BLs) are in floating state in standby mode, then in active mode, the activated BLs are discharged to low level in the early timing of the active period by the short pulse BLDIS control timing operation. In the conventional sense amplifier, the simultaneous switching activation timing operation invokes the large coupling noise between the VSAREF node and the inner amplification nodes of the sense amplifiers. The coupling noise at VSAREF degrades the sensing voltage margin of the conventional sense amplifier. The merit of the proposed sense amplifier is almost removing the coupling noise at VSAREF from sharing with other sense amplifiers.