• Title/Summary/Keyword: random sum

Search Result 252, Processing Time 0.026 seconds

Multiuser Heterogeneous-SNR MIMO Systems

  • Jo, Han-Shin
    • 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.

Sum Rate Approximation of Zero-Forcing Beamforming with Semi-Orthogonal User Selection

  • Yang, Jang-Hoon;Jang, Seung-Hun;Kim, Dong-Ku
    • Journal of Communications and Networks
    • /
    • v.12 no.3
    • /
    • pp.222-230
    • /
    • 2010
  • In this paper, we present a closed-form approximation of the average sum rate of zero-forcing (ZF) beamforming (BF) with semi-orthogonal user selection (SUS). We first derive the survival probability associated with the SUS that absolute square of the channel correlation between two users is less than the orthogonalization level threshold (OLT).With this result, each distribution for the number of surviving users at each iteration of the SUS and the number of streams for transmission is calculated. Secondly, the received signal power of ZF-BF is represented as a function of the elements of the upper triangular matrix from QR decomposition of the channel matrix. Thirdly, we approximate the received signal power of ZF-BF with the SUS as the maximum of scaled chisquare random variables where the scaling factor is approximated as a function of both OLT and the number of users in the system. Putting all the above derivations and order statistics together, the approximated ergodic sum rate of ZF-BF with the SUS is shown in a closed form. The simulation results verify that the approximation tightly matches with the sample average for any OLT and even for a small number of users.

Impact of Mobility on the Ad Hoc Network Performance (이동성이 Ad Hoc 망의 성능에 미치는 영향)

  • Ahn, Hong-Young
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.10 no.5
    • /
    • pp.201-208
    • /
    • 2010
  • Mobile Ad Hoc Network(MANET) has highly dynamic topology, hence presents a great challenge on the network performance evaluation and network protocol design. We proposed total path break up time, $\sum_{i}T_i$, as a metric to measure the performance of the total system as well as an individual connection. In this paper, we evaluate and analyze the performance of three mobility models(Random Waypoint, Manhattan, Blocked Manhattan) by applying the total path break up metric, investigate why network parameters such as packet delivery ratio, end-to-end delay, etc. vary by mobility models. We also present analysis result how much AODV Buffer improve packet delivery ratio and increase the end-to-end delay in spite of the path break up.

Determining the Efficient Solutions for Bicriteria Programming Problems with Random Variables in Both the Objective Functions and the Constraints

  • Bayoumi, B.I.;El-Sawy, A.A.;Baseley, N.L.;Yousef, I.K.;Widyan, A.M.
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.9 no.1
    • /
    • pp.99-110
    • /
    • 2005
  • This paper suggests an efficient approach for stochastic bicriteria programming problem (SBCPP) with random variables in both the objective functions and in the right-hand side of the constraints. The suggested approach uses the statistical inference through two different techniques: In one of them, the SBCPP is transformed into an equivalent deterministic bicriteria programming problem (DBCPP), then the nonnegative weighted sum approach will be used to transform the bicriteria programming problem into a single objective programming problem, and the other technique, the nonnegative weighted sum approach is used to transform the SBCPP to an equivalent stochastic single objective programming problem, then apply the same procedure to convert stochastic single objective programming problem into its equivalent deterministic single objective programming problem (DSOPP). In both techniques the resulting problem can be solved as a nonlinear programming problem to get the efficient solutions. Finally, a comparison between the two different techniques is discussed, and illustrated example is given to demonstrate the actual application of these techniques.

  • PDF

MEPS Method to Set the Design and Operational Limits for Aircraft Engine (항공엔진의 설계 및 운용한계 설정을 위한 MEPS 기법연구)

  • Kim, Ji-Hyun;Oh, Seong-Hwan;Ko, Han-Young
    • Proceedings of the Korean Society of Propulsion Engineers Conference
    • /
    • 2007.04a
    • /
    • pp.258-261
    • /
    • 2007
  • The objective of this paper is to examine the ways in which to implement MEPS method for setting the design and operational limits in order to provide the guaranteed performance of the aircraft engine. Direct adder arithmetically added and related with the effects of ambient humidity, engine quality, throttle set tolerance and deterioration, etc is described with the random adder added in root square sum. The method was applied on the preliminary design of 4,000Ib class turbofan engine and the MEPS for engine component design and operational margin was generated.

  • PDF

Secure Biometric Hashing by Random Fusion of Global and Local Features

  • Ou, Yang;Rhee, Kyung-Hyune
    • Journal of Korea Multimedia Society
    • /
    • v.13 no.6
    • /
    • pp.875-883
    • /
    • 2010
  • In this paper, we present a secure biometric hashing scheme for face recognition by random fusion of global and local features. The Fourier-Mellin transform and Radon transform are adopted respectively to form specialized representation of global and local features, due to their invariance to geometric operations. The final biometric hash is securely generated by random weighting sum of both feature sets. A fourfold key is involved in our algorithm to ensure the security and privacy of biometric templates. The proposed biometric hash can be revocable and replaced by using a new key. Moreover, the attacker cannot obtain any information about the original biometric template without knowing the secret key. The experimental results confirm that our scheme has a satisfactory accuracy performance in terms of EER.

ON ALMOST SURE CONVERGENCE FOR WEIGHTED SUMS OF LNQD RANDOM VARIABLES

  • Choi, Jeong-Yeol;Kim, So-Youn;Baek, Jong-Il
    • Honam Mathematical Journal
    • /
    • v.34 no.2
    • /
    • pp.241-252
    • /
    • 2012
  • Let $\{X_{ni},\;1{\leq}i{\leq}n,\;n{\geq}1\}$ be a sequence of LNQD which are dominated randomly by another random variable X. We obtain the complete convergence and almost sure convergence of weighted sums ${\sum}^n_{i=1}a_{ni}X_{ni}$ for LNQD by using a new exponential inequality, where $\{a_{ni},\;1{\leq}i{\leq}n,\;n{\geq}1\}$ is an array of constants. As corollary, the results of some authors are extended from i.i.d. case to not necessarily identically LNQD case.

Nonlinear Networked Control Systems with Random Nature using Neural Approach and Dynamic Bayesian Networks

  • Cho, Hyun-Cheol;Lee, Kwon-Soon
    • International Journal of Control, Automation, and Systems
    • /
    • v.6 no.3
    • /
    • pp.444-452
    • /
    • 2008
  • We propose an intelligent predictive control approach for a nonlinear networked control system (NCS) with time-varying delay and random observation. The control is given by the sum of a nominal control and a corrective control. The nominal control is determined analytically using a linearized system model with fixed time delay. The corrective control is generated online by a neural network optimizer. A Markov chain (MC) dynamic Bayesian network (DBN) predicts the dynamics of the stochastic system online to allow predictive control design. We apply our proposed method to a satellite attitude control system and evaluate its control performance through computer simulation.

Robust design of liquid column vibration absorber in seismic vibration mitigation considering random system parameter

  • Debbarma, Rama;Chakraborty, Subrata
    • Structural Engineering and Mechanics
    • /
    • v.53 no.6
    • /
    • pp.1127-1141
    • /
    • 2015
  • The optimum design of liquid column dampers in seismic vibration control considering system parameter uncertainty is usually performed by minimizing the unconditional response of a structure without any consideration to the variation of damper performance due to uncertainty. However, the system so designed may be sensitive to the variations of input system parameters due to uncertainty. The present study is concerned with robust design optimization (RDO) of liquid column vibration absorber (LCVA) considering random system parameters characterizing the primary structure and ground motion model. The RDO is obtained by minimizing the weighted sum of the mean value of the root mean square displacement of the primary structure as well as its standard deviation. A numerical study elucidates the importance of the RDO procedure for design of LCVA system by comparing the RDO results with the results obtained by the conventional stochastic structural optimization procedure and the unconditional response based optimization.

An unwanted facility location problem with negative influence cost and transportation cost (기피비용과 수송비용을 고려한 기피시설 입지문제)

  • Yang, Byoung-Hak
    • Journal of the Korea Safety Management & Science
    • /
    • v.15 no.1
    • /
    • pp.77-85
    • /
    • 2013
  • In the location science, environmental effect becomes a new main consideration for site selection. For the unwanted facility location selection, decision makers should consider the cost of resolving the environmental conflict. We introduced the negative influence cost for the facility which was inversely proportional to distance between the facility and residents. An unwanted facility location problem was suggested to minimize the sum of the negative influence cost and the transportation cost. The objective cost function was analyzed as nonlinear type and was neither convex nor concave. Three GRASP (Greedy Randomized adaptive Search Procedure) methods as like Random_GRASP, Epsilon_GRASP and GRID_GRASP were developed to solve the unwanted facility location problem. The Newton's method for nonlinear optimization problem was used for local search in GRASP. Experimental results showed that quality of solution of the GRID_GRASP was better than those of Random_GRASP and Epsilon_GRASP. The calculation time of Random_GRASP and Epsilon_GRASP were faster than that of Grid_GRASP.