Electrical and Electronic Engineering - Research Publications
Permanent URI for this collection
Search Results
1 - 10 of 16
-
ItemNo Preview AvailableFrequency Permutations for Joint Radar and Communications(IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 2022-11)
-
ItemNo Preview AvailableOptimum Reconfigurable Intelligent Surface Selection for Wireless Networks(IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 2022-09)
-
ItemNo Preview AvailableCapacity Bounds for One-Bit MIMO Gaussian Channels With Analog Combining(IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 2022-11)
-
ItemNo Preview AvailableOn the Capacity-Achieving Input of Channels With Phase Quantization(IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 2022-09)
-
ItemNo Preview AvailableOn the Capacity-Achieving Input of the Gaussian Channel With Polar Quantization(IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 2022-09)
-
ItemMaximizing Sum-Rate via Relay Selection and Power Control in Dual-Hop Networks(IEEE, 2022)In this paper, we focus on the sum-rate optimization problem in a general dual-hop relay network by considering the joint relay selection and power control in the presence of interference. First, we propose a new relay selection algorithm which has better sum-rate performance than the existing relay selection techniques. Then we combine relay selection and power control to propose a novel iterative algorithm based on the tight lower bound approximation which maximizes the achievable sum-rate. We also prove that for the special case of two-user networks, binary power allocation is optimum for at least two transmitting nodes. Extensive numerical examples are used to compare the performance of the proposed algorithm and to illustrate the accuracy of the analysis.
-
ItemOptimal Routing for Multi-User Multi-Hop Relay Networks Via Dynamic Programming(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.
-
ItemSum-Rate Optimization in Flexible Half-Duplex Networks With Transmitter/Receiver Scheduling(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.
-
ItemReliability Characterization for SIMO Communication Systems With Low-Resolution Phase Quantization Under Rayleigh Fading(IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 2021)
-
ItemLow-Resolution Quantization in Phase Modulated Systems: Optimum Detectors and Error Rate Analysis(Institute of Electrical and Electronics Engineers (IEEE), 2020-07-20)This paper studies optimum detectors and error rate analysis for wireless systems with low-resolution quantizers in the presence of fading and noise. A universal lower bound on the average symbol error probability ( SEP ), correct for all M -ary modulation schemes, is obtained when the number of quantization bits is not enough to resolve M signal points. In the special case of M -ary phase shift keying ( M -PSK), the maximum likelihood detector is derived. Utilizing the structure of the derived detector, a general average SEP expression for M -PSK modulation with n -bit quantization is obtained when the wireless channel is subject to fading with a circularly-symmetric distribution. For the Nakagami- m fading, it is shown that a transceiver architecture with n -bit quantization is asymptotically optimum in terms of communication reliability if n≥log2M+1 . That is, the decay exponent for the average SEP is the same and equal to m with infinite-bit and n -bit quantizers for n≥log2M+1 . On the other hand, it is only equal to 12 and 0 for n=log2M and n