A5024072566- Cooperative Communication and Network Coding
- Advanced MIMO Systems Optimization
- Wireless Communication Security Techniques
- Advanced Wireless Communication Techniques
- Wireless Communication Networks Research
- Blockchain Technology Applications and Security
- Distributed systems and fault tolerance
- Advanced Wireless Network Optimization
- Genomics and Phylogenetic Studies
- Mobile Ad Hoc Networks
- Cryptography and Data Security
- Algorithms and Data Compression
- Error Correcting Code Techniques
- DNA and Biological Computing
- Machine Learning and Algorithms
- Full-Duplex Wireless Communications
- RNA and protein synthesis mechanisms
- Gene expression and cancer classification
- Network Traffic and Congestion Control
- Optimal Power Flow Distribution
- Energy Harvesting in Wireless Networks
- Wireless Networks and Protocols
- Neural Networks and Applications
- Antenna Design and Analysis
- Advanced Bandit Algorithms Research
Illumina (United States)
2025
Stanford University
2015-2024
Palo Alto University
2019
Stanford Medicine
2017-2018
Institute of Electrical and Electronics Engineers
2017-2018
University of Toronto
2017-2018
University of Illinois Chicago
2017-2018
University of Maryland, College Park
2017-2018
Monash University
2017-2018
New York University
2018
We develop and analyze low-complexity cooperative diversity protocols that combat fading induced by multipath propagation in wireless networks. The underlying techniques exploit space available through cooperating terminals' relaying signals for one another. outline several strategies employed the radios, including fixed schemes such as amplify-and-forward decode-and-forward, selection adapt based upon channel measurements between terminals, incremental limited feedback from destination...
Multiple antennas can be used for increasing the amount of diversity or number degrees freedom in wireless communication systems. We propose point view that both types gains simultaneously obtained a given multiple-antenna channel, but there is fundamental tradeoff between how much each any coding scheme get. For richly scattered Rayleigh-fading we give simple characterization optimal curve and use it to evaluate performance existing multiple antenna schemes.
The capacity of ad hoc wireless networks is constrained by the mutual interference concurrent transmissions between nodes. We study a model an network where n nodes communicate in random source-destination pairs. These are assumed to be mobile. examine per-session throughput for applications with loose delay constraints, such that topology changes over time-scale packet delivery. Under this assumption, per-user can increase dramatically when mobile rather than fixed. This improvement...
The capacity of the two-user Gaussian interference channel has been open for 30 years. understanding on this problem limited. best known achievable region is due to Han and Kobayashi but its characterization very complicated. It also not how tight existing outer bounds are. In work, we show that can in fact be arbitrarily loose some parameter ranges, by deriving new bounds, a simple explicit Han-Kobayashi type scheme achieve within single bit per second hertz (bit/s/Hz) all values...
We characterize the sum capacity of vector Gaussian broadcast channel by showing that existing inner bound Marton and upper Sato are tight for this channel. exploit an intimate four-way connection between channel, corresponding point-to-point (where receivers can cooperate), multiple-access (MAC) role transmitters reversed), cooperate).
In multiaccess wireless systems, dynamic allocation of resources such as transmit power, bandwidths, and rates is an important means to deal with the time-varying nature environment. We consider problem optimal resource from information-theoretic point view. focus on fading channel Gaussian noise, define two notions capacity depending whether traffic delay-sensitive or not. characterize throughput region which contains long-term achievable through channel. show that each boundary can be...
We study the capacity of multiple-antenna fading channels. focus on scenario where coefficients vary quickly; thus an accurate estimation is generally not available to either transmitter or receiver. use a noncoherent block model proposed by Marzetta and Hochwald (see ibid. vol.45, p.139-57, 1999). The does assume any channel side information at receiver transmitter, but assumes that remain constant for coherence interval length T symbol periods. compute asymptotic this high signal-to-noise...
Previous studies have shown that single-user systems employing n-element antenna arrays at both the transmitter and receiver can achieve a capacity proportional to n, assuming independent Rayleigh fading between pairs. We explore of dual-antenna-array under correlated via theoretical analysis ray-tracing simulations. derive compare expressions for asymptotic growth rate with n antennas cases; latter is derived some assumptions about scaling correlation structure. In cases, theoretic linear...
Multiuser receivers improve the performance of spread-spectrum and antenna-array systems by exploiting structure multiaccess interference when demodulating signal a user. Much previous work on analysis multiuser has focused their ability to reject worst case interference. Their in power-controlled network resulting user capacity are less well-understood. We show that large system with each using random spreading sequences, limiting effects under several linear can be decoupled, such...
We study a spectrum sharing problem in an unlicensed band where multiple systems coexist and interfere with each other. Due to asymmetries selfish system behavior, unfair inefficient situations may arise. investigate whether efficiency fairness can be obtained self-enforcing rules. These rules have the advantage of not requiring central authority that verifies compliance protocol. Any protocol must correspond equilibrium game. first analyze possible outcomes one shot game, observe many cases...
In a wireless network with single source and destination an arbitrary number of relay nodes, what is the maximum rate information flow achievable? We make progress on this long standing problem through two-step approach. First we propose deterministic channel model which captures key properties signal strength, broadcast superposition. obtain exact characterization capacity nodes connected by such channels. This result natural generalization celebrated max-flow min-cut theorem for wired...
An achievable bit rate per source-destination pair in a wireless network of n randomly located nodes is determined adopting the scaling limit approach statistical physics. It shown that scattered can achieve, with high probability, same 1/radicn transmission arbitrarily nodes. This contrasts previous results suggesting 1/radicnlogn reduced price to pay for randomness due location The operation strategy achieve result corresponds transition region between order and disorder an underlying...
n source and destination pairs randomly located in an area want to communicate with each other. Signals transmitted from one user another at distance r apart are subject a power loss of <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">-alpha</sup> as well random phase. We identify the scaling laws information-theoretic capacity network when nodes can relay information for In case dense networks, where is fixed density increasing, we show that...
We develop two variants of an energy-efficient cooperative diversity protocol that combats fading induced by multipath propagation in wireless networks, The underlying techniques build upon the classical relay channel and related work exploit space available at distributed antennas through coordinated transmission processing cooperating radios. While applicable to any setting, these protocols are particularly attractive ad-hoc or peer-to-peer which radios typically constrained employ a...
In a point-to-point wireless fading channel, multiple transmit and receive antennas can be used to improve the reliability of reception (diversity gain) or increase rate communication for fixed level (multiplexing gain). multiple-access situation, also spatially separate signals from different users (multiple-access Recent work has characterized fundamental tradeoff between diversity multiplexing gains in scenario. this paper, we extend results channel. Our characterize three types gain...
We analyze the problem of communication over a set parallel Gaussian broadcast channels, each with different noise power for users. show that capacity can be achieved by optimal allocation and obtain an explicit characterization allocations resulting region.
Transmitter channel state information (CSIT) is crucial for the multiplexing gains offered by advanced interference management techniques such as multiuser multiple-input multiple-output (MIMO) and alignment. Such CSIT usually obtained feedback from receivers, but subject to delays. The usual approach use fed back predict current then apply a scheme designed assuming perfect CSIT. When delay large compared coherence time, prediction completely fails achieve any gain. In this paper, we show...
Abstract Type 2 diabetes mellitus (T2D) is a growing health problem, but little known about its early disease stages, effects on biological processes or the transition to clinical T2D. To understand earliest stages of T2D better, we obtained samples from 106 healthy individuals and with prediabetes over approximately four years performed deep profiling transcriptomes, metabolomes, cytokines, proteomes, as well changes in microbiome. This rich longitudinal data set revealed many insights:...
For pt.I see ibid., vol.44, no.7, p.2796-815 (1998). In multiaccess wireless systems, dynamic allocation of resources such as transmit power, bandwidths, and rates is an important means to deal with the time-varying nature environment. We consider problem optimal resource from information-theoretic point view. focus on fading channel Gaussian noise, define two notions capacity depending whether traffic delay-sensitive or not. present paper, we introduce a notion delay-limited which maximum...
There has been intense effort in the past decade to develop multiuser receiver structures which mitigate interference between users spread-spectrum systems. While much of this research is performed at physical layer, appropriate power control and choice signature sequences conjunction with receivers resulting network user capacity not well understood. In paper we will focus on a single cell consider both uplink downlink scenarios assume synchronous CDMA (S-CDMA) system. We characterize...
In this paper, we propose a new way of interference management for cellular networks. We develop the scheme that approaches to <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">interference-free</i> degree-of-freedom (dof) as number xmlns:xlink="http://www.w3.org/1999/xlink">K</i> users in each cell increases. Also find corresponding bandwidth scaling conditions typical wireless channels: multi-path channels and single-path with propagation delay....
We develop an interference alignment (IA) technique for a downlink cellular system. In the uplink, IA schemes need channel-state-information exchange across base-stations of different cells, but our requires feedback only within cell. As result, proposed scheme can be implemented with few changes to existing system where mechanism (within cell) is already being considered supporting multi-user MIMO. Not implementable little effort, it in fact provide substantial gain especially when from...
Recently, Etkin, Tse, and Wang found the capacity region of two-user Gaussian interference channel to within 1 bit/s/Hz. A natural goal is apply this approach with an arbitrary number users. We make progress towards by finding many-to-one one-to-many channels a constant bits. The result makes use deterministic model provide insight into channel. explicit dimension signal level. central theme emerges: lattice codes for alignment interfering signals on
In this letter, we propose an adaptive SC (Successive Cancellation)-List decoder for polar codes with CRC. This SC-List iteratively increases the list size until at least one survival path can pass Simulation shows that provides significant complexity reduction. We also demonstrate code (2048, 1024) 24-bit CRC decoded by our proposed very large maximum achieve a frame error rate FER ≤ 10 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">-3</sup>...