• Title/Summary/Keyword: Input constraint

Search Result 202, Processing Time 0.024 seconds

Data Stream Allocation for Fair Performance in Multiuser MIMO Systems (다중 사용자 MIMO 환경에서 균등한 성능을 보장하는 데이터 스트림 할당 기법)

  • Lim, Dong-Ho;Choi, Kwon-Hue
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.12A
    • /
    • pp.1006-1013
    • /
    • 2009
  • This paper proposes a data stream allocation technique for fair capacity performance in multiuser multiple-input multiple-output (MIMO) systems using block diagonalization (BD) algorithm. Conventional studies have been focused on maximum sum capacity. Thus, there is a very large difference of capacity among users, since user capacity unfairly distributed according to each user channel environment. In additional, poor channel user has very small capacity, since base station allocates the power by using water-filling technique. Also, almost studies limited itself to obtain the additional gain by using the same number of data streams for all users. In this paper, we propose the technique for maximizing sum capacity under the fair performance constraint by allocating data stream according to user channel environment. Also, proposed algorithm has more gain of sum capacity and transmit power than conventional equal allocation via computer simulation.

Optimization Methodology for Sales and Operations Planning by Stochastic Programming under Uncertainty : A Case Study in Service Industry (불확실성하에서의 확률적 기법에 의한 판매 및 실행 계획 최적화 방법론 : 서비스 산업)

  • Hwang, Seon Min;Song, Sang Hwa
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.39 no.4
    • /
    • pp.137-146
    • /
    • 2016
  • In recent years, business environment is faced with multi uncertainty that have not been suffered in the past. As supply chain is getting expanded and longer, the flow of information, material and production is also being complicated. It is well known that development service industry using application software has various uncertainty in random events such as supply and demand fluctuation of developer's capcity, project effective date after winning a contract, manpower cost (or revenue), subcontract cost (or purchase), and overrun due to developer's skill-level. This study intends to social contribution through attempts to optimize enterprise's goal by supply chain management platform to balance demand and supply and stochastic programming which is basically applied in order to solve uncertainty considering economical and operational risk at solution supplier. In Particular, this study emphasizes to determine allocation of internal and external manpower of developers using S&OP (Sales & Operations Planning) as monthly resource input has constraint on resource's capability that shared in industry or task. This study is to verify how Stochastic Programming such as Markowitz's MV (Mean Variance) model or 2-Stage Recourse Model is flexible and efficient than Deterministic Programming in software enterprise field by experiment with process and data from service industry which is manufacturing software and performing projects. In addition, this study is also to analysis how profit and labor input plan according to scope of uncertainty is changed based on Pareto Optimal, then lastly it is to enumerate limitation of the study extracted drawback which can be happened in real business environment and to contribute direction in future research considering another applicable methodology.

Image Dequantization using Optimization (최적화 기반 영상 역양자화)

  • Choi, Min-Gyu;Kim, Tae-Hoon;Ahn, Jong-Woo
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.34 no.7
    • /
    • pp.296-303
    • /
    • 2007
  • Color quantization replaces the color of each pixel with the closest representative color, and thus it makes the resulting image partitioned into uniformly-colored regions. As a consequence, continuous, detailed variations of color over the corresponding regions in the original image are lost through color quantization. In this paper. we present a novel blind scheme for restoring such variations from a color-quantized input image without it priori knowledge of the quantization method. Our scheme identifies which pairs of uniformly-colored regions in the input image should have continuous variations of color in the resulting image. Then, such regions are seamlessly stitched through optimization while preserving the closest representative colors. The user can optionally indicate which regions should be separated or stitched by scribbling constraint brushes across the regions. We demonstrate the effectiveness of our approach through diverse examples, such as photographs, cartoons, and artistic illustrations.

