kth.sePublications
System disruptions
We are currently experiencing disruptions on the search portals due to high traffic. We are working to resolve the issue, you may temporarily encounter an error message.
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Inverse Extrapolation for Efficient Precoding in Time-Varying Massive MIMO-OFDM Systems
Beijing Univ Posts & Telecommun, Natl Engn Lab Mobile Network Technol, Beijing 100876, Peoples R China..
Linköping Univ, Dept Elect Engn, S-58183 Linköping, Sweden..ORCID iD: 0000-0002-5954-434x
Apple, 3D Vis Team, Santa Clara, CA USA..
Beijing Univ Posts & Telecommun, Natl Engn Lab Mobile Network Technol, Beijing 100876, Peoples R China..
Show others and affiliations
2019 (English)In: IEEE Access, E-ISSN 2169-3536, Vol. 7, p. 91105-91119Article in journal (Refereed) Published
Abstract [en]

Regularized zero forcing (RZF) precoding is an efficient linear precoding scheme for combating interference in a single-cell massive multiple-input-multiple-output (MIMO) systems. Inaccurate channel state information (CSI) due to channel aging will reduce the performance of the precoder over time. The channel aging determines how often we need to estimate the channels, and thus how frequently we need to send pilots in order to maximize the overall data rate. Channel prediction is one way to improve the CSI accuracy in the downlink, without having to send new pilots but it requires frequent re-computation of the matrix inverse in the RZF precoder, which has high-computational complexity. In this paper, we consider massive MIMO-OFDM systems and propose an algorithm called inverse extrapolation that extrapolates the channel and inverse matrix coefficients separately. The RZF coefficients are then obtained with comparably low complexity with no need for matrix inversion. We compare this algorithm with the traditional way of computing the RZF coefficients through prediction of the channel matrix followed by matrix inversion. The simulation results show that the two predictors have the same performance when the number of antennas is large, and thus the proposed scheme is preferable since it can reduce the complexity. For example, a scenario is shown, where the complexity is reduced by 61.84% without a significant degradation in performance.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers (IEEE) , 2019. Vol. 7, p. 91105-91119
Keywords [en]
Channel aging, computational complexity, inverse extrapolation, massive MIMO
National Category
Signal Processing Telecommunications
Identifiers
URN: urn:nbn:se:kth:diva-295867DOI: 10.1109/ACCESS.2019.2914057ISI: 000477864400027Scopus ID: 2-s2.0-85070219335OAI: oai:DiVA.org:kth-295867DiVA, id: diva2:1664060
Note

QC 20220614

Available from: 2022-06-03 Created: 2022-06-03 Last updated: 2022-06-25Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records

Björnson, Emil

Search in DiVA

By author/editor
Björnson, Emil
In the same journal
IEEE Access
Signal ProcessingTelecommunications

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 16 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf