Browse ORBi

- What it is and what it isn't
- Green Road / Gold Road?
- Ready to Publish. Now What?
- How can I support the OA movement?
- Where can I learn more?

ORBi

Weighted Fair Multicast Multigroup Beamforming under Per-antenna Power Constraints Christopoulos, Dimitrios ; Chatzinotas, Symeon ; Ottersten, Björn in Signal Processing, IEEE Transactions on (2014), 62(19), 5132-5142 A multi-antenna transmitter that conveys independent sets of common data to distinct groups of users is considered. This model is known as physical layer multicasting to multiple co-channel groups. In ... [more ▼] A multi-antenna transmitter that conveys independent sets of common data to distinct groups of users is considered. This model is known as physical layer multicasting to multiple co-channel groups. In this context, the practical constraint of a maximum permitted power level radiated by each antenna is addressed. The per-antenna power constrained system is optimized in a maximum fairness sense with respect to predetermined quality of service weights. In other words, the worst scaled user is boosted by maximizing its weighted signal-to-interference plus noise ratio. A detailed solution to tackle the weighted max-min fair multigroup multicast problem under per-antenna power constraints is therefore derived. The implications of the novel constraints are investigated via prominent applications and paradigms. What is more, robust per-antenna constrained multigroup multicast beamforming solutions are proposed. Finally, an extensive performance evaluation quantifies the gains of the proposed algorithm over existing solutions and exhibits its accuracy over per-antenna power constrained systems. [less ▲] Detailed reference viewed: 325 (39 UL)Weighted Group Algebras on Groups of Polynomial Growth ; ; et al in Mathematische Zeitschrift (2003), 245(4), 791-821 Detailed reference viewed: 93 (1 UL)Weighted lattice polynomials Marichal, Jean-Luc in Discrete Mathematics (2009), 309(4), 814-820 We define the concept of weighted lattice polynomial functions as lattice polynomial functions constructed from both variables and parameters. We provide equivalent forms of these functions in an ... [more ▼] We define the concept of weighted lattice polynomial functions as lattice polynomial functions constructed from both variables and parameters. We provide equivalent forms of these functions in an arbitrary bounded distributive lattice. We also show that these functions include the class of discrete Sugeno integrals and that they are characterized by a median based decomposition formula. [less ▲] Detailed reference viewed: 117 (7 UL)Weighted lattice polynomials Marichal, Jean-Luc in Proc. 11th Int. Conf. on Information Processing and Management of Uncertainty in Knowledge-Based Systems (IPMU 2006), Paris, France, July 2-7, 2006 (2006, July) We define the concept of weighted lattice polynomials as lattice polynomials constructed from both variables and parameters. We provide equivalent forms of these functions in an arbitrary bounded ... [more ▼] We define the concept of weighted lattice polynomials as lattice polynomials constructed from both variables and parameters. We provide equivalent forms of these functions in an arbitrary bounded distributive lattice. We also show that these functions include the class of discrete Sugeno integrals and that they are characterized by a remarkable median based decomposition formula. [less ▲] Detailed reference viewed: 103 (3 UL)The weighted lattice polynomials as aggregation functions Marichal, Jean-Luc in Proc. 63rd Meeting of the Eur. Working Group "Multiple Criteria Decision Aiding" (MCDA 63) (2006, March) We define the concept of weighted lattice polynomials as lattice polynomials constructed from both variables and parameters. We provide equivalent forms of these functions in an arbitrary bounded ... [more ▼] We define the concept of weighted lattice polynomials as lattice polynomials constructed from both variables and parameters. We provide equivalent forms of these functions in an arbitrary bounded distributive lattice. We also show that these functions include the class of discrete Sugeno integrals and that they are characterized by a remarkable median based decomposition formula. [less ▲] Detailed reference viewed: 39 (1 UL)Weighted lattice polynomials of independent random variables Marichal, Jean-Luc in Discrete Applied Mathematics (2008), 156(5), 685-694 We give the cumulative distribution functions, the expected values, and the moments of weighted lattice polynomials when regarded as real functions of independent random variables. Since weighted lattice ... [more ▼] We give the cumulative distribution functions, the expected values, and the moments of weighted lattice polynomials when regarded as real functions of independent random variables. Since weighted lattice polynomial functions include ordinary lattice polynomial functions and, particularly, order statistics, our results encompass the corresponding formulas for these particular functions. We also provide an application to the reliability analysis of coherent systems. [less ▲] Detailed reference viewed: 86 (4 UL)Weighted numbers: Commentary on “The Number Sense Represents (Rational) Numbers” by Sam Clarke and Jacob Beck Marinova, Mila ; ; in Behavioral and Brain Sciences (2021) Detailed reference viewed: 46 (3 UL)Weighted power variations of iterated Brownian motion Nourdin, Ivan ; Peccati, Giovanni in Electronic Journal of Probability (2008), 13 Detailed reference viewed: 139 (1 UL)Weighted Subspace Fitting for General Array Error Models ; ; Ottersten, Björn in IEEE Transactions on Signal Processing (1998), 46(9), 24842498 Detailed reference viewed: 29 (0 UL)Weighted sum rate maximization for MIMO broadcast channels using dirty paper coding and zero-forcing methods ; ; et al in IEEE Transactions on Communications (2013), 6(61), 2362-2373 We consider precoder design for maximizing the weighted sum rate (WSR) of successive zero-forcing dirty paper coding (SZF-DPC). For this problem, the existing precoder designs often assume a sum power ... [more ▼] We consider precoder design for maximizing the weighted sum rate (WSR) of successive zero-forcing dirty paper coding (SZF-DPC). For this problem, the existing precoder designs often assume a sum power constraint (SPC) and rely on the singular value decomposition (SVD). The SVD-based designs are known to be optimal but require high complexity. We first propose a low-complexity optimal precoder design for SZF-DPC under SPC, using the QR decomposition. Then, we propose an efficient numerical algorithm to find the optimal precoders subject to per-antenna power constraints (PAPCs). To this end, the precoder design for PAPCs is formulated as an optimization problem with a rank constraint on the covariance matrices. A well-known approach to solve this problem is to relax the rank constraints and solve the relaxed problem. Interestingly, for SZF-DPC, we are able to prove that the rank relaxation is tight. Consequently, the optimal precoder design for PAPCs is computed by solving the relaxed problem, for which we propose a customized interior-point method that exhibits a superlinear convergence rate. Two suboptimal precoder designs are also presented and compared to the optimal ones. We also show that the proposed numerical method is applicable for finding the optimal precoders for block diagonalization scheme. [less ▲] Detailed reference viewed: 180 (2 UL)Weighted Sum-SINR and Fairness Optimization for SWIPT-Multigroup Multicasting Systems with Heterogeneous Users Gautam, Sumit ; Lagunas, Eva ; Sharma, Shree Krishna et al in IEEE Open Journal of the Communications Society (2020) The development of next generation wireless communication systems focuses on the expansion of existing technologies, while ensuring an accord between various devices within a system. In this paper, we ... [more ▼] The development of next generation wireless communication systems focuses on the expansion of existing technologies, while ensuring an accord between various devices within a system. In this paper, we target the aspect of precoder design for simultaneous wireless information and power transmission (SWIPT) in a multi-group (MG) multicasting (MC) framework capable of handling heterogeneous types of users, viz., information decoding (ID) specific, energy harvesting (EH) explicit, and/or both ID and EH operations concurrently. Precoding is a technique well-known for handling the inter-user interference in multi-user systems, however, the joint design with SWIPT is not yet fully exploited. Herein, we investigate the potential benefits of having a dedicated precoder for the set of users with EH demands, in addition to the MC precoding. We study the system performance of the aforementioned system from the perspectives of weighted sum of signal-to-interference-plus-noise-ratio (SINR) and fairness. In this regard, we formulate the precoder design problems for (i) maximizing the weighted sum of SINRs at the intended users and (ii) maximizing the minimum of SINRs at the intended users; both subject to the constraints on minimum (non-linear) harvested energy, an upper limit on the total transmit power and a minimum SINR required to close the link. We solve the above-mentioned problems using distinct iterative algorithms with the help of semi-definite relaxation (SDR) and slack-variable replacement (SVR) techniques, following suitable transformations pertaining the problem convexification. The main novelty of the proposed approach lies in the ability to jointly design the MC and EH precoders for serving the heterogeneously classified ID and EH users present in distinct groups, respectively. We illustrate the comparison between the proposed weighted sum-SINR and fairness models via simulation results, carried out under various parameter values and operating conditions. [less ▲] Detailed reference viewed: 92 (17 UL)"Weil die meisten Comics einfach zu schwer sind!" - Zur Kategorie der Einfachheit beim Einsatz von Bandes dessinées im Fremdsprachenunterricht Französisch Morys, Nancy Scientific Conference (2014, September 26) Detailed reference viewed: 116 (0 UL)"... weil die meisten Comics einfach zu schwer sind!" - Zur Kategorie der Einfachheit beim Einsatz von Bandes dessinées im Fremdsprachenunterricht Französisch Morys, Nancy in Burwitz-Melzer, Eva; O´Sullivan, Emer (Eds.) Einfachheit in der Kinder- und Jugendliteratur - Ein Gewinn für den Fremdsprachenunterricht (2016, December 18) Detailed reference viewed: 133 (2 UL)The Weil-Petersson metric and the renormalized volume of hyperbolic 3-manifolds ; Schlenker, Jean-Marc in Handbook of Teichmüller theory. Volume III (2012) Detailed reference viewed: 134 (1 UL)Weinhandel und Weinkonsum in der Stadt Luxemburg im 15. Jahrhundert Pauly, Michel Conference given outside the academic context (2017) Detailed reference viewed: 96 (2 UL)"Weisst Du auch, wie das auf Deutsch heisst?" Ethnographie der Mehrsprachigkeit in bilingualen Kindertagesstätten der Westschweiz ; ; Neumann, Sascha et al in Stenger, Ursula; Edelmann, Doris; Nolte, David (Eds.) et al Diversität in der Pädagogik der frühen Kindheit. Im Spannungsfeld zwischen Konstruktion und Normativität (2017) Detailed reference viewed: 198 (7 UL)Weiter springen durch selbstgesteuertes Techniktraining ; Bund, Andreas in Sportpädagogik (2013), (2), 27-33 Detailed reference viewed: 121 (1 UL)Die Weiterbildung in der Sozialen Arbeit in Luxemburg - Bestandsaufnahme, Bedarf und Perspektiven Dujardin, Céline Scientific Conference (2015, October 22) Detailed reference viewed: 71 (4 UL)Weiterentwicklung eines mechanischen Modells zur Beschreibung Regen-Wind induzierter Schwingungen ; Zilian, Andreas ; in PAMM (2008), 8(1), 10883--10884 Detailed reference viewed: 160 (0 UL)Das Weiterleben der alten Kulte in Trier und Umgebung Ghetta, Marcello in Alexander Demandt und Josef Engemann (Hg.): Konstantin der Große (2007) Detailed reference viewed: 57 (3 UL) |
||