2015
Elvira, Victor; Martino, Luca; Luengo, David; Bugallo, Monica F
Efficient Multiple Importance Sampling Estimators Artículo de revista
En: IEEE Signal Processing Letters, vol. 22, no 10, pp. 1757–1761, 2015, ISSN: 1070-9908.
Resumen | Enlaces | BibTeX | Etiquetas: Adaptive importance sampling, classical mixture approach, computational complexity, Computational efficiency, Computer Simulation, deterministic mixture, estimation theory, Journal, Monte Carlo methods, multiple importance sampling, multiple importance sampling estimator, partial deterministic mixture MIS estimator, Proposals, signal sampling, Sociology, Standards, variance reduction, weight calculation
@article{Elvira2015bb,
title = {Efficient Multiple Importance Sampling Estimators},
author = {Victor Elvira and Luca Martino and David Luengo and Monica F Bugallo},
url = {http://ieeexplore.ieee.org/articleDetails.jsp?arnumber=7105865},
doi = {10.1109/LSP.2015.2432078},
issn = {1070-9908},
year = {2015},
date = {2015-10-01},
journal = {IEEE Signal Processing Letters},
volume = {22},
number = {10},
pages = {1757--1761},
publisher = {IEEE},
abstract = {Multiple importance sampling (MIS) methods use a set of proposal distributions from which samples are drawn. Each sample is then assigned an importance weight that can be obtained according to different strategies. This work is motivated by the trade-off between variance reduction and computational complexity of the different approaches (classical vs. deterministic mixture) available for the weight calculation. A new method that achieves an efficient compromise between both factors is introduced in this letter. It is based on forming a partition of the set of proposal distributions and computing the weights accordingly. Computer simulations show the excellent performance of the associated partial deterministic mixture MIS estimator.},
keywords = {Adaptive importance sampling, classical mixture approach, computational complexity, Computational efficiency, Computer Simulation, deterministic mixture, estimation theory, Journal, Monte Carlo methods, multiple importance sampling, multiple importance sampling estimator, partial deterministic mixture MIS estimator, Proposals, signal sampling, Sociology, Standards, variance reduction, weight calculation},
pubstate = {published},
tppubtype = {article}
}
2014
Cespedes, Javier; Olmos, Pablo M; Sanchez-Fernandez, Matilde; Perez-Cruz, Fernando
Expectation Propagation Detection for High-order High-dimensional MIMO Systems Artículo de revista
En: IEEE Transactions on Communications, vol. PP, no 99, pp. 1–1, 2014, ISSN: 0090-6778.
Resumen | Enlaces | BibTeX | Etiquetas: Approximation methods, computational complexity, Detectors, MIMO, Signal to noise ratio, Vectors
@article{Cespedes2014,
title = {Expectation Propagation Detection for High-order High-dimensional MIMO Systems},
author = {Javier Cespedes and Pablo M Olmos and Matilde Sanchez-Fernandez and Fernando Perez-Cruz},
url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=6841617},
issn = {0090-6778},
year = {2014},
date = {2014-01-01},
journal = {IEEE Transactions on Communications},
volume = {PP},
number = {99},
pages = {1--1},
abstract = {Modern communications systems use multiple-input multiple-output (MIMO) and high-order QAM constellations for maximizing spectral efficiency. However, as the number of antennas and the order of the constellation grow, the design of efficient and low-complexity MIMO receivers possesses big technical challenges. For example, symbol detection can no longer rely on maximum likelihood detection or sphere-decoding methods, as their complexity increases exponentially with the number of transmitters/receivers. In this paper, we propose a low-complexity high-accuracy MIMO symbol detector based on the Expectation Propagation (EP) algorithm. EP allows approximating iteratively at polynomial-time the posterior distribution of the transmitted symbols. We also show that our EP MIMO detector outperforms classic and state-of-the-art solutions reducing the symbol error rate at a reduced computational complexity.},
keywords = {Approximation methods, computational complexity, Detectors, MIMO, Signal to noise ratio, Vectors},
pubstate = {published},
tppubtype = {article}
}
2011
Olmos, Pablo M; Murillo-Fuentes, Juan Jose; Perez-Cruz, Fernando
Tree-Structured Expectation Propagation for Decoding Finite-Length LDPC Codes Artículo de revista
En: IEEE Communications Letters, vol. 15, no 2, pp. 235–237, 2011, ISSN: 1089-7798.
Resumen | Enlaces | BibTeX | Etiquetas: belief propagation decoder, BP algorithm, BP decoder, code graph, communication complexity, computational complexity, Decoding, finite-length analysis, finite-length low-density parity-check code, LDPC code, LDPC decoding, parity check codes, radiowave propagation, stopping set, TEP algorithm, TEP decoder, tree-structured expectation propagation
@article{Olmos2011c,
title = {Tree-Structured Expectation Propagation for Decoding Finite-Length LDPC Codes},
author = {Pablo M Olmos and Juan Jose Murillo-Fuentes and Fernando Perez-Cruz},
url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=5682215},
issn = {1089-7798},
year = {2011},
date = {2011-01-01},
journal = {IEEE Communications Letters},
volume = {15},
number = {2},
pages = {235--237},
abstract = {In this paper, we propose Tree-structured Expectation Propagation (TEP) algorithm to decode finite-length Low-Density Parity-Check (LDPC) codes. The TEP decoder is able to continue decoding once the standard Belief Propagation (BP) decoder fails, presenting the same computational complexity as the BP decoder. The BP algorithm is dominated by the presence of stopping sets (SSs) in the code graph. We show that the TEP decoder, without previous knowledge of the graph, naturally avoids some fairly common SSs. This results in a significant improvement in the system performance.},
keywords = {belief propagation decoder, BP algorithm, BP decoder, code graph, communication complexity, computational complexity, Decoding, finite-length analysis, finite-length low-density parity-check code, LDPC code, LDPC decoding, parity check codes, radiowave propagation, stopping set, TEP algorithm, TEP decoder, tree-structured expectation propagation},
pubstate = {published},
tppubtype = {article}
}