New Factorization Algorithms for Channel-Factorization Aided MMSE Receiver in MIMO Systems

Chih-Cheng KUO; Wern-Ho SHEEN; Chang-Lung HSIAO

doi:10.1587/transcom.E94.B.222

New Factorization Algorithms for Channel-Factorization Aided MMSE Receiver in MIMO Systems

Chih-Cheng KUO, Wern-Ho SHEEN, Chang-Lung HSIAO

Full Text Views

0

Cite this

Summary :

Channel-factorization aided detector (CFAD) is one of the important low-complexity detectors used in multiple input, multiple output (MIMO) receivers. Through channel factorization, this method transforms the original MIMO system into an equivalent system with a better-conditioned channel where detection is performed with a low-complexity detector; the estimate is then transferred back to the original system to obtain the final decision. Traditionally, the channel factorization is done with the lattice reduction algorithms such as the Lenstra-Lenstra-Lovasz (LLL) and Seysen's algorithms with no consideration of the low-complexity detector used. In this paper, we propose a different approach: the channel factorization is designed specifically for the minimum mean-square-error (MMSE) detector that is a popular low-complexity detector in CFADs. Two new types of factorization algorithms are proposed. Type-I is LLL based, where the well-known DLLL-extended algorithm, the LLL algorithm working on the dual matrix of the extended channel matrix, is a member of this type but with a higher complexity. DLLL-extended is the best-performed factorization algorithm found in the literature, Type-II is greedy-search based where its members are differentiated with different algorithm's parameters. Type-II algorithms can provide around 0.5-1.0 dB gain over Type-I algorithms and have a fixed computational complexity which is advantageous in hardware implementation.

Publication: IEICE TRANSACTIONS on Communications Vol.E94-B No.1 pp.222-233

Publication Date: 2011/01/01

Publicized

Online ISSN: 1745-1345

DOI: 10.1587/transcom.E94.B.222

Type of Manuscript: PAPER

Category: Wireless Communication Technologies

Cite this

Copy

Chih-Cheng KUO, Wern-Ho SHEEN, Chang-Lung HSIAO, "New Factorization Algorithms for Channel-Factorization Aided MMSE Receiver in MIMO Systems" in IEICE TRANSACTIONS on Communications, vol. E94-B, no. 1, pp. 222-233, January 2011, doi: 10.1587/transcom.E94.B.222.
Abstract: Channel-factorization aided detector (CFAD) is one of the important low-complexity detectors used in multiple input, multiple output (MIMO) receivers. Through channel factorization, this method transforms the original MIMO system into an equivalent system with a better-conditioned channel where detection is performed with a low-complexity detector; the estimate is then transferred back to the original system to obtain the final decision. Traditionally, the channel factorization is done with the lattice reduction algorithms such as the Lenstra-Lenstra-Lovasz (LLL) and Seysen's algorithms with no consideration of the low-complexity detector used. In this paper, we propose a different approach: the channel factorization is designed specifically for the minimum mean-square-error (MMSE) detector that is a popular low-complexity detector in CFADs. Two new types of factorization algorithms are proposed. Type-I is LLL based, where the well-known DLLL-extended algorithm, the LLL algorithm working on the dual matrix of the extended channel matrix, is a member of this type but with a higher complexity. DLLL-extended is the best-performed factorization algorithm found in the literature, Type-II is greedy-search based where its members are differentiated with different algorithm's parameters. Type-II algorithms can provide around 0.5-1.0 dB gain over Type-I algorithms and have a fixed computational complexity which is advantageous in hardware implementation.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E94.B.222/_p

Copy

@ARTICLE{e94-b_1_222,
author={Chih-Cheng KUO, Wern-Ho SHEEN, Chang-Lung HSIAO, },
journal={IEICE TRANSACTIONS on Communications},
title={New Factorization Algorithms for Channel-Factorization Aided MMSE Receiver in MIMO Systems},
year={2011},
volume={E94-B},
number={1},
pages={222-233},
abstract={Channel-factorization aided detector (CFAD) is one of the important low-complexity detectors used in multiple input, multiple output (MIMO) receivers. Through channel factorization, this method transforms the original MIMO system into an equivalent system with a better-conditioned channel where detection is performed with a low-complexity detector; the estimate is then transferred back to the original system to obtain the final decision. Traditionally, the channel factorization is done with the lattice reduction algorithms such as the Lenstra-Lenstra-Lovasz (LLL) and Seysen's algorithms with no consideration of the low-complexity detector used. In this paper, we propose a different approach: the channel factorization is designed specifically for the minimum mean-square-error (MMSE) detector that is a popular low-complexity detector in CFADs. Two new types of factorization algorithms are proposed. Type-I is LLL based, where the well-known DLLL-extended algorithm, the LLL algorithm working on the dual matrix of the extended channel matrix, is a member of this type but with a higher complexity. DLLL-extended is the best-performed factorization algorithm found in the literature, Type-II is greedy-search based where its members are differentiated with different algorithm's parameters. Type-II algorithms can provide around 0.5-1.0 dB gain over Type-I algorithms and have a fixed computational complexity which is advantageous in hardware implementation.},
keywords={},
doi={10.1587/transcom.E94.B.222},
ISSN={1745-1345},
month={January},}

Copy

TY - JOUR
TI - New Factorization Algorithms for Channel-Factorization Aided MMSE Receiver in MIMO Systems
T2 - IEICE TRANSACTIONS on Communications
SP - 222
EP - 233
AU - Chih-Cheng KUO
AU - Wern-Ho SHEEN
AU - Chang-Lung HSIAO
PY - 2011
DO - 10.1587/transcom.E94.B.222
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E94-B
IS - 1
JA - IEICE TRANSACTIONS on Communications
Y1 - January 2011
AB - Channel-factorization aided detector (CFAD) is one of the important low-complexity detectors used in multiple input, multiple output (MIMO) receivers. Through channel factorization, this method transforms the original MIMO system into an equivalent system with a better-conditioned channel where detection is performed with a low-complexity detector; the estimate is then transferred back to the original system to obtain the final decision. Traditionally, the channel factorization is done with the lattice reduction algorithms such as the Lenstra-Lenstra-Lovasz (LLL) and Seysen's algorithms with no consideration of the low-complexity detector used. In this paper, we propose a different approach: the channel factorization is designed specifically for the minimum mean-square-error (MMSE) detector that is a popular low-complexity detector in CFADs. Two new types of factorization algorithms are proposed. Type-I is LLL based, where the well-known DLLL-extended algorithm, the LLL algorithm working on the dual matrix of the extended channel matrix, is a member of this type but with a higher complexity. DLLL-extended is the best-performed factorization algorithm found in the literature, Type-II is greedy-search based where its members are differentiated with different algorithm's parameters. Type-II algorithms can provide around 0.5-1.0 dB gain over Type-I algorithms and have a fixed computational complexity which is advantageous in hardware implementation.
ER -