http://www.rssboard.org/rss-specification720Recent cpcc items
https://escholarship.org/uc/cpcc/rss
Recent eScholarship items from Center for Pervasive Communications and ComputingSun, 20 Sep 2020 08:28:32 +0000Generalized Cross Subspace Alignment Codes for Coded Distributed Batch Matrix Multiplication
https://escholarship.org/uc/item/8fx6x83p
The goal of coded distributed batch matrix multiplication is to efficiently multiply L instances of \lambda x \kappa matrices, A=(A_1, ..., A_L)$, with L instances of \kappa x \mu matrices B=(B_1,..., B_L), by distributing the computation across S servers, such that the response from any R servers (R is called the recovery threshold) is sufficient to compute the L matrix products, AB=(A_1B_1, A_2B_2, ..., A_LB_L). Existing solutions either compute each $A_lB_l$ one at a time by partitioning individual matrices and coding across these partitions, or rely only on batch processing, i.e., coding across the batch of matrices without any matrix partitioning. The state-of-art for matrix-partitioning and batch processing approaches is represented by Entangled Polynomial Codes (EP codes), and Lagrange Coded Computing (LCC), respectively. In order to combine the benefits of the two approaches, we propose Generalized Cross-Subspace Alignment Codes (GCSA codes) that unify, generalize...https://escholarship.org/uc/item/8fx6x83pThu, 31 Oct 2019 00:00:00 +0000Robust Optimality of TIN under Secrecy Constraints
https://escholarship.org/uc/item/4242x608
A parameter regime is identified where the simple scheme of treating interference as Gaussian noise (TIN), with power control and jamming, is optimal for the secure generalized degrees of freedom (GDoF) region of Gaussian broadcast networks under the robust assumption of finite-precision channel state information at the transmitter (CSIT). The network consists of one transmitter equipped with K antennas, and K single-antenna receivers. The results are generalized to groupcast (equivalently, compound broadcast) settings where each message is desired by a disjoint group of receivers. Noting that messages are independently encoded in the GDoF-optimal scheme, the result for the broadcast channel is extended to its counterpart Gaussian interference channel under finite precision CSIT. Evidently, both secrecy constraints and finite precision CSIT limit the benefits of more sophisticated schemes, leading to optimality of simpler schemes for larger parameter regimes. Aligned Image bounds...https://escholarship.org/uc/item/4242x608Sun, 27 Oct 2019 00:00:00 +0000$X$-secure $T$-private Information Retrieval from MDS Coded Storage with Byzantine and Unresponsive Servers
https://escholarship.org/uc/item/5gt0b9v1
The problem of $X$-secure $T$-private information retrieval from MDS coded storage is studied in this paper, where the user wishes to privately retrieve one out of $K$ independent messages that are distributed over $N$ servers according to an MDS code. It is guaranteed that any group of up to $X$ colluding servers learn nothing about the messages and that any group of up to $T$ colluding servers learn nothing about the identity of desired message. A lower bound of achievable rates is proved by presenting a novel scheme based on \emph{cross-subspace alignment} and a successive decoding with interference cancellation strategy. For large number of messages $(K\rightarrow\infty)$ the achieved rate, which we conjecture to be optimal, improves upon the best known rates previously reported in the literature by Raviv and Karpuk, and generalizes an achievable rate for MDS-TPIR previously found by Freij-Hollanti et al. that is also conjectured to be asymptotically optimal. The setting is...https://escholarship.org/uc/item/5gt0b9v1Tue, 27 Aug 2019 00:00:00 +0000GDoF of Interference Channel with Limited Cooperation under Finite Precision CSIT
https://escholarship.org/uc/item/0mf232ft
The Generalized Degrees of Freedom (GDoF) of the two user interference channel are characterized for all parameter regimes under the assumption of finite precision channel state information at the transmitters (CSIT), when a limited amount of cooperation is allowed between the transmitters in the form of π DoF of shared messages. In all cases, the number of over- the-air bits that each cooperation bit buys is shown to be equal to either 0, 1, 1/2 or 1/3.https://escholarship.org/uc/item/0mf232ftFri, 10 May 2019 00:00:00 +0000Towards an Extremal Network Theory – Robust GDoF Gain of Transmitter Cooperation over TIN
https://escholarship.org/uc/item/0qn447j4
With the emergence of aligned images bounds, significant progress has been made in the understanding of robust fundamental limits of wireless networks through Generalized Degrees of Freedom (GDoF) characterizations under the assumption of finite precision channel state information at the transmitters (CSIT), especially for smaller or highly symmetric network settings. A critical barrier in extending these insights to larger and asymmetric networks is the inherent combinatorial complexity of such networks. Motivated by other fields such as extremal combinatorics and extremal graph theory, we explore the possibility of an extremal network theory, i.e., a study of extremal networks within particular regimes of interest. As our test application, we study the GDoF benefits of transmitter cooperation over the simple scheme of power control and treating interference as Gaussian noise (TIN) for three regimes of interest where the interference is weak. The question is intriguing because...https://escholarship.org/uc/item/0qn447j4Sun, 20 Jan 2019 00:00:00 +0000On the Capacity of Locally Decodable Codes
https://escholarship.org/uc/item/0qh0h88p
A locally decodable code (LDC) maps $K$ source symbols, each of size $L_w$ bits, to $M$ coded symbols, each of size $L_x$ bits, such that each source symbol can be decoded from $N \leq M$ coded symbols. A perfectly smooth LDC further requires that each coded symbol is uniformly accessed when we decode any one of the messages. The ratio $L_w/L_x$ is called the symbol rate of an LDC. The highest possible symbol rate for a class of LDCs is called the capacity of that class. It is shown that given $K, N$, the maximum value of capacity of perfectly smooth LDCs, maximized over all code lengths $M$, is $C^*=N\left(1+1/N+1/N^2+\cdots+1/N^{K-1}\right)^{-1}$. Furthermore, given $K, N$, the minimum code length $M$ for which the capacity of a perfectly smooth LDC is $C^*$ is shown to be $M = N^K$. Both of these results generalize to a broader class of LDCs, called universal LDCs. The results are then translated into the context of PIR$_{\max}$, i.e., Private Information Retrieval subject...https://escholarship.org/uc/item/0qh0h88pSat, 8 Dec 2018 00:00:00 +0000On the Necessity of Non-Shannon Information Inequalities for Storage Overhead Constrained PIR and Network Coding
https://escholarship.org/uc/item/70d1v0jt
We show that to characterize the capacity of storage overhead constrained private information retrieval (PIR) with only 2 messages, and 2 databases, non-Shannon information inequalities are necessary. As a by-product of this result, we construct the smallest instance, to our knowledge, of a network coding capacity problem that requires non-Shannon inequalities.https://escholarship.org/uc/item/70d1v0jtWed, 24 Oct 2018 00:00:00 +0000Optimality of Simple Layered Superposition Coding in the 3 User MISO BC with Finite Precision CSIT
https://escholarship.org/uc/item/41h6v54h
We study the 3 user multiple input single output (MISO) broadcast channel (BC) with 3 antennas at the transmitter and 1 antenna at each receiver, from the generalized degrees of freedom (GDoF) perspective, under the assumption that the channel state information at the transmitter (CSIT) is limited to finite precision. In particular, our goal is to identify a parameter regime where a simple layered superposition (SLS) coding scheme achieves the entire GDoF region. With αij representing the channel strength parameter for the link from the jth antenna of the transmitter to the ith receiver, we prove that SLS is GDoF optimal without the need for time-sharing if max(αji,αij) ≤ αii and αki + αij ≤ αii + αkj for all i,j,k ∈ [3]. The GDoF region under this condition is a convex polyhedron.https://escholarship.org/uc/item/41h6v54hTue, 23 Jan 2018 00:00:00 +0000The Capacity of Private Computation
https://escholarship.org/uc/item/5vc8f7h0
The Capacity of Private Computationhttps://escholarship.org/uc/item/5vc8f7h0Tue, 31 Oct 2017 00:00:00 +0000Interference Mitigation Using Asynchronous Transmission and Sampling Diversity
https://escholarship.org/uc/item/8cj3m85d
In this paper, we show that by investigating inherent time delays between different users in a multiuser scenario, we are able to cancel interference more efficiently. Time asynchrony provides another tool to cancel interference which results in preserving other resources like frequency, time and code. Therefore, we can save the invaluable resource of frequency band and also increase spectral efficiency. A sampling method is presented which results in independent noise samples and obviates the need for the complex process of noise whitening. By taking advantage of this sampling method and its unique structure, we implement maximum-likelihood sequence detection which outperforms synchronous maximum-likelihood detection. We also present successive interference cancellation with hard decision passing which gives rise to a novel forward-backward belief propagation method. Next, the performance of zero forcing detection is analyzed. Simulation results are also presented to verify our...https://escholarship.org/uc/item/8cj3m85dTue, 12 Apr 2016 00:00:00 +0000Transmitter Cooperation under Finite Precision CSIT: A GDoF Perspective
https://escholarship.org/uc/item/9cv1135b
The benefits of partial and full transmitter cooperation are evaluated for a two user interference channel under finite precision channel state information at the transmitters (CSIT), using the generalized degrees of freedom (GDoF) metric. Under finite precision CSIT, the benefits of interference alignment are completely lost, so that the $X$ channel obtained by partial transmitter cooperation does no better than the underlying interference channels. Full transmitter cooperation produces a vector broadcast channel (BC) which has a strict GDoF advantage over partial cooperation (X channel) and whose GDoF are fully achieved by interference enhancement. https://escholarship.org/uc/item/9cv1135bFri, 12 Feb 2016 00:00:00 +0000Correction to “Multicast Networks with Variable-Length Limited Feedback”
https://escholarship.org/uc/item/1z226604
Correction to “Multicast Networks with Variable-Length Limited Feedback”https://escholarship.org/uc/item/1z226604Thu, 9 Jul 2015 00:00:00 +0000Degrees of Freedom of Rank-Deficient MIMO Interference Networks
https://escholarship.org/uc/item/1c17p6zq
<p>We characterize the degrees of freedom (DoF) of MIMO interference networks with rank-</p><p>deficient channel matrices. For the 2-user rank deficient MIMO interference channel, we prove</p><p>the optimality of previously known achievable DoF in the symmetric case and generalize the re-</p><p>sult to fully asymmetric settings. For the K-user rank deficient interference channel, we improve</p><p>the previously known achievable DoF and provide a tight outer bound to establish optimality</p><p>in symmetric settings. In particular, we show that for the K-user rank deficient interference</p><p>channel, when all nodes have M antennas, all direct channels have rank D0, all cross chan-</p><p>nels are of rank D, and the channels are otherwise generic, the optimal DoF value per user is</p><p>min(D0, M −min(M,(K−1)D)). For 2-user and 3-user rank deficient channels, achievable schemes2</p><p>are for both constant and time-varying channels, while for K-user rank deficient channels, we present...https://escholarship.org/uc/item/1c17p6zqFri, 9 Jan 2015 00:00:00 +0000Two-User Multicast Networks with Variable-Length Limited Feedback
https://escholarship.org/uc/item/0010s3qd
Two-User Multicast Networks with Variable-Length Limited Feedback https://escholarship.org/uc/item/0010s3qdMon, 13 Jan 2014 00:00:00 +0000Multiscale Image Quality Estimation
https://escholarship.org/uc/item/19d0q7jx
Multimedia communication is becoming pervasive because of the progress in wireless communications and multimedia coding. Estimating the quality of the visual content accurately is crucial in providing satisfactory service. State of the art visual quality assessment approaches are effective when the input image and the reference image have the same resolution. However, finding the quality of an image that has spatial resolution different than that of the reference image is still a challenging problem. To solve this problem, we develop a quality estimator (QE) which computes the quality of the input image without resampling the reference or the input images. In this work, we begin by identifying the potential weaknesses of previous approaches used to estimate the quality of experience. Next, we design a QE to estimate the quality of a distorted image with a lower resolution compared to the reference image. We also propose a subjective test environment to explore the success of the...https://escholarship.org/uc/item/19d0q7jxWed, 30 Oct 2013 00:00:00 +0000Topological Interference Management through Index Coding
https://escholarship.org/uc/item/66b461fd
While much recent progress on interference networks has come about under the assumption of abundant channel state information at the transmitters (CSIT), a complementary perspective is sought in this work through the study of interference networks with no CSIT except a coarse knowledge of the topology of the network that only allows a distinction between weak and significant channels and no further knowledge of the channel coefficients' realizations. Modeled as a degrees-of-freedom (DoF) study of a partially connected interference network with no CSIT, the problem is found to have a counterpart in the capacity analysis of wired networks with arbitrary linear network coding at intermediate nodes, under the assumption that the sources are aware only of the end to end topology of the network. The network capacity (wired) and DoF (wireless) region, expressed in dimensionless units as multiples of the capacity (wired) and DoF (wireless) of a single link, are found to be bounded above...https://escholarship.org/uc/item/66b461fdSun, 29 Sep 2013 00:00:00 +0000Degrees of Freedom of the Two-Way Relay MIMO Interference Channel
https://escholarship.org/uc/item/9qc3343h
We investigate the symmetric degrees of freedom (DoF) of the K-pair (2K users) two-way relay Multiple-Input Multiple-Output (MIMO) Gaussian interference channel for K = 2,3 where each user is equipped with M antennas and the relay node is equipped with N antennas. The two users of each pair communicate with each other via the help of the relay only. Expressing the DoF characterization as a function of the ratio γ = M/N, we find that the DoF value per user is piecewise linear depending on M and N alternately. As we will show in this paper, while the DoF achievability only needs linear beamforming transmission and zero-forcing reception, inter-pair signal subspace alignment is essential at the relay node as well as the users. In addition, the DoF converse is first developed based on the linear dimension counting approach, which can be further translated to the information theoretic statement.https://escholarship.org/uc/item/9qc3343hThu, 10 Jan 2013 00:00:00 +0000Degrees of Freedom of the Interference Channel with a Cognitive Helper
https://escholarship.org/uc/item/2nf4s7hf
Abstract—In this letter, we characterize the degrees of freedom (DoF) of theK≥3user Gaussian interference network with a cognitive helper where each node is equipped with only one antenna. Specifically, each user sends one independent message to its corresponding receiver through its own antenna and via the help of the cognitive helper. For this network, we show that the sum DoF value is outer bounded by(K + 1)/2whenKis odd andK2/(2(K + 1))whenKis even, respectively. The new DoF outer bounds are derived based on the fact that collaboration among users does not decrease the capacity region and increasing the number of users does not increase the capacity per user. In addition, we provide a new achievable scheme to achieve a total of(K + 1)/2DoF for anyK≥3. Thus, the exact DoF value of the network is characterized with the total DoF given as(K + 1)/2, wheneverKis odd. The new achievable scheme is based on interference neutralization and asymptotic interference alignment.https://escholarship.org/uc/item/2nf4s7hfThu, 8 Nov 2012 00:00:00 +0000On Optimal Ergodic Interference Alignment
https://escholarship.org/uc/item/72b5q2sf
The original ergodic interference alignment scheme proposed by Nazer et al. requires symmetric channel phase dis- tribution. In this paper, we investigate a new ergodic interference alignment scheme which can achieve one half interference-free degree of freedom (DoF) for arbitrary phase distribution. Even for symmetric phase distributions, the new scheme achieves a better high SNR offset than the original ergodic interference alignment scheme, and depending upon the magnitude distribu- tions it is shown that the SNR offset improvement with the new scheme over the original scheme can be arbitrarily large. The SNR offset optimal ergodic alignment scheme is based on results in majorization theory.https://escholarship.org/uc/item/72b5q2sfSun, 22 Apr 2012 00:00:00 +0000Degrees of Freedom of 2-user and 3-user Rank-Deficient MIMO Interference Channels
https://escholarship.org/uc/item/3gc1z8kn
We study the degrees of freedom (DoF) of 2-user and 3-user multiple input multiple output (MIMO) interference channels with rank deficient channel matrices. Only achievable DoF results and trivial outer bounds were previously available for these problems, restricted to symmetric settings. For the 2- user rank deficient MIMO interference channel we prove the optimality of previously known achievable DoF in the symmetric case and generalize the result to fully asymmetric settings. For the 3-user rank deficient MIMO interference channel, we improve the achievable DoF and provide a tight outer bound to establish optimality. Linear precoding based achievable schemes are found to be DoF optimal in both cases.https://escholarship.org/uc/item/3gc1z8knSun, 22 Apr 2012 00:00:00 +0000Feedback improves the generalized degrees of freedom of the strong interference channel
https://escholarship.org/uc/item/02w92010
<p>We provide inner and outer bounds on the generalized degrees of freedom of the two user symmetric interference channel. The bounds are tight in the moderately weak and strong interference regimes. Feedback is shown to provide unbounded improvements to the generalized degrees of freedom of the two user interference channel in the very strong interference regime. It is also shown that feedback does not improve the GDOF of the channel if the interference is moderately weak or moderately strong. We also finally present bounds for the generalized degrees of freedom of the symmetric MIMO interference channel with feedback.</p><p>(This report is the exact paper submitted to IEEE GLOBECOM for review, April 1, 2008 on EDAS. Uploaded, for the record, as CPCC report in Oct. 2011.)</p>https://escholarship.org/uc/item/02w92010Wed, 26 Oct 2011 00:00:00 +0000On Optimality of Linear Interference Alignment for the Three-User MIMO Interference Channel with Constant Channel Coefficients
https://escholarship.org/uc/item/6t14c361
<p>We investigate the optimality of linear interference</p><p>alignment (allowing symbol extensions) for Â 3-user</p><p>$M_T\times M_R$ MIMO interference channel where $M_T$ and $M_R$</p><p>denote the number of antennas at each transmitter and each receiver,</p><p>respectively, and the \emph{channel coefficients are held constant}. Recently, Wang et al. have conjectured that interference alignment based on linear beamforming using only proper Gaussian codebooks and possibly with symbol extensions, is sufficient to achieve the information theoretic DoF outer bound for all $M_T, M_R$ values except</p><p>if $|M_T-M_R|=1$, $\min(M_T,M_R)\geq 2$. A partial proof of the conjecture is provided by Wang et al. for arbitrary $M_T, M_R$ values subject to a final numerical evaluation step that needs to be performed for each $M_T, M_R$ setting to complete the proof. The numerical evaluation step is also carried out explicitly by Wang et al. to settle the conjecture for all Â $M_T, M_R$ values...https://escholarship.org/uc/item/6t14c361Sat, 22 Oct 2011 00:00:00 +0000Exploiting Heterogeneous Channel Coherence Intervals for Blind Interference Alignment
https://escholarship.org/uc/item/548776qj
We explore 5 Â network communication problems where the possibility of interference alignment, and consequently the total number of degrees of freedom (DoF) with channel uncertainty at the transmitters, Â are unknown. These problems share the common property that in each case the best known outer bounds are essentially robust to channel uncertainty and represent the outcome with interference alignment, but the best inner bounds --- in some cases conjectured to be optimal --- Â predict a total collapse of DoF, thus indicating the infeasibility of interference alignment under channel uncertainty at transmitters. Our main contribution is to introduce the idea of blind interference alignment. Specifically, we show that even with no knowledge of channel coefficient values at the transmitters, the knowledge of the channels' coherence structure can be exploited to achieve interference alignment. In each case, we show that under certain heterogeneous block fading models, i.e., when certain...https://escholarship.org/uc/item/548776qjThu, 20 Oct 2011 00:00:00 +0000Interference Alignment and Degrees of Freedom of the Two-User X Channel with an Instantaneous Relay
https://escholarship.org/uc/item/0112p0hf
<p>In this paper we investigate the sum degrees of freedom (DoF) of multiple unicasts in a wireless network. With 2 source nodes, 2 destination nodes, there are a total of 4 independent unicast sessions (messages), one from each source to each sink node (this setting is also known as an X network), and also there is a delay-free relay working in full-duplex mode helping the transmissions from the source to destination nodes. For such a channel setting, we prove that 5/3 DoF is achievable almost surely for time-varying/frequency-selective channels, based on the ideas of aligned interference neutralization, linear forwarding and interference alignment. Also, the achievable scheme can be easily translated to the rational alignment scheme for the network with constant-values channel coefficients. In addition, we provide an intuition for the 5/3 DoF result from the perspective of counting the number of linear equations and variables.</p>https://escholarship.org/uc/item/0112p0hfSat, 11 Jun 2011 00:00:00 +0000Short-term Performance Limits of MIMO Systems with Side Information at the Transmitter
https://escholarship.org/uc/item/6z00q9qn
<p>The fundamental performance limits of space-time block code (STBC) designs when perfect channel information is available at the transmitter (CSIT) are studied in this report. With CSIT, the transmitter can perform various techniques such as rate adaption, power allocation, or beamforming. Previously, the exploration of these fundamental results assumed long-term constraints, for example, channel codes can have infinite decoding delay, and power or rate is normalized over infinite channel-uses. With long-term constraints, the transmitter can operate at the rate lower than the instantaneous mutual information and error-free transmission can be supported. In this report, we focus on the performance limits of short-term behavior for STBC systems. We assume that the system has block power constraint, block rate constraint, and finite decoding delay. With these constraints, although the transmitter can perform rate adaption, power control, or beamforming, we show that decoding-error...https://escholarship.org/uc/item/6z00q9qnFri, 3 Jun 2011 00:00:00 +0000Aligned Interference Neutralization and the Degrees of Freedom of the 2x2x2 Interference Channel
https://escholarship.org/uc/item/7j98g3qj
<p>We show that the 2 × 2 × 2 interference network, i.e., the multihop interference network formed by concatenation of two 2-user interference channels achieves the min-cut outer bound value of 2 DoF, for almost all values of channel coefﬁcients, for both time-varying or ﬁxed channel coefﬁcients. The key to this result is a new idea, called aligned interference neutralization, that provides a way to align interference terms over each hop in a manner that allows them to be cancelled over the air at the last hop.</p>https://escholarship.org/uc/item/7j98g3qjSat, 26 Feb 2011 00:00:00 +0000The Ergodic Capacity of Interference Networks
https://escholarship.org/uc/item/4b2338qk
<p>We identify the role of equal strength interference links as bottlenecks on the ergodic sum capacity of a K user interference network with the fading process restricted primarily to inde- pendent and uniform phase variations while the channel magnitudes are held ﬁxed across time. It is shown that even though there are K(K − 1) cross-links, only about K/2 disjoint and equal strength interference links suﬃce to determine the capacity of the network regardless of the strengths of the rest of the cross channels. This scenario is called a minimal bottleneck state. It is shown that ergodic interference alignment is capacity optimal for a network in a minimal bottleneck state. The results are applied to large networks. It is shown that large networks are close to bottleneck states with a high probability, so that ergodic interference alignment is close to optimal for large networks. Limitations of the notion of bottleneck states are also high- lighted for channels where...https://escholarship.org/uc/item/4b2338qkTue, 4 Jan 2011 00:00:00 +0000Diversity Results for DSTC-ICRec and DSTC Joint-user ML decoding
https://escholarship.org/uc/item/475040fd
<p>In this technical report, we provide diversity analysis for two transmission schemes in (J;Ja;Ra;N) multi-access relay networks (MARNs), where J users, each equipped with Ja antennas, communicate to one N-antenna receiver through Ra single-antenna relays. Both transmission schemes allow all users' symbols to be transmitted concurrently through the source-relay and relay-receiver links. Therefore, both schemes have the potential of high transmission rate in multi-user relay networks. In the first scheme, called DSTC joint-user ML decoding, the relays perform distributed space-time coding (DSTC) to improve the reliability of the system, and the receiver jointly decodes all users' symbols using the ML decoding. Through rigorous analysis, this scheme achieves a symbol rate of 1/2 symbols/user/channel use, in conjunction to a diversity gain of Ra*min(Ja;N), which is the maximum diversity achievable in this network. But the decoding complexity of this scheme is exponential in the...https://escholarship.org/uc/item/475040fdWed, 29 Dec 2010 00:00:00 +0000The Necessity of Relay Selection
https://escholarship.org/uc/item/926746j9
<p>We determine necessary conditions on the structure of symbol error rate (SER) optimal quantizers for limited feedback beamforming in wireless networks with one transmitter-receiver pair and R parallel amplify-and-forward relays. We call a quantizer codebook "small" if its cardinality is less than R, and "large" otherwise. A "d-codebook" depends on the power constraints and can be optimized accordingly, while an "i-codebook" remains fixed. It was previously shown that any i-codebook that contains the single-relay selection (SRS) codebook achieves the full-diversity order, R. We prove the following: Every full-diversity i-codebook contains the SRS codebook, and thus is necessarily large. In general, as the power constraints grow to infinity, the limit of an optimal large d-codebook contains an SRS codebook, provided that it exists. For small codebooks, the maximal diversity is equal to the codebook cardinality. Every diversity-optimal small i-codebook is an orthogonal multiple-relay...https://escholarship.org/uc/item/926746j9Fri, 26 Nov 2010 00:00:00 +0000Distributed Beamforming in Wireless Multiuser Relay-Interference Networks with Quantized Feedback
https://escholarship.org/uc/item/75s21826
<p>We study quantized beamforming in wireless amplify-and-forward relay-interference networks with any number of transmitters, relays, and receivers. We design the quantizer of the channel state information to minimize the probability that at least one receiver incorrectly decodes its desired symbol(s). Correspondingly, we introduce a generalized diversity measure that encapsulates the conventional one as the first-order diversity. Additionally, it incorporates the second-order diversity, which is concerned with the transmitter power dependent logarithmic terms that appear in the error rate expression. First, we show that, regardless of the quantizer and the amount of feedback that is used, the relay-interference network suffers a second-order diversity loss compared to interference-free networks. Then, two different quantization schemes are studied: First, using a global quantizer, we show that a simple relay selection scheme can achieve maximal diversity. Then, using the localization...https://escholarship.org/uc/item/75s21826Fri, 26 Nov 2010 00:00:00 +0000Degrees of Freedom of the Cellular System with Relays and Partial CSIT
https://escholarship.org/uc/item/7cg6q1gw
<p>We consider a two-tier cellular system where there is a macrocell base station equipped with multiple antennas transmitting to multiple microcells, each equipped with a microcell base station (relay) equipped with one antenna. Each microcell has one user. We explore the degrees of freedom (DoF) of several conﬁgurations of this network with the assumption that no channel state information (CSI) of the users is available at the macrocell base station and different assumptions on the CSI between other transmitter-receiver pairs. With very limited CSI and the relays, the achievable DoF can be greatly increased compared to the case when there is no relays.</p>https://escholarship.org/uc/item/7cg6q1gwFri, 12 Nov 2010 00:00:00 +0000Multiple-Antenna Interference Cancellation and Detection for Two Users Using Quantized Feedback
https://escholarship.org/uc/item/6cp9n6s1
<p>When two users transmit signals to a common receiver, one can design precoders to cancel the interference for each user, if each user knows all the channel information perfectly. Also the diversity for each user is full. However, in practice, perfect channel information is not available. In this paper, we design precoders for two users with two transmit antennas and one receiver with two receive antennas using quantized feedback. We propose to construct codebook using Grassmannian line packing. By choosing precoders from the codebook properly, our proposed scheme can cancel the interference for each user. Also we analytically prove that our system can achieve full diversity for each user. Then we extend our scheme to any number of transmit and receive antennas. Simulation results confirm our analytical proof and show that our scheme can serve as a bridge between a system with no feedback and a system with perfect feedback.</p>https://escholarship.org/uc/item/6cp9n6s1Thu, 4 Nov 2010 00:00:00 +0000"Using Instantaneous Normalized Receive SNR for Diversity Gain Calculation
https://escholarship.org/uc/item/9511q6pf
<p>We propose a technique to calculate the diversity gain for a vector channel when the noises have any nonsingular distribution and the fading coefficients have arbitrary distribution. This technique uses the serial expansion of the outage probability of the instantaneous normalized receive SNR to obtain the diversity gain. The approach is simpler than using the pairwise symbol error rate to analyze the diversity gain.</p>https://escholarship.org/uc/item/9511q6pfTue, 21 Sep 2010 00:00:00 +0000Interference Cancellation at the Relay for Multi-User Wireless Cooperative Networks
https://escholarship.org/uc/item/8hs1d0tt
<p>We study multi-user transmission and detection schemes for a multi-access relay network (MARN) with linear constraints at all nodes. In a (J, Ja, Ra, M) MARN, J sources, each equipped with Ja antennas, communicate to one M-antenna destination through one Ra-antenna relay. A new protocol called IC-Relay-TDMA is proposed which takes two phases. During the first phase, symbols of different sources are transmitted concurrently to the relay. At the relay, interference cancellation (IC) techniques, previously proposed for systems with direct transmission, are applied to decouple the information of different sources without decoding. During the second phase, symbols of different sources are forwarded to the destination in a time division multi-access (TDMA) fashion. At the destination, the maximum-likelihood (ML) decoding is performed source-by-source. The protocol of IC-Relay-TDMA requires the number of relay antennas no less than the number of sources, i.e., Ra >= J. Through...https://escholarship.org/uc/item/8hs1d0ttTue, 21 Sep 2010 00:00:00 +0000Retrospective Interference Alignment
https://escholarship.org/uc/item/40m956wj
<p>We explore similarities and differences in recent works on blind interference alignment under different models such as staggered block fading model and the delayed CSIT model. In particular we explore the possibility of achieving interference alignment with delayed CSIT when the transmitters are distributed. Our main contribution is an interference alignment scheme, called retrospective interference alignment in this work, that is specialized to settings with distributed transmitters. With this scheme we show that the 2 user X channel with only delayed channel state information at the transmitters can achieve 8/7 DoF, while the interference channel with 3 users is able to achieve 9/8 DoF. We also consider another setting where delayed channel output feedback is available to transmitters. In this setting the X channel and the 3 user interference channel are shown to achieve 4/3 and 6/5 DoF, respectively.</p>https://escholarship.org/uc/item/40m956wjFri, 17 Sep 2010 00:00:00 +0000B-ISDN (Broadband Integrated Services Digital Network)
https://escholarship.org/uc/item/68w38300
<p>The subject of B-ISDN came into being in the late 1980s, together with the concept of Asynchronous Transfer Mode (ATM). ATM is closely tied to high-speed packet switching by means of specialized switches implemented in hardware. Due to its high speed and packet structure, ATM technology was considered attractive to unify voice, data, and video services. A unification of these services over the telephone infrastructure was attempted earlier by a standards offering known as Integrated Services Digital Network (ISDN). Consequently, this new service unification was termed Broadband ISDN (B-ISDN). Although due to its origins, B-ISDN is sometimes closely tied to ATM technology, the term independently represents the vision of packet-based high-speed integration of voice, data, and video services. It is important that in this process, guarantees to satisfy different Quality-of-Service (QoS) needs (in terms of delay, loss, etc) required by voice, data, and video services are provided....https://escholarship.org/uc/item/68w38300Fri, 6 Feb 2004 00:00:00 +0000VOFDM Broadband Wireless Transmission and Its Advantages
https://escholarship.org/uc/item/28s196nf
<p>In this paper we describe a coding, modulation, and spatial processing technique for fixed broadband wireless Internet access applications and provide examples of its performance. This technique is built on Orthogonal Frequency Division Multiplexing (OFDM) and is known as Vector OFDM (VOFDM). We compare VOFDM with conventional Single Carrier Modulation (SCM), and show that it provides substantial performance improvements over SCM. 1. It divides the channel into narrowband, flat fading, subchannels and thus it is more resistant to frequency selective fading as compared to single carrier systems. 2. By using FFT techniques, it is computationally efficient. 3. It can be combined with coding and interleaving to recover symbols lost due to the frequency selectivity of</p>https://escholarship.org/uc/item/28s196nfFri, 6 Feb 2004 00:00:00 +0000