K. R. Sahasranand
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
K. R. Sahasranand has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Himanshu Tyagi
Electrical Communication Engineering department, Indian Institute of Science, Bengaluru, India
3 shared publications - Ashish Joglekar
Robert Bosch Centre for CyberPhysical Systems and the AI and Robots Technology Park, Indian Institute of Science, Bengaluru, India
2 shared publications - Francis C. Joseph
Department of Electrical Engineering, Indian Institute of Science, Bengaluru, India
2 shared publications - Gurunath Gurrala
Department of Electrical Engineering, Indian Institute of Science, Bengaluru, India
2 shared publications - Aslan Tchamkerten
Télécom ParisTech
1 shared publication - Puneet Kumar
Department of Electrical Engineering, Indian Institute of Science at Bengaluru, Bengaluru, India
1 shared publication
Latest Publications
- 1 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 70 (10) , 6823-6833
Feedback Increases the Capacity of Queues With Bounded Service Times
- 1 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 70 (10) , 6823-6833
Feedback Increases the Capacity of Queues With Bounded Service Times
- 10 February 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Smart Grid
- Vol. 13 (3) , 2185-2196
Anomaly-Aware Adaptive Sampling for Electrical Signal Compression
Intelligent electronic devices for power systems often entail high frequency sampling of electric signals, enabled to capture anomalous signal behavior. However, in normal operation this oversampling is redundant and leads to excessive data being stored or transmitted. This gives rise to a new compression problem where the collected samples should be further subsampled and quantized based on the presence of an anomaly in the underlying signal. We propose an Anomaly-aware Compressive Sampler (ACS) which tests the signal for the presence of an anomaly in a block of samples, and subsamples in a hierarchical manner to retain the desired sampling rate. ACS has been designed keeping hardware constraints in mind, using integer operations, an appropriate bit-packing, a simple iterated delta filter, and a streaming data pipeline. We present a mathematical formulation of the problem and analyze the performance of ACS, establishing theoretically its ability to identify anomalies in the signal and adapt the sampling rate. ACS competes with the state-of-the-art algorithm for the better-behaved transmission system data from DOE/EPRI, and outperforms it significantly on real-time distribution system data recorded in our laboratory. Finally, ACS is lightweight and was implemented on an ARM processor.
- 10 February 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Smart Grid
- Vol. 13 (3) , 2185-2196
Anomaly-Aware Adaptive Sampling for Electrical Signal Compression
Intelligent electronic devices for power systems often entail high frequency sampling of electric signals, enabled to capture anomalous signal behavior. However, in normal operation this oversampling is redundant and leads to excessive data being stored or transmitted. This gives rise to a new compression problem where the collected samples should be further subsampled and quantized based on the presence of an anomaly in the underlying signal. We propose an Anomaly-aware Compressive Sampler (ACS) which tests the signal for the presence of an anomaly in a block of samples, and subsamples in a hierarchical manner to retain the desired sampling rate. ACS has been designed keeping hardware constraints in mind, using integer operations, an appropriate bit-packing, a simple iterated delta filter, and a streaming data pipeline. We present a mathematical formulation of the problem and analyze the performance of ACS, establishing theoretically its ability to identify anomalies in the signal and adapt the sampling rate. ACS competes with the state-of-the-art algorithm for the better-behaved transmission system data from DOE/EPRI, and outperforms it significantly on real-time distribution system data recorded in our laboratory. Finally, ACS is lightweight and was implemented on an ARM processor.
- 13 January 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Signal Processing Letters
- Vol. 29 (10709908) , 493-497
Dithered A/D Conversion of Bandlimited Signals Under Frequency Band Uncertainty
We propose a scheme for analog-to-digital (A/D) conversion of a signal that is bandlimited most of the time but contains harmonics of a high frequency occasionally. To enable the capture of the high frequency components, such signals are usually oversampled. This framework is of practical interest in the case of electrical signals wherein one encounters high frequency faults or anomalies from time to time, all of which need to be retained for diagnostic purposes. Existing schemes that rely on oversampling for dithered A/D conversion of bandlimited signals are designed for the worst case and do not take into account the fact that the high frequency anomalies occur rarely. We propose an adaptive A/D conversion scheme that identifies the presence or absence of a high frequency component in a given block of samples by formulating it as a hypothesis testing problem. The proposed scheme performs better in terms of compression compared to a scheme designed for the worst case while retaining the same guarantees on the reconstruction error.
- 13 January 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Signal Processing Letters
- Vol. 29 (10709908) , 493-497
Dithered A/D Conversion of Bandlimited Signals Under Frequency Band Uncertainty
We propose a scheme for analog-to-digital (A/D) conversion of a signal that is bandlimited most of the time but contains harmonics of a high frequency occasionally. To enable the capture of the high frequency components, such signals are usually oversampled. This framework is of practical interest in the case of electrical signals wherein one encounters high frequency faults or anomalies from time to time, all of which need to be retained for diagnostic purposes. Existing schemes that rely on oversampling for dithered A/D conversion of bandlimited signals are designed for the worst case and do not take into account the fact that the high frequency anomalies occur rarely. We propose an adaptive A/D conversion scheme that identifies the presence or absence of a high frequency component in a given block of samples by formulating it as a hypothesis testing problem. The proposed scheme performs better in terms of compression compared to a scheme designed for the worst case while retaining the same guarantees on the reconstruction error.
- Open Access
- 1 January 2022
- Published by Walter de Gruyter GmbH in Concrete Operators
- Vol. 9 (1) , 1-5
The p-norm of circulant matrices via Fourier analysis
A recent work derived expressions for the induced p-norm of a special class of circulant matrices A(n, a, b) ∈ ℝ n × n , with the diagonal entries equal to a ∈ ℝ and the off-diagonal entries equal to b ≥ 0. We provide shorter proofs for all the results therein using Fourier analysis. The key observation is that a circulant matrix is diagonalized by a DFT matrix. The results comprise an exact expression for ǁAǁ p , 1 ≤ p ≤ ∞, where A = A(n, a, b), a ≥ 0 and for ǁAǁ2 where A = A(n, −a, b), a ≥ 0; for the other p-norms of A(n, −a, b), 2 < p < ∞, upper and lower bounds are derived.
- 1 January 2022
- Published by Walter de Gruyter GmbH in Concrete Operators
- Vol. 9 (1) , 1-5
Open AccessThe p-norm of circulant matrices via Fourier analysis
A recent work derived expressions for the induced p-norm of a special class of circulant matrices A(n, a, b) ∈ ℝ n × n , with the diagonal entries equal to a ∈ ℝ and the off-diagonal entries equal to b ≥ 0. We provide shorter proofs for all the results therein using Fourier analysis. The key observation is that a circulant matrix is diagonalized by a DFT matrix. The results comprise an exact expression for ǁAǁ p , 1 ≤ p ≤ ∞, where A = A(n, a, b), a ≥ 0 and for ǁAǁ2 where A = A(n, −a, b), a ≥ 0; for the other p-norms of A(n, −a, b), 2 < p < ∞, upper and lower bounds are derived.
- Open Access
- 23 June 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 67 (9) , 6082-6095
Communication Complexity of Distributed High Dimensional Correlation Testing
We consider a two-party distributed hypothesis testing problem for correlated Gaussian random variables. For a d-dimensional random vector X and a scalar random variable Y, where X and Y are jointly Gaussian with an unknown correlation vector ρ, parties P 1 and P 2 observe independent copies of X and Y, respectively. The parties seek to test if their observations are correlated or not, namely they seek to test if ||ρ|| 2 exceeds τ or is it 0. To that end, they communicate interactively and declare the test output. We show that roughly order d/τ 2 bits of communication are sufficient and necessary for resolving the distributed correlation testing problem above. Furthermore, we establish a lower bound of roughly d 2 /τ 2 bits for the communication needed for distributed estimation of ρ, implying that distributed correlation testing requires less communication than distributed estimation. Both our lower bounds for testing and estimation hold for an arbitrary d and interactive communication with shared randomness, while our distributed test requires only one-way communication with shared randomness. For the one-dimensional case, with one-way communication and with probability of one of the error-types fixed, our bounds are more refined in the dependence on the other error-type and are tight even in the constant.
- 23 June 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 67 (9) , 6082-6095
Open AccessCommunication Complexity of Distributed High Dimensional Correlation Testing
We consider a two-party distributed hypothesis testing problem for correlated Gaussian random variables. For a d-dimensional random vector X and a scalar random variable Y, where X and Y are jointly Gaussian with an unknown correlation vector ρ, parties P 1 and P 2 observe independent copies of X and Y, respectively. The parties seek to test if their observations are correlated or not, namely they seek to test if ||ρ|| 2 exceeds τ or is it 0. To that end, they communicate interactively and declare the test output. We show that roughly order d/τ 2 bits of communication are sufficient and necessary for resolving the distributed correlation testing problem above. Furthermore, we establish a lower bound of roughly d 2 /τ 2 bits for the communication needed for distributed estimation of ρ, implying that distributed correlation testing requires less communication than distributed estimation. Both our lower bounds for testing and estimation hold for an arbitrary d and interactive communication with shared randomness, while our distributed test requires only one-way communication with shared randomness. For the one-dimensional case, with one-way communication and with probability of one of the error-types fixed, our bounds are more refined in the dependence on the other error-type and are tight even in the constant.
- 10 May 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Instrumentation and Measurement
- Vol. 70 (00189456) , 1-12
Open-Source Heterogeneous Constrained Edge-Computing Platform for Smart Grid Measurements
This article presents a low-cost, open-source, heterogeneous, resource-constrained hardware platform called “Parallella” as a measurement device for edge-computing applications research in smart grid. The unique hardware architecture of the Parallella provides a multitude of edge-computing resources in the form of a Zynq SoC (dual-core ARM + FPGA) and a 16-core co-processor called Epiphany. A multifunctional intelligent electronic device (IED) design is demonstrated to showcase the capabilities of the platform. A custom I/O board has been developed for the desktop and embedded versions of Parallella, which can be interfaced with external daughter boards and peripherals for measurements. One such daughter board is an analog sensing board, which can measure voltages of all the three phases and four line currents using a 16-bit synchronous ADC set at 32 kHz. The ADC samples are synchronized to the PPS time clock of a GPS unit for providing global time reference. These captured seven-channel raw waveform data are sent to a cloud server over a bandwidth-limited communication channel using a custom anomaly-aware data compression algorithm implemented on the ARM. A phasor measurement algorithm using the Teager energy operator (TEO) is implemented on the field-programmable gate array (FPGA). A parallel power quality (PQ) measurement algorithm is implemented on the Epiphany. The obtained measurements are found to be comparable to a commercial power analyzer.
- 10 May 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Instrumentation and Measurement
- Vol. 70 (00189456) , 1-12
Open-Source Heterogeneous Constrained Edge-Computing Platform for Smart Grid Measurements
This article presents a low-cost, open-source, heterogeneous, resource-constrained hardware platform called “Parallella” as a measurement device for edge-computing applications research in smart grid. The unique hardware architecture of the Parallella provides a multitude of edge-computing resources in the form of a Zynq SoC (dual-core ARM + FPGA) and a 16-core co-processor called Epiphany. A multifunctional intelligent electronic device (IED) design is demonstrated to showcase the capabilities of the platform. A custom I/O board has been developed for the desktop and embedded versions of Parallella, which can be interfaced with external daughter boards and peripherals for measurements. One such daughter board is an analog sensing board, which can measure voltages of all the three phases and four line currents using a 16-bit synchronous ADC set at 32 kHz. The ADC samples are synchronized to the PPS time clock of a GPS unit for providing global time reference. These captured seven-channel raw waveform data are sent to a cloud server over a bandwidth-limited communication channel using a custom anomaly-aware data compression algorithm implemented on the ARM. A phasor measurement algorithm using the Teager energy operator (TEO) is implemented on the field-programmable gate array (FPGA). A parallel power quality (PQ) measurement algorithm is implemented on the Epiphany. The obtained measurements are found to be comparable to a commercial power analyzer.