• Journal of Communications and Networks
• /
• v.9 no.2
• /
• pp.112-117
• /
• 2007

In this paper, we focus on the total transmission power minimization problem for downlink beamforming multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) systems while ensuring each user's QoS requirement. Although the linear integer programming (LIP) solution we formulate provides the performance upper bound of the margin adaptive (MA) optimization problem, it is hard to be implemented in practice due to its high computational complexity. By regarding each user's equivalent channel gain as approximate independent values and using iterative descent method, we present a heuristic MA resource allocation algorithm. Simulation results show that the proposed algorithm efficiently converges to the local optimum, which is very close to the performance of the optimal LIP solution. Compared with existing space division multiple access (SDMA) OFDM systems with or without adaptive resource allocation, the proposed algorithm achieves significant performance improvement by exploiting the frequency diversity and multi-user diversity in downlink multiple-input single-output (MISO) OFDM systems.

• Journal of KIISE:Information Networking
• /
• v.31 no.1
• /
• pp.37-52
• /
• 2004

Broadcast has been often used to disseminate the frequently requested data efficiently to a large volume of mobile units over a single or multiple channels. Since the mobile units have limited battery power, the minimization of the access time for the broadcast data is an important problem. There have been many research efforts that focus on the improvement if the broadcast techniques by providing indexes on the broadcast data. In this paper, we studied an efficient index allocation method for the broadcast data over multiple physical channels, which cannot be coalesced into a single high bandwidth channel. Previously proposed index allocation techniques either require the equal size of index and data or have a performance degradation problem when the number of given physical channels is not enough. These two problems will result in the increased average access time for the broadcast data. To cope with these problems, we propose an efficient tree- structured index allocation method for the broadcast data with different access frequencies over multiple physical channels. Our method minimizes the average access time for the broadcast data by broadcasting the hot data and their indexes more often than the less hot data and their indexes. We present an in-0e0th experimental and theoretical analysis of our method by comparing it with other similar techniques. Our performance analysis shows that it significantly decrease the average access time for the broadcast data over existing methods.

• Journal of Broadcast Engineering
• /
• v.15 no.3
• /
• pp.407-413
• /
• 2010

In DCA (Dynamic Channel Allocation) scheme of uplink cellular system appling a frequency reuse factor of one, when a new call requests a channel, the new call will be blocked if its SINR (Carrier to Noise and Interference Ratio) is less than the required SINR or there is no available channel. The additional channel allocation for the blocked new call can be performed with channel borrowing in the adjacent cells. The channel borrowing causes the CCI (Co-Channel Interference), thus the SINR of the existing calls is deteriorated and the channel reallocation for the existing calls is required. As a result, the channel borrowing leads to a complex calculation so that it is a NP-hard problem. Therefore, to overcome the problem, we propose a novel Group Search-based DCA scheme which decreases the number of the blocked new calls and then reduces the number of the channel reallocation by the channel borrowing for the blocked new calls. The proposed scheme searches the all channels in a group of the adjacent cells and home cell at the same time in order to minimizes the number of the blocked new calls. The simulation results show that proposed Group Search-based DCA scheme provides better new call blocking probability and system throughput than the existing Single Search-based DCA scheme which searches only the channels in home cell.

• Speech Sciences
• /
• v.14 no.4
• /
• pp.157-167
• /
• 2007

In this paper, we implemented a single-chip speech recognizer using the TMS320C2000 DSPs. For this implementation, we had developed very small-sized speaker-dependent recognition engine based on dynamic time warping, which is especially suited for embedded systems where the system resources are severely limited. We carried out some optimizations including speed optimization by programming time-critical functions in assembly language, and code size optimization and effective memory allocation. For the TMS320F2801 DSP which has 12Kbyte SRAM and 32Kbyte flash ROM, the recognizer developed can recognize 10 commands. For the TMS320F2808 DSP which has 36Kbyte SRAM and 128Kbyte flash ROM, it has additional capability of outputting the speech sound corresponding to the recognition result. The speech sounds for response, which are captured when the user trains commands, are encoded using ADPCM and saved on flash ROM. The single-chip recognizer needs few parts except for a DSP itself and an OP amp for amplifying microphone output and anti-aliasing. Therefore, this recognizer may play a similar role to dedicated speech recognition chips.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.10
• /
• pp.4823-4843
• /
• 2017

