• Vacuum Magazine
• /
• v.3 no.1
• /
• pp.16-21
• /
• 2016

FinFETs are able to be scaled down to 22 nm and beyond while suppressing effectively short channel effect, and have superior performance compared to 2-dimensional (2-D) MOSFETs. Bulk FinFETs are built on bulk Si wafers which have less defect density and lower cost than SOI(Silicon-On-Insulator) wafers. In contrast to SOI FinFETs, bulk FinFETs have no floating body effect and better heat transfer rate to the substrate while keeping nearly the same scalability. The bulk FinFET has been developed at 14 nm technology node, and applied in mass production of AP and CPU since 2015. In the development of the bulk FinFETs at 10 nm and beyond, self-heating effects (SHE) is becoming important. Accurate control of device geometry and threshold voltage between devices is also important. The random telegraph noise (RTN) would be problematic in scaled FinFET which has narrow fin width and small fin height.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1998.10a
• /
• pp.397-400
• /
• 1998

This paper has a dual purpose. First, we consider a relaxation algorithm which seems to be particularly suitable for multicasting routing problems. We show that the algorithm has polynomial complexity. Second, to measure the quality of solutions in comparison to the optimal solutions over a wide range of network sizes for which the computation of the optimal costs is too excessive, we also propose a random graph generation scheme in which an asymptotic lower bound on the expected optimal cost can be computed as a function of network node size.

• Journal of information and communication convergence engineering
• /
• v.10 no.4
• /
• pp.384-389
• /
• 2012

In this paper, we examine the problems of the low energy adaptive clustering hierarchy (LEACH) protocol and present ideas for improvement by selecting the cluster head node. The main problem with LEACH lies in the random selection of cluster heads. There exists a probability that the formed cluster heads are unbalanced and may remain in one part of the network, which makes some part of the network unreachable. In this paper, we present a new version of the LEACH protocol called the improved LEACH (ILEACH) protocol, which a cluster head is selected based on its ratio between the current energy level and an initial energy level, and multiplies by the root square of its number of neighbor nodes. The simulation results show that the proposed ILEACH increases the energy efficiency and network lifetime.

• The Journal of Information Technology and Database
• /
• v.8 no.2
• /
• pp.103-114
• /
• 2001

In this paper, we propose an efficient index mechanism for real-time main memory database systems. Existing main memory index structures based on the tree can effectively support range searches. However, it doesn't guarantee the real-time characteristic because difference between the access time of a node and an average access time can be high. The index structures based on the hash have always a regular random access time on the simple searches and that speed is very fast. However they do not support range searches. To solve such problems, we propose a new index mechanism called Hyper Tree-Hash (Hyper-TH) that combines ECBH (Extendible Chained Bucket Hashing) and T＊-tree. ECBH can be dynamically extended and has a very fast access time. T＊-tree effectively supports the range searches. We show through our experiments that the proposed mechanism outperforms existing other index structures.

• ETRI Journal
• /
• v.29 no.4
• /
• pp.457-462
• /
• 2007

This work presents a low-voltage static random access memory (SRAM) technique based on a dual-boosted cell array. For each read/write cycle, the wordline and cell power node of selected SRAM cells are boosted into two different voltage levels. This technique enhances the read static noise margin to a sufficient level without an increase in cell size. It also improves the SRAM circuit speed due to an increase in the cell read-out current. A 0.18 ${\mu}m$ CMOS 256-kbit SRAM macro is fabricated with the proposed technique, which demonstrates 0.8 V operation with 50 MHz while consuming 65 ${\mu}W$/MHz. It also demonstrates an 87% bit error rate reduction while operating with a 43% higher clock frequency compared with that of conventional SRAM.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.9
• /
• pp.1998-2016
• /
• 2012

Reliable spectrum sensing algorithm is a fundamental component in cognitive radio. In this paper, a non-cooperative spectrum sensing algorithm which needs only one cognitive radio node named CORDIC (Coordinate Rotation Digital Computer) Jacobi based method is proposed. The algorithm computes the eigenvalues of the sampled covariance of received signal mainly by shift and additional operations, which is suitable for hardware implementation. Based the latest random matrix theory (RMT) about the distribution of the limiting maximum and minimum eigenvalue ratio, the relationship between the probability of false alarm and the decision threshold is derived. Simulations and discussions show the method is effective. Real captured digital television (DTV) signals and Universal Software Radio Peripheral (USRP) are also employed to evaluate the performance of the algorithm, which prove the proposed algorithm can be applied in practical spectrum sensing applications.

• Journal of Communications and Networks
• /
• v.17 no.5
• /
• pp.482-490
• /
• 2015

This article exploits spatial diversity for jamming to prevent wiretapping in the extreme case in which an eavesdropper is located near the source and a common jamming signal is unavailable. To address this challenge, the jamming signal is allowed to carry a random binary message. Then, it is proposed that the active intermediate node transmits this jamming signal and the decoding of this signal at both source and destination is physically secured as result of using the physical-layer security method. If the source and the destination securely and correctly decode this jamming message, the source transmits another message which is created from combining its information message and the decoded message using the network-coding method. Therefore, this method prevents the transmissions from being eavesdropped upon by the source-wiretapping.

• IE interfaces
• /
• v.9 no.3
• /
• pp.168-179
• /
• 1996

Automatic repeated recalling from individual computing equipments such as PC and workstations, to access ATM networks may result in call overload to networks. Call overload causes to waste network resources and fail to meet user call processing QoS requirements. We evaluate two call connection request methods: the back-off recall method(BRM) which makes recall with random waiting time after rejection, and the direct recall method(DRM) which repeats call connection request whenever call request is rejected. We evaluate their performances by simulation and it shows that as the total number of attached terminals to each access node increases, BRM performs better than DRM in terms of the call acceptance level and effective network bandwidth utilization.

• Journal of the Korea Safety Management & Science
• /
• v.8 no.3
• /
• pp.115-123
• /
• 2006

The main focus of this study is to investigate the performance of a clark-scarf type multi-echelon serial supply chain operating with a base-stock policy and to optimize the inventory levels in the supply chains so as to minimize the systemwide total inventory cost, comprising holding and backorder costs as all the nodes in the supply chain. The source of supply of raw materials to the most upstream node, namely supplier, is assumed to have an infinite raw material availability. Retailer faces random customer demand, which is assumed to be stationary and normally distributed. If the demand exceeds on-hand inventory, the excess demand is backlogged. Using the echelon stock and demand quantile concepts and an efficient simulation technique, we derive near optimal inventory policy. Additionally we discuss the derived results through the extensive experiments for different supply chain settings.

• ETRI Journal
• /
• v.36 no.4
• /
• pp.609-616
• /
• 2014

Even though many computational methods (recursive formulae) for blocking probabilities in finite-capacity M/D/1 queues have already been produced, these are forms of transforms or are limited to single-node queues. Using a distinctly different approach from the usual queueing theory, this study introduces explicit (transform-free) formulae for a blocking probability, a stationary probability, and mean sojourn time under either production or communication blocking policy. Additionally, the smallest buffer capacity subject to a given blocking probability can be determined numerically from these formulae. With proper selection of the overall offered load ${\rho}$, the approach described herein can be applicable to more general queues from a computational point of view if the explicit expressions of random vector $D_n$ are available.