Swaroop Gopalam
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Swaroop Gopalam has a total of 20 co-authors. Here are the top co-authors by number of shared publications:
- Stephen Vaughan Hanly
School of Engineering, Macquarie University, Sydney, NSW, Australia
12 shared publications - Iain B. Collings
School of Engineering, Macquarie University, Sydney, NSW, Australia
8 shared publications - Philip Whiting
School of Engineering, Macquarie University, Sydney, NSW, Australia
7 shared publications - Hazer Inaltekin
School of Engineering, Macquarie University, North Ryde, NSW, Australia
6 shared publications Hazer Inaltekin
School of Engineering, Macquarie University
5 shared publicationsPhilip Whiting
School of Engineering, Macquarie University
4 shared publications
Latest Publications
- Open Access
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of the Communications Society
- Vol. 7, 11653-11675
Distributed IoT With LEO Satellites: Optimal Attempt Rate Schemes With Low Feedback
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of the Communications Society
- Vol. 7, 11653-11675
Open AccessDistributed IoT With LEO Satellites: Optimal Attempt Rate Schemes With Low Feedback
- Open Access
- 3 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in TechRxiv
Base Station Beam Scheduling for mmWave Networks with Full-Frequency Reuse
This paper considers mmWave networks with full-frequency reuse, where each base station (BS) employs a hybrid beamforming (HBF) architecture. We propose a beam scheduling scheme that guarantees UEs' target rates, using the smallest possible number of slots at each BS in each transmission block. We avoid intra-BS interference by enforcing constraints that ensure UEs in adjacent spacial areas are not scheduled simultaneously. We formulate the beam scheduling task as a stochastic mixed-integer nonconvex time allocation problem, allocating time to UE-BS links, and provide a novel iterative algorithm that solves the problem. In each iteration there are three stages. Stage one optimizes the time-fraction allocation for UE-BS links given an estimate of UE rates in each transmission block. Stage two allocates these time-fractions to beams at each BS using a sand-filling policy. Stage three schedules the beams, and updates the estimate of UE rates in each block. We consider HBF with a zero-forcing (ZF) digital component, and compare its performance to a pure analog beamformer (i.e. using the same analog beams, but without the ZF digital component). Numerical results reveal that our proposed scheme significantly outperforms round-robin (RR) baseline schemes, and that pure analog beamforming actually outperforms HBF.
- 3 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in TechRxiv
Open AccessBase Station Beam Scheduling for mmWave Networks with Full-Frequency Reuse
This paper considers mmWave networks with full-frequency reuse, where each base station (BS) employs a hybrid beamforming (HBF) architecture. We propose a beam scheduling scheme that guarantees UEs' target rates, using the smallest possible number of slots at each BS in each transmission block. We avoid intra-BS interference by enforcing constraints that ensure UEs in adjacent spacial areas are not scheduled simultaneously. We formulate the beam scheduling task as a stochastic mixed-integer nonconvex time allocation problem, allocating time to UE-BS links, and provide a novel iterative algorithm that solves the problem. In each iteration there are three stages. Stage one optimizes the time-fraction allocation for UE-BS links given an estimate of UE rates in each transmission block. Stage two allocates these time-fractions to beams at each BS using a sand-filling policy. Stage three schedules the beams, and updates the estimate of UE rates in each block. We consider HBF with a zero-forcing (ZF) digital component, and compare its performance to a pure analog beamformer (i.e. using the same analog beams, but without the ZF digital component). Numerical results reveal that our proposed scheme significantly outperforms round-robin (RR) baseline schemes, and that pure analog beamforming actually outperforms HBF.
- Open Access
- 13 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of the Communications Society
- Vol. 5, 7400-7418
Distributed IoT Communications With LEO Satellites: QoS Performance and Terminal Attempt Rate Schemes
Low Earth Orbit (LEO) satellites are increasingly being used to provide connectivity for wide area Internet of Things (IoT) sensing applications. Distributed IoT terminals are not able to coordinate their uplink transmissions to the nano-satellites, and so operate in a grant-free mode. Quality-of-Service (QoS) depends on the transmission attempt success statistics, which are time-varying. This paper presents asymptotic analysis results that characterize the IoT terminal’s transmission success process. We show that it converges to an inhomogeneous Poisson process, in the large population regime, and characterize the time-dependent intensity as a function of the terminal location and the attempt rate scheme. We also propose three terminal attempt rate schemes that are solutions to max-min optimization problems. The performance of the proposed schemes are compared in terms of individual terminal QoS as well as the population-wide QoS distribution. Performance for various IoT applications is also presented.
- 13 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of the Communications Society
- Vol. 5, 7400-7418
Open AccessDistributed IoT Communications With LEO Satellites: QoS Performance and Terminal Attempt Rate Schemes
Low Earth Orbit (LEO) satellites are increasingly being used to provide connectivity for wide area Internet of Things (IoT) sensing applications. Distributed IoT terminals are not able to coordinate their uplink transmissions to the nano-satellites, and so operate in a grant-free mode. Quality-of-Service (QoS) depends on the transmission attempt success statistics, which are time-varying. This paper presents asymptotic analysis results that characterize the IoT terminal’s transmission success process. We show that it converges to an inhomogeneous Poisson process, in the large population regime, and characterize the time-dependent intensity as a function of the terminal location and the attempt rate scheme. We also propose three terminal attempt rate schemes that are solutions to max-min optimization problems. The performance of the proposed schemes are compared in terms of individual terminal QoS as well as the population-wide QoS distribution. Performance for various IoT applications is also presented.
- Open Access
- 23 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in TechRxiv
General Delay-Doppler Domain Signalling using Periodic Discrete Weyl-Heisenberg Sets and Analog Twisted Convolution Filters
In this paper, we present a new general delay-Doppler (DD) signalling framework that uses periodic discrete Weyl-Heisenberg (PD-WH) systems for data modulation and analog twisted convolution filters for pulse shaping. We show that the input-output (I/O) relationship of a modulation scheme under this framework, depends only on discrete DD channel taps and the ambiguity function of the PD-WH prototype pulse. We show that the I/O relationship of a scheme is predictable if the prototype ambiguity function has a bed-of-nails structure that is suited to the spreads of the discrete DD channel, so that DD aliasing is prevented. We propose DD modulation using a linear chirp prototype pulse and show that it has a predictable I/O relationship. It also has a slightly better symbol-error-rate performance compared to Zak-OTFS, in numerical simulation. We also develop a new composite pilot response technique for underspread DD channel measurement (for schemes with non-predictable I/O relationships) and also for overspread DD channel measurement (for schemes with predictable I/O relationships).
- 23 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in TechRxiv
Open AccessGeneral Delay-Doppler Domain Signalling using Periodic Discrete Weyl-Heisenberg Sets and Analog Twisted Convolution Filters
In this paper, we present a new general delay-Doppler (DD) signalling framework that uses periodic discrete Weyl-Heisenberg (PD-WH) systems for data modulation and analog twisted convolution filters for pulse shaping. We show that the input-output (I/O) relationship of a modulation scheme under this framework, depends only on discrete DD channel taps and the ambiguity function of the PD-WH prototype pulse. We show that the I/O relationship of a scheme is predictable if the prototype ambiguity function has a bed-of-nails structure that is suited to the spreads of the discrete DD channel, so that DD aliasing is prevented. We propose DD modulation using a linear chirp prototype pulse and show that it has a predictable I/O relationship. It also has a slightly better symbol-error-rate performance compared to Zak-OTFS, in numerical simulation. We also develop a new composite pilot response technique for underspread DD channel measurement (for schemes with non-predictable I/O relationships) and also for overspread DD channel measurement (for schemes with predictable I/O relationships).
- Open Access
- 20 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in TechRxiv
Distributed IoT Communications with LEO Satellites: QoS Performance and Terminal Attempt Rate Schemes
Low Earth Orbit (LEO) satellites are increasingly being used to provide connectivity for wide area Internet of Things (IoT) sensing applications. Since distributed IoT terminals are not able to coordinate their transmissions with each other to avoid packet collisions, Quality-of-Service (QoS) depends on the transmission attempt success statistics, which are time-varying. This paper presents asymptotic analysis results that characterize the IoT terminal's transmission attempt and success processes. We show that they converge to inhomogeneous Poisson processes, in the large population regime, and characterize the timedependent intensities as functions of the terminal locations and the attempt rate scheme. We also propose three terminal attempt rate schemes that are solutions to max-min optimization problems. The performance of the proposed schemes are compared in terms of individual terminal QoS as well as the populationwide QoS distribution. Performance for various IoT applications is also presented, using our asymptotic Poisson limit results.
- 20 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in TechRxiv
Open AccessDistributed IoT Communications with LEO Satellites: QoS Performance and Terminal Attempt Rate Schemes
Low Earth Orbit (LEO) satellites are increasingly being used to provide connectivity for wide area Internet of Things (IoT) sensing applications. Since distributed IoT terminals are not able to coordinate their transmissions with each other to avoid packet collisions, Quality-of-Service (QoS) depends on the transmission attempt success statistics, which are time-varying. This paper presents asymptotic analysis results that characterize the IoT terminal's transmission attempt and success processes. We show that they converge to inhomogeneous Poisson processes, in the large population regime, and characterize the timedependent intensities as functions of the terminal locations and the attempt rate scheme. We also propose three terminal attempt rate schemes that are solutions to max-min optimization problems. The performance of the proposed schemes are compared in terms of individual terminal QoS as well as the populationwide QoS distribution. Performance for various IoT applications is also presented, using our asymptotic Poisson limit results.
- 31 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 73 (12) , 18787-18797
UAV Communications With Dipole Antennas
This paper presents a new connectivity model for UAV-to-ground communication, when the UAV has a dipole antenna. Our model includes the impact of antenna length and impedance, on the radiation pattern. We present a new multi-ring two-tier connectivity model and show that the ground coverage area from the UAV consists of multiple circular annuli. We use the model to find the expected number of connected UEs for a given UAV height, and use it to optimize flying height. We present height optimization results for various dipole antenna lengths, and show the relationship with effective bandwidth.
- 31 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 73 (12) , 18787-18797
UAV Communications With Dipole Antennas
This paper presents a new connectivity model for UAV-to-ground communication, when the UAV has a dipole antenna. Our model includes the impact of antenna length and impedance, on the radiation pattern. We present a new multi-ring two-tier connectivity model and show that the ground coverage area from the UAV consists of multiple circular annuli. We use the model to find the expected number of connected UEs for a given UAV height, and use it to optimize flying height. We present height optimization results for various dipole antenna lengths, and show the relationship with effective bandwidth.
- Open Access
- 19 June 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of the Communications Society
- Vol. 5, 4462-4482
Optimal Zak-OTFS Receiver and Its Relation to the Radar Matched Filter
This paper presents optimal receiver implementations for Zak-OTFS modulation. Zak-OTFS has a receiver structure that includes a twisted convolution filter followed by delay-Doppler domain sampling. We first show that this receiver is equivalent to a correlation demodulator where the receive pulses are determined by the choice of the receive delay-Doppler domain twisted convolution (TC) filter. We formulate the notion of a matched TC filter as the receive TC filter that maximizes the SNR in an additive white Gaussian noise (AWGN) channel, for a given transmit TC filter. We show that the matched TC filter formulation is crucial for understanding noise processes in the delay-Doppler domain. More generally, for a doubly dispersive channel, we define a receive TC filter that is matched to the twisted convolution of the channel with the transmit TC filter. We show that this receive TC filter, sampled at the delay-Doppler grid points is the optimal Zak-OTFS receiver that recovers sufficient statistics for maximum likelihood detection of the data symbols. We first present an implementation of this optimal receiver for a general sparse doubly dispersive channel which requires radar matched filter processing and involves computing ambiguity functions. We then present a second implementation that uses a receive TC filter that is matched to the transmit TC filter (not the channel) and only requires time and frequency windowing. We show that these two approaches converge when the window supports are large relative to the fundamental periods of the delay-Doppler grid. We also show that the second approach has an interpretation as a rake receiver operating in the delay-Doppler domain.
- 19 June 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of the Communications Society
- Vol. 5, 4462-4482
Open AccessOptimal Zak-OTFS Receiver and Its Relation to the Radar Matched Filter
This paper presents optimal receiver implementations for Zak-OTFS modulation. Zak-OTFS has a receiver structure that includes a twisted convolution filter followed by delay-Doppler domain sampling. We first show that this receiver is equivalent to a correlation demodulator where the receive pulses are determined by the choice of the receive delay-Doppler domain twisted convolution (TC) filter. We formulate the notion of a matched TC filter as the receive TC filter that maximizes the SNR in an additive white Gaussian noise (AWGN) channel, for a given transmit TC filter. We show that the matched TC filter formulation is crucial for understanding noise processes in the delay-Doppler domain. More generally, for a doubly dispersive channel, we define a receive TC filter that is matched to the twisted convolution of the channel with the transmit TC filter. We show that this receive TC filter, sampled at the delay-Doppler grid points is the optimal Zak-OTFS receiver that recovers sufficient statistics for maximum likelihood detection of the data symbols. We first present an implementation of this optimal receiver for a general sparse doubly dispersive channel which requires radar matched filter processing and involves computing ambiguity functions. We then present a second implementation that uses a receive TC filter that is matched to the transmit TC filter (not the channel) and only requires time and frequency windowing. We show that these two approaches converge when the window supports are large relative to the fundamental periods of the delay-Doppler grid. We also show that the second approach has an interpretation as a rake receiver operating in the delay-Doppler domain.
- Open Access
- 20 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in TechRxiv
Joint Beam Allocation and Scheduling for mmWave Cellular Networks
A document by Swaroop Gopalam . Click on the document to view its contents.
- 20 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in TechRxiv
Open AccessJoint Beam Allocation and Scheduling for mmWave Cellular Networks
A document by Swaroop Gopalam . Click on the document to view its contents.
- Open Access
- 13 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in TechRxiv
A New Micro-Subcarrier OFDM-Based Waveform for Delay Doppler Domain Communication
This paper presents a new OFDM based modulation scheme for communication in doubly dispersive channels. We call this Delay-Doppler OFDM (DD-OFDM). Our waveform has the same sparse-channel benefits as orthogonal-time-frequency-space (OTFS) modulation, while offering advantages in terms of simpler channel estimation, lower symbol error rate and lower out-of-band (OOB) emissions. We propose the DD-OFDM modulation scheme by introducing precoding across frames of frequency subcarriers. We show that the resulting waveform has different data carrying basis functions compared to OTFS modulation. We present the DD-OFDM receiver and derive the base-band model equations. We show that the base-band model for DD-OFDM leads to a simple and accurate channel estimation algorithm in non-integer fractional Doppler channels.
- 13 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in TechRxiv
Open AccessA New Micro-Subcarrier OFDM-Based Waveform for Delay Doppler Domain Communication
This paper presents a new OFDM based modulation scheme for communication in doubly dispersive channels. We call this Delay-Doppler OFDM (DD-OFDM). Our waveform has the same sparse-channel benefits as orthogonal-time-frequency-space (OTFS) modulation, while offering advantages in terms of simpler channel estimation, lower symbol error rate and lower out-of-band (OOB) emissions. We propose the DD-OFDM modulation scheme by introducing precoding across frames of frequency subcarriers. We show that the resulting waveform has different data carrying basis functions compared to OTFS modulation. We present the DD-OFDM receiver and derive the base-band model equations. We show that the base-band model for DD-OFDM leads to a simple and accurate channel estimation algorithm in non-integer fractional Doppler channels.
- 13 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 70 (8) , 5624-5639
Joint Beam Allocation and Scheduling for mmWave Cellular Networks
This paper provides capacity results for multi-user mm-wave hybrid-beamforming, and presents optimal joint beam allocation and user scheduling algorithms. We characterize the downlink capacity of a practical system with quantized analog beamforming code-books under the constraint that users cannot be scheduled at the same time if they are closer together than a beam width in angle. We show that the capacity region is determined by a small number of linear inequality constraints. We also present capacity-achieving scheduling algorithms that provide beam allocations guaranteeing that user rate requirements are met within each resource block. In particular, we propose “sand-filling” algorithms that are provably optimal and which have linear complexity. Intuitively, our schemes can be viewed in terms of filling containers with coloured sand, in such a way that the colours at any given height do not conflict with the colours in the other containers at the same height, where the containers represent the RF chains (i.e. the beamforming resources), and the coloured sand represents the users (and their rate requirements). We show a numerical example where the capacity of our scheme is 82% higher than a traditional resource partitioning scheme.
- 13 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 70 (8) , 5624-5639
Joint Beam Allocation and Scheduling for mmWave Cellular Networks
This paper provides capacity results for multi-user mm-wave hybrid-beamforming, and presents optimal joint beam allocation and user scheduling algorithms. We characterize the downlink capacity of a practical system with quantized analog beamforming code-books under the constraint that users cannot be scheduled at the same time if they are closer together than a beam width in angle. We show that the capacity region is determined by a small number of linear inequality constraints. We also present capacity-achieving scheduling algorithms that provide beam allocations guaranteeing that user rate requirements are met within each resource block. In particular, we propose “sand-filling” algorithms that are provably optimal and which have linear complexity. Intuitively, our schemes can be viewed in terms of filling containers with coloured sand, in such a way that the colours at any given height do not conflict with the colours in the other containers at the same height, where the containers represent the RF chains (i.e. the beamforming resources), and the coloured sand represents the users (and their rate requirements). We show a numerical example where the capacity of our scheme is 82% higher than a traditional resource partitioning scheme.