Publication

Network Simplification: the Gaussian N-Relay Diamond Network

2010
Reports

Abstract

We consider the Gaussian $N$ -relay diamond network, where a source wants to communicate to a destination 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$ relays? We show that in every Gaussian $N$ -relay diamond network, there exists a subset of $k$ relays which alone provide approximately a fraction $\frac{k}{k+1}$ of the total capacity. The result holds independent of the number of available relay nodes $N$ , the channel configurations and the operating SNR. The approximation is within $3\log N+3k$ bits/s/Hz to the capacity.

Official source

https://infoscience.epfl.ch/entities/publication/961c3ed0-14c2-4f38-ae89-a90a6b6032ca

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

2010
Reports

Abstract

Official source

https://infoscience.epfl.ch/entities/publication/961c3ed0-14c2-4f38-ae89-a90a6b6032ca

About this result

Related concepts (25)

Approximation algorithm

In computer science and operations research, approximation algorithms are efficient algorithms that find approximate solutions to optimization problems (in particular NP-hard problems) with provable guarantees on the distance of the returned solution to the optimal one. Approximation algorithms naturally arise in the field of theoretical computer science as a consequence of the widely believed P ≠ NP conjecture. Under this conjecture, a wide class of optimization problems cannot be solved exactly in polynomial time.

Channel capacity

Channel capacity, in electrical engineering, computer science, and information theory, is the tight upper bound on the rate at which information can be reliably transmitted over a communication channel. Following the terms of the noisy-channel coding theorem, the channel capacity of a given channel is the highest information rate (in units of information per unit time) that can be achieved with arbitrarily small error probability. Information theory, developed by Claude E.

Number

A number is a mathematical object used to count, measure, and label. The original examples are the natural numbers 1, 2, 3, 4, and so forth. Numbers can be represented in language with number words. More universally, individual numbers can be represented by symbols, called numerals; for example, "5" is a numeral that represents the number five. As only a relatively small number of symbols can be memorized, basic numerals are commonly organized in a numeral system, which is an organized way to represent any number.

Related publications (3)

Network Simplification: the Gaussian N-Relay Diamond Network

Chat with Graph Search

A Kernel Classifier for Distributions

Reaching volumes generated by means of octal trees and Cartesian constraints

Calcul des opacités de plasmas denses. Eclatement du spectre dû aux interactions électroniques dans le cas du fer