### 2011

Vazquez, Manuel A; Miguez, Joaquin

A Per-Survivor Processing Receiver for MIMO Transmission Systems With One Unknown Channel Order Per Output Artículo de revista

En: IEEE Transactions on Vehicular Technology, vol. 60, no. 9, pp. 4415–4426, 2011, ISSN: 0018-9545.

Resumen | Enlaces | BibTeX | Etiquetas: Channel estimation, communication channel, Complexity theory, dynamic programming, frequency-selective MIMO channel, frequency-selective multiple-input multiple-output, maximum likelihood detection, maximum likelihood sequence detection, maximum likelihood sequence estimation, MIMO, MIMO channel impulse response coefficient, MIMO communication, MIMO transmission system, multipath channels, mutiple-input–multiple-output (MIMO), per-survivor processing receiver, Receiving antennas, Signal processing algorithms, time-selective MIMO channel, Transmitting antennas, Viterbi algorithm

@article{Vazquez2011,

title = {A Per-Survivor Processing Receiver for MIMO Transmission Systems With One Unknown Channel Order Per Output},

author = {Manuel A Vazquez and Joaquin Miguez},

url = {http://www.tsc.uc3m.es/~jmiguez/papers/P31_2011_A Per-Survivor Processing Receiver for MIMO Transmission Systems With One Unknown Channel Order Per Output.pdf http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=6032763},

issn = {0018-9545},

year = {2011},

date = {2011-01-01},

journal = {IEEE Transactions on Vehicular Technology},

volume = {60},

number = {9},

pages = {4415--4426},

abstract = {The order of a communications channel is the length of its impulse response. Recently, several works have tackled the problem of estimating the order of a frequency-selective multiple-input-multiple-output (MIMO) channel. However, all of them consider a single order, despite the fact that a MIMO channel comprises several subchannels (specifically, as many as the number of inputs times the number of outputs), each one possibly with its own order. In this paper, we introduce an algorithm for maximum-likelihood sequence detection (MLSD) in frequency- and time-selective MIMO channels that incorporates full estimation of the MIMO channel impulse response (CIR) coefficients, including one channel order per output. Simulation results following the analytical derivation of the algorithm suggest that the proposed receiver can achieve significant improvements in performance when transmitting through a MIMO channel that effectively comprises subchannels of different lengths.},

keywords = {Channel estimation, communication channel, Complexity theory, dynamic programming, frequency-selective MIMO channel, frequency-selective multiple-input multiple-output, maximum likelihood detection, maximum likelihood sequence detection, maximum likelihood sequence estimation, MIMO, MIMO channel impulse response coefficient, MIMO communication, MIMO transmission system, multipath channels, mutiple-input\textendashmultiple-output (MIMO), per-survivor processing receiver, Receiving antennas, Signal processing algorithms, time-selective MIMO channel, Transmitting antennas, Viterbi algorithm},

pubstate = {published},

tppubtype = {article}

}

### 2010

Salamanca, Luis; Murillo-Fuentes, Juan Jose; Perez-Cruz, Fernando

Channel Decoding with a Bayesian Equalizer Artículo en actas

En: 2010 IEEE International Symposium on Information Theory, pp. 1998–2002, IEEE, Austin, TX, 2010, ISBN: 978-1-4244-7892-7.

Resumen | Enlaces | BibTeX | Etiquetas: a posteriori probability, Bayesian equalizer, Bayesian methods, BER, Bit error rate, Channel Coding, channel decoding, channel estate information, Communication channels, Decoding, equalisers, Equalizers, error statistics, low-density parity-check decoders, LPDC decoders, Maximum likelihood decoding, maximum likelihood detection, maximum likelihood estimation, Noise reduction, parity check codes, Probability, Uncertainty

@inproceedings{Salamanca2010a,

title = {Channel Decoding with a Bayesian Equalizer},

author = {Luis Salamanca and Juan Jose Murillo-Fuentes and Fernando Perez-Cruz},

url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=5513348},

isbn = {978-1-4244-7892-7},

year = {2010},

date = {2010-01-01},

booktitle = {2010 IEEE International Symposium on Information Theory},

pages = {1998--2002},

publisher = {IEEE},

address = {Austin, TX},

abstract = {Low-density parity-check (LPDC) decoders assume the channel estate information (CSI) is known and they have the true a posteriori probability (APP) for each transmitted bit. But in most cases of interest, the CSI needs to be estimated with the help of a short training sequence and the LDPC decoder has to decode the received word using faulty APP estimates. In this paper, we study the uncertainty in the CSI estimate and how it affects the bit error rate (BER) output by the LDPC decoder. To improve these APP estimates, we propose a Bayesian equalizer that takes into consideration not only the uncertainty due to the noise in the channel, but also the uncertainty in the CSI estimate, reducing the BER after the LDPC decoder.},

keywords = {a posteriori probability, Bayesian equalizer, Bayesian methods, BER, Bit error rate, Channel Coding, channel decoding, channel estate information, Communication channels, Decoding, equalisers, Equalizers, error statistics, low-density parity-check decoders, LPDC decoders, Maximum likelihood decoding, maximum likelihood detection, maximum likelihood estimation, Noise reduction, parity check codes, Probability, Uncertainty},

pubstate = {published},

tppubtype = {inproceedings}

}

### 2009

Bravo-Santos, Ángel M; Djuric, Petar M

Cooperative Relay Communications in Mesh Networks Artículo en actas

En: 2009 IEEE 10th Workshop on Signal Processing Advances in Wireless Communications, pp. 499–503, IEEE, Perugia, 2009, ISBN: 978-1-4244-3695-8.

Resumen | Enlaces | BibTeX | Etiquetas: binary transmission, bit error probability, Bit error rate, cooperative relay communications, decode-and-forward relays, Detectors, error statistics, Maximum likelihood decoding, maximum likelihood detection, Mesh networks, mesh wireless networks, multi-hop networks, Network topology, optimal node decision rules, Peer to peer computing, radio networks, Relays, spread spectrum communication, telecommunication network topology, Wireless Sensor Networks

@inproceedings{Bravo-Santos2009,

title = {Cooperative Relay Communications in Mesh Networks},

author = {\'{A}ngel M Bravo-Santos and Petar M Djuric},

url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=5161835},

isbn = {978-1-4244-3695-8},

year = {2009},

date = {2009-01-01},

booktitle = {2009 IEEE 10th Workshop on Signal Processing Advances in Wireless Communications},

pages = {499--503},

publisher = {IEEE},

address = {Perugia},

abstract = {In previous literature on cooperative relay communications, the emphasis has been on the study of multi-hop networks. In this paper we address mesh wireless networks that use decode-and-forward relays for which we derive the optimal node decision rules in case of binary transmission. We also obtain the expression for the overall bit error probability. We compare the mesh networks with multi-hop networks and show the improvement in performance that can be achieved with them when both networks have the same number of nodes and equal number of hops.},

keywords = {binary transmission, bit error probability, Bit error rate, cooperative relay communications, decode-and-forward relays, Detectors, error statistics, Maximum likelihood decoding, maximum likelihood detection, Mesh networks, mesh wireless networks, multi-hop networks, Network topology, optimal node decision rules, Peer to peer computing, radio networks, Relays, spread spectrum communication, telecommunication network topology, Wireless Sensor Networks},

pubstate = {published},

tppubtype = {inproceedings}

}

Murillo-Fuentes, Juan Jose; Perez-Cruz, Fernando

Gaussian Process Regressors for Multiuser Detection in DS-CDMA Systems Artículo de revista

En: IEEE Transactions on Communications, vol. 57, no. 8, pp. 2339–2347, 2009, ISSN: 0090-6778.

Resumen | Enlaces | BibTeX | Etiquetas: analytical nonlinear multiuser detectors, code division multiple access, communication systems, Detectors, digital communication, digital communications, DS-CDMA systems, Gaussian process for regressi, Gaussian process regressors, Gaussian processes, GPR, Ground penetrating radar, least mean squares methods, maximum likelihood, maximum likelihood detection, maximum likelihood estimation, mean square error methods, minimum mean square error, MMSE, Multiaccess communication, Multiuser detection, nonlinear estimator, nonlinear state-ofthe- art solutions, radio receivers, Receivers, regression analysis, Support vector machines

@article{Murillo-Fuentes2009,

title = {Gaussian Process Regressors for Multiuser Detection in DS-CDMA Systems},

author = {Juan Jose Murillo-Fuentes and Fernando Perez-Cruz},

url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=5201027},

issn = {0090-6778},

year = {2009},

date = {2009-01-01},

journal = {IEEE Transactions on Communications},

volume = {57},

number = {8},

pages = {2339--2347},

abstract = {In this paper we present Gaussian processes for Regression (GPR) as a novel detector for CDMA digital communications. Particularly, we propose GPR for constructing analytical nonlinear multiuser detectors in CDMA communication systems. GPR can easily compute the parameters that describe its nonlinearities by maximum likelihood. Thereby, no cross-validation is needed, as it is typically used in nonlinear estimation procedures. The GPR solution is analytical, given its parameters, and it does not need to solve an optimization problem for building the nonlinear estimator. These properties provide fast and accurate learning, two major issues in digital communications. The GPR with a linear decision function can be understood as a regularized MMSE detector, in which the regularization parameter is optimally set. We also show the GPR receiver to be a straightforward nonlinear extension of the linear minimum mean square error (MMSE) criterion, widely used in the design of these receivers. We argue the benefits of this new approach in short codes CDMA systems where little information on the users' codes, users' amplitudes or the channel is available. The paper includes some experiments to show that GPR outperforms linear (MMSE) and nonlinear (SVM) state-ofthe- art solutions.},

keywords = {analytical nonlinear multiuser detectors, code division multiple access, communication systems, Detectors, digital communication, digital communications, DS-CDMA systems, Gaussian process for regressi, Gaussian process regressors, Gaussian processes, GPR, Ground penetrating radar, least mean squares methods, maximum likelihood, maximum likelihood detection, maximum likelihood estimation, mean square error methods, minimum mean square error, MMSE, Multiaccess communication, Multiuser detection, nonlinear estimator, nonlinear state-ofthe- art solutions, radio receivers, Receivers, regression analysis, Support vector machines},

pubstate = {published},

tppubtype = {article}

}

Vazquez, Manuel A; Miguez, Joaquin

Maximum-Likelihood Sequence Detection in Time- and Frequency-Selective MIMO Channels With Unknown Order Artículo de revista

En: IEEE Transactions on Vehicular Technology, vol. 58, no. 1, pp. 499–504, 2009, ISSN: 0018-9545.

Resumen | Enlaces | BibTeX | Etiquetas: channel impulse response, channel order estimation, CIR, frequency-selective multiple-input-multiple-output, joint channel and data estimation, maximum likelihood detection, maximum-likelihood sequence detection, MIMO channels, MIMO communication, MLSD, Multiple Input Multiple Output (MIMO), multiple-input–multiple-output (MIMO), per-survivor processing, per-survivor processing (PSP), telecommunication channels, time-selective multiple-input-multiple-output chan

@article{Vazquez2009,

title = {Maximum-Likelihood Sequence Detection in Time- and Frequency-Selective MIMO Channels With Unknown Order},

author = {Manuel A Vazquez and Joaquin Miguez},

url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=4510724},

issn = {0018-9545},

year = {2009},

date = {2009-01-01},

journal = {IEEE Transactions on Vehicular Technology},

volume = {58},

number = {1},

pages = {499--504},

abstract = {In the equalization of frequency-selective multiple-input-multiple-output (MIMO) channels, it is usually assumed that the length of the channel impulse response (CIR), which is also referred to as the channel order, is known. However, this is not true in most practical situations, and it is a common approach to overestimate the channel order to avoid the serious performance degradation that occurs when the CIR length is underestimated. Unfortunately, the computational complexity of maximum-likelihood sequence detection (MLSD) in frequency-selective channels exponentially grows with the channel order; hence, overestimation can actually be undesirable because it leads to more expensive and inefficient receivers. In this paper, we introduce an algorithm for MLSD that incorporates the full estimation of the MIMO CIR parameters, including its order. The proposed technique is based on the per-survivor processing (PSP) methodology; it admits both blind and semiblind implementations, depending on the availability of pilot data, and is designed to work with time-selective channels. In addition to the analytical derivation of the algorithm, we provide computer simulation results that illustrate the effectiveness of the resulting receiver.},

keywords = {channel impulse response, channel order estimation, CIR, frequency-selective multiple-input-multiple-output, joint channel and data estimation, maximum likelihood detection, maximum-likelihood sequence detection, MIMO channels, MIMO communication, MLSD, Multiple Input Multiple Output (MIMO), multiple-input\textendashmultiple-output (MIMO), per-survivor processing, per-survivor processing (PSP), telecommunication channels, time-selective multiple-input-multiple-output chan},

pubstate = {published},

tppubtype = {article}

}

### 2008

Vazquez, Manuel A; Miguez, Joaquin

A Per-Survivor Processing Algorithm for Maximum Likelihood Equalization of MIMO Channels with Unknown Order Artículo en actas

En: 2008 International ITG Workshop on Smart Antennas, pp. 387–391, IEEE, Vienna, 2008, ISBN: 978-1-4244-1756-8.

Resumen | Enlaces | BibTeX | Etiquetas: Channel estimation, channel impulse response, computational complexity, Computer science education, Computer Simulation, Degradation, Frequency, frequency-selective multiple-input multiple-output, maximum likelihood detection, maximum likelihood equalization, maximum likelihood estimation, maximum likelihood sequence detection, maximum likelihood sequence estimation, MIMO, MIMO channels, MIMO communication, per-survivor processing algorithm, time-selective channels, Transmitting antennas

@inproceedings{Vazquez2008,

title = {A Per-Survivor Processing Algorithm for Maximum Likelihood Equalization of MIMO Channels with Unknown Order},

author = {Manuel A Vazquez and Joaquin Miguez},

url = {http://ieeexplore.ieee.org/articleDetails.jsp?arnumber=4475587},

isbn = {978-1-4244-1756-8},

year = {2008},

date = {2008-01-01},

booktitle = {2008 International ITG Workshop on Smart Antennas},

pages = {387--391},

publisher = {IEEE},

address = {Vienna},

abstract = {In the equalization of frequency-selective multiple-input multiple-output (MIMO) channels it is usually assumed that the length of the channel impulse response (CIR), also referred to as the channel order, is known. However, this is not true in most practical situations and, in order to avoid the serious performance degradation that occurs when the CIR length is underestimated, a channel with "more than enough" taps is usually considered. This possibly means overestimating the channel order, and is not desirable since the computational complexity of maximum likelihood sequence detection (MLSD) in frequency-selective channels grows exponentially with the channel order. In addition to that, the higher the channel order considered, the more the number of channel coefficients that need to be estimated from the same set of observations. In this paper, we introduce an algorithm for MLSD that incorporates the full estimation of the MIMO CIR parameters, including its order. The proposed technique is based on the per survivor processing (PSP) methodology, it admits both blind and semiblind implementations, depending on the availability of pilot data, and is designed to work with time-selective channels. Besides the analytical derivation of the algorithm, we provide computer simulation results that illustrate the effectiveness of the resulting receiver},

keywords = {Channel estimation, channel impulse response, computational complexity, Computer science education, Computer Simulation, Degradation, Frequency, frequency-selective multiple-input multiple-output, maximum likelihood detection, maximum likelihood equalization, maximum likelihood estimation, maximum likelihood sequence detection, maximum likelihood sequence estimation, MIMO, MIMO channels, MIMO communication, per-survivor processing algorithm, time-selective channels, Transmitting antennas},

pubstate = {published},

tppubtype = {inproceedings}

}

Vazquez, Manuel A; Miguez, Joaquin

A Per-Survivor Processing Algorithm for Maximum Likelihood Equalization of MIMO Channels with Unknown Order Artículo en actas

En: 2008 International ITG Workshop on Smart Antennas, pp. 387–391, IEEE, Vienna, 2008, ISBN: 978-1-4244-1756-8.

Resumen | Enlaces | BibTeX | Etiquetas: Channel estimation, channel impulse response, computational complexity, Computer science education, Computer Simulation, Degradation, Frequency, frequency-selective multiple-input multiple-output, maximum likelihood detection, maximum likelihood equalization, maximum likelihood estimation, maximum likelihood sequence detection, maximum likelihood sequence estimation, MIMO, MIMO channels, MIMO communication, per-survivor processing algorithm, time-selective channels, Transmitting antennas

@inproceedings{Vazquez2008a,

title = {A Per-Survivor Processing Algorithm for Maximum Likelihood Equalization of MIMO Channels with Unknown Order},

author = {Manuel A Vazquez and Joaquin Miguez},

url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=4475587},

isbn = {978-1-4244-1756-8},

year = {2008},

date = {2008-01-01},

booktitle = {2008 International ITG Workshop on Smart Antennas},

pages = {387--391},

publisher = {IEEE},

address = {Vienna},

abstract = {In the equalization of frequency-selective multiple-input multiple-output (MIMO) channels it is usually assumed that the length of the channel impulse response (CIR), also referred to as the channel order, is known. However, this is not true in most practical situations and, in order to avoid the serious performance degradation that occurs when the CIR length is underestimated, a channel with "more than enough" taps is usually considered. This possibly means overestimating the channel order, and is not desirable since the computational complexity of maximum likelihood sequence detection (MLSD) in frequency-selective channels grows exponentially with the channel order. In addition to that, the higher the channel order considered, the more the number of channel coefficients that need to be estimated from the same set of observations. In this paper, we introduce an algorithm for MLSD that incorporates the full estimation of the MIMO CIR parameters, including its order. The proposed technique is based on the per survivor processing (PSP) methodology, it admits both blind and semiblind implementations, depending on the availability of pilot data, and is designed to work with time-selective channels. Besides the analytical derivation of the algorithm, we provide computer simulation results that illustrate the effectiveness of the resulting receiver.},

keywords = {Channel estimation, channel impulse response, computational complexity, Computer science education, Computer Simulation, Degradation, Frequency, frequency-selective multiple-input multiple-output, maximum likelihood detection, maximum likelihood equalization, maximum likelihood estimation, maximum likelihood sequence detection, maximum likelihood sequence estimation, MIMO, MIMO channels, MIMO communication, per-survivor processing algorithm, time-selective channels, Transmitting antennas},

pubstate = {published},

tppubtype = {inproceedings}

}