Rahul Devassy
YOU?
Author Swipe
Shannon Capacity of LOS MIMO Channels with Uniform Circular Arrays Open
The Shannon capacity for the line-of-sight (LOS) multiple-input multiple-output (MIMO) channel between two perfectly aligned uniform circular arrays (UCAs) is derived from the first principles in a tutorial fashion. It is well known that h…
Short-Packet Transmission via Variable-Length Codes in the Presence of Noisy Stop Feedback Open
We present an upper bound on the error probability achievable using variable-length stop feedback codes, for a fixed size of the information payload and a given constraint on the maximum latency and the average service time. Differently fr…
Short-packet Transmission via Variable-Length Codes in the Presence of\n Noisy Stop Feedback Open
We present an upper bound on the error probability achievable using\nvariable-length stop feedback codes, for a fixed size of the information\npayload and a given constraint on the maximum latency and the average service\ntime. Differently…
Peak-Age Violation Guarantees for the Transmission of Short Packets over Fading Channels Open
We investigate the probability that the peak age of information in a point-to-point communication system operating over a multiantenna wireless fading channel exceeds a predetermined value. The packets are scheduled according to a last-com…
Peak-Age Violation Guarantees for the Transmission of Short Packets over\n Fading Channels Open
We investigate the probability that the peak age of information in a\npoint-to-point communication system operating over a multiantenna wireless\nfading channel exceeds a predetermined value. The packets are scheduled\naccording to a last-…
Peak-Age Violation Guarantees for the Transmission of Short Packets over Fading Channels Open
We investigate the probability that the peak age of information in a point-to-point communication system operating over a multiantenna wireless fading channel exceeds a predetermined value. The packets are scheduled according to a last-com…
Reliable Transmission of Short Packets Through Queues and Noisy Channels Under Latency and Peak-Age Violation Guarantees Open
This paper investigates the probability that the delay and the peak-age of information exceed a desired threshold in a point-to-point communication system with short information packets. The packets are generated according to a stationary …
Low-Latency Short-Packet Transmissions: Fixed Length or HARQ? Open
We study short-packet communications, subject to latency and reliability constraints, under the premises of limited frequency diversity and no time diversity. The question addressed is whether, and when, hybrid automatic repeat request (HA…
Low-Latency Short-Packet Transmissions: Fixed Length or HARQ? Open
We study short-packet communications, subject to latency and reliability constraints, under the premises of limited frequency diversity and no time diversity. The question addressed is whether, and when, hybrid automatic repeat request (HA…
Reliable Transmission of Short Packets through Queues and Noisy Channels under Latency and Peak-Age Violation Guarantees Open
This work investigates the probability that the delay and the peak-age of information exceed a desired threshold in a point-to-point communication system with short information packets. The packets are generated according to a stationary m…
Delay and Peak-Age Violation Probability in Short-Packet Transmissions Open
This paper investigates the distribution of delay and peak age of information in a communication system where packets, generated according to an independent and identically distributed Bernoulli process, are placed in a single-server queue…
Delay and Peak-Age Violation Probability in Short-Packet Transmissions Open
This paper investigates the distribution of delay and peak age of information in a communication system where packets, generated according to an independent and identically distributed Bernoulli process, are placed in a single-server queue…
Nonasymptotic coding-rate bounds for binary erasure channels with feedback Open
We present nonasymptotic achievability and converse bounds on the maximum coding rate (for a fixed average error probability and a fixed average blocklength) of variable-length full-feedback (VLF) and variable-length stop-feedback (VLSF) c…
Bounds on the maximum coding rate of multiple-access channels and feedback channels Open
We provide upper and lower bounds on the coding rate of multiple-access channels (MACs) and feedback channels.\nTraditional MACs have been extensively studied under the assumption of availability of perfect channel state information (CSI).…