Topic
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.
Papers published on a yearly basis
Papers
More filters
TL;DR: This paper shows how a simple dirty paper coding scheme employing Tomlinson-Harashima pre-coding with partial interference pre-subtraction can be employed by metro cells to mitigate the interference caused by macro cells.
Abstract: In heterogeneous networks where macro cells and metro cells use the same frequency band to communicate with their respective users, the major problem limiting performance is the interference caused by macro cells to metro cells. The information theoretic result known as dirty paper coding provides a way to address this problem and significantly improve the performance of heterogeneous networks with co-channel deployment. In this paper, we show how a simple dirty paper coding scheme employing Tomlinson-Harashima pre-coding with partial interference pre-subtraction can be employed by metro cells to mitigate the interference caused by macro cells. A performance study included in this paper shows that the proposed dirty paper coding scheme can lead to significant improvement in user rate statistics.
1 citations
20 Mar 2016
TL;DR: This paper proposes a hybrid secure transmission scheme which combines zero-forcing DPC and artificial noise (AN) and finds that in addition to supporting the normal transmission, the proposed scheme has the potential to achieve a secrecy rate close to that of the traditional AN-based beamforming.
Abstract: This paper studies the dirty-paper coding (DPC) based secure transmission in a multiuser broadcast channel. Since the encoding order of DPC determines which information-bearing signals must be treated as noise by potential eavesdroppers, adopting DPC enables the accurate characterization of the intrinsic secrecy as well as secrecy outage of multiuser broadcasting. Furthermore, the information-bearing signals can be designed to provide secrecy in addition to supporting normal (unclassified) transmission. To show this, we consider the scenario where one user requests secure transmission and the other users request normal transmission, and propose a hybrid secure transmission scheme which combines zero-forcing DPC and artificial noise (AN). By solving the secrecy rate maximization problem under constraints on the secrecy outage probability and the normal communication rates, we find that in addition to supporting the normal transmission, the proposed scheme has the potential to achieve a secrecy rate close to that of the traditional AN-based beamforming.
1 citations
16 May 2009
TL;DR: A vector DPC transmission scheme with non-binary LDPC codes and low density generator matrix based quantizer for multicell processing and the random coding based proof for the encoding and decoding transmission system is presented.
Abstract: The vector dirty paper coding (DPC) can achieve rate region for multicell cooperation system. Conventional DPC implementation approach suffer the capacity loss due to quantization which lead to modulo loss. In this paper, we proposed a vector DPC transmission scheme with non-binary LDPC codes and low density generator matrix based quantizer for multicell processing. And the random coding based proof for the encoding and decoding transmission system is presented. It can achieve a shaping gain and significantly reduce computational complexity.
1 citations
15 Jul 2012
TL;DR: This study proposes a novel method to effectively eliminate annoying MAl in a multiuser uplink system by using the R matrix, which comes after applying QR dirty paper coding to the equivalent channel response matrices.
Abstract: In this study, an antenna selection method is studied in a precoding OFDMA uplink system for the upcoming 4G cellular era. Candidates for 4G system include WiMAX 2.0 and 3GPP L TE-Advanced. This study specifically addresses the situation that the receiver possesses limited RF modules. The common carrier frequency offset (CFO) problem is considered, which brings along the problems of inter carrier interference (ICI) and multiple access interference (MAI). This study proposes a novel method to effectively eliminate annoying MAl in a multiuser uplink system by using the R matrix, which comes after applying QR dirty paper coding (QR-DPC) to the equivalent channel response matrices. Moreover, the R matrix helps to select antenna. The BER performance of the proposed method is better than the well known Shannon-Hartley theorem.
1 citations
01 Nov 2020
TL;DR: In this article, the capacity and the capacity-achieving strategy of a two-user multi-antenna NOUM with partial CSIT were investigated and it was shown that linearly precoded Rate-Splitting (RS), relying on splitting unicast messages into common and private parts, encoding the common parts together with the multicast message and linearly pre-decoding at the transmitter, can achieve larger rate regions than DPC-assisted NouM with complete CSIT.
Abstract: A Non-Orthogonal Unicast and Multicast (NOUM) transmission system allows a multicast stream intended to all receivers to be jointly transmitted with unicast streams in the same time-frequency resource blocks. While the capacity of the two-user multi-antenna NOUM with perfect Channel State Information at the Transmitter (CSIT) is known and achieved by Dirty Paper Coding (DPC)-assisted NOUM with Superposition Coding (SC), the capacity and the capacity-achieving strategy of the multi-antenna NOUM with partial CSIT remain unknown. In this work, we focus on the partial CSIT setting and make two major contributions. First, we show that linearly precoded Rate-Splitting (RS), relying on splitting unicast messages into common and private parts, encoding the common parts together with the multicast message and linearly precoding at the transmitter, can achieve larger rate regions than DPC-assisted NOUM with partial CSIT. Second, we study Dirty Paper Coded Rate-Splitting (DPCRS), that marries RS and DPC. We show that the rate region of DPCRS-assisted NOUM is enlarged beyond that of conventional DPC-assisted NOUM and that of linearly precoded RS-assisted NOUM with partial CSIT.
1 citations