Realizable Spatio-Temporal Tomlinson-Harashima Precoders: Theory and Fast Computation
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 pr...
Saved in:
Published in | IEEE transactions on signal processing Vol. 60; no. 9; pp. 4819 - 4833 |
---|---|
Main Authors | , |
Format | Journal Article |
Language | English |
Published |
New York, NY
IEEE
01.09.2012
Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
Subjects | |
Online Access | Get full text |
ISSN | 1053-587X 1941-0476 |
DOI | 10.1109/TSP.2012.2203123 |
Cover
Loading…
Abstract | 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. |
---|---|
AbstractList | 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. |
Author | Wahls, S. Boche, H. |
Author_xml | – sequence: 1 givenname: S. surname: Wahls fullname: Wahls, S. email: wahls@princeton.edu organization: Tech. Univ. Munchen, München, Germany – sequence: 2 givenname: H. surname: Boche fullname: Boche, H. email: boche@tum.de organization: Tech. Univ. Munchen, München, Germany |
BackLink | http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=26264721$$DView record in Pascal Francis |
BookMark | eNp9kEtLxDAURoMo-NwLbgrismNuXm3dyaCOIChawV1Ik5Tp0DY16SzGX2-Gji5cuMpdnO-7uecY7feutwidA54B4OK6fHuZEQxkRgimQOgeOoKCQYpZJvbjjDlNeZ59HKLjEFYYA2OFOELvr1a1zZeqWpu8DWpsXFrabnBetUnpurbpg-vThfIqLJtOJS_eamesDzdJubTObxLVm-RehTGZu25Yj9uK_hQd1KoN9mz3nqD3-7tyvkifnh8e57dPqaaCjilXBa4wFJwXHHLNMddEUFaDzjUxpAJR11VmjSFgBanzzBjDeM2oERyoregJupx6B-8-1zaMcuXWvo8rJWBKaR4NiEhd7SgVtGprr3rdBDn4eJDfSCKIYBmByImJ096F4G0tdTPdM3rVtLFSblXLqFpuVcud6hjEf4I_3f9ELqZIY639xUX8BTBKvwFb2orT |
CODEN | ITPRED |
CitedBy_id | crossref_primary_10_1109_TSP_2013_2259487 |
Cites_doi | 10.1109/TIT.2004.834787 10.1109/78.869048 10.1109/TIT.2005.862077 10.1109/GLOCOM.1989.64231 10.1109/NEWCAS.2004.1359050 10.1002/0471439002 10.1109/TSP.2008.929126 10.1109/TSP.2007.893978 10.1109/25.806797 10.1109/49.93092 10.1109/30.809202 10.1049/el:20010899 10.1109/TSP.2005.861900 10.1109/JSSC.2009.2031015 10.1109/49.93100 10.1109/VETECS.2005.1543433 10.1109/TSP.2003.822360 10.1109/49.793307 10.1109/TSP.2007.893954 10.1109/TSP.2010.2044606 10.1109/TCOM.1972.1091221 10.1109/78.97994 10.1109/MSP.2009.932122 10.1109/TIT.2005.856935 10.1049/el:19710089 10.1109/TSP.2005.859254 10.1109/ICASSP.2010.5496048 10.1109/TCSII.2007.914435 10.1109/18.761338 10.1109/ACSSC.2000.911265 10.1109/TCOMM.2005.849639 10.1109/78.890353 10.1109/78.771040 10.1016/j.automatica.2005.04.010 10.1109/ACSSC.1994.471638 10.1109/MSP.2003.1203214 10.1109/IZS.2004.1287426 |
ContentType | Journal Article |
Copyright | 2015 INIST-CNRS Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Sep 2012 |
Copyright_xml | – notice: 2015 INIST-CNRS – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Sep 2012 |
DBID | 97E RIA RIE AAYXX CITATION IQODW 7SC 7SP 8FD JQ2 L7M L~C L~D |
DOI | 10.1109/TSP.2012.2203123 |
DatabaseName | IEEE All-Society Periodicals Package (ASPP) 2005–Present IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE/IET Electronic Library CrossRef Pascal-Francis Computer and Information Systems Abstracts Electronics & Communications Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
DatabaseTitle | CrossRef Technology Research Database Computer and Information Systems Abstracts – Academic Electronics & Communications Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional |
DatabaseTitleList | Technology Research Database |
Database_xml | – sequence: 1 dbid: RIE name: IEEE/IET Electronic Library url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/ sourceTypes: Publisher |
DeliveryMethod | fulltext_linktorsrc |
Discipline | Engineering Applied Sciences |
EISSN | 1941-0476 |
EndPage | 4833 |
ExternalDocumentID | 2736000791 26264721 10_1109_TSP_2012_2203123 6213143 |
Genre | orig-research |
GroupedDBID | -~X .DC 0R~ 29I 3EH 4.4 53G 5GY 5VS 6IK 85S 97E AAJGR AARMG AASAJ AAWTH ABAZT ABFSI ABQJQ ABVLG ACGFO ACIWK ACKIV ACNCT AENEX AETIX AGQYO AGSQL AHBIQ AI. AIBXA AJQPL AKJIK AKQYR ALLEH ALMA_UNASSIGNED_HOLDINGS ASUFR ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 E.L EBS EJD F5P HZ~ H~9 ICLAB IFIPE IFJZH IPLJI JAVBF LAI MS~ O9- OCL P2P RIA RIE RNS TAE TN5 VH1 AAYOK AAYXX CITATION RIG IQODW 7SC 7SP 8FD JQ2 L7M L~C L~D |
ID | FETCH-LOGICAL-c363t-5a90b019559518c505c2634f1c8c2d2b16ffb7edd21e62f87ddd45f43d6513eb3 |
IEDL.DBID | RIE |
ISSN | 1053-587X |
IngestDate | Mon Jun 30 10:23:38 EDT 2025 Mon Jul 21 09:14:42 EDT 2025 Tue Jul 01 02:52:57 EDT 2025 Thu Apr 24 22:50:29 EDT 2025 Tue Aug 26 16:56:50 EDT 2025 |
IsDoiOpenAccess | false |
IsOpenAccess | true |
IsPeerReviewed | true |
IsScholarly | true |
Issue | 9 |
Keywords | Infinite impulse response filter Input signal least mean squares algorithms Transmitter precoding Frequency selector Optimization Mean square error Digital filter Frequency selection Coding Fast algorithms Ordering MIMO Pretreatment Fast algorithm Feedforward MIMO system Coding circuit Decentralized system Intersymbol interference Digital subscriber line Signal processing Finite impulse response filter Least mean squares methods |
Language | English |
License | CC BY 4.0 |
LinkModel | DirectLink |
MergedId | FETCHMERGED-LOGICAL-c363t-5a90b019559518c505c2634f1c8c2d2b16ffb7edd21e62f87ddd45f43d6513eb3 |
Notes | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 |
OpenAccessLink | http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6213143 |
PQID | 1033389416 |
PQPubID | 85478 |
PageCount | 15 |
ParticipantIDs | ieee_primary_6213143 proquest_journals_1033389416 crossref_citationtrail_10_1109_TSP_2012_2203123 pascalfrancis_primary_26264721 crossref_primary_10_1109_TSP_2012_2203123 |
ProviderPackageCode | CITATION AAYXX |
PublicationCentury | 2000 |
PublicationDate | 2012-09-01 |
PublicationDateYYYYMMDD | 2012-09-01 |
PublicationDate_xml | – month: 09 year: 2012 text: 2012-09-01 day: 01 |
PublicationDecade | 2010 |
PublicationPlace | New York, NY |
PublicationPlace_xml | – name: New York, NY – name: New York |
PublicationTitle | IEEE transactions on signal processing |
PublicationTitleAbbrev | TSP |
PublicationYear | 2012 |
Publisher | IEEE Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
Publisher_xml | – name: IEEE – name: Institute of Electrical and Electronics Engineers – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
References | ref35 ref13 ref12 ref15 ref36 ref14 ref31 ref33 ref32 antsaklis (ref30) 2006 ref10 liu (ref11) 2004; 1 gu (ref22) 2008; 55 ref2 ref1 ref17 ref16 ref19 ref18 anderson (ref27) 1979 kressner (ref40) 2000 ref46 ref24 ref23 ref26 ref47 ref25 ref20 ref41 ref44 ref21 ref43 forney (ref34) 2004 vandewalle (ref45) 2009; 26 ref28 fischer (ref6) 2002 ref29 ref8 ref7 joham (ref42) 2004 ref9 gallivan (ref38) 1995 ref4 ref3 (ref39) 1999 golub (ref37) 1996 ref5 |
References_xml | – year: 1999 ident: ref39 publication-title: Fast Reliable Algorithms for Matrices with Structure – ident: ref33 doi: 10.1109/TIT.2004.834787 – ident: ref43 doi: 10.1109/78.869048 – ident: ref36 doi: 10.1109/TIT.2005.862077 – ident: ref4 doi: 10.1109/GLOCOM.1989.64231 – ident: ref21 doi: 10.1109/NEWCAS.2004.1359050 – ident: ref9 doi: 10.1002/0471439002 – ident: ref16 doi: 10.1109/TSP.2008.929126 – ident: ref41 doi: 10.1109/TSP.2007.893978 – ident: ref10 doi: 10.1109/25.806797 – ident: ref17 doi: 10.1109/49.93092 – year: 2002 ident: ref6 article-title: Space-time transmission using Tomlinson-Harashima precoding publication-title: Proc ITG Conf Source Channel Coding – ident: ref32 doi: 10.1109/30.809202 – ident: ref46 doi: 10.1049/el:20010899 – ident: ref44 doi: 10.1109/TSP.2005.861900 – ident: ref23 doi: 10.1109/JSSC.2009.2031015 – ident: ref18 doi: 10.1109/49.93100 – year: 2000 ident: ref40 publication-title: Factorizations and linear system solvers for matrices with Toeplitz structure – ident: ref12 doi: 10.1109/VETECS.2005.1543433 – ident: ref25 doi: 10.1109/TSP.2003.822360 – start-page: 387 year: 2004 ident: ref42 article-title: MMSE approaches to multiuser spatio-temporal Tomlinson-Harashima precoding publication-title: Proc Int ITG Conf Source Channel Coding – ident: ref31 doi: 10.1109/49.793307 – ident: ref13 doi: 10.1109/TSP.2007.893954 – ident: ref28 doi: 10.1109/TSP.2010.2044606 – ident: ref2 doi: 10.1109/TCOM.1972.1091221 – ident: ref24 doi: 10.1109/78.97994 – volume: 26 start-page: 37 year: 2009 ident: ref45 article-title: Reproducible research in signal processing-What, why, and how publication-title: IEEE Signal Process Mag doi: 10.1109/MSP.2009.932122 – year: 1979 ident: ref27 publication-title: Optimal Filtering – year: 1996 ident: ref37 publication-title: Matrix Computations – ident: ref35 doi: 10.1109/TIT.2005.856935 – ident: ref1 doi: 10.1049/el:19710089 – ident: ref20 doi: 10.1109/TSP.2005.859254 – volume: 1 start-page: 277 year: 2004 ident: ref11 article-title: Nonlinear multiuser precoding for downlink DS-CDMA systems over multipath fading channels publication-title: Proc IEEE Globecom – ident: ref29 doi: 10.1109/ICASSP.2010.5496048 – volume: 55 start-page: 447 year: 2008 ident: ref22 article-title: Design of parallel Tomlinson-Harashima precoders publication-title: IEEE Trans Circuits Syst Express Briefs doi: 10.1109/TCSII.2007.914435 – ident: ref19 doi: 10.1109/18.761338 – year: 1995 ident: ref38 publication-title: QR factorization of rank deficient block Toeplitz matrices – ident: ref5 doi: 10.1109/ACSSC.2000.911265 – ident: ref7 doi: 10.1109/TCOMM.2005.849639 – year: 2006 ident: ref30 publication-title: Linear Systems – ident: ref26 doi: 10.1109/78.890353 – ident: ref14 doi: 10.1109/78.771040 – ident: ref15 doi: 10.1016/j.automatica.2005.04.010 – ident: ref8 doi: 10.1109/ACSSC.1994.471638 – ident: ref3 doi: 10.1109/MSP.2003.1203214 – year: 2004 ident: ref34 article-title: On the role of MMSE estimation in approaching the information-theoretic limits of linear Gaussian channels: Shannon meets Wiener publication-title: Proc Allerton Conf Commun Control Comput – ident: ref47 doi: 10.1109/IZS.2004.1287426 |
SSID | ssj0014496 |
Score | 2.045778 |
Snippet | We derive the optimal realizable Tomlinson-Harashima precoder for frequency-selective multiple-input multiple-output (MIMO) channels with respect to a... |
SourceID | proquest pascalfrancis crossref ieee |
SourceType | Aggregation Database Index Database Enrichment Source Publisher |
StartPage | 4819 |
SubjectTerms | Algorithms Applied sciences Coding, codes Complexity theory Decision feedback equalizers Detection, estimation, filtering, equalization, prediction Exact sciences and technology Fast algorithms Feedforward neural networks Finite impulse response filter Information, signal and communications theory intersymbol interference least mean squares algorithms Mean square error methods MIMO precoding Receivers Signal and communications theory Signal, noise Studies Telecommunications and information theory Transmitters |
Title | Realizable Spatio-Temporal Tomlinson-Harashima Precoders: Theory and Fast Computation |
URI | https://ieeexplore.ieee.org/document/6213143 https://www.proquest.com/docview/1033389416 |
Volume | 60 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1LT-MwEB4Bp-WwwALasmzlA5eV1m1iO06yN7SiqpCK0NJKvUXx67KlRTS98OsZ22m0PLTiEkWK8_LnZL6xv5kBuGB1zlSJCCRWWIr22FDFFKcldyVzCbpvQfI_uZHjmbieZ_Md-NnFwlhrg_jMDvxuWMs3K73xU2VDyVKO9n0XdtFxi7Fa3YqBEKEWF9IFTrMin2-XJJNyOL279RouNmAMhzDjL0xQqKniFZH1GjvFxWoWb37MwdqMDmCyfc4oMvk72DRqoJ9epXD86IscwueWdpLLOE6OYMcuv8D-P8kIj2H2Bzmj13gtLLkLOms6jXmrFmS6ul-EMDE6rh99-aX7mtx6X9rLoH-RGOBP6qUho3rdkFgqImB-ArPR1fT3mLZFF6jmkjc0q0s_N-oT02VpoZEgaSa5cKkuNDNMpdI5lVtjWGolc0VujBGZE9zILOWI7SnsLVdL-xVIIU2NfFGI3OIm0QWyJ13K3DpllExND4ZbHCrdZiT3hTEWVfBMkrJC5CqPXNUi14Mf3RkPMRvHf9oe-47v2rV93oP-C6i74wxdO4H-cA_Ot9hX7fe8xptw9OVLZK9n71_2G3zyN4_qs3PYax439jvSlUb1wzh9BsKu5ec |
linkProvider | IEEE |
linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV3Pb9MwFH4a2wE4jI2B6DaGD7sg4TaxHSfhhhBVgXWaWCr1FsW_LnTttKaX_fV7ttOIAUJcokj55fhz8r5nf-89gHPW5EyViEBihaVojw1VTHFaclcyl6D7FiT_00s5mYlv82y-Ax_6WBhrbRCf2aHfDWv5ZqU3fqpsJFnK0b4_gT20-1kao7X6NQMhQjUuJAycZkU-3y5KJuWour7yKi42ZAwHMeOPjFCoquI1kc0au8XFehZ__JqDvRm_gOm2pVFm8nO4adVQ3_-WxPF_X-UA9jviST7FkXIIO3b5Ep7_ko7wCGY_kDV6ldfCkuugtKZVzFy1INXqZhECxeikufMFmG4acuW9aS-E_khiiD9ploaMm3VLYrGIgPormI2_VJ8ntCu7QDWXvKVZU_rZUZ-aLksLjRRJM8mFS3WhmWEqlc6p3BrDUiuZK3JjjMic4EZmKUd0X8PucrW0b4AU0jTIGIXILW4SXSB_0qXMrVNGydQMYLTFodZdTnJfGmNRB98kKWtErvbI1R1yA3jfX3Eb83H849wj3_H9eV2fD-DsEdT9cYbOnUCPeACnW-zr7ote40M4evMl8tfjv9_2HTydVNOL-uLr5fcTeOYbErVop7Db3m3sWyQvrToLY_YB53TpMA |
openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Realizable+Spatio-Temporal+Tomlinson-Harashima+Precoders%3A+Theory+and+Fast+Computation&rft.jtitle=IEEE+transactions+on+signal+processing&rft.au=Wahls%2C+Sander&rft.au=Boche%2C+Holger&rft.date=2012-09-01&rft.issn=1053-587X&rft.eissn=1941-0476&rft.volume=60&rft.issue=9&rft.spage=4819&rft.epage=4833&rft_id=info:doi/10.1109%2FTSP.2012.2203123&rft.externalDBID=n%2Fa&rft.externalDocID=10_1109_TSP_2012_2203123 |
thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1053-587X&client=summon |
thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1053-587X&client=summon |
thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1053-587X&client=summon |