In this paper, an improved utility-based cross-layer dynamic subcarrier allocation (DSA) algorithm is proposed for single carrier frequency division multiple access (SC-FDMA) system, which adopts adaptive service rate control (ASRC) to eliminate the service rate waste and improve the spectral efficiency in heterogeneous network including non-real-time traffic and real-time traffic. In this algorithm, furthermore, a first in first out (FIFO) queuing model with finite space is established on the cross-layer scheduling framework. Simulation results indicate that by taking the service rate constraint as the necessary condition for optimality, the ASRC algorithm can effectively eliminate the service rate waste without compromising the scheduling performance. Moreover, the ASRC algorithm is able to further improve the quality of service (QoS) performance and transmission throughput by contributing an attractive performance trade-off between real-time and non-real-time applications.

• Journal of the Korean housing association
• /
• v.25 no.5
• /
• pp.103-112
• /
• 2014

This study explores the typology of the urban detached houses in the new housing quarters that were created in the process of Seoul's urbanization in the aftermath of the Korean War. It analyzes and compares the urban tissue and space allocation set when the new urban residential areas were organized according to different methods of production. Based on the comparative analysis of housing built in the same time of 1960s, this study aims to deduce why a specific urban detached housing type was selected as an influential housing prototype and how this spread in later generations. Case study sites selected for this study include: the new Urban Hanok towns of Yongdu-dong, filled with mass Urban Hanoks built by housing developers; the single-family detached housing district of Myunmok-dong, filled with individual dwellings built by private builders; and the housing complex of detached houses in Suyu-dong, developed by government-sponsorship during the early 1960s. Each case examines the following: first, the difference in housing typology allocation according to urban tissue; second, the difference in spatial composition and arrangement within plots. As a result, it was found that differences in typology occur depending on which of the social, cultural, economic and technical factors was preferentially considered in forming urban tissue and allocating buildings in each residential area.

• Journal of Institute of Control, Robotics and Systems
• /
• v.3 no.1
• /
• pp.77-88
• /
• 1997

Fieldbus is the lowest level communication network in factory automation and process control systems. Performance of factory automation and process control systems is directly affected by the data delay induced by network traffic. Data generated from several distributed field devices can be largely divided into three categories: sporadic real-time, periodic real-time and non real-time data. Since these data share one fieldbus network medium, the limited bandwidth of a fieldbus network must be appropriately allocated to the sporadic real-time, periodic real-time and non real-time traffic. This paper introduces a new fieldbus design scheme which allocates the limited bandwidth of fieldbus network to several different kinds of traffic. The design scheme introduced in this study not only satisfies the performance requirements of application systems interconnected into the fieldbus but also fully utilizes the network resources. The design scheme introduced in this study can be applicable to cyclic service protocols operated under single-service discipline. The bandwidth allocation scheme introduced in this study is verified using a discrete-event/continuous-time simulation experiment.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.38 no.10
• /
• pp.24-33
• /
• 2001

Delay, delay variation and packet loss rate are principal QoS(Quality of Service) elements of packet communication. This paper proposes a new buffer allocation mechanism to improve the packet loss performance in such a situation that multiple logical buffers share a single physical memory buffer. In the proposed buffer allocation mechanism, the movement of dynamic threshold follows a curved track instead of a straight line which is used in the DT(dynamic threshold) mechanism. In order evaluate the effectiveness of the proposed mechanism, it is compared with the existing previously proposed mechanisms in several aspects including NC(no control), ST(Static Threshold) and DT mechanisms.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.4
• /
• pp.1026-1040
• /
• 2012

For a single relay channel, we compare the capacity of two different amplify-and-forward (AF) protocols, which are orthogonal AF (OAF) and non-orthogonal AF (NAF). The NAF protocol has been proposed to overcome a significant loss of performance of OAF in the high spectral efficiency region, and it was also theoretically proved that NAF performs better than OAF in terms of the diversity-multiplexing tradeoff. However, existing results have been evaluated at the asymptotically high signal to noise ratio (SNR), thus the power allocation problem between the source and the relay was neglected. We examine which protocol has better performance in a practical system operating at a finite SNR. We also study where a relay should be located if we consider the power allocation problem. A notable conclusion is that the capacity performance depends on both SNR and power allocation ratio, which indicates OAF may perform better than NAF in a certain environment.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2001.10a
• /
• pp.57-60
• /
• 2001

In this paper, I will describe the trends of multicast address allocation mechanism. IP Multicast efficiently supports this type of transmission by enabling sources to send a single copy of a message to multiple recipients who explicitly want to receive the information. Generally, MAAs server or MADCAP servers are used to allocate multicast addresses. As the need of home networking and autoconfiguring network mechanism has been increased, not only automatic host IP configuration but also automatic multicast address generation mechanism was demanded. in this paper, I will explain the automatic multicast address mechanism in a host. management techniques and the trends of multicast address generation and allocation mechanism that is bong now discussed In IETF.