• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04a
• /
• pp.931-933
• /
• 2004

In a SoC environment, asynchronous design techniques offer solutions for problems of synchronous design techniques. Asynchronous FIFOs have the advantages of easier interconnection methods and higher throughput than synchronous ones. Low latency and high throughput are two imp ortant standards in asynchronous FIFOs. We present low latency asynchronous FIFO in the paper, which optimizes GasP[6]. Pre-layout of HSPICE simulations of a 8-stage FIFO on 1-bit datapath using Anam's 0.25$\mu\textrm{m}$ technology indicates 17% lower latency than GasP.

• Bulletin of the Korean Chemical Society
• /
• v.30 no.12
• /
• pp.3085-3088
• /
• 2009

• Journal of the Society of Cosmetic Scientists of Korea
• /
• v.27 no.2
• /
• pp.15-30
• /
• 2001

최근 인간 유전체 사업(Human Genome Project)의 완성과 DNA Microarray, Proteomics, Bioinformatics 등의 초고속, 대용량 처리 바이오기술(High Throughput Biotechnology)의 발전과 함께 생명과학 분야의 연구는 획기적인 변화의 시기를 맞이하게 되었다. 이미 의약품 분야는 이러한 기술을 활용한 연구가 보편화 되어있고 선진 외국 회사들의 화장품연구 또한 이를 활용한 연구가 본격화 되고 있다. 화장품개발에 있어서도 이러한 기술들의 활용이 불가피하게 되었다. 여기서는 이러한 새로운 바이오기술들에 관해 간단히 알아보고 향후 이러한 기술들의 효과적인 화장품개발 관련연구 활용범위와 활용방법에 대하여 알아본다.

• Journal of information and communication convergence engineering
• /
• v.10 no.3
• /
• pp.253-257
• /
• 2012

This paper presents an efficient filtering system for a metastable state-based true random number generator. To output a result with high randomness, we use loop-storage for storing the value of metastability. During the metastable state, the output value is accumulated to the storage. When the non-metastable state arises, the stored metastable value will be used for output instead of the result of the non-metastable state. As a result, we can maintain high entropy together with the original throughput.

• 한국약용작물학회:학술대회논문집
• /
• 2012.05a
• /
• pp.151-152
• /
• 2012

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.11a
• /
• pp.1314-1315
• /
• 2008

Recent research work has unearthed that multi-radio multi-channel wireless mesh networks offer considerable capacity gains over single-radio wireless mesh networks. In this paper, we present a new routing metric for multi-radio multi-channel wireless mesh networks. The goal of the metric is to choose multiple link/node disjoint paths between a source and destination node that, when used concomitantly, impart high end-to-end throughput. The proposed metric selects high fidelity paths that will produce elevated throughput with maximum fault tolerance.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.8
• /
• pp.2607-2625
• /
• 2014

Previous studies on multiuser multiple-input multiple-output (MIMO) mostly assume a homogeneous signal-to-noise ratio (SNR), where each user has the same average SNR. However, real networks are more likely to feature heterogeneous SNRs (a random-valued average SNR). Motivated by this fact, we analyze a multiuser MIMO downlink with a zero-forcing (ZF) receiver in a heterogeneous SNR environment. A transmitter with Mantennas constructs M orthonormal beams and performs the SNR-based proportional fairness (S-PF) scheduling where data are transmitted to users each with the highest ratio of the SNR to the average SNR per beam. We develop a new analytical expression for the sum throughput of the multiuser MIMO system. Furthermore, simply modifying the expression provides the sum throughput for important special cases such as homogeneous SNR, max-rate scheduling, or high SNR. From the analysis, we obtain new insights (lemmas): i) S-PF scheduling maximizes the sum throughput in the homogeneous SNR and ii) under high SNR and a large number of users, S-PF scheduling yields the same multiuser diversity for both heterogeneous SNRs and homogeneous SNRs. Numerical simulation shows the interesting result that the sum throughput is not always proportional to M for a small number of users.

• ETRI Journal
• /
• v.29 no.2
• /
• pp.201-211
• /
• 2007

This paper focuses on the scheduling problem with the objective of maximizing system throughput, while guaranteeing long-term quality of service (QoS) constraints for non-realtime data users and short-term QoS constraints for realtime multimedia users in multiclass service high-speed uplink packet access (HSUPA) systems. After studying the feasible rate region for multiclass service HSUPA systems, we formulate this scheduling problem and propose a multi-constraints HSUPA opportunistic scheduling (MHOS) algorithm to solve this problem. The MHOS algorithm selects the optimal subset of users for transmission at each time slot to maximize system throughput, while guaranteeing the different constraints. The selection is made according to channel condition, feasible rate region, and user weights, which are adjusted by stochastic approximation algorithms to guarantee the different QoS constraints at different time scales. Simulation results show that the proposed MHOS algorithm guarantees QoS constraints, and achieves high system throughput.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.11S
• /
• pp.3260-3268
• /
• 1999

As the proliferation of multimedia traffic over High-speed Internet increases, ATM network will be vital to adopt as backbone network over various parts of Internet. In this paper, we investigate the performance of TCP/IP traffic flow over ABR and UBR of ATM service to study for the high throughput and good fairness by simulation technique. Although TCP is run in the transport layer, it is controlled by several methods, e.g, EPD, PPD, RED, EFCI, ER etc, in ATM layer when TCP uses the ABR/UBR service. Therefore, if one cell is discarded in ATM layer, a packet of TCp will be laost. And, also, along with the increasing of the number of VC among switches, the throughput and fairness will be degraded. In order to improve these degradations, we propose the effective parameter control operations of EFCI and ER on ABR service, and also suggest the buffer management methods on UBR service. Finally, through the simulation results, the improved throughput and fairness are shown.

• Proceedings of the KIEE Conference
• /
• 2006.10c
• /
• pp.467-469
• /
• 2006

In wireless network environments, as users' demands on high-speed data communications due to increase of multi-media services, the necessity of new high-speed WLAN technologies has appeared. Nowaday, IEEE is standardizing a new WLAN protocol caned as IEEE 802.11n. To effectively use wireless resources, IEEE 802.11n introduces MAC aggregation function which is similar to that in IEEE 802.11e. In case of transmitting several frames without MAC aggregation, the frames include individual frame header and trailer, and their corresponding acknowledgement frames can appear on wireless link. However, if they are aggregated into single MAC frame, we can reduce the number of used bits due to frame headers/trailers and also remove redundant acknowledgement frames. In this paper, we explain two different MAC frame aggregation methods for IEEE 802.11e and IEEE 802.11n and evaluate their throughput by simulations.