TY - JOUR
T1 - Realizable spatio-temporal Tomlinson-Harashima precoders
T2 - Theory and fast computation
AU - Wahls, Sander
AU - Boche, Holger
N1 - Funding Information:
Manuscript received March 24, 2011; revised October 17, 2011 and May 02, 2012; accepted May 29, 2012. Date of publication June 06, 2012; date of current version August 07, 2012. The associate editor coordinating the review of this manuscript and approving it for publication was Prof. Amir Leshem. This work was supported by the German Research Foundation (DFG) by Grant BO 1734/5-2. A portion of this paper was presented at the IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP), Prague, Czech Republic, 2011.
PY - 2012
Y1 - 2012
N2 - We derive the optimal realizable Tomlinson-Harashima precoder for frequency-selective multiple-input multiple-output (MIMO) channels with respect to a simplified mean square error (MSE) criterion. Realizability means that, in contrast to other works, we do not restrict the internal filters of the precoder to have finite impulse responses (FIRs) but nevertheless ensure that the precoder can be operated in real-time subject to a finite latency time which can be chosen by the system designer. In particular, this allows us to consider channels with infinite impulse responses (IIRs) as they occur, e.g., in digital subscriber lines. The feedforward filter is located at the transmitter in our system model and an additional scalar gain is employed at the receiver. The relocation of the feedforward filter allows us to consider decentralized receivers. However, it also makes it necessary to impose a transmit power constraint. The power constraint often has the effect that the input signals at the receiver have to be rescaled. We argue that the inclusion of the additional scalar gain allows us to incorporate the effect of the rescaling operation into the optimization. Special emphasis is put on the fast computation of the realizable Tomlinson-Harashima precoder via displacement structure theory. We propose a fast algorithm which includes a successive construction of a close-to-optimal ordering of the data streams. The complexity of this algorithm is only cubic in the number of channel inputs and quadratic in the latency time. The algorithm can also be applied in situations where certain FIR constraints have to be fulfilled because we find that the optimal realizable Tomlinson-Harashima precoder involves only FIR filters as soon as the channel is FIR. Our results are reproducible.
AB - We derive the optimal realizable Tomlinson-Harashima precoder for frequency-selective multiple-input multiple-output (MIMO) channels with respect to a simplified mean square error (MSE) criterion. Realizability means that, in contrast to other works, we do not restrict the internal filters of the precoder to have finite impulse responses (FIRs) but nevertheless ensure that the precoder can be operated in real-time subject to a finite latency time which can be chosen by the system designer. In particular, this allows us to consider channels with infinite impulse responses (IIRs) as they occur, e.g., in digital subscriber lines. The feedforward filter is located at the transmitter in our system model and an additional scalar gain is employed at the receiver. The relocation of the feedforward filter allows us to consider decentralized receivers. However, it also makes it necessary to impose a transmit power constraint. The power constraint often has the effect that the input signals at the receiver have to be rescaled. We argue that the inclusion of the additional scalar gain allows us to incorporate the effect of the rescaling operation into the optimization. Special emphasis is put on the fast computation of the realizable Tomlinson-Harashima precoder via displacement structure theory. We propose a fast algorithm which includes a successive construction of a close-to-optimal ordering of the data streams. The complexity of this algorithm is only cubic in the number of channel inputs and quadratic in the latency time. The algorithm can also be applied in situations where certain FIR constraints have to be fulfilled because we find that the optimal realizable Tomlinson-Harashima precoder involves only FIR filters as soon as the channel is FIR. Our results are reproducible.
KW - Fast algorithms
KW - MIMO
KW - intersymbol interference
KW - least mean squares algorithms
KW - precoding
UR - http://www.scopus.com/inward/record.url?scp=84865230247&partnerID=8YFLogxK
U2 - 10.1109/TSP.2012.2203123
DO - 10.1109/TSP.2012.2203123
M3 - Article
AN - SCOPUS:84865230247
SN - 1053-587X
VL - 60
SP - 4819
EP - 4833
JO - IEEE Transactions on Signal Processing
JF - IEEE Transactions on Signal Processing
IS - 9
M1 - 6213143
ER -