Recursive Nullspace Calculation for Multiuser MIMO Systems 


Vol. 32,  No. 12, pp. 1238-1243, Dec.  2007


PDF
  Abstract

The computational complexity for the zero-forcing (ZF)-based multiuser (MU) multiple-input multiple-output (MIMO) preprocessing matrices can be immoderately large as the number of transmit antennas or users increases. In this paper, we show that the span of singular vector space of a matrix can be obtained from the singular vectors of the parted rows of that matrix with computational saving and propose a computationally efficient recursive-algorithm for achieving the ZF-based preprocessing matrices. Analysis about the complexities shows that a new recursive-algorithm can lighten the computational load.

  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]

J. Joung and Y. H. Lee, "Recursive Nullspace Calculation for Multiuser MIMO Systems," The Journal of Korean Institute of Communications and Information Sciences, vol. 32, no. 12, pp. 1238-1243, 2007. DOI: .

[ACM Style]

Jingon Joung and Yong Hoon Lee. 2007. Recursive Nullspace Calculation for Multiuser MIMO Systems. The Journal of Korean Institute of Communications and Information Sciences, 32, 12, (2007), 1238-1243. DOI: .

[KICS Style]

Jingon Joung and Yong Hoon Lee, "Recursive Nullspace Calculation for Multiuser MIMO Systems," The Journal of Korean Institute of Communications and Information Sciences, vol. 32, no. 12, pp. 1238-1243, 12. 2007.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880