QR-MMSE Iterative Equalizer Based on Rank-1 Matrix Update 


Vol. 47,  No. 3, pp. 430-433, Mar.  2022
10.7840/kics.2022.47.3.430


PDF
  Abstract

In this letter, we propose a low complexity QR-MMSE iterative equalizer based on the rank-1 matrix update. To reduce the complexity of the QR-MMSE iterative equalizer, the proposed scheme calculates the inverse matrix for the MMSE filter of the current symbol from that of the previous symbol, where the rank-1 matrix update is utilized during the calculation procedure. Because the effective channel matrix of the QR-MMSE iterative equalizer is an upper triangular matrix, the rank-1 matrix update of the proposed scheme can greatly reduce the complexity by utilizing column vectors of the effective channel matrix having zero elements. Simulation results show that the proposed scheme can achieve the identical error performance to the conventional MMSE and QR-MMSE iterative equalizers.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

D. Paeng and S. Park, "QR-MMSE Iterative Equalizer Based on Rank-1 Matrix Update," The Journal of Korean Institute of Communications and Information Sciences, vol. 47, no. 3, pp. 430-433, 2022. DOI: 10.7840/kics.2022.47.3.430.

[ACM Style]

Daewon Paeng and Sangjoon Park. 2022. QR-MMSE Iterative Equalizer Based on Rank-1 Matrix Update. The Journal of Korean Institute of Communications and Information Sciences, 47, 3, (2022), 430-433. DOI: 10.7840/kics.2022.47.3.430.

[KICS Style]

Daewon Paeng and Sangjoon Park, "QR-MMSE Iterative Equalizer Based on Rank-1 Matrix Update," The Journal of Korean Institute of Communications and Information Sciences, vol. 47, no. 3, pp. 430-433, 3. 2022. (https://doi.org/10.7840/kics.2022.47.3.430)

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880