scispace - formally typeset
Search or ask a question
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
More filters
Posted Content
TL;DR: It is proven that the proposed secure hybrid digital-analog secure joint source channel coding schemes can give a graceful degradation of distortion with SNR under SNR mismatch, i.e., when the actual SNR is larger than the designed SNR.
Abstract: In this work, the problem of transmitting an i.i.d Gaussian source over an i.i.d Gaussian wiretap channel with an i.i.d Gaussian side information is considered. The intended receiver is assumed to have a certain minimum SNR and the eavesdropper is assumed to have a strictly lower SNR compared to the intended receiver. The objective is minimizing the distortion of source reconstruction at the intended receiver. In this work, it is shown that unlike the Gaussian wiretap channel without side information, Shannon's source-channel separation coding scheme is not optimum in the sense of achieving the minimum distortion. Three hybrid digital-analog secure joint source channel coding schemes are then proposed which achieve the minimum distortion. The first coding scheme is based on Costa's dirty paper coding scheme and wiretap channel coding scheme when the analog source is not explicitly quantized. The second coding scheme is based on the superposition of the secure digital signal and the hybrid digital-analog signal. It is shown that for the problem of communicating a Gaussian source over a Gaussian wiretap channel with side information, there exists an infinite family of optimum secure joint source-channel coding scheme. In the third coding scheme, the quantized signal and the analog error signal are explicitly superimposed. It is shown that this scheme provides an infinite family of optimum secure joint source-channel channel coding schemes with a variable number of binning. Finally, the proposed secure hybrid digital-analog schemes are analyzed under the main channel SNR mismatch. It is proven that the proposed schemes can give a graceful degradation of distortion with SNR under SNR mismatch, i.e., when the actual SNR is larger than the designed SNR.

2 citations

Posted Content
TL;DR: This paper presents a practical dirty paper coding scheme using trellis coded modulation for the dirty paper channel and recognizes the criteria that the transmit signal must be as orthogonal to the dirt as possible.
Abstract: In this paper, we present a practical dirty paper coding scheme using trellis coded modulation for the dirty paper channelY = X+S+W; EfX 2 g P , whereW is white Gaussian noise with power 2, P is the average transmit power and S is the Gaussian interference with power 2 s that is non-causally known at the transmitter We ensure that the dirt in our scheme remains distinguishable to the receiver and thus, our designed scheme is applicable to broadcast channel Following Costa's idea, we recognize the criteria that the transmit signal must be as orthogonal to the dirt as possible Finite constellation codes are constructed using trellis coded modulation and by using a Viterbi algorithm at the encoder so that the code satisfies the design criteria and simulation results are presented with codes constructed via trellis coded modulation using QAM signal sets to illustrate our results I INTRODUCTION The dirty paper channel model is receiving increased at- tention due to its utility in communication over Gaussian broadcast channels and design of good methods for digital watermarking and information embedding In this communi-

2 citations

Journal ArticleDOI
TL;DR: Three multiuser multiple input-multiple output (MU-MIMO) downlink transmission strategies based on the extended quadrature spatial modulation (EQSM) system for mobile communication outperform their conventional counterparts in terms of bit error rate (BER) and detection complexity.
Abstract: This paper presents three multiuser multiple input-multiple output (MU-MIMO) downlink transmission strategies based on the extended quadrature spatial modulation (EQSM) system for mobile communication. The three MU-MIMO precoding strategies utilised are block diagonalisation (BD), dirty paper coding (DPC), and a combined BD-DPC strategy. We analyse and compare the performance of these three MU-MIMO-EQSM schemes with the conventional MU-MIMO spatial multiplexing (MU-MIMO-SMux) system in terms of bit error rate (BER) and detection complexity considering correlated and uncorrelated fading channels. Results show that the BD-MIMO-EQSM and DPC-MIMO-EQSM systems outperform by 2−3 dB in BER performance their conventional counterparts with the additional advantage of a detection complexity reduction of up to 62% for the analysed cases. For the uncorrelated fading channel, the BD technique has better BER performance for a spectral efficiency (SE) of 12 bits per channel use (bpcu), while the DPC technique has better BER performance for an SE of 8 bpcu. Considering the correlated channel, DPC suffers a deep BER degradation of up to 30 dB compared with BD. However, still in this scenario, both proposed MU-MIMO-EQSM systems outperform their conventional counterparts. In terms of detection complexity, DPC has a complexity reduction of 77% as compared with the BD technique. The BD-DPC-MIMO-EQSM hybrid system heritages the low detection complexity of DPC with the advantage of all users in the system having the same BER performance.

2 citations

Posted Content
06 Aug 2018
TL;DR: This paper derives the constant-gap sum rate of the three-user RS scheme and shows that its gap to the sum capacity can be unbounded through a pathological example, and proposes a practical stream elimination algorithm that can reduce the total number of active streams while preserving the Constantgap rate.
Abstract: In this paper, we consider a general K-user multiple-input multiple-output (MIMO) broadcast channel (BC). We assume that the channel state is deterministic and known to all the nodes. While the capacity region is well known to be achievable with dirty paper coding (DPC), we are interested in the simpler linearly precoded transmission schemes. First, using a simple two-user example, we show that any linear precoding scheme with only private streams can have an unbounded gap to the sum capacity of the channel. Then, we show that applying rate-splitting (RS) with minimum mean square error (MMSE) precoding, one can achieve the entire capacity region to within a constant gap in the two-user case. Remarkably, such constant-gap optimality of the RS scheme does not extend to the three-user case. Specifically, we derive the constant-gap sum rate of the three-user RS scheme and show that its gap to the sum capacity can be unbounded through a pathological example. For the general K-user RS scheme with arbitrary K, we derive a constant-gap sum rate upper bound that is shown numerically to be tight. Finally, we propose a practical stream elimination algorithm that can reduce the total number of active streams while preserving the constant-gap rate, i.e., with only a finite sum rate loss. Based on the same idea, we propose a second algorithm to order the 2^K-1 streams.

2 citations

Proceedings ArticleDOI
25 Jun 2018
TL;DR: There exists a (quasi) closed-form solution to a particular sum rate maximization problem in the MIMO broadcast channel: for a two-user system with a shaping constraint, the optimal input covariance matrices can be computed from a generalized eigenvalue decomposition.
Abstract: While the capacity-achieving transmit strategy in a single-user MIMO system can be calculated in (quasi) closed-form based on an eigenvalue decomposition, rate maximization problems in multiuser systems usually have to be tackled by iterative numerical algorithms When the capacity-achieving dirty paper coding is applied in the MIMO broadcast channel, the sum rate maximization can be solved in a globally optimal manner via the dual multiple access channel, where the optimization is a convex problem, but iterative methods are necessary to obtain this solution In this paper, we show that there exists a (quasi) closed-form solution to a particular sum rate maximization problem in the MIMO broadcast channel: for a two-user system with a shaping constraint, the optimal input covariance matrices can be computed from a generalized eigenvalue decomposition Interestingly, this is a scenario for which the numerical solution via the dual uplink is particularly complicated since the conventional uplink-downlink duality for systems with power constraints cannot be applied

2 citations

Network Information
Related Topics (5)
Fading
55.4K papers, 1M citations
89% related
Base station
85.8K papers, 1M citations
87% related
Wireless network
122.5K papers, 2.1M citations
86% related
Wireless
133.4K papers, 1.9M citations
84% related
Network packet
159.7K papers, 2.2M citations
83% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20236
202217
202121
202013
201926
201823