The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Pengesan bantuan pemfaktoran saluran (CFAD) ialah salah satu pengesan kerumitan rendah penting yang digunakan dalam penerima berbilang input, berbilang output (MIMO). Melalui pemfaktoran saluran, kaedah ini mengubah sistem MIMO asal kepada sistem yang setara dengan saluran yang lebih baik di mana pengesanan dilakukan dengan pengesan kerumitan rendah; anggaran itu kemudiannya dipindahkan kembali ke sistem asal untuk mendapatkan keputusan muktamad. Secara tradisinya, pemfaktoran saluran dilakukan dengan algoritma pengurangan kekisi seperti algoritma Lenstra-Lenstra-Lovasz (LLL) dan Seysen tanpa mengambil kira pengesan kerumitan rendah yang digunakan. Dalam kertas ini, kami mencadangkan pendekatan yang berbeza: pemfaktoran saluran direka khusus untuk pengesan min-square-error (MMSE) minimum yang merupakan pengesan kerumitan rendah yang popular dalam CFAD. Dua jenis algoritma pemfaktoran baharu dicadangkan. Jenis-I adalah berasaskan LLL, di mana algoritma lanjutan DLLL yang terkenal, algoritma LLL yang berfungsi pada matriks dwi matriks saluran lanjutan, adalah ahli jenis ini tetapi dengan kerumitan yang lebih tinggi. DLLL-extended ialah algoritma pemfaktoran berprestasi terbaik yang terdapat dalam literatur, Jenis-II adalah berdasarkan pencarian tamak di mana ahlinya dibezakan dengan parameter algoritma yang berbeza. Algoritma Jenis-II boleh memberikan keuntungan sekitar 0.5-1.0 dB berbanding algoritma Jenis-I dan mempunyai kerumitan pengiraan tetap yang berfaedah dalam pelaksanaan perkakasan.
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.
Salinan
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
Salinan
@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},}
Salinan
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 -