Improving Brightness for a Multi-projector Display Using Human Visual Properties (인간의 시각 특성을 사용한 Multi-Projector Display에서의 밝기 향상 방법)

  • Lee Hee-Won;Lee Byung-Uk
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.5C
    • /
    • pp.512-518
    • /
    • 2006
  • Very large-area multi-projector display systems have wide applications since they provide immersible environments. The brightness of projectors in the system is different due to the design and aging of the bulbs, and optical properties of the projectors. Therefore it is imperative to match the brightness characteristics of projectors in the system. This issue has been addressed by many researchers. The state of the art solution considers characteristic of projector's brightness only. In this paper, we propose a method that takes into account brightness of projector as well as the dynamic range of the input image. We increase the dynamic range of the input image to utilize the maximum possible brightness of a projector while satisfying the spatial smoothness constraint. This achieves a seamless multi-display with dramatic brightness improvement.

Optimal Design of a Fine Actuator for Optical Pick-up (광픽업 미세구동부의 최적설계)

  • Lee, Moon-G;Gweon, Dae-Gab
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.21 no.5
    • /
    • pp.819-827
    • /
    • 1997
  • In this paper, a new modeling of a fine actuator for an optical pick-up has been proposed and multiobjective optimization of the actuator has been performed. The fine actuator is constituted of the bobbin which is supported by wire suspension, the coils which wind around the bobbin, and the magnets which cause the magnetic flux. If current flows in the coils, magnetic force is so produced as to be balanced with spring force of wire, so the bobbin is pisitioned. In this model the transfer function from input voltage to output displacementof bobbin has been obtained so that we can describe this integrated system with electromagnetic and mechanical parts. Wire suspension is regarded as a continuous Euler beam, damper as distributed viscous damping, and bobbin as a rigid body which can move up- and down- ward motion only. According to the model, the high frequency dynamic characteristics of the fine actuator can be known and the effect of damping can be investigated while the conventional second order model cannot. In multiobjective optimization, two objective functions have been chosen to maximize the fundamental frequency and the sensitivity with respect to the input voltage of the actuator so that Pareto's optimal solutions have been obtained using .epsilon.-constraint method. These objective functions will satisfy the trends which will enhance the access speed and reduce the tracking error in the optical pick-up technology of next generation. In the result of optimization, we obtain the designs of the optical pick-up fine actuator which has high speed, high sensitivity and low resonant peak. Furthermore, we offer the relation between two object functions so that the designer can make easy choice.

Efficient User Selection Algorithms for Multiuser MIMO Systems with Zero-Forcing Dirty Paper Coding

  • Wang, Youxiang;Hur, Soo-Jung;Park, Yong-Wan;Choi, Jeong-Hee
    • Journal of Communications and Networks
    • /
    • v.13 no.3
    • /
    • pp.232-239
    • /
    • 2011
  • This paper investigates the user selection problem of successive zero-forcing precoded multiuser multiple-input multiple-output (MU-MIMO) downlink systems, in which the base station and mobile receivers are equipped with multiple antennas. Assuming full knowledge of the channel state information at the transmitter, dirty paper coding (DPC) is an optimal precoding strategy, but practical implementation is difficult because of its excessive complexity. As a suboptimal DPC solution, successive zero-forcing DPC (SZF-DPC) was recently proposed; it employs partial interference cancellation at the transmitter with dirty paper encoding. Because of a dimensionality constraint, the base station may select a subset of users to serve in order to maximize the total throughput. The exhaustive search algorithm is optimal; however, its computational complexity is prohibitive. In this paper, we develop two low-complexity user scheduling algorithms to maximize the sum rate capacity of MU-MIMO systems with SZF-DPC. Both algorithms add one user at a time. The first algorithm selects the user with the maximum product of the maximum column norm and maximum eigenvalue. The second algorithm selects the user with the maximum product of the minimum column norm and minimum eigenvalue. Simulation results demonstrate that the second algorithm achieves a performance similar to that of a previously proposed capacity-based selection algorithm at a high signal-to-noise (SNR), and the first algorithm achieves performance very similar to that of a capacity-based algorithm at a low SNR, but both do so with much lower complexity.

