IEICE TRANSACTIONS on Communications
Tight Lower Bounds on Achievable Information Rates for Regularized Tomlinson-Harashima Precoding in Multi-User MIMO Systems
Summary :
Tomlinson-Harashima precoding (THP) is considered to be a prominent precoding scheme due to its ability to efficiently cancel out the known interference at the transmitter side. Therefore, the information rates achieved by THP are superior to those achieved by conventional linear precoding schemes. In this paper, new lower bounds on the achievable information rates for the regularized THP scheme are derived. Analytical results show that the lower bounds derived in this paper are tighter than the original lower bounds particularly for the low SNR range, while all lower bounds converge to
- Publication
- IEICE TRANSACTIONS on Communications Vol.E95-B No.4 pp.1463-1466
- Publication Date
- 2012/04/01
- Publicized
- Online ISSN
- 1745-1345
- DOI
- 10.1587/transcom.E95.B.1463
- Type of Manuscript
- LETTER
- Category
- Wireless Communication Technologies
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Bing HUI, Manar MOHAISEN, KyungHi CHANG, "Tight Lower Bounds on Achievable Information Rates for Regularized Tomlinson-Harashima Precoding in Multi-User MIMO Systems" in IEICE TRANSACTIONS on Communications,
vol. E95-B, no. 4, pp. 1463-1466, April 2012, doi: 10.1587/transcom.E95.B.1463.
Abstract: Tomlinson-Harashima precoding (THP) is considered to be a prominent precoding scheme due to its ability to efficiently cancel out the known interference at the transmitter side. Therefore, the information rates achieved by THP are superior to those achieved by conventional linear precoding schemes. In this paper, new lower bounds on the achievable information rates for the regularized THP scheme are derived. Analytical results show that the lower bounds derived in this paper are tighter than the original lower bounds particularly for the low SNR range, while all lower bounds converge to
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E95.B.1463/_p
Copy
@ARTICLE{e95-b_4_1463,
author={Bing HUI, Manar MOHAISEN, KyungHi CHANG, },
journal={IEICE TRANSACTIONS on Communications},
title={Tight Lower Bounds on Achievable Information Rates for Regularized Tomlinson-Harashima Precoding in Multi-User MIMO Systems},
year={2012},
volume={E95-B},
number={4},
pages={1463-1466},
abstract={Tomlinson-Harashima precoding (THP) is considered to be a prominent precoding scheme due to its ability to efficiently cancel out the known interference at the transmitter side. Therefore, the information rates achieved by THP are superior to those achieved by conventional linear precoding schemes. In this paper, new lower bounds on the achievable information rates for the regularized THP scheme are derived. Analytical results show that the lower bounds derived in this paper are tighter than the original lower bounds particularly for the low SNR range, while all lower bounds converge to
keywords={},
doi={10.1587/transcom.E95.B.1463},
ISSN={1745-1345},
month={April},}
Copy
TY - JOUR
TI - Tight Lower Bounds on Achievable Information Rates for Regularized Tomlinson-Harashima Precoding in Multi-User MIMO Systems
T2 - IEICE TRANSACTIONS on Communications
SP - 1463
EP - 1466
AU - Bing HUI
AU - Manar MOHAISEN
AU - KyungHi CHANG
PY - 2012
DO - 10.1587/transcom.E95.B.1463
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E95-B
IS - 4
JA - IEICE TRANSACTIONS on Communications
Y1 - April 2012
AB - Tomlinson-Harashima precoding (THP) is considered to be a prominent precoding scheme due to its ability to efficiently cancel out the known interference at the transmitter side. Therefore, the information rates achieved by THP are superior to those achieved by conventional linear precoding schemes. In this paper, new lower bounds on the achievable information rates for the regularized THP scheme are derived. Analytical results show that the lower bounds derived in this paper are tighter than the original lower bounds particularly for the low SNR range, while all lower bounds converge to
ER -
English
