• Title/Summary/Keyword: dirty paper coding

Search Result 15, Processing Time 0.027 seconds

3-User Dirty Paper Precoding (세 명의 다중 사용자 채널에서의 더티 페이퍼 전처리 코딩)

  • Lee, Moon-Ho;Park, Ju-Yong;Shin, Tae-Chol
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.49 no.2
    • /
    • pp.32-38
    • /
    • 2012
  • In this paper, we design on nonliner 3 user Dirty Paper Precoding for MIMO adjacant interference signal cancellation based on 3 GPP LTE Release 10. In this paper, in order to reduce the inter-channel interference at the transmitted side, we propose the Dirty Paper Precoding scheme for 3-user MIMO wireless systems using LQ decomposition and Gram-Schmidt algorithm based in its orthonormal basis.

Achievable Sum Rate Enhancement by Sectorization for Dirty Paper Coding Aided Multihop Cellular Networks (Dirty Paper Coding을 이용한 다중 도약 셀룰러 네트워크에서 Sectorization을 통한 전송률 향상)

  • Park, Sung-Soo;Song, Hyung-Joon;Lim, Sung-Mook;You, Cheol-Woo;Hong, Dae-Sik
    • Proceedings of the IEEK Conference
    • /
    • 2008.06a
    • /
    • pp.241-242
    • /
    • 2008
  • This paper proposes a sectorization and exclusive subcarrier allocation technique for dirty paper coding (DPC) aided orthogonal frequency division multiple access (OFDMA) multihop cellular networks. Simulation result shows that the proposed technique significantly increases the achievable sum rate compared to the conventional mobile station selection approach.

  • PDF

Triangulation Algorithm for Multi-user Spatial Multiplexing in MIMO Downlink Channels (MIMO 다운링크 채널에서 다중사용자 공간다중화를 위한 알고리즘)

  • Lee, Heun-Chul;Paulraj, Aroyaswami;Lee, In-Kyu
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.1C
    • /
    • pp.45-54
    • /
    • 2010
  • This paper studies the design of a multiuser multiple-input multiple-output (MIMO) system, where a base station (BS) transmits independent messages to multiple users. The remarkable "dirty paper coding (DPC)" result was first presented by Costa that the capacity does not change if the Gaussian interference is known at the transmitter noncausally. While several implementable DPC schemes have been proposed recently for single-user dirty-paper channels, DPC is still difficult to implement directly in practical multiuser MIMO channels. In this paper, we propose a network channel matrix triangulation (NMT) algorithm for utilizing interference known at the transmitter. The NMT algorithm decomposes a multiuser MIMO channel into a set of parallel, single-input single-output dirty-paper subchannels and then successively employs the DPC to each subchannel. This approach allows us to extend practical single-user DPC techniques to multiuser MIMO downlink cases. We present the sum rate analysis for the proposed scheme. Simulation results show that the proposed schemes approach the sum rate capacity of the multiuser MIMO downlink at moderate signal-to-noise ratio (SNR) values.

Efficient User Selection Algorithms for Multiuser MIMO Systems with Zero-Forcing Dirty Paper Coding

  • Wang, Youxiang;Hur, Soo-Jung;Park, Yong-Wan;Choi, Jeong-Hee
    • Journal of Communications and Networks
    • /
    • v.13 no.3
    • /
    • pp.232-239
    • /
    • 2011
  • This paper investigates the user selection problem of successive zero-forcing precoded multiuser multiple-input multiple-output (MU-MIMO) downlink systems, in which the base station and mobile receivers are equipped with multiple antennas. Assuming full knowledge of the channel state information at the transmitter, dirty paper coding (DPC) is an optimal precoding strategy, but practical implementation is difficult because of its excessive complexity. As a suboptimal DPC solution, successive zero-forcing DPC (SZF-DPC) was recently proposed; it employs partial interference cancellation at the transmitter with dirty paper encoding. Because of a dimensionality constraint, the base station may select a subset of users to serve in order to maximize the total throughput. The exhaustive search algorithm is optimal; however, its computational complexity is prohibitive. In this paper, we develop two low-complexity user scheduling algorithms to maximize the sum rate capacity of MU-MIMO systems with SZF-DPC. Both algorithms add one user at a time. The first algorithm selects the user with the maximum product of the maximum column norm and maximum eigenvalue. The second algorithm selects the user with the maximum product of the minimum column norm and minimum eigenvalue. Simulation results demonstrate that the second algorithm achieves a performance similar to that of a previously proposed capacity-based selection algorithm at a high signal-to-noise (SNR), and the first algorithm achieves performance very similar to that of a capacity-based algorithm at a low SNR, but both do so with much lower complexity.

Sum-Rate Capacity with Fairness in Correlated MIMO Broadcast Channels

  • Lee, Seung-Hwan;Kim, Jin-Up
    • Journal of electromagnetic engineering and science
    • /
    • v.9 no.3
    • /
    • pp.124-129
    • /
    • 2009
  • Although the maximum sum-rate capacity of multiple-input multiple output(MIMO) broadcast channels(BCs) can be achieved by dirty-paper coding(DPC), the results were obtained without fairness considerations in uncorrelated MIMO channels. In this paper, we propose new multiuser scheduling algorithms, which find a best user set for approaching the maximum sum-rate capacity while maintaining fairness among users. We analyze the performance of the proposed algorithms using zero-forcing dirty paper coding(ZF-DPC) in the correlated MIMO BCs for throughput and delay fairness, respectively. Numerical results demonstrate that a large time window can reduce the average throughput difference between users, but it increases head-of-line(HOL) delay jitters in the case of delay fairness.

Joint Energy Efficiency Optimization with Nonlinear Precoding in Multi-cell Broadcast Systems

  • Gui, Xin;Lee, Kyoung-Jae;Jung, Jaehoon;Lee, Inkyu
    • Journal of Communications and Networks
    • /
    • v.18 no.6
    • /
    • pp.873-883
    • /
    • 2016
  • In this paper, we focus on maximizing weighted sum energy efficiency (EE) for a multi-cell multi-user channel. In order to solve this non-convex problem, we first decompose the original problem into a sequence of parallel subproblems which can optimized separately. For each subproblem, a base station employs dirty paper coding to maximize the EE for users within a cell while regulating interference induced to other cells. Since each subproblem can be transformed to a convex multiple-access channel problem, the proposed method provides a closed-form solution for power allocation. Then, based on the derived optimal covariance matrix for each subproblem, a local optimal solution is obtained to maximize the sum EE. Finally, simulation results show that our algorithm based on non-linear precoding achieves about 20 percent performance gains over the conventional linear precoding method.

3 User Non-Linear Tomlinson-Harashima Precoding (비선형 3 User Tomlinson-Harashima 전처리 코딩)

  • Abu Hanif, Mohammad;Cho, Kye-Mun;Lee, Moon-Ho;Shin, Tae-Chol
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.22 no.8
    • /
    • pp.809-812
    • /
    • 2011
  • In this letter, in order to reduce the inter-channel interference at the transmitted side, we design the precoder based on Tomlinson-Harashima coding, which is well know for one kind of non-linear precoding schemes, for 3-user MIMO wireless systems. And its performance is also analyzed in comparison with that of the Dirty Paper Coding based precoder.

MMSE Based Nonlinear Precoding for Multiuser MIMO Broadcast Channels with Inter-Cell Interference (다중사용자 다중입출력 하향링크 채널에서 인접셀 간섭을 고려한 MMSE 기반 비선형 프리코딩)

  • Lee, Kyoung-Jae;Sung, Hakjea;Lee, Inkyu
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.8
    • /
    • pp.896-902
    • /
    • 2016
  • In this paper, we investigate a minimum mean-squared error based nonlinear successive precoding method as a practical solution of dirty paper coding for multiuser downlink channels where each user has more than one antenna in the presence of other cell interference (OCI). Unlike conventional zero-forcing (ZF) based methods, the proposed scheme takes the OCI plus noise into account when suppressing the inter-cell multiuser interference, which results in improvement of the received signal-to-interference-plus-noise ratio. Simulation results show that the proposed scheme outperforms conventional methods in terms of sum rate for various OCI configurations.

A Comparison of TDMA, Dirty Paper Coding, and Beamforming for Multiuser MIMO Relay Networks

  • Li, Jianing;Zhang, Jianhua;Zhang, Yu;Zhang, Ping
    • Journal of Communications and Networks
    • /
    • v.10 no.2
    • /
    • pp.186-193
    • /
    • 2008
  • A two-hop multiple-input multiple-output (MIMO) relay network which comprises a multiple antenna source, an amplify-and-forward MIMO relay and many potential users are studied in this paper. Consider the achievable sum rate as the performance metric, a joint design method for the processing units of the BS and relay node is proposed. The optimal structures are given, which decompose the multiuser MIMO relay channel into several parallel single-input single-output relay channels. With these structures, the signal-to-noise ratio at the destination users is derived; and the power allocation is proved to be a convex problem. We also show that high sum rate can be achieved by pairing each link according to its magnitude. The sum rate of three broadcast strategies, time division multiple access (TDMA) to the strongest user, dirty paper coding (DPC), and beamforming (BF) are investigated. The sum rate bounds of these strategies and the sum capacity (achieved by DPC) gain over TDMA and BF are given. With these results, it can be easily obtained that how far away TDMA and BF are from being optimal in terms of the achievable sum rate.

Rate Bounds for MIMO Relay Channels

  • Lo, Caleb K.;Vishwanath, Sriram;Heath, Jr., Robert W.
    • Journal of Communications and Networks
    • /
    • v.10 no.2
    • /
    • pp.194-203
    • /
    • 2008
  • This paper considers the multi-input multi-output (MIMO) relay channel where multiple antennas are employed by each terminal. Compared to single-input single-output (SISO) relay channels, MIMO relay channels introduce additional degrees of freedom, making the design and analysis of optimal cooperative strategies more complex. In this paper, a partial cooperation strategy that combines transmit-side message splitting and block-Markov encoding is presented. Lower bounds on capacity that improve on a previously proposed non-cooperative lower bound are derived for Gaussian MIMO relay channels.