To improve the channel estimation accuracy of multiple-input multiple-output (MIMO) multiplexing, we previously proposed iterative QR-decomposition with M-algorithm (QRD-M) with decision directed channel estimation. In this paper, to keep the computational complexity low while further improving the transmission performance, we will modify previously proposed iterative QRD-M by incorporating cyclic redundancy check (CRC) coding. In the proposed method, transmitted signals are ranked according to their results of CRC decoding and the received signal-to-interference plus noise power ratio (SINR). In the modified M-algorithm, since the results of Turbo decoding and CRC decoding are used to generate the surviving symbol replica, the accuracy of signal detection in the following steps can be improved. Furthermore, based on the results of CRC decoding, iterative process can be terminated before reaching the maximum allowable number of iterations. Computer simulation results show that the loss in the required average received signal energy per bit-to-noise power spectrum density ratio Eb/N0 for average packet error rate (PER) = 10-2 is only about 0.4 dB from maximum likelihood detection (Full MLD) with ideal channel estimation.
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.
Copy
Koichi ADACHI, Masao NAKAGAWA, "Iterative Modified QRD-M Based on CRC Codes for OFDM MIMO Multiplexing" in IEICE TRANSACTIONS on Communications,
vol. E90-B, no. 6, pp. 1433-1443, June 2007, doi: 10.1093/ietcom/e90-b.6.1433.
Abstract: To improve the channel estimation accuracy of multiple-input multiple-output (MIMO) multiplexing, we previously proposed iterative QR-decomposition with M-algorithm (QRD-M) with decision directed channel estimation. In this paper, to keep the computational complexity low while further improving the transmission performance, we will modify previously proposed iterative QRD-M by incorporating cyclic redundancy check (CRC) coding. In the proposed method, transmitted signals are ranked according to their results of CRC decoding and the received signal-to-interference plus noise power ratio (SINR). In the modified M-algorithm, since the results of Turbo decoding and CRC decoding are used to generate the surviving symbol replica, the accuracy of signal detection in the following steps can be improved. Furthermore, based on the results of CRC decoding, iterative process can be terminated before reaching the maximum allowable number of iterations. Computer simulation results show that the loss in the required average received signal energy per bit-to-noise power spectrum density ratio Eb/N0 for average packet error rate (PER) = 10-2 is only about 0.4 dB from maximum likelihood detection (Full MLD) with ideal channel estimation.
URL: https://global.ieice.org/en_transactions/communications/10.1093/ietcom/e90-b.6.1433/_p
Copy
@ARTICLE{e90-b_6_1433,
author={Koichi ADACHI, Masao NAKAGAWA, },
journal={IEICE TRANSACTIONS on Communications},
title={Iterative Modified QRD-M Based on CRC Codes for OFDM MIMO Multiplexing},
year={2007},
volume={E90-B},
number={6},
pages={1433-1443},
abstract={To improve the channel estimation accuracy of multiple-input multiple-output (MIMO) multiplexing, we previously proposed iterative QR-decomposition with M-algorithm (QRD-M) with decision directed channel estimation. In this paper, to keep the computational complexity low while further improving the transmission performance, we will modify previously proposed iterative QRD-M by incorporating cyclic redundancy check (CRC) coding. In the proposed method, transmitted signals are ranked according to their results of CRC decoding and the received signal-to-interference plus noise power ratio (SINR). In the modified M-algorithm, since the results of Turbo decoding and CRC decoding are used to generate the surviving symbol replica, the accuracy of signal detection in the following steps can be improved. Furthermore, based on the results of CRC decoding, iterative process can be terminated before reaching the maximum allowable number of iterations. Computer simulation results show that the loss in the required average received signal energy per bit-to-noise power spectrum density ratio Eb/N0 for average packet error rate (PER) = 10-2 is only about 0.4 dB from maximum likelihood detection (Full MLD) with ideal channel estimation.},
keywords={},
doi={10.1093/ietcom/e90-b.6.1433},
ISSN={1745-1345},
month={June},}
Copy
TY - JOUR
TI - Iterative Modified QRD-M Based on CRC Codes for OFDM MIMO Multiplexing
T2 - IEICE TRANSACTIONS on Communications
SP - 1433
EP - 1443
AU - Koichi ADACHI
AU - Masao NAKAGAWA
PY - 2007
DO - 10.1093/ietcom/e90-b.6.1433
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E90-B
IS - 6
JA - IEICE TRANSACTIONS on Communications
Y1 - June 2007
AB - To improve the channel estimation accuracy of multiple-input multiple-output (MIMO) multiplexing, we previously proposed iterative QR-decomposition with M-algorithm (QRD-M) with decision directed channel estimation. In this paper, to keep the computational complexity low while further improving the transmission performance, we will modify previously proposed iterative QRD-M by incorporating cyclic redundancy check (CRC) coding. In the proposed method, transmitted signals are ranked according to their results of CRC decoding and the received signal-to-interference plus noise power ratio (SINR). In the modified M-algorithm, since the results of Turbo decoding and CRC decoding are used to generate the surviving symbol replica, the accuracy of signal detection in the following steps can be improved. Furthermore, based on the results of CRC decoding, iterative process can be terminated before reaching the maximum allowable number of iterations. Computer simulation results show that the loss in the required average received signal energy per bit-to-noise power spectrum density ratio Eb/N0 for average packet error rate (PER) = 10-2 is only about 0.4 dB from maximum likelihood detection (Full MLD) with ideal channel estimation.
ER -