Iso-density Surface Reconstruction using Hierarchical Shrink-Wrapping Algorithm (계층적 Shrink-Wrapping 알고리즘을 이용한 등밀도면의 재구성)

  • Choi, Young-Kyu;Park, Eun-Jin
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.36 no.6
    • /
    • pp.511-520
    • /
    • 2009
  • In this paper, we present a new iso-density surface reconstruction scheme based on a hierarchy on the input volume data and the output mesh data. From the input volume data, we construct a hierarchy of volumes, called a volume pyramid, based on a 3D dilation filter. After constructing the volume pyramid, we extract a coarse base mesh from the coarsest resolution of the pyramid with the Cell-boundary representation scheme. We iteratively fit this mesh to the iso-points extracted from the volume data under O(3)-adjacency constraint. For the surface fitting, the shrinking process and the smoothing process are adopted as in the SWIS (Shrink-wrapped isosurface) algorithm[6], and we subdivide the mesh to be able to reconstruct fine detail of the isosurface. The advantage of our method is that it generates a mesh which can be utilized by several multiresolution algorithms such as compression and progressive transmission.

Fast Fuzzy Inference Algorithm for Fuzzy System constructed with Triangular Membership Functions (삼각형 소속함수로 구성된 퍼지시스템의 고속 퍼지추론 알고리즘)

  • Yoo, Byung-Kook
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.12 no.1
    • /
    • pp.7-13
    • /
    • 2002
  • Almost applications using fuzzy theory are based on the fuzzy inference. However fuzzy inference needs much time in calculation process for the fuzzy system with many input variables or many fuzzy labels defined on each variable. Inference time is dependent on the number of arithmetic Product in computation Process. Especially, the inference time is a primary constraint to fuzzy control applications using microprocessor or PC-based controller. In this paper, a simple fast fuzzy inference algorithm(FFIA), without loss of information, was proposed to reduce the inference time based on the fuzzy system with triangular membership functions in antecedent part of fuzzy rule. The proposed algorithm was induced by using partition of input state space and simple geometrical analysis. By using this scheme, we can take the same effect of the fuzzy rule reduction.

Partial CSI-Based Cooperative Power Allocation in Multi-Cell Dual-Hop MISO Relay Systems (다중-셀 이중-홉 MISO 릴레이 시스템에서 부분 채널 정보를 이용한 협력 전력 할당 기법)

  • Cho, Hee-Nam;Kim, Ah-Young;Lee, Jin-Woo;Lee, Young-Hwan
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.9C
    • /
    • pp.887-895
    • /
    • 2009
  • This paper proposes a cooperative power allocation with the use of partial channel information (e.g., the average signal-to-noise ratio (SNR) and transmit correlation) in multi-cell dual-hop multi-input single-output (MISO) relay systems. In a dual-hop MISO relay channel, it is desirable to allocate the transmit power between dual-hop links to maximize the end-to-end capacity. We consider the maximization of the end-to-end capacity of a dual-hop MISO relay channel under sum-power constraint. The proposed scheme adaptively allocates the transmit power considering the average channel gain of the target relay and the transmit correlation of the desired and inter-relay interference channel from adjacent relays. It is shown by means of upper-bound analysis that the end-to-end capacity can be maximized by making the angle difference of the principal eigenvectors of the desired and inter-relay interference channel orthogonal in highly-correlated channel environments. Finally, the performance of the proposed scheme is verified by computer simulation.

Feature Parameter Extraction and Speech Recognition Using Matrix Factorization (Matrix Factorization을 이용한 음성 특징 파라미터 추출 및 인식)

  • Lee Kwang-Seok;Hur Kang-In
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.10 no.7
    • /
    • pp.1307-1311
    • /
    • 2006
  • In this paper, we propose new speech feature parameter using the Matrix Factorization for appearance part-based features of speech spectrum. The proposed parameter represents effective dimensional reduced data from multi-dimensional feature data through matrix factorization procedure under all of the matrix elements are the non-negative constraint. Reduced feature data presents p art-based features of input data. We verify about usefulness of NMF(Non-Negative Matrix Factorization) algorithm for speech feature extraction applying feature parameter that is got using NMF in Mel-scaled filter bank output. According to recognition experiment results, we confirm that proposed feature parameter is superior to MFCC(Mel-Frequency Cepstral Coefficient) in recognition performance that is used generally.