Network Simplification: the Gaussian Diamond Network with Multiple Antennas

2011-08-05
Nazaroglu, Caner
Ebrahimi, Javad B.
Oezguer, Ayfer
Fragouli, Christina
We consider the N-relay Gaussian diamond network when the source and the destination have n(s) >= 2 and n(d) >= 2 antennas respectively. We show that when n(s) = n(d) = 2 and when the individual MISO channels from the source to each relay and the SIMO channels from each relay to the destination have the same capacity, there exists a two relay sub-network that achieves approximately all the capacity of the network. To prove this result, we establish a simple relation between the joint entropies of three Gaussian random variables, which is not implied by standard Shannon-type entropy inequalities.(1)

Suggestions

Wireless Network Simplification: the Gaussian N-Relay Diamond Network
Nazaroglu, Caner; Oezguer, Ayfer; Fragouli, Christina (2011-08-05)
We consider the Gaussian N-relay diamond network, where a source wants to communicate to a destination node through a layer of N-relay nodes. We investigate the following question: What fraction of the capacity can we maintain by using only k out of the N available relays? We show that in every Gaussian N-relay diamond network, there exists a subset of k relays which alone provide approximately k/k+1 of the total capacity. The result holds independent of the number of available relay nodes N, the channel co...
Geometric measures of entanglement
UYANIK, KIVANÇ; Turgut, Sadi (American Physical Society (APS), 2010-03-01)
The geometric measure of entanglement, which expresses the minimum distance to product states, has been generalized to distances to sets that remain invariant under the stochastic reducibility relation. For each such set, an associated entanglement monotone can be defined. The explicit analytical forms of these measures are obtained for bipartite entangled states. Moreover, the three-qubit case is discussed and it is argued that the distance to the W states is a new monotone.
Propagation models for hilly terrain based on ray optic methods
Yıldırım, Erkan Ersin; Dural Ünver, Mevlüde Gülbin; Department of Electrical and Electronics Engineering (2015)
In RF propagation path loss modeling, numerical methods may not be useful since they require very long computation times because electrically very large objects may be located in the terrain. Ray optic methods such as Geometrical Optics (GO) or Geometrical Theory of Diffraction (GTD) are more commonly used in propagation problems as well as the empirical models. Although ray optics methods are designed for very high frequency applications, they provide quite accurate path loss estimations in hilly terrain i...
Frequency estimation of a single real-valued sinusoid: An invariant function approach
Candan, Çağatay; Çelebi, Utku (2021-08-01)
An invariant function approach for the computationally efficient (non-iterative and gridless) maximum likelihood (ML) estimation of unknown parameters is applied on the real-valued sinusoid frequency estimation problem. The main attraction point of the approach is its potential to yield a ML-like performance at a significantly reduced computational load with respect to conventional ML estimator that requires repeated evaluation of an objective function or numerical search routines. The numerical results ind...
Frame synchronization in OFDM systems
Gürsan, Hakan Yesari; Tuncer, Temel Engin; Department of Electrical and Electronics Engineering (2005)
In this thesis, we considered the problem of frame synchronization and channel estimation in Orthogonal Frequency Division Multiplexing (OFDM) systems. Since framing error may cause severe ISI and may disturb the orthogonality of the subcarriers, frame synchronization must be accomplished at the OFDM receiver. Furthermore, the effects of channel must be compensated to obtain the symbols accurately. We investigated several frame synchronization algorithms including a maximum likelihood (ML) synchronizer whic...
Citation Formats
C. Nazaroglu, J. B. Ebrahimi, A. Oezguer, and C. Fragouli, “Network Simplification: the Gaussian Diamond Network with Multiple Antennas,” 2011, p. 79, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/67491.