• Journal of Communications and Networks
• /
• v.7 no.2
• /
• pp.115-125
• /
• 2005

This paper discusses how to effectively design a next-generation wireless communication system that can possibly provide very high data-rate transmissions and versatile quality services. In order to accommodate the sophisticated user requirements and diversified user environments of the next-generation systems, it should be designed to take an efficient and flexible structure for multiple access and resource allocation. In addition, the design should be optimized for cost-effective usage of resources and for efficient operation in a multi-cell environment. As orthogonal frequency division multiple access (OFDMA) has turned out in recent researches to be one of the most promising multiple access techniques that can possibly meet all those requirements through efficient radio spectrum utilization, we take OFDMA as the basic framework in the next-generation wireless communications system design. So, in this paper, we focus on introducing an OFDMA-based downlink system design that employs the techniques of hybrid multiple access (HMA) and frequency group (FG) in conjunction with intra-frequency group averaging (IFGA). The HMA technique combines various multiple access schemes on the basis of OFDMA system, adopting the multiple access scheme that best fits to the given user condition in terms of mobility, service, and environment. The FG concept and IFGA technique help to reduce the feedback overhead of OFDMA system and the other-cell interference (OCI) problem by grouping the sub-carriers based on coherence band-widths and by harmonizing the channel condition and OCI of the grouped sub-carriers.

• Korean Management Science Review
• /
• v.16 no.1
• /
• pp.157-171
• /
• 1999

In a increasingly competitive marketplace, the manufacturing companies have no choice but looking for ways to improve productivity to sustain their competitiveness and survive in the industry. Recently cellular manufacturing has been under discussion as an option to be easily implemented without burdensome capital investment. The objective of cellular manufacturing is to realize many aspects of efficiencies associated with mass production in the less repetitive job-shop production systems. The very first step for cellular manufacturing is to group the sets of parts having similar processing requirements into part families, and the equipment needed to process a particular part family into machine cells. The underlying problem to determine the part and machine assignments to each manufacturing cell is called the cell formation. The purpose of this study is to develop a clustering algorithm based on the neural network approach which overcomes the drawbacks of ART1 algorithm for cell formation problems. In this paper, a generalized learning vector quantization(GLVQ) algorithm was devised in order to transform a 0/1 part-machine assignment matrix into the matrix with diagonal blocks in such a way to increase clustering performance. Furthermore, an assignment problem model and a rearrangement procedure has been embedded to increase efficiency. The performance of the proposed algorithm has been evaluated using data sets adopted by prior studies on cell formation. The proposed algorithm dominates almost all the cell formation reported so far, based on the grouping index($\alpha$ = 0.2). Among 27 cell formation problems investigated, the result by the proposed algorithm was superior in 11, equal 15, and inferior only in 1.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.4C
• /
• pp.341-348
• /
• 2009

In this paper, we propose a grouping technique for the SDD(Synchronous Digital Duplexing) based on OFDMA(Orthogonal Frequency Division Multiple Access). The SDD has advantages of increasing data efficiency and flexibility of resource since SDD can transmit uplink signals and downlink signals simultaneously by using mutual time information and mutual channel information, obtained during mutual ranging process. However, the SDD has a disadvantage of requiring additional CS to maintain orthogonality of OFDMA symbols when the sum of mutual time difference and mutual channel length between AP(access point) and SS(subscriber station) or among SSs are larger than CP length. In order to minimize the length of CS for the case of requiring additional CS in SDD, we proposes a grouping technique which controls transmit timing and receive timing of AP and SS in a cell by classifying them into groups. Performances of the proposed grouping technique are evaluated by computer simulation.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.24 no.6
• /
• pp.1080-1086
• /
• 1987

SLAGEN, a system for symbolic cell layout based on artificial intelligence approach, takes as input a transistor connection description of CMOS standard cells and environment information, and outputs a symbolic layout description. SLAGEN performas transistor grouping by a heuristic search method, in order to minimize the number of separations, and then performs group reordering and transistor reordering with an eye toward minimizing routing. Next, SLAGEN creates a rough initial routing in order to guarantee functionality and correctness, and then improve the initial routing by a rule-based approach.

• Journal of Korean Institute of Industrial Engineers
• /
• v.22 no.4
• /
• pp.705-718
• /
• 1996

A similarity coefficient based algorithm is proposed to solve the machine cells and part families formation problem in group technology. Similarity coefficients are newly designed from the machine-part incidence matrix. Machine cells are formed using a recurrent neural network in which the similarity coefficients are used as connection weights between processing units. Then parts are assigned to complete the cell composition. The proposed algorithm is applied to 30 different kinds of problems appeared in the literature. The results are compared to those by the GRAFICS algorithm in terms of the grouping efficiency and efficacy.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.4
• /
• pp.646-652
• /
• 2015

In this paper, the system-level performance is evaluated for the feedback scheme on the pre-coding matrix index (PMI) and channel quality indication (CQI), which are required for user selection in the multi-user MIMO system. Our analysis demonstrates that the number of users, the number of selected users, and codebook size are the key factors that govern the performance of the best companion grouping (BCG)-based user scheduling. Accordingly, we have confirmed that the probability of forming the co-scheduled user group is determined by these factors, which implies that the number of PMI's and codebook size can be dynamically determined so as to maximize the average system throughput as the number of users varies in the cell.

• Journal of Korean Institute of Industrial Engineers
• /
• v.30 no.4
• /
• pp.285-293
• /
• 2004

In this study, a machine grouping problem for the formation of manufacturing cells is considered. We constructed the problem as minimizing manufacturing leadtime consisting of parts' processing, moving, and waiting time. Specifically, the main objective of the defined problem is established as minimizing inter-cell traffic in order to minimize the part's moving time. In addition, to reduce the waiting time of parts, the load balance among cells is implicitly included as constraints. Since this problem is well known as NP-complete and cannot be solved in polynomial time, a genetic algorithm is implemented to obtain solutions. Also, a local optimization algorithm is applied in order to improve the solution by the genetic algorithm. Several experiments show that the suggested algorithms guarantee near optimal solutions in a few seconds.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.46 no.3
• /
• pp.26-31
• /
• 2009

A new LFSR based test compression scheme is proposed by reducing the maximum number of specified bits in the test cube set, smax, virtually. The performance of a conventional LFSR reseeding scheme highly depends on smax. In this paper, by using different clock frequencies between an LFSR and scan chains, and grouping the scan cells, we could reduce smax virtually. H the clock frequency which is slower than the clock frequency for the scan chain by n times is used for LFSR, successive n scan cells are filled with the same data; such that the number of specified bits can be reduced with an efficient grouping of scan cells. Since the efficiency of the proposed scheme depends on the grouping mechanism, a new graph-based scan cell grouping heuristic has been proposed. The simulation results on the largest ISCAS 89 benchmark circuit show that the proposed scheme requires less memory storage with significantly smaller area overhead compared to the previous test compression schemes.

• IE interfaces
• /
• v.12 no.1
• /
• pp.10-18
• /
• 1999

Job shop manufacturing environments are using the concept of cellular manufacturing systems(CMS) which has several advantages in reducing production lead times, setup times, work-in-process, etc. Utilizing the similarities between cell-machine, part-machine, and the shape/size of parts, CMS can group machines and parts resulting in improved efficiency of this system. However, when grouping machines and parts in machine cells, there inevitably occurs exceptional elements(EEs), which can not operate in the same machine cell. Minimizing these EEs in CMS is a critical point that improving production efficiency. Constraints in machine duplication cost, machining process technology, machining capability, and factory space limitations are main problems that prevent achiving the goal of maintaining an ideal CMS environment. This paper presents an algorithm that minimizes EEs under the constraints of machine duplication cost and factory space limitation. Developing exceptional operation similarity(EOS) by cell-machine incidence matrix and part-machine incidence matrix, it brings the machine cells that operate the parts or not. A mathematical model to minimize machine duplication is developed by EOS, followed by a heuristic algorithm in order to reflect dynamic situation resulting from minimizing exceptional elements process and the mathematical model. A numerical example is provided to illustrate the algorithm.

• Journal of Korean Society of Forest Science
• /
• v.90 no.4
• /
• pp.535-542
• /
• 2001

The objective of this study is to develop a spatial analysis modeling technique to evaluate the functional suitability of forest lands for land slide prevention. The functional suitability is classified into 3 categories of high, medium and low according to the potential of land slide on forest lands. The potential of land slide hazards is estimated using the measurements of 7 major site factors : slope, bed rock, soil depth, shape of slope, forest type and D.B.H. class of trees. The analytic hierarchical process is applied to determining the relative weight of site factors in estimating the potential of land slides. The spatial analysis modeling starts building base layers for the 7 major site factors by $25m{\times}25m$ grid analysis or TIN analysis, reclassifies them and produces new layers containing standardized attribute values, needed in estimating land slide potential. To these attributes, applied is the weight for the corresponding site factor to build the suitability classification map by map algebra analysis. Then, finally, cell-grouping operations convert the suitability classification map to the land unit function map. The whole procedures of the spatial analysis modeling are presented in this paper.