Raghuraman Mudumbai

Raghuraman Mudumbai

Auto-generated profile, based on publicly available information

Raghuraman Mudumbai

Department of Electrical & Computer Engineering University of Iowa Iowa 52242 City IA

Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 April 2009
Verified
Conference Paper
Closed access
RMR. Mudumbai
R. Mudumbai
SSS. K. Singh
S. K. Singh
UMU. Madhow
U. Madhow
We investigate an architecture for multi-Gigabit outdoor mesh networks operating in the unlicensed 60 GHz "millimeter (mm) wave" band. In this band, the use of narrow beams is essential for attaining the required link ranges in order to overcome the higher path loss at mm wave carrier frequencies. However, highly directional links make standard MAC methods for interference management, such as carrier sense multiple access, which rely on neighboring nodes hearing each other, become inapplicable. In this paper, we study the extent to which we can reduce, or even dispense with, interference management, by exploiting the reduction in interference due to the narrow beamwidths and the oxygen absorption characteristic of the 60 GHz band. We provide a probabilistic analysis of the interference incurred due to uncoordinated transmissions, and show that, for the parameters considered, the links in the network can be thought of as pseudo-wired. That is, interference can essentially be ignored in MAC design, and the challenge is to schedule half-duplex transmissions in the face of the "deafness" resulting from highly directional links. We provide preliminary simulation results to validate our approach.

10 April 2018 in IEEE Access
Verified
Journal Article
Open access
TATomohiro Arakawa
Tomohiro Arakawa
SGSairam Goguri
Sairam Goguri
JKJames V. Krogmeier
James V. Krogmeier
AKAnton Kruger
Anton Kruger
DLDavid J. Love
David J. Love
MSMatthew A. Swabey
Matthew A. Swabey
The widespread need for ubiquitous power delivery is driving the commercialization of inductive wireless power transfer (WPT). Wireless power transfer systems, however, are plagued by low efficiency. To combat this, we propose a new approach to maximize the efficiency of inductive WPT using multiple coil charging systems. The use of multiple coils can potentially allow the system to efficiently adapt to magnetic field propagation conditions, similar to the way multiple antennas are used to adapt to channel conditions in wireless communication systems. We consider a multiple-input single-output (MISO) WPT system using near-field inductive coupling. While such systems have been extensively studied in previous work using lumped resistance, inductance, and capacitance (RLC) circuit models to analyze their behavior, the difficulty of constructing tractable and realistic circuit models has limited the ability to accurately predict and optimize the performance of these systems. The main innovation in our work is to take a more abstract approach to modeling the WPT system as a linear circuit whose input-output relationship is expressed in terms of a small number of unknown parameters that can be thought of as transimpedances and gains. The crucial advantage of this approach is the economy of the representation, i.e., the number of unknown model parameters can be much smaller than the number of lumped circuit elements required for a complete and accurate RLC circuit representation. We present simple derivations for the optimal voltage excitations to be applied at the transmitters to maximize power transfer efficiency as well as suboptimal excitations which are less computationally intensive. A simple procedure, which we call circuit sounding, for estimating the unknown parameters using a small set of direct measurements is described. We outline a series of experiments with four transmit coils and two receive coils that verify the model and show that the optimal solution can achieve higher efficiencies than those of previously known methods.

24 September 2018 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
SGSairam Goguri
Sairam Goguri
DODennis Ogbe
Dennis Ogbe
SDSoura Dasgupta
Soura Dasgupta
RMRaghuraman Mudumbai
Raghuraman Mudumbai
DBD. Richard Brown
D. Richard Brown
UMUpamanyu Madhow
Upamanyu Madhow
We consider the problem of optimal precoder design for a multi-input single-output wideband wireless system to maximize two different figures of merit: the total communication capacity and the total received power, subject to individual power constraints on each transmit element. We show that the two optimal precoders satisfy a Separation Principle that reveals a simple structure for these precoders. We use this Separation Principle extensively to derive several interesting properties of these two optimal precoders. Some key analytical results are as follows. We show that the power-maximizing precoders must concentrate all their energy in a small number of active channels that cannot exceed the number of input terminals. The capacitymaximizing precoder turns out to be very different from the classical waterfilling solutions and also very different from the power-maximizing precoders except at asymptotically low SNRs where the power-maximizing precoders also maximize capacity. We also show that the capacity of the wideband system is lowerbounded by the sum-rate of a multiple-access channel with the same channel gains and power constraints. Finally, the Separation Principle also yields simple fixed-point algorithms that allow for the efficient numerical computation of the two optimal precoders.

7 November 2016 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Open access
AKAmy Kumar
Amy Kumar
RMRaghuraman Mudumbai
Raghuraman Mudumbai
SDSoura Dasgupta
Soura Dasgupta
UMUpamanyu Madhow
Upamanyu Madhow
DBD. Richard Brown
D. Richard Brown
We consider the problem of multicasting a common message signal from a distributed array of wireless transceivers by beamforming to a set of beam targets, while simultaneously protecting a set of null targets by nullforming to them. We describe a distributed algorithm in which each transmitter iteratively adapts its complex transmit weight using common aggregate feedback messages broadcast by the targets, and the local knowledge of only its own channel gains to the targets. This knowledge can be obtained using reciprocity without any explicit feedback. The algorithm minimizes the mean square error between the complex signal amplitudes at the targets and their desired values. We prove convergence of the algorithm, present geometric interpretations, characterize initializations that lead to minimum total transmit power, and prescribe designs for such initializations. We show that the convergence speed is nondecreasing in the number of transmitters N if a step size parameter is kept constant. For Rayleigh fading channels, as N goes to infinity: 1) convergence can be made arbitrarily fast and 2) beams and nulls can be achieved with vanishing total transmit power even with noise, both with probability one. These results add up to some remarkable scalability properties: the feedback overhead does not grow with the number of transmitters, and with high probability, the algorithm can be configured to converge arbitrarily fast and use vanishingly small total transmit power.

1 December 2011
Verified
Conference Paper
Closed access
RMRaghuraman Mudumbai
Raghuraman Mudumbai
SDSoura Dasgupta
Soura Dasgupta
BCBrian B. Cho
Brian B. Cho
In this paper, we present a simple, distributed algorithm for frequency control and optimal economic dispatch of power generators. In this algorithm each generator independently adjusts its power-frequency set-points of generators to correct for generation and load fluctuations using only the aggregate power imbalance in the network, which can be observed by each generator through local measurements of the frequency deviation on the grid. In the absence of power losses, we prove that the distributed algorithm eventually achieves optimality i.e. minimum cost power allocations, under mild assumptions (strict convexity and positivity of cost functions); we also present numerical results from simulations to compare its performance with traditional (centralized) dispatch algorithms. Furthermore, we show that the performance of the algorithm is robust in the sense that even with power losses it corrects for frequency deviations, and for low levels of losses, it still achieves near-optimal allocations; we present an approximate analysis to quantify the resulting suboptimality.

1 January 2011 in IFAC Proceedings Volumes
Verified
Journal Article
Closed access
PDF file
MRMuhammad Mahboob-Ur Rahman
Muhammad Mahboob-Ur Rahman
RMRaghuraman Mudumbai
Raghuraman Mudumbai
SDSoura Dasgupta
Soura Dasgupta