2015
Bravo-Santos, Ángel M; Djuric, Petar M
Detectors for Cooperative Mesh Networks with Decode-and-Forward Relays Artículo de revista
En: IEEE Transactions on Signal Processing, vol. 63, no 1, pp. 5–17, 2015, ISSN: 1053-587X.
Resumen | Enlaces | BibTeX | Etiquetas: Cooperative systems, Detectors, Mesh networks, Modulation, Relays, spread spectrum communication, Wireless communication
@article{Bravo-Santos2014b,
title = {Detectors for Cooperative Mesh Networks with Decode-and-Forward Relays},
author = {\'{A}ngel M Bravo-Santos and Petar M Djuric},
url = {http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6928514},
doi = {10.1109/TSP.2014.2364016},
issn = {1053-587X},
year = {2015},
date = {2015-01-01},
journal = {IEEE Transactions on Signal Processing},
volume = {63},
number = {1},
pages = {5--17},
publisher = {IEEE},
abstract = {We consider mesh networks composed of groups of relaying nodes which operate in decode-andforward mode. Each node from a group relays information to all the nodes in the next group. We study these networks in two setups, one where the nodes have complete state information about the channels through which they receive the signals, and another when they only have the statistics of the channels. We derive recursive expressions for the probabilities of errors of the nodes and present several implementations of detectors used in these networks. We compare the mesh networks with multi-hop networks formed by a set of parallel sections of multiple relaying nodes. We demonstrate with numerous simulations that there are significant improvements in performance of mesh over multi-hop networks in various scenarios.},
keywords = {Cooperative systems, Detectors, Mesh networks, Modulation, Relays, spread spectrum communication, Wireless communication},
pubstate = {published},
tppubtype = {article}
}
We consider mesh networks composed of groups of relaying nodes which operate in decode-andforward mode. Each node from a group relays information to all the nodes in the next group. We study these networks in two setups, one where the nodes have complete state information about the channels through which they receive the signals, and another when they only have the statistics of the channels. We derive recursive expressions for the probabilities of errors of the nodes and present several implementations of detectors used in these networks. We compare the mesh networks with multi-hop networks formed by a set of parallel sections of multiple relaying nodes. We demonstrate with numerous simulations that there are significant improvements in performance of mesh over multi-hop networks in various scenarios.
Bravo-Santos, Ángel M; Djuric, Petar M
Detectors for Cooperative Mesh Networks with Decode-and-Forward Relays Artículo de revista
En: IEEE Transactions on Signal Processing, vol. 63, no 1, pp. 5–17, 2015, ISSN: 1053-587X.
Resumen | Enlaces | BibTeX | Etiquetas: Cooperative systems, Detectors, Journal, Mesh networks, Modulation, Relays, spread spectrum communication, Wireless communication
@article{Bravo-Santos2014bb,
title = {Detectors for Cooperative Mesh Networks with Decode-and-Forward Relays},
author = {\'{A}ngel M Bravo-Santos and Petar M Djuric},
url = {http://ieeexplore.ieee.org/articleDetails.jsp?arnumber=6928514},
doi = {10.1109/TSP.2014.2364016},
issn = {1053-587X},
year = {2015},
date = {2015-01-01},
journal = {IEEE Transactions on Signal Processing},
volume = {63},
number = {1},
pages = {5--17},
publisher = {IEEE},
abstract = {We consider mesh networks composed of groups of relaying nodes which operate in decode-andforward mode. Each node from a group relays information to all the nodes in the next group. We study these networks in two setups, one where the nodes have complete state information about the channels through which they receive the signals, and another when they only have the statistics of the channels. We derive recursive expressions for the probabilities of errors of the nodes and present several implementations of detectors used in these networks. We compare the mesh networks with multi-hop networks formed by a set of parallel sections of multiple relaying nodes. We demonstrate with numerous simulations that there are significant improvements in performance of mesh over multi-hop networks in various scenarios.},
keywords = {Cooperative systems, Detectors, Journal, Mesh networks, Modulation, Relays, spread spectrum communication, Wireless communication},
pubstate = {published},
tppubtype = {article}
}
We consider mesh networks composed of groups of relaying nodes which operate in decode-andforward mode. Each node from a group relays information to all the nodes in the next group. We study these networks in two setups, one where the nodes have complete state information about the channels through which they receive the signals, and another when they only have the statistics of the channels. We derive recursive expressions for the probabilities of errors of the nodes and present several implementations of detectors used in these networks. We compare the mesh networks with multi-hop networks formed by a set of parallel sections of multiple relaying nodes. We demonstrate with numerous simulations that there are significant improvements in performance of mesh over multi-hop networks in various scenarios.
2013
Bravo-Santos, Ángel M
Polar Codes for Gaussian Degraded Relay Channels Artículo de revista
En: IEEE Communications Letters, vol. 17, no 2, pp. 365–368, 2013, ISSN: 1089-7798.
Resumen | Enlaces | BibTeX | Etiquetas: channel capacity, Channel Coding, Decoding, Encoding, Gaussian channels, Gaussian degraded relay channel, Gaussian noise, Gaussian-degraded relay channels, log-likelihood expression, Markov coding, Noise, parity check codes, polar code detector, polar codes, relay-destination link, Relays, Vectors
@article{Bravo-Santos2013,
title = {Polar Codes for Gaussian Degraded Relay Channels},
author = {\'{A}ngel M Bravo-Santos},
url = {http://ieeexplore.ieee.org/articleDetails.jsp?arnumber=6412681},
issn = {1089-7798},
year = {2013},
date = {2013-01-01},
journal = {IEEE Communications Letters},
volume = {17},
number = {2},
pages = {365--368},
publisher = {IEEE},
abstract = {In this paper we apply polar codes for the Gaussian degraded relay channel. We study the conditions to be satisfied by the codes and provide an efficient method for constructing them. The relay-destination link is special because the noise is the sum of two components: the Gaussian noise and the signals from the source. We study this link and provide the log-likelihood expression to be used by the polar code detector. We perform simulations of the channel and the results show that polar codes of high rate and large codeword length are closer to the theoretical limit than other good codes.},
keywords = {channel capacity, Channel Coding, Decoding, Encoding, Gaussian channels, Gaussian degraded relay channel, Gaussian noise, Gaussian-degraded relay channels, log-likelihood expression, Markov coding, Noise, parity check codes, polar code detector, polar codes, relay-destination link, Relays, Vectors},
pubstate = {published},
tppubtype = {article}
}
In this paper we apply polar codes for the Gaussian degraded relay channel. We study the conditions to be satisfied by the codes and provide an efficient method for constructing them. The relay-destination link is special because the noise is the sum of two components: the Gaussian noise and the signals from the source. We study this link and provide the log-likelihood expression to be used by the polar code detector. We perform simulations of the channel and the results show that polar codes of high rate and large codeword length are closer to the theoretical limit than other good codes.
Koch, Tobias; Kramer, Gerhard
On Noncoherent Fading Relay Channels at High Signal-to-Noise Ratio Artículo de revista
En: IEEE Transactions on Information Theory, vol. 59, no 4, pp. 2221–2241, 2013, ISSN: 0018-9448.
Resumen | Enlaces | BibTeX | Etiquetas: channel capacity, Channel models, Fading, fading channels, MIMO communication, multiple-input single-output fading channel statis, noncoherent, noncoherent fading relay channel capacity, radio receiver, radio receivers, radio transmitter, radio transmitters, Receivers, relay channels, relay networks (telecommunication), Relays, Signal to noise ratio, signal-to-noise ratio, SNR, statistics, time selective, Transmitters, Upper bound
@article{Koch2013a,
title = {On Noncoherent Fading Relay Channels at High Signal-to-Noise Ratio},
author = {Tobias Koch and Gerhard Kramer},
url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=6378474},
issn = {0018-9448},
year = {2013},
date = {2013-01-01},
journal = {IEEE Transactions on Information Theory},
volume = {59},
number = {4},
pages = {2221--2241},
abstract = {The capacity of noncoherent regular-fading relay channels is studied where all terminals are aware of the fading statistics but not of their realizations. It is shown that if the fading coefficient of the channel between the transmitter and the receiver can be predicted more accurately from its infinite past than the fading coefficient of the channel between the relay and the receiver, then at high signal-to-noise ratio (SNR), the relay does not increase capacity. It is further shown that if the fading coefficient of the channel between the transmitter and the relay can be predicted more accurately from its infinite past than the fading coefficient of the channel between the relay and the receiver, then at high SNR, one can achieve communication rates that are within one bit of the capacity of the multiple-input single-output fading channel that results when the transmitter and the relay can cooperate.},
keywords = {channel capacity, Channel models, Fading, fading channels, MIMO communication, multiple-input single-output fading channel statis, noncoherent, noncoherent fading relay channel capacity, radio receiver, radio receivers, radio transmitter, radio transmitters, Receivers, relay channels, relay networks (telecommunication), Relays, Signal to noise ratio, signal-to-noise ratio, SNR, statistics, time selective, Transmitters, Upper bound},
pubstate = {published},
tppubtype = {article}
}
The capacity of noncoherent regular-fading relay channels is studied where all terminals are aware of the fading statistics but not of their realizations. It is shown that if the fading coefficient of the channel between the transmitter and the receiver can be predicted more accurately from its infinite past than the fading coefficient of the channel between the relay and the receiver, then at high signal-to-noise ratio (SNR), the relay does not increase capacity. It is further shown that if the fading coefficient of the channel between the transmitter and the relay can be predicted more accurately from its infinite past than the fading coefficient of the channel between the relay and the receiver, then at high SNR, one can achieve communication rates that are within one bit of the capacity of the multiple-input single-output fading channel that results when the transmitter and the relay can cooperate.