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: It is shown that the proposed H-N-NOMA/QDUP scheme can effectively exploit the benefit of multi user diversity.
Abstract: The application of network non-orthogonal multiple access (N-NOMA) technique to coordinated multi-point (CoMP) systems has attracted significant attention due to its superior capability to improve connectivity and maintain reliable transmission for CoMP users simultaneously. Based on the concept of quasi-degraded channel for N-NOMA, this paper studies the precoding design for downlink N-NOMA scenarios with two base stations (BSs) equipped with multiple antennas. In specific, under quasi-degraded channels, simple linear precoding based N-NOMA can achieve the same minimal total transmission power as theoretically optimal but complicated dirty paper coding (DPC) scheme, when the users' target rates and minimal transmission power of each BS are given. In this paper, the channel quasi-degradation (QD) condition is first rigorously derived for the scenario with single CoMP user and two NOMA users. The closed-form optimal precoders for N-NOMA under quasi-degraded channels are also provided. Then, based on QD condition, a novel hybrid N-NOMA (H-N-NOMA) scheme is proposed, which is a mixture of N-NOMA and conventional zero-forcing beamforming (ZFBF) scheme. Further, for the scenarios with more users, a low-complexity QD based user pairing (QDUP) algorithm is proposed. Numerical results are presented to reveal the impact factors of QD channels, and also demonstrate the superior performance of the proposed H-N-NOMA/QDUP scheme. It is shown that the proposed H-N-NOMA/QDUP scheme can effectively exploit the benefit of multi user diversity.
01 Jan 2007
TL;DR: In this article, the authors proposed several dirty paper coding schemes for the broadcast channel when both the transmitter and receivers are equipped with multiple antennas, inspired from information-theoretic concepts.
Abstract: We propose several dirty paper coding schemes for the broadcast channel when both the transmitter and receivers are equipped with multiple antennas. These schemes are based on channel state information at the transmitter and inspired from information-theoretic concepts. The proposed end-to-end algorithms allows us to evaluate the performance of the broadcast channel in terms of bit error rates and not in terms of coding rates as it is usually the case in the literature. Different inner coding schemes such as the ZF-DPC and MMSE-DPC and different outer Ce travail de recherche a ete sponsorise par France Telecom R&D et a ete effectue dans le cadre du contrat No 46 127 353 entre France Telecom R&D et le CNRS. Des parties de cet article ont ete presentees dans les actes de deux conferences IEEE : [2] et [1]
Posted Content•
TL;DR: Simulation results show that a much better bit error rate (BER) and sum-rate performances can be achieved by the proposed iterative coordinate THP compared to the previous linear art.
Abstract: Tomlinson-Harashima precoding (THP) is a nonlinear processing technique employed at the transmit side to implement the concept of dirty paper coding (DPC). The perform of THP, however, is restricted by the dimensionality constraint that the number of transmit antennas has to be greater or equal to the total number of receive antennas. In this paper, we propose an iterative coordinate THP algorithm for the scenarios in which the total number of receive antennas is larger than the number of transmit antennas. The proposed algorithm is implemented on two types of THP structures, the decentralized THP (dTHP) with diagonal weighted filters at the receivers of the users, and the centralized THP (cTHP) with diagonal weighted filter at the transmitter. Simulation results show that a much better bit error rate (BER) and sum-rate performances can be achieved by the proposed iterative coordinate THP compared to the previous linear art.
TL;DR: The theoretical and simulation-based performance analysis of the digital receivers and the MSE-based analog FM distortion analysis suggest that precoded modulo-precanceling schemes provide substantially higher data rates than existing precanceling strategies at the cost of transmission delay and transmitter and receiver complexity.
Abstract: We present techniques for simulcasting low-power digital data and analog FM over fading channels. Our methods have strong connections to what are referred to as dirty paper coding techniques in that a low-power digital data signal is modulo-added to the host analog FM signal. Due to the low power levels of the digital data and the suppression capability of analog FM, a standard analog FM receiver can be used to reliably recover the analog audio signal. We develop digital receivers that work reliably over fading channels given imperfect channel state information. Spread- response preceding is exploited to not only provide rate-1 temporal diversity benefits, but also to simplify the design of the modulo-precanceler and the receiver. Our theoretical and simulation-based performance analysis of the digital receivers and our MSE-based analog FM distortion analysis suggest that precoded modulo-precanceling schemes provide substantially higher data rates than existing precanceling strategies at the cost of transmission delay and transmitter and receiver complexity. The systems we present are also readily compatible with conventional channel coding techniques as well as with analog FM postcancelers, which can improve the digital receiver bit-error-rate performance at the expense of receiver complexity.