Modified Block Diagonalization Precoding with Greedy Approach 


Vol. 33,  No. 1, pp. 79-85, Jan.  2008


PDF
  Abstract

Dirty Paper Coding (DPC) can achieve the sum capacity of a multiuser multiple-input multiple-output (MU MIMO) broadcast channels. However, due to the high computational complexity of the successive encoding and decoding, deploying DPC in real systems is impractical. As one of practical alternatives to DPC, Block Diagonalization (BD) was researched. BD is an extension of the zero-forcing precoding technique that eliminates interuser interference (IUI) in downlink MIMO systems. Though BD has lower complexity than DPC, BD shows poor sum capacity performance. We show that sum capacity performance of BD is degraded due to no IUI constraint. Then, we modify BD to improve its sum capacity performance with relaxing the constraint and sub optimal channel set searching. With simulation results, it can be verified that our modification in BD induces some improvement in sum capacity performance.

  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]

S. Kim, W. Seo, K. Kwak, D. Hong, "Modified Block Diagonalization Precoding with Greedy Approach," The Journal of Korean Institute of Communications and Information Sciences, vol. 33, no. 1, pp. 79-85, 2008. DOI: .

[ACM Style]

Sungtae Kim, Woohyun Seo, Kyungchul Kwak, and Daesik Hong. 2008. Modified Block Diagonalization Precoding with Greedy Approach. The Journal of Korean Institute of Communications and Information Sciences, 33, 1, (2008), 79-85. DOI: .

[KICS Style]

Sungtae Kim, Woohyun Seo, Kyungchul Kwak, Daesik Hong, "Modified Block Diagonalization Precoding with Greedy Approach," The Journal of Korean Institute of Communications and Information Sciences, vol. 33, no. 1, pp. 79-85, 1. 2008.