SwePub
Tyck till om SwePub Sök här!
Sök i SwePub databas

  Utökad sökning

Träfflista för sökning "WFRF:(Ghauch Hadi 1986 ) "

Sökning: WFRF:(Ghauch Hadi 1986 )

  • Resultat 1-10 av 15
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
1.
  • A. Mouris, Boules, et al. (författare)
  • Multi-tone Signal Optimization for Wireless Power Transfer in the Presence of Wireless Communication Links
  • 2020
  • Ingår i: IEEE Transactions on Wireless Communications. - : Institute of Electrical and Electronics Engineers (IEEE). - 1536-1276 .- 1558-2248. ; 19:5, s. 3575-3590
  • Tidskriftsartikel (refereegranskat)abstract
    • In this paper, we study optimization of multi-tone signals for wireless power transfer (WPT) systems. We investigate different non-linear energy harvesting models. Two of them are adopted to optimize the multi-tone signal according to the channel state information available at the transmitter. We show that a second-order polynomial curve-fitting model can be utilized to optimize the multi-tone signal for any RF energy harvester design. We consider both single-antenna and multi-antenna WPT systems. In-band co-existing communication links are also considered in this work by imposing a constraint on the received power at the nearby information receiver to prevent its RF front end from saturation. We emphasize the importance of imposing such constraint by explaining how inter-modulation products, due to saturation, can cause high interference at the information receiver in the case of multi-tone signals. The multi-tone optimization problem is formulated as a non-convex linearly constrained quadratic program. Two globally optimal solution approaches using mixed-integer linear programming and finite branch-and-bound techniques are proposed to solve the problem. The achieved improvement resulting from applying both solution methods to the multi-tone optimization problem is highlighted through simulations and comparisons with other solutions existing in the literature.
  •  
2.
  • B. da Silva Jr., Jose Mairton, 1990-, et al. (författare)
  • How to Split UL/DL Antennas in Full-DuplexCellular Networks
  • 2018
  • Ingår i: IEEE International Conference on Communication (ICC’18). - Kansas City, MO, USA : IEEE Communications Society.
  • Konferensbidrag (refereegranskat)abstract
    • To further improve the potential of full-duplex com-munications, networks may employ multiple antennas at thebase station or user equipment. To this end, networks thatemploy current radios usually deal with self-interference andmulti-user interference by beamforming techniques. Althoughprevious works investigated beamforming design to improvespectral efficiency, the fundamental question of how to split theantennas at a base station between uplink and downlink infull-duplex networks has not been investigated rigorously. Thispaper addresses this question by posing antenna splitting as abinary nonlinear optimization problem to minimize the sum meansquared error of the received data symbols. It is shown that thisis an NP-hard problem. This combinatorial problem is dealt withby equivalent formulations, iterative convex approximations, anda binary relaxation. The proposed algorithm is guaranteed toconverge to a stationary solution of the relaxed problem with muchsmaller complexity than exhaustive search. Numerical resultsindicate that the proposed solution is close to the optimal in bothhigh and low self-interference capable scenarios, while the usuallyassumed antenna splitting is far from optimal. For large numberof antennas, a simple antenna splitting is close to the proposedsolution. This reveals that the importance of antenna splittingdiminishes with the number of antennas.
  •  
3.
  • Barros da Silva Jr., José Mairton, Dr. 1990-, et al. (författare)
  • Smart Antenna Assignment is Essential in Full-Duplex Communications
  • 2021
  • Ingår i: IEEE Transactions on Communications. - : IEEE. - 0090-6778 .- 1558-0857. ; 69:5, s. 3450-3466
  • Tidskriftsartikel (refereegranskat)abstract
    • Full-duplex communications have the potential to almost double the spectralefficiency. To realize such a potentiality, the signal separation at base station’s antennasplays an essential role. This paper addresses the fundamentals of such separationby proposing a new smart antenna architecture that allows every antenna to beeither shared or separated between uplink and downlink transmissions. The benefitsof such architecture are investigated by an assignment problem to optimally assignantennas, beamforming and power to maximize the weighted sum spectral efficiency.We propose a near-to-optimal solution using block coordinate descent that divides theproblem into assignment problems, which are NP-hard, a beamforming and powerallocation problems. The optimal solutions for the beamforming and power allocationare established while near-to-optimal solutions to the assignment problems are derivedby semidefinite relaxation. Numerical results indicate that the proposed solution isclose to the optimum, and it maintains a similar performance for high and low residualself-interference powers. With respect to the usually assumed antenna separationtechnique and half-duplex transmission, the sum spectral efficiency gains increase withthe number of antennas. We conclude that our proposed smart antenna assignment forsignal separation is essential to realize the benefits of multiple antenna full-duplexcommunications.
  •  
4.
  • Ghauch, Hadi, 1986-, et al. (författare)
  • Compressive Sensing with Applications to Millimeter-wave Architectures
  • 2019
  • Ingår i: 2019 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP). - : IEEE. - 9781479981311 ; , s. 7834-7838
  • Konferensbidrag (refereegranskat)abstract
    • To make the system available at low-cost, millimeter-ave (mmWave) multiple-input multiple-output (MIMO) architectures employ analog arrays, which are driven by a limited number of radio frequency (RF) chains. One primary challenge of using large hybrid analog-digital arrays is that the digital baseband cannot directly access the signal to/from each antenna. To address this limitation, recent research has focused on retransmissions, iterative precoding, and subspace decomposition methods. Unlike these approaches that exploited the channel's low-rank, in this work we exploit the sparsity of the received signal at both the transmit/receive antennas. While the signal itself is de facto dense, it is well-known that most signals are sparse under an appropriate choice of basis. By delving into the structured compressive sensing (CS) framework and adapting them to variants of the mmWave hybrid architectures, we provide methodologies to recover the analog signal at each antenna from the (low-dimensional) digital signal. Moreover, we characterizes the minimal numbers of measurement and RF chains to provide this recovery, with high probability. We discuss their applications to common variants of the hybrid architecture. By leveraging the inherent sparsity of the received signal, our analysis reveals that a hybrid MIMO system can be " turned into" a fully digital one: the number of needed RF chains increases logarithmically with the number of antennas.
  •  
5.
  • Ghauch, Hadi, 1986-, et al. (författare)
  • Interference Alignment via Controlled Perturbations
  • 2013
  • Ingår i: 2013 IEEE Global Communications Conference (GLOBECOM). - : IEEE. - 9781479913534 ; , s. 3996-4001
  • Konferensbidrag (refereegranskat)abstract
    • In this work, we study the so-called leakage minimization problem, within the context of interference alignment (IA). For that purpose, we propose a novel approach based on controlled perturbations of the leakage function, and show how the latter can be used as a mechanism to control the algorithm's convergence (and thus tradeoff convergence speed for reliability). Although the proposed scheme falls under the broad category of stochastic optimization, we show through simulations that it has a quasi-deterministic convergence that we exploit to improve on the worst case performance of its predecessor, resulting in significantly better sum-rate capacity and average cost function value.
  •  
6.
  •  
7.
  • Ghauch, Hadi, 1986- (författare)
  • Machine Learning for Spectrum Sharing in Millimeter‐Wave Cellular Networks
  • 2020
  • Ingår i: Machine Learning for Future Wireless Communications. - : John Wiley & Sons. ; , s. 45-62
  • Bokkapitel (refereegranskat)abstract
    • This chapter is devoted to the use of machine learning (ML) tools to address the spectrum‐sharing problem in cellular networks. The emphasis is on a hybrid approach that combines the traditional model‐based approach with a (ML) data‐driven approach. Taking millimeter‐wave cellular network as an application case, the theoretical analyses and experiments presented in the chapter show that the proposed hybrid approach is a very promising solution in dealing with the key technical aspects of spectrum sharing: the choice of beamforming, the level of information exchange for coordination and association, and the sharing architecture. The chapter then focuses on motivation and background related to spectrum sharing. It also presents the system model and problem formulation, and focuses on all technical aspects of the proposed hybrid approach. Finally, the chapter discusses further issues and conclusions.
  •  
8.
  • Ghauch, Hadi, 1986-, et al. (författare)
  • Sum-Rate Maximization in Sub-28-GHz Millimeter-Wave MIMO Interfering Networks
  • 2017
  • Ingår i: IEEE Journal on Selected Areas in Communications. - : IEEE. - 0733-8716 .- 1558-0008. ; 35:7, s. 1649-1662
  • Tidskriftsartikel (refereegranskat)abstract
    • MIMO systems in the lower part of the millimetre-wave (mmWave) spectrum band (i.e., below 28 GHz) do not exhibit enough directivity and selectively, as compared to their counterparts in higher bands of the spectrum (i.e., above 60 GHz), and thus still suffer from the detrimental effect of interference, on the system sum rate. As such systems exhibit large numbers of antennas and short coherence times for the channel, traditional methods of distributed coordination are ill-suited, and the resulting communication overhead would offset the gains of coordination. In this paper, we propose algorithms for tackling the sum-rate maximization problem that are designed to address the above-mentioned limitations. We derive a lower bound on the sum rate, a so-called difference of log and trace (DLT) bound, shed light on its tightness, and highlight its decoupled nature at both the transmitters and receivers. Moreover, we derive the solution to each of the subproblems that we dub non-homogeneous waterfilling (a variation on the MIMO waterfilling solution), and underline an inherent desirable feature: its ability to turn-OFF streams exhibiting low SINR, and contribute to greatly speeding up the convergence of the proposed algorithm. We then show the convergence of the resulting algorithm, max-DLT, to a stationary point of the DLT bound. Finally, we rely on extensive simulations of various network configurations, to establish the fast-converging nature of our proposed schemes, and thus their suitability for addressing the short coherence interval, as well as the increased system dimensions, arising when managing interference in lower bands of the mmWave spectrum. Moreover, our results suggest that interference management still brings about significant performance gains, especially in dense deployments.
  •  
9.
  •  
10.
  • Ghauch, Hadi, 1986-, et al. (författare)
  • User Assignment in C-RAN Systems : Algorithms and Bounds
  • 2018
  • Ingår i: IEEE Transactions on Wireless Communications. - : IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC. - 1536-1276 .- 1558-2248. ; 17:6, s. 3889-3902
  • Tidskriftsartikel (refereegranskat)abstract
    • In this paper, we investigate the problem of mitigating interference between so-called antenna domains of a cloud radio access network (C-RAN). In contrast to previous work, we turn to an approach utilizing primarily the optimal assignment of users to central processors in a C-RAN deployment. We formulate this user assignment problem as an integer optimization problem and propose an iterative algorithm for obtaining a solution. Motivated by the lack of optimality guarantees on such solutions, we opt to find lower bounds on the problem and the resulting interference leakage in the network. We thus derive the corresponding Dantzig-Wolfe decomposition, formulate the dual problem, and show that the former offers a tighter bound than the latter. We highlight the fact that the bounds in question consist of linear problems with an exponential number of variables and adapt the column generation method for solving them. In addition to shedding light on the tightness of the bounds in question, our numerical results show significant sum-rate gains over several comparison schemes. Moreover, the proposed scheme delivers similar performance as weighted minimum mean squared-error (MMSE) with a significantly lower complexity (around 10 times less).
  •  
Skapa referenser, mejla, bekava och länka
  • Resultat 1-10 av 15

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy