Electrical and Electronic Engineering - Research Publications

Permanent URI for this collection

Search Results

Now showing 1 - 7 of 7
  • Item
    No Preview Available
    Frequency Permutations for Joint Radar and Communications
    Senanayake, R ; Smith, PJ ; Han, T ; Evans, J ; Moran, W ; Evans, R (IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 2022-11)
  • Item
    No Preview Available
    Optimum Reconfigurable Intelligent Surface Selection for Wireless Networks
    Fang, Y ; Atapattu, S ; Inaltekin, H ; Evans, J (IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 2022-09)
  • Item
    No Preview Available
    Capacity Bounds for One-Bit MIMO Gaussian Channels With Analog Combining
    Bernardo, NI ; Zhu, J ; Eldar, YC ; Evans, J (IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 2022-11)
  • Item
    No Preview Available
    On the Capacity-Achieving Input of Channels With Phase Quantization
    Bernardo, NI ; Zhu, J ; Evans, J (IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 2022-09)
  • Item
    No Preview Available
    On the Capacity-Achieving Input of the Gaussian Channel With Polar Quantization
    Bernardo, NI ; Zhu, J ; Evans, J (IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 2022-09)
  • Item
    Thumbnail Image
    Optimal Routing for Multi-User Multi-Hop Relay Networks Via Dynamic Programming
    Dayarathna, S ; Senanayake, R ; Evans, J (IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 2022-05-23)
    In this letter, we study the relay selection problem in multi-user, multi-hop relay networks with the objective of minimizing the network outage probability. When only one user is present, it is well known that the optimal relay selection problem can be solved efficiently via dynamic programming. This solution breaks down in the multi-user scenario due to dependence between users. We resolve this challenge using a novel relay aggregation approach. On the expanded trellis, dynamic programming can be used to solve the optimal relay selection problem with computational complexity linear in the number of hops. Numerical examples illustrate the efficient use of this algorithm for relay networks.
  • Item
    Thumbnail Image
    Sum-Rate Optimization in Flexible Half-Duplex Networks With Transmitter/Receiver Scheduling
    Dayarathna, S ; Senanayake, R ; Evans, J (IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 2022-07)
    In this paper, we focus on the problem of transmitter and receiver scheduling to maximize the achievable sum-rate of a flexible half-duplex network where nodes have the flexibility to either transmit, receive or be silent in a given time slot. We consider a network with multiple transmitters and receivers where each transmitter has specific information it needs to send to a set of receiving nodes. First, we conduct some structural analysis and show that the achievable sum-rate is maximized when each transmitter only transmits to a single receiver at a given time. Next, we consider one instance of the flexible network and by reducing the symmetric multiple receiver network to a single receiver network, we also show that the achievable sum-rate is maximized when either one transmitter or all the transmitters transmit. In fact, there exists a unique received signal-to-noise ratio at which the optimality changes from all-to-one. Finally, we design a novel low-cost algorithm that gives a sub-optimal solution to the achievable sum-rate maximization problem in a flexible half-duplex network. We also provide a comprehensive comparison of the proposed algorithm with respect to existing resource allocation techniques, and observe that our proposed algorithm provides significant sum-rate gains.