Dirty paper coding

About: Dirty paper coding is a research topic. Over the lifetime, 814 publications have been published within this topic receiving 37097 citations.

Interference presubtracting method and trasmitter using the same

Abstract: An interference presubtraction method and a transmitter using the method are provided to realize DPC(Dirty Paper Coding) by adding Viterbi algorithm only to the transmitter, and to enable a receiver to use a turbo decoder as it is, thereby simply realizing the DPC A channel encoder(110) carries out channel coding for an information symbol An interleaver(120) interleaves channel-coded signals An interference subtractor(150) subtracts previously known interference from the interleaved signals A source encoder(160) generates transmission signals by changing shape of a signal set from which interference is removed A mapper(140) constellation-maps the interleaved signals

Performance improvement of multi-user chaos MIMO transmission scheme using dirty paper coding

Abstract: The multi-user multiple-input multiple-output (MU-MIMO) scheme is one of the main methods for improving the frequency-efficiency in wireless communication systems. In MU-MIMO systems, a base station equipped with multiple antennas and a large number of receivers with multiple antennas communicate simultaneously. Conventionally, we adopted the principle of chaos communications to MU-MIMO and proposed a multi-user chaos MIMO (MU-C-MIMO) scheme that has physical layer security between each receiver. In the previous study, we utilized block diagonalization (BD) — a liner precoding method — to remove interference components in MU-C-MIMO. On the one hand, channel gain for each user is not maximized in BD. On the other hand, the gain maximization can be realized using nonlinear precoding, and further improvement of transmission quality is expected in MU-C-MIMO. Therefore, in this paper, we propose a MU-C-MIMO scheme using dirty paper coding (DPC), a nonlinear precoding method, in order to realize the most ideal precoding characteristics. The effectiveness of this scheme is evaluated through numerical simulations with comparisons to a conventional MU-C-MIMO system with BD.

Improved performance bounds for the infinite-dimensional Witsenhausen problem

Abstract: There is a growing concern regarding the design of decentralized control systems. Witsenhausen's counterexample is a well-known problem which has remained open in this context, and emphasizes the necessity of communication between blocks in a distributed control system. In this paper, we study an infinite vector model of this problem and a new bound for the cost function is derived. It is shown that this bound improves upon previously known bounds obtained by dirty paper coding in some SNR regimes. Consequently, a system can be designed to sense the SNR level and then select the best scheme between these two sub-optimal strategies.

Rotating cluster mechanism for coordinated heterogeneous MIMO cellular networks

Abstract: To increase the average achievable rates per user for cluster-edge users, a rotating clustering scheme for the downlink of a coordinated multicell multiuser multiple-input multiple-output system is proposed in this paper and analyzed in two network layouts. In the multicell heterogeneous cellular network, base stations of a cluster cooperate to transmit data signals to the users within the cluster; rotating cluster patterns enable all users to be nearer the cluster center in at least one of the patterns. Considering cellular layouts with three or six macrocells per site, different rotating patterns of clusters are proposed and the system performance with the proposed sets of clustering patterns is investigated using a simulated annealing algorithm for user scheduling and successive zero-forcing dirty paper coding as the precoding method. The rotating clustering scheme is less complex than fully dynamic clustering, and it is primarily designed to improve the throughput of cluster-edge users. As an extra secondary benefit, it is also capable of slightly improving the average achievable sum rate of the network overall. The effectiveness of the proposed methods with two different scheduling metrics, namely throughput maximization and proportionally fair scheduling, is of interest in this work. Moreover, the speed of rotation affects the performance of the system; the higher the speed of rotation, the more frequently any specific users will be nearer the cluster center. Our simulations demonstrate the effectiveness of the proposed rotational approach and determine the speed of rotation beyond which any additional performance gains become negligible.

SPC01-1: Precoding Schemes for the Downlink of a Multiuser Communication System

Abstract: We consider the downlink of a multiuser communication system with multiple antennas at the transmitter and at each receiver. A new transmission scheme that employs dirty-paper coding (DPC) with partial interference cancellation is proposed. It is shown that given any user ordering the achievable throughput is asymptotically optimal in the high signal-to-noise ratio (SNR) regime and for all values of the SNR it improves over the throughput of the zero-forcing dirty-paper coding (ZFDPC) scheme [1]. Due to its implementation complexity issues, we also consider a low complexity linear transmission scheme. A precoding technique where interference is canceled successively at the base station is proposed. In this case, users treat the partial interference at the receiver as an independent noise, and it is shown that compared to other linear transmission schemes such as the block-diagonalization (BD) and the zero-forcing schemes, the achievable throughput of the proposed precoding scheme is improved for all SNR values.