Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Siddharth Ray

dblp:09/6919 · DBLP profile ↗
← Back
9ranked-venue papers
7as first author
0since 2021 · last 2011
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 4 · 2 first-authorApplied, interdisciplinary, general and emerging computing · 4 · 4 first-authorTheory of computation · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
2 papers
Physical-layer communications · 66% Optical networks · 26% Network optimization and economics · 8%
Theoretical computer science
1 paper
Information theory · 100%

Topics — the 8 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Physical-layer communications
MIMO
0.222011
Fiber Aided Wireless Network Architecture · IEEE J. Sel. Areas Commun. 2011
On Noncoherent MIMO Channels in the Wideband Regime: Capacity and Reliability · IEEE Trans. Inf. Theory 2007
Optical networks › optical access network
fiber-wireless integration
0.112011
Fiber Aided Wireless Network Architecture · IEEE J. Sel. Areas Commun. 2011
Physical-layer communications › MIMO › noncoherent communication
noncoherent MIMO
0.112007
On Noncoherent MIMO Channels in the Wideband Regime: Capacity and Reliability · IEEE Trans. Inf. Theory 2007
Information theory
channel capacity
0.112007
On Noncoherent MIMO Channels in the Wideband Regime: Capacity and Reliability · IEEE Trans. Inf. Theory 2007
Information theory › channel capacity › low-SNR analysis
wideband regime
0.112007
On Noncoherent MIMO Channels in the Wideband Regime: Capacity and Reliability · IEEE Trans. Inf. Theory 2007
Network optimization and economics › resource allocation
capacity allocation
0.012011
Fiber Aided Wireless Network Architecture · IEEE J. Sel. Areas Commun. 2011
Physical-layer communications › fading channels
block-fading channel
0.012007
On Noncoherent MIMO Channels in the Wideband Regime: Capacity and Reliability · IEEE Trans. Inf. Theory 2007
Physical-layer communications
fading channels
0.012007
On Noncoherent MIMO Channels in the Wideband Regime: Capacity and Reliability · IEEE Trans. Inf. Theory 2007

Methods — techniques the papers use, named apart from their topics

capacity analysis · 0.3signaling scheme design · 0.1error probability analysis · 0.1quantization · 0.1
YearPublicationVenuePosition
2011 Uplink Resource Allocation for Frequency Selective Channels and Fractional Power Control in LTE
abstract
We consider the allocation of spectral and power resources every subframe (1 ms) on the uplink of the Long Term Evolution (LTE) wideband orthogonal frequency division multiple access (OFDMA) cellular network. System bandwidth is divided into multiple sub-bands. The fractional power control to manage interference is allowed to be sub-band dependent. Moreover, the channel gains from the base-station to the mobiles (user equipment (UE) in LTE) can vary with the sub-band. The power and spectral resources are to be allocated among different UEs in a cell based on channel conditions, desired fairness/QoS, and constraints on power due to interference and power limitation at a UE. For N UEs and M sub-bands, we exploit the structure of the underlying optimization problem to obtain an interior point method for optimal resource allocation where each Newton step has complexity O(NM). To implement this in an OFDMA system, we delineate a simple control signalling structure where the UE computes in O(M) time a waterfllling solution every subframe it is assigned resources. When the allocation is restricted to contiguous allocation in frequency due to single carrier constraint in LTE, we convert the solution computed above into a feasible solution in O(NM) time. For typical network scenarios, the solution thus computed is numerically shown to be very close to the optimal solution without the contiguous constraint.
Ritesh Madan, Siddharth Ray
ICC2
2011 M2M over CDMA2000 1x case studies
abstract
In recent years, M2M (machine to machine) communications has increasingly been seen as a new growth area for wide-area wireless technologies which were designed for voice and high-speed packet data applications. In this paper, we use simulations to estimate the capacity of M2M applications over one of the widely used 3G wireless systems, CDMA2000 1x. We present capacity estimates of the CDMA2000 1x system for applications such as SMS, smart grid and vehicle tracking, under different network loading conditions. Our simulations show that the capacity of the aforementioned applications is reverse-link limited. In particular, the most commonly used configuration of reverse access channel in existing networks severely limits the M2M capacity. With better network configuration, use of enhanced access channel, and reverse link interference cancellation, the M2M capacity can be significantly improved. Our simulations show that the SMS capacity over 1x can reach about 2,400 SMS's per minute per sector on a single CDMA2000 1x carrier. In addition, the optimized network can support 56,000 smart-grid node or track approximately 2,900 vehicles per sector per 1.25MHz.
Yu-Cheun Jou, Rashid Attar, Siddharth Ray
WCNC3
2011 Fiber Aided Wireless Network Architecture
abstract
We introduce the concept of a fiber aided wireless network architecture (FAWNA), which allows high-speed mobile connectivity by leveraging the speed of optical networks. Specifically, we consider a single-input, multiple-output (SIMO) FAWNA, which consists of a SIMO wireless channel interfaced with an optical fiber channel through wireless-optical interfaces. We propose a design where the received wireless signal at each interface is sampled and quantized before being sent over the fiber. The capacity of our scheme approaches the capacity of the architecture, exponentially with fiber capacity. We also show that for a given fiber capacity, there is an optimal operating wireless bandwidth and number of interfaces. We show that the optimal way to divide the fiber capacity among the interfaces is to ensure that each interface gets enough rate so that its noise is dominated by front end noise rather than by quantizer distortion. We also show that rather than dynamically change rate allocation based on channel state, a less complex, fixed rate allocation scheme can be adopted with very small loss in performance.
Siddharth Ray, Muriel Médard, Lizhong Zheng
IEEE J. Sel. Areas Commun.1
2007 On Noncoherent MIMO Channels in the Wideband Regime: Capacity and Reliability
abstract
We consider a multiple-input multiple-output (MIMO) wideband Rayleigh block-fading channel where the channel state is unknown to both the transmitter and the receiver and there is only an average power constraint on the input. We compute the capacity and analyze its dependence on coherence length, number of antennas and receive signal-to-noise ratio (SNR) per degree of freedom. We establish conditions on the coherence length and number of antennas for the noncoherent channel to have a “near-coherent” performance in the wideband regime. We also propose a signaling scheme that is near-capacity achieving in this regime. We compute the error probability for this wideband noncoherent MIMO channel and study its dependence on SNR, number of transmit and receive antennas and coherence length. We show that error probability decays inversely with coherence length and exponentially with the product of the number of transmit and receive antennas. Moreover, channel outage dominates error probability in the wideband regime. We also show that the critical as well as cutoff rates are much smaller than channel capacity in this regime.
Siddharth Ray, Muriel Médard, Lizhong Zheng
IEEE Trans. Inf. Theory1
2006 On Jamming in the Wideband Regime
abstract
We consider the problem of jamming in non-coherent wideband fading channels. While the problem is well understood for coherent channels, the results for the coherent case do not generalize in the non-coherent regime. We show that energy-limited jammers do not affect capacity in the wideband regime. We also propose a training based transmission scheme that is able to achieve the wideband limit in the presence of a jammer
Siddharth Ray, Pierre Moulin, Muriel Médard
ISIT1
2006 On Error Probability for Non-coherent MIMO Channels in the Wideband Regime
abstract
We consider a multiple-input, multiple-output (MIMO) wideband Rayleigh block fading channel where the channel state is unknown to both the transmitter and the receiver and there is only an average power constraint on the input. We compute the error probability and study its dependence on receive signal-to-noise ratio (SNR), number of transmit and receive antennas and coherence length. We show that error probability decays inversely with coherence length and exponentially with the product of the number of transmit and receive antennas. Moreover, channel outage dominates error probability in the wideband regime. We also show that the critical as well as cut-off rates are much smaller than channel capacity in this regime
Siddharth Ray, Muriel Médard, Lizhong Zheng
ISIT1
2006 A SIMO Fiber Aided Wireless Network Architecture
abstract
The concept of a fiber aided wireless network architecture (FAWNA) is introduced in [Ray et al., Allerton Conference 2005], which allows high-speed mobile connectivity by leveraging the speed of optical networks. In this paper, we consider a single-input, multiple-output (SIMO) FAWNA, which consists of a SIMO wireless channel and an optical fiber channel, connected through wireless-optical interfaces. We propose a scheme where the received wireless signal at each interface is quantized and sent over the fiber. Though our architecture is similar to that of the classical CEO problem, our problem is different from it. We show that the capacity of our scheme approaches the capacity of the architecture, exponentially with fiber capacity. We also show that for a given fiber capacity, there is an optimal operating wireless bandwidth and an optimal number of wireless-optical interfaces. The wireless-optical interfaces of our scheme have low complexity and do not require knowledge of the transmitter code book. They are also extendable to FAWNAs with large number of transmitters and interfaces and, offer adaptability to variable rates, changing channel conditions and node positions
Siddharth Ray, Muriel Médard, Lizhong Zheng
ISIT1
2005 Wideband non-coherent MIMO capacity
abstract
We consider a multiple-input, multiple-output (MIMO) wideband Rayleigh block fading channel, where the channel state is unknown to both the transmitter and the receiver. With only an average power constraint, we compute the capacity of this channel and consider its interaction with the coherence length, number of transmit and receive antennas and receive signal-to-noise ratio (SNR) per degree of freedom. We establish how large the coherence length has to be in order for the non-coherent channel to have a "near coherent" performance in the wideband regime. More specifically, we show that if the coherence length of the channel is above a certain SNR (bandwidth) dependent threshold, the non-coherent and coherent capacities are the same in the large bandwidth regime. We also propose a signaling scheme that is near-optimal in the wideband regime
Siddharth Ray, Muriel Médard, Lizhong Zheng
ISIT1
2003 Random coding in noise-free multiple access networks over finite fields
abstract
A two transmitter single receiver multiple access noise-free network is considered where interference is additive and the transmit and receive alphabet size is the same. We consider two performance metrics - code rate and sum rate. Code rate is defined as the ratio of the symbols recovered, after multiple access interference, to the symbols sent by the transmitters. The sum rate is the number of symbols successfully received per unit time. A packet by packet coding scheme is presented where we determine how these rates change with redundancy. We propose a coding mechanism that maximizes the code and sum rates and show that it suffices to code at only one of the transmitters and that systematic codes are sufficient for this purpose. The development is independent of the alphabet size the symbols are defined over. We also show that we can achieve maximum rates by using a random code. This allows us to choose codes in a random fashion and the scheme achieves optimality with probability tending to 1 exponentially with the code length.
Siddharth Ray, Muriel Médard, Jinane Abounadi
GLOBECOM1