2013
Alvarado, Alex; Brannstrom, Fredrik; Agrell, Erik; Koch, Tobias
High-SNR Asymptotics of Mutual Information for Discrete Constellations Proceedings Article
En: 2013 IEEE International Symposium on Information Theory, pp. 2274–2278, IEEE, Istanbul, 2013, ISSN: 2157-8095.
Resumen | Enlaces | BibTeX | Etiquetas: AWGN channels, discrete constellations, Entropy, Fading, Gaussian Q-function, high-SNR asymptotics, IP networks, least mean squares methods, minimum mean-square error, MMSE, Mutual information, scalar additive white Gaussian noise channel, Signal to noise ratio, signal-to-noise ratio, Upper bound
@inproceedings{Alvarado2013b,
title = {High-SNR Asymptotics of Mutual Information for Discrete Constellations},
author = {Alex Alvarado and Fredrik Brannstrom and Erik Agrell and Tobias Koch},
url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=6620631},
issn = {2157-8095},
year = {2013},
date = {2013-01-01},
booktitle = {2013 IEEE International Symposium on Information Theory},
pages = {2274--2278},
publisher = {IEEE},
address = {Istanbul},
abstract = {The asymptotic behavior of the mutual information (MI) at high signal-to-noise ratio (SNR) for discrete constellations over the scalar additive white Gaussian noise channel is studied. Exact asymptotic expressions for the MI for arbitrary one-dimensional constellations and input distributions are presented in the limit as the SNR tends to infinity. Asymptotics of the minimum mean-square error (MMSE) are also developed. It is shown that for any input distribution, the MI and the MMSE have an asymptotic behavior proportional to a Gaussian Q-function, whose argument depends on the minimum Euclidean distance of the constellation and the SNR. Closed-form expressions for the coefficients of these Q-functions are calculated.},
keywords = {AWGN channels, discrete constellations, Entropy, Fading, Gaussian Q-function, high-SNR asymptotics, IP networks, least mean squares methods, minimum mean-square error, MMSE, Mutual information, scalar additive white Gaussian noise channel, Signal to noise ratio, signal-to-noise ratio, Upper bound},
pubstate = {published},
tppubtype = {inproceedings}
}
Salamanca, Luis; Murillo-Fuentes, Juan Jose; Olmos, Pablo M; Perez-Cruz, Fernando
Improving the BP Estimate over the AWGN Channel Using Tree-Structured Expectation Propagation Proceedings Article
En: 2013 IEEE International Symposium on Information Theory, pp. 2990–2994, IEEE, Istanbul, 2013, ISSN: 2157-8095.
Resumen | Enlaces | BibTeX | Etiquetas: Approximation algorithms, Approximation methods, AWGN channels, BEC, belief propagation decoding, BI-AWGN channel, binary additive white Gaussian noise channel, binary erasure channel, BP estimation, Channel Coding, Complexity theory, error rate reduction, error statistics, Expectation, finite-length codes, Iterative decoding, LDPC codes, LDPC decoding, low-density parity-check decoding, Maximum likelihood decoding, parity check codes, posterior distribution, Propagation, TEP algorithm, tree-structured expectation propagation algorithm, trees (mathematics)
@inproceedings{Salamanca2013,
title = {Improving the BP Estimate over the AWGN Channel Using Tree-Structured Expectation Propagation},
author = {Luis Salamanca and Juan Jose Murillo-Fuentes and Pablo M Olmos and Fernando Perez-Cruz},
url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=6620774},
issn = {2157-8095},
year = {2013},
date = {2013-01-01},
booktitle = {2013 IEEE International Symposium on Information Theory},
pages = {2990--2994},
publisher = {IEEE},
address = {Istanbul},
abstract = {In this paper, we propose the tree-structured expectation propagation (TEP) algorithm for low-density parity-check (LDPC) decoding over the binary additive white Gaussian noise (BI-AWGN) channel. By approximating the posterior distribution by a tree-structure factorization, the TEP has been proven to improve belief propagation (BP) decoding over the binary erasure channel (BEC). We show for the AWGN channel how the TEP decoder is also able to capture additional information disregarded by the BP solution, which leads to a noticeable reduction of the error rate for finite-length codes. We show that for the range of codes of interest, the TEP gain is obtained with a slight increase in complexity over that of the BP algorithm. An efficient way of constructing the tree-like structure is also described.},
keywords = {Approximation algorithms, Approximation methods, AWGN channels, BEC, belief propagation decoding, BI-AWGN channel, binary additive white Gaussian noise channel, binary erasure channel, BP estimation, Channel Coding, Complexity theory, error rate reduction, error statistics, Expectation, finite-length codes, Iterative decoding, LDPC codes, LDPC decoding, low-density parity-check decoding, Maximum likelihood decoding, parity check codes, posterior distribution, Propagation, TEP algorithm, tree-structured expectation propagation algorithm, trees (mathematics)},
pubstate = {published},
tppubtype = {inproceedings}
}
Durisi, Giuseppe; Tarable, Alberto; Koch, Tobias
On the Multiplexing Gain of MIMO Microwave Backhaul Links Affected by Phase Noise Proceedings Article
En: 2013 IEEE International Conference on Communications (ICC), pp. 3209–3214, IEEE, Budapest, 2013, ISSN: 1550-3607.
Resumen | Enlaces | BibTeX | Etiquetas: AWGN channels, marginal distribution, Microwave antennas, microwave links, MIMO, MIMO AWGN channel, MIMO communication, MIMO microwave backhaul links, MIMO multiplexing gain, multiple-input multiple-output AWGN channel, Multiplexing, Phase noise, phase-noise processes, Receivers, Signal to noise ratio, strong phase noise, transmit signal, Transmitters
@inproceedings{Durisi2013,
title = {On the Multiplexing Gain of MIMO Microwave Backhaul Links Affected by Phase Noise},
author = {Giuseppe Durisi and Alberto Tarable and Tobias Koch},
url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=6655038},
issn = {1550-3607},
year = {2013},
date = {2013-01-01},
booktitle = {2013 IEEE International Conference on Communications (ICC)},
pages = {3209--3214},
publisher = {IEEE},
address = {Budapest},
abstract = {We consider a multiple-input multiple-output (MIMO) AWGN channel affected by phase noise. Focusing on the 2 × 2 case, we show that no MIMO multiplexing gain is to be expected when the phase-noise processes at each antenna are independent, memoryless in time, and with uniform marginal distribution over [0, 2$pi$] (strong phase noise), and when the transmit signal is isotropically distributed on the real plane. The scenario of independent phase-noise processes across antennas is relevant for microwave backhaul links operating in the 20-40 GHz range.},
keywords = {AWGN channels, marginal distribution, Microwave antennas, microwave links, MIMO, MIMO AWGN channel, MIMO communication, MIMO microwave backhaul links, MIMO multiplexing gain, multiple-input multiple-output AWGN channel, Multiplexing, Phase noise, phase-noise processes, Receivers, Signal to noise ratio, strong phase noise, transmit signal, Transmitters},
pubstate = {published},
tppubtype = {inproceedings}
}
Yang, Wei; Durisi, Giuseppe; Koch, Tobias; Polyanskiy, Yury
Quasi-Static SIMO Fading Channels at Finite Blocklength Proceedings Article
En: 2013 IEEE International Symposium on Information Theory, pp. 1531–1535, IEEE, Istanbul, 2013, ISSN: 2157-8095.
Resumen | Enlaces | BibTeX | Etiquetas: achievability bounds, AWGN channel, AWGN channels, channel capacity, channel dispersion, channel gains, Dispersion, error probability, error statistics, Fading, fading channels, fading realizations, fast convergence, finite blocklength, maximal achievable rate, numerical evaluation, outage capacity, quasistatic SIMO fading channels, Random variables, Receivers, SIMO Rician channel, single-input multiple-output, Transmitters, zero dispersion
@inproceedings{Yang2013a,
title = {Quasi-Static SIMO Fading Channels at Finite Blocklength},
author = {Wei Yang and Giuseppe Durisi and Tobias Koch and Yury Polyanskiy},
url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=6620483},
issn = {2157-8095},
year = {2013},
date = {2013-01-01},
booktitle = {2013 IEEE International Symposium on Information Theory},
pages = {1531--1535},
publisher = {IEEE},
address = {Istanbul},
abstract = {We investigate the maximal achievable rate for a given blocklength and error probability over quasi-static single-input multiple-output (SIMO) fading channels. Under mild conditions on the channel gains, it is shown that the channel dispersion is zero regardless of whether the fading realizations are available at the transmitter and/or the receiver. The result follows from computationally and analytically tractable converse and achievability bounds. Through numerical evaluation, we verify that, in some scenarios, zero dispersion indeed entails fast convergence to outage capacity as the blocklength increases. In the example of a particular 1×2 SIMO Rician channel, the blocklength required to achieve 90% of capacity is about an order of magnitude smaller compared to the blocklength required for an AWGN channel with the same capacity.},
keywords = {achievability bounds, AWGN channel, AWGN channels, channel capacity, channel dispersion, channel gains, Dispersion, error probability, error statistics, Fading, fading channels, fading realizations, fast convergence, finite blocklength, maximal achievable rate, numerical evaluation, outage capacity, quasistatic SIMO fading channels, Random variables, Receivers, SIMO Rician channel, single-input multiple-output, Transmitters, zero dispersion},
pubstate = {published},
tppubtype = {inproceedings}
}
2012
Salamanca, Luis; Murillo-Fuentes, Juan Jose; Olmos, Pablo M; Perez-Cruz, Fernando
Tree-Structured Expectation Propagation for LDPC Decoding over the AWGN Channel Proceedings Article
En: 2012 IEEE International Workshop on Machine Learning for Signal Processing, pp. 1–6, IEEE, Santander, 2012, ISSN: 1551-2541.
Resumen | Enlaces | BibTeX | Etiquetas: additive white Gaussian noise channel, Approximation algorithms, Approximation methods, approximation theory, AWGN channel, AWGN channels, belief propagation solution, Bit error rate, Decoding, error floor reduction, finite-length regime, Gain, Joints, LDPC decoding, low-density parity-check decoding, pairwise marginal constraint, parity check codes, TEP decoder, tree-like approximation, tree-structured expectation propagation, trees (mathematics)
@inproceedings{Salamanca2012,
title = {Tree-Structured Expectation Propagation for LDPC Decoding over the AWGN Channel},
author = {Luis Salamanca and Juan Jose Murillo-Fuentes and Pablo M Olmos and Fernando Perez-Cruz},
url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=6349716},
issn = {1551-2541},
year = {2012},
date = {2012-01-01},
booktitle = {2012 IEEE International Workshop on Machine Learning for Signal Processing},
pages = {1--6},
publisher = {IEEE},
address = {Santander},
abstract = {In this paper, we propose the tree-structured expectation propagation (TEP) algorithm for low-density parity-check (LDPC) decoding over the additive white Gaussian noise (AWGN) channel. By imposing a tree-like approximation over the graphical model of the code, this algorithm introduces pairwise marginal constraints over pairs of variables, which provide joint information of the variables related. Thanks to this, the proposed TEP decoder improves the performance of the standard belief propagation (BP) solution. An efficient way of constructing the tree-like structure is also described. The simulation results illustrate the TEP decoder gain in the finite-length regime, compared to the standard BP solution. For code lengths shorter than n = 512, the gain in the waterfall region achieves up to 0.25 dB. We also notice a remarkable reduction of the error floor.},
keywords = {additive white Gaussian noise channel, Approximation algorithms, Approximation methods, approximation theory, AWGN channel, AWGN channels, belief propagation solution, Bit error rate, Decoding, error floor reduction, finite-length regime, Gain, Joints, LDPC decoding, low-density parity-check decoding, pairwise marginal constraint, parity check codes, TEP decoder, tree-like approximation, tree-structured expectation propagation, trees (mathematics)},
pubstate = {published},
tppubtype = {inproceedings}
}
2010
Koch, Tobias; Lapidoth, Amos
Increased Capacity per Unit-Cost by Oversampling Proceedings Article
En: 2010 IEEE 26-th Convention of Electrical and Electronics Engineers in Israel, pp. 000684–000688, IEEE, Eliat, 2010, ISBN: 978-1-4244-8681-6.
Resumen | Enlaces | BibTeX | Etiquetas: AWGN, AWGN channels, bandlimited Gaussian channel, channel capacity, Gaussian channels, increased capacity per unit cost, Information rates, one bit output quantizer, oversampling, quantisation (signal), quantization, sampling rate recovery, signal sampling
@inproceedings{Koch2010,
title = {Increased Capacity per Unit-Cost by Oversampling},
author = {Tobias Koch and Amos Lapidoth},
url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=5662127},
isbn = {978-1-4244-8681-6},
year = {2010},
date = {2010-01-01},
booktitle = {2010 IEEE 26-th Convention of Electrical and Electronics Engineers in Israel},
pages = {000684--000688},
publisher = {IEEE},
address = {Eliat},
abstract = {It is demonstrated that doubling the sampling rate recovers some of the loss in capacity incurred on the bandlimited Gaussian channel with a one-bit output quantizer.},
keywords = {AWGN, AWGN channels, bandlimited Gaussian channel, channel capacity, Gaussian channels, increased capacity per unit cost, Information rates, one bit output quantizer, oversampling, quantisation (signal), quantization, sampling rate recovery, signal sampling},
pubstate = {published},
tppubtype = {inproceedings}
}