• 제목/요약/키워드: zero-sum

검색결과 211건 처리시간 0.028초

Achievable Sum Rate Analysis of ZF Receivers in 3D MIMO Systems

  • Li, Xingwang;Li, Lihua;Xie, Ling
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제8권4호
    • /
    • pp.1368-1389
    • /
    • 2014
  • Three-dimensional multiple-input multiple-output (3D MIMO) and large-scale MIMO are two promising technologies for upcoming high data rate wireless communications, since the inter-user interference can be reduced by exploiting antenna vertical gain and degree of freedom, respectively. In this paper, we derive the achievable sum rate of 3D MIMO systems employing zero-forcing (ZF) receivers, accounting for log-normal shadowing fading, path-loss and antenna gain. In particular, we consider the prevalent log-normal model and propose a novel closed-form lower bound on the achievable sum rate exploiting elevation features. Using the lower bound as a starting point, we pursue the "large-system" analysis and derive a closed-form expression when the number of antennas grows large for fixed average transmit power and fixed total transmit power schemes. We further model a high-building with several floors. Due to the floor height, different floors correspond to different elevation angles. Therefore, the asymptotic achievable sum rate performances for each floor and the whole building considering the elevation features are analyzed and the effects of tilt angle and user distribution for both horizontal and vertical dimensions are discussed. Finally, the relationship between the achievable sum rate and the number of users is investigated and the optimal number of users to maximize the sum rate performance is determined.

Manabe 표준형의 계단 응답 특성 및 제어기설계에의 응용 (The Characteristices of Step Responses of the Manabe Standard Forms and Its Application to the Controller Desegn)

  • 강환일
    • 대한전기학회논문지:전력기술부문A
    • /
    • 제48권5호
    • /
    • pp.586-592
    • /
    • 1999
  • We investigate the characteristic of 소데 responses of the Manabe standard form which is used recently for design of the controller. We obtain some theorems and these theorems have the properties of the relationship between the roots of the polynomial and the stability indices which are used for the Manabe standard form. The Manabe standard form has the following properties: The sum of the squal to zero, the sum of the reciprocal of the squared roots is greater than zero and the parameter $\tau$ is the negative value of the sum of the reciprocal of the roots. We compare the step responses of the Manabe standard form with those of the ITAE form, the dead beat response and Bessel forms. We choose the 6th order closed loop polynomial and keep the same settling time for the four forms. Under these conditions we find that the Manabe standard form have faster 90% rising time than the Bessel and dead beat response. We see that the ITAE, bessel and dead beat responses have some overshoot, whereas the Manabe standard form has none. We also compare the Manabe form with the other three forms for the controller design using the pole assignment technique. If the open loop transfer function is a type-1 system (transfer functions having one integrator), then, for the closed loop system associated with the open loop transfer function, the steady state error of the unit ramp input is obtained in terms of the parameter $\tau$ of the Manabe standard form.

  • PDF

다중 안테나 다중 사용자 환경에서 최대 전송율에 근접하는 선형 precoding 기법 (A Near Optimal Linear Preceding for Multiuser MIMO Throughput Maximization)

  • 장승훈;양장훈;장규환;김동구
    • 한국통신학회논문지
    • /
    • 제34권4C호
    • /
    • pp.414-423
    • /
    • 2009
  • 본 논문은 최대 전송률에 가까운 성능을 보이는 선형 preceding 기법을 제안한다. MMSE preceding은 ZF preceding 방식보다 우수한 평균 자승 오차 성능을 가진다. 반면 MMSE preceding 방식의 전송률은 낮은 SNR 범위에서는 ZF 방식에 비해 개선된 성능을 보여주지만 높은 SNR에서는 오히려 성능 열화현상을 보인다. 이와 같은 사실에 착안하여 본 논문에서는 최대 전송률에 근접하는 선형 preceding 기법을 제안한다. 제안된 방식은 ZF precoding방식에서 사용되는 역행렬 연산을 전송율이 최대화될 수 있도록 정규화하는 방식이고 이를 위한 간단한 수치 알고리즘이 제안된다. 또한 그 과정에서 낮은 복잡도를 가지는 간단한 전력 재할당에 의한 정규화 방식이 제안된다. 시뮬레이션과 성능분석을 통해 제안된 방식이 모든 SNR 범위에서 기존의 ZF preceding 방식과 MMSE preceding방식보다 높은 전송률을 가짐을 보인다. 또한 제안된 방식은 채널 추정 오차가 존재하는 경우에도 기존의 선형 preceding 방식들과 비교하여 성능 이득을 유지하면서 채널 추정 오차에 강인함을 가진다.

ON THE COMPLETE MOMENT CONVERGENCE OF MOVING AVERAGE PROCESSES GENERATED BY ρ*-MIXING SEQUENCES

  • Ko, Mi-Hwa;Kim, Tae-Sung;Ryu, Dae-Hee
    • 대한수학회논문집
    • /
    • 제23권4호
    • /
    • pp.597-606
    • /
    • 2008
  • Let {$Y_{ij}-{\infty}\;<\;i\;<\;{\infty}$} be a doubly infinite sequence of identically distributed and ${\rho}^*$-mixing random variables with zero means and finite variances and {$a_{ij}-{\infty}\;<\;i\;<\;{\infty}$} an absolutely summable sequence of real numbers. In this paper, we prove the complete moment convergence of {${\sum}^n_{k=1}\;{\sum}^{\infty}_{i=-{\infty}}\;a_{i+k}Y_i/n^{1/p}$; $n\;{\geq}\;1$} under some suitable conditions. We extend Theorem 1.1 of Li and Zhang [Y. X. Li and L. X. Zhang, Complete moment convergence of moving average processes under dependence assumptions, Statist. Probab. Lett. 70 (2004), 191.197.] to the ${\rho}^*$-mixing case.

EVERY POLYNOMIAL OVER A FIELD CONTAINING 𝔽16 IS A STRICT SUM OF FOUR CUBES AND ONE EXPRESSION A2 + A

  • Gallardo, Luis H.
    • 대한수학회보
    • /
    • 제46권5호
    • /
    • pp.941-947
    • /
    • 2009
  • Let q be a power of 16. Every polynomial $P\in\mathbb{F}_q$[t] is a strict sum $P=A^2+A+B^3+C^3+D^3+E^3$. The values of A,B,C,D,E are effectively obtained from the coefficients of P. The proof uses the new result that every polynomial $Q\in\mathbb{F}_q$[t], satisfying the necessary condition that the constant term Q(0) has zero trace, has a strict and effective representation as: $Q=F^2+F+tG^2$. This improves for such q's and such Q's a result of Gallardo, Rahavandrainy, and Vaserstein that requires three polynomials F,G,H for the strict representation $Q=F^2$+F+GH. Observe that the latter representation may be considered as an analogue in characteristic 2 of the strict representation of a polynomial Q by three squares in odd characteristic.

A WEAK LAW FOR WEIGHTED SUMS OF ARRAY OF ROW NA RANDOM VARIABLES

  • Baek, Jong-Il;Liang, Han-Ying;Choi, Jeong-Yeol
    • 대한수학회보
    • /
    • 제40권2호
    • /
    • pp.341-349
    • /
    • 2003
  • Let {$x_{nk}\;$\mid$1\;\leq\;k\;\leq\;n,\;n\;\geq\;1$} be an array of random varianbles and $\{a_n$\mid$n\;\geq\;1\}\;and\;\{b_n$\mid$n\;\geq\;1} be a sequence of constants with $a_n\;>\;0,\;b_n\;>\;0,\;n\;\geq\;1. In this paper, for array of row negatively associated(NA) random variables, we establish a general weak law of large numbers (WLLA) of the form (${\sum_{\kappa=1}}^n\;a_{\kappa}X_{n\kappa}\;-\;\nu_{n\kappa})\;/b_n$ converges in probability to zero, as $n\;\rightarrow\;\infty$, where {$\nu_{n\kappa}$\mid$1\;\leq\;\kappa\;\leq\;n,\;n\;\geq\;1$} is a suitable array of constants.

COMPLETE MOMENT CONVERGENCE OF MOVING AVERAGE PROCESSES WITH DEPENDENT INNOVATIONS

  • Kim, Tae-Sung;Ko, Mi-Hwa;Choi, Yong-Kab
    • 대한수학회지
    • /
    • 제45권2호
    • /
    • pp.355-365
    • /
    • 2008
  • Let ${Y_i;-\infty<i<\infty}$ be a doubly infinite sequence of identically distributed and $\phi$-mixing random variables with zero means and finite variances and ${a_i;-\infty<i<\infty}$ an absolutely summable sequence of real numbers. In this paper, we prove the complete moment convergence of ${{\sum}_{k=1}^{n}\;{\sum}_{i=-\infty}^{\infty}\;a_{i+k}Y_i/n^{1/p};n\geq1}$ under some suitable conditions.

열대곡선 헤아리기 (Enumerate tropical algebraic curves)

  • 김영록;신용수
    • 한국수학사학회지
    • /
    • 제30권3호
    • /
    • pp.185-199
    • /
    • 2017
  • In tropical geometry, the sum of two numbers is defined as the minimum, and the multiplication as the sum. As a way to build tropical plane curves, we could use Newton polygons or amoebas. We study one method to convert the representation of an algebraic variety from an image of a rational map to the zero set of some multivariate polynomials. Mikhalkin proved that complex curves can be replaced by tropical curves, and induced a combination formula which counts the number of tropical curves in complex projective plane. In this paper, we present close examinations of this particular combination formula.

트리에서 길이 제한이 있는 가장 무거운 경로를 찾는 알고리즘 (Algorithm for finding a length-constrained heaviest path of a tree)

  • 김성권
    • 정보처리학회논문지A
    • /
    • 제13A권6호
    • /
    • pp.541-544
    • /
    • 2006
  • 에지마다 길이와 무게(둘 다 양수, 음수, 0 가능)가 주어진 트리에서, 길이의 합이 주어진 값 이하이면서 무게의 합이 가장 큰 경로를 찾는 O(nlognloglogn) 시간 알고리즘을 제시한다. 이전의 결과 O($nlog^2n$) 보다 향상된 것이다. 여기서, n은 트리가 가지는 노드의 수이다.

스테레오 비전에서 비용 축적 알고리즘의 비교 분석 (Comparative Analysis of Cost Aggregation Algorithms in Stereo Vision)

  • 이용환;김영섭
    • 반도체디스플레이기술학회지
    • /
    • 제15권1호
    • /
    • pp.47-51
    • /
    • 2016
  • Human visual system infers 3D vision through stereo disparity in the stereoscopic images, and stereo visioning are recently being used in consumer electronics which has resulted in much research in the application field. Basically, stereo vision system consists of four processes, which are cost computation, cost aggregation, disparity calculation, and disparity refinement. In this paper, we present and evaluate the existing various methods, focusing on cost aggregation for stereo vision system to comparatively analyze the performance of their algorithms for a given set of resources. Experiments show that Normalized Cross Correlation and Zero-Mean Normalized Cross Correlation provide higher accuracy, however they are computationally heavy for embedded system in the real time systems. Sum of Absolute Difference and Sum of Squared Difference are more suitable selection for embedded system, but they should be required on improvement to apply to the real world system.