Results 1 - 10 of 310

On the dispersion of dirty paper coding

by Jonathan Scarlett - In Proc. IEEE International Symposium on Information Theory , 2014
"... Abstract-This paper studies the second-order asymptotics of the coding rate for a given error probability in the setting of dirty paper coding ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Abstract-This paper studies the second-order asymptotics of the coding rate for a given error probability in the setting of dirty paper coding

Arbitrarily dirty paper coding and applications

by Anand D. Sarwate, Michael Gastpar - IN INFORMATION THEORY, 2008. ISIT 2008. IEEE INTERNATIONAL SYMPOSIUM ON , 2008
"... A deterministic dirty-paper coding strategy for communication over an arbitrarily varying channel with an interference signal known to the transmitter is investigated. The presence of a known interference signal at the transmitter is shown to provide some protection against jamming interference. Fo ..."
Abstract - Cited by 4 (1 self) - Add to MetaCart
A deterministic dirty-paper coding strategy for communication over an arbitrarily varying channel with an interference signal known to the transmitter is investigated. The presence of a known interference signal at the transmitter is shown to provide some protection against jamming interference

1Rewriting Flash Memories and Dirty-Paper Coding

by Brian M. Kurkoski
"... Abstract—This paper considers that write-once memory (WOM) codes can be seen as a type of dirty-paper code. The current state of the memory, which is known to the encoder, plays the role of the known interference of dirty-paper coding. Erez, Shamai and Zamir showed that lattice strategies can achiev ..."
Abstract - Add to MetaCart
Abstract—This paper considers that write-once memory (WOM) codes can be seen as a type of dirty-paper code. The current state of the memory, which is known to the encoder, plays the role of the known interference of dirty-paper coding. Erez, Shamai and Zamir showed that lattice strategies can

Two-Level Dirty Paper Coding

by Sae-young Chung
"... We propose a two-level coding and successive decoding for dirty paper coding (DPC). We divide the channel code into two levels, the upper code interacting with the shaping code and the lower code that does not, such that it is information lossless. Furthermore, the code design becomes more intuitive ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
We propose a two-level coding and successive decoding for dirty paper coding (DPC). We divide the channel code into two levels, the upper code interacting with the shaping code and the lower code that does not, such that it is information lossless. Furthermore, the code design becomes more

Dirty-Paper Coding for the Gaussian Multiaccess Channel With Conferencing

by Shraga I. Bross, Senior Member, Amos Lapidoth, Michèle Wigger
"... Abstract—We derive the capacity region of the two-user dirty-paper Gaussian multiaccess channel (MAC) with conferencing en-coders. In this MAC, prior to each transmission block, the trans-mitters can hold a conference in which they can communicate with each other over error-free bit pipes of given c ..."
Abstract - Cited by 2 (1 self) - Add to MetaCart
Abstract—We derive the capacity region of the two-user dirty-paper Gaussian multiaccess channel (MAC) with conferencing en-coders. In this MAC, prior to each transmission block, the trans-mitters can hold a conference in which they can communicate with each other over error-free bit pipes of given

Analysis and Design of Dirty Paper Coding by Transformation of Noise

by Young-Seung Lee , Sae-Young Chung
"... Abstract-We design a coding scheme for Costa's dirty paper coding (DPC) [6] using a channel and a shaping code. We show that by transforming the channel noise distribution the DPC channel can be converted into the binary erasure channel (BEC) with binary interference with memory. Furthremore, ..."
Abstract - Add to MetaCart
Abstract-We design a coding scheme for Costa's dirty paper coding (DPC) [6] using a channel and a shaping code. We show that by transforming the channel noise distribution the DPC channel can be converted into the binary erasure channel (BEC) with binary interference with memory. Furthremore

1On the Robustness of Dirty Paper Coding

by Anatoly Khina, Uri Erez
"... AbstractA dirty-paper channel is considered, where the transmitter knows the interference sequence up to a constant multiplicative factor, known only to the receiver. Lower bounds on the achievable rate of communication are derived by proposing a coding scheme that partially compensates for the impr ..."
Abstract - Cited by 4 (0 self) - Add to MetaCart
AbstractA dirty-paper channel is considered, where the transmitter knows the interference sequence up to a constant multiplicative factor, known only to the receiver. Lower bounds on the achievable rate of communication are derived by proposing a coding scheme that partially compensates

Dirty-paper coding versus TDMA for MIMO broadcast channels

by Nihar Jindal, Andrea Goldsmith - IEEE Trans. Inf. Theory , 2005
"... Abstract—We compare the capacity of dirty-paper coding (DPC)to that of time-division multiple access (TDMA)for a multiple-antenna (multipleinput multiple-output (MIMO)) Gaussian broadcast channel (BC). We find that the sum-rate capacity (achievable using DPC)of the multiple-antenna BC is at most ��� ..."
Abstract - Cited by 63 (3 self) - Add to MetaCart
Abstract—We compare the capacity of dirty-paper coding (DPC)to that of time-division multiple access (TDMA)for a multiple-antenna (multipleinput multiple-output (MIMO)) Gaussian broadcast channel (BC). We find that the sum-rate capacity (achievable using DPC)of the multiple-antenna BC is at most

An Efficient Greedy Scheduler for Zero-Forcing Dirty-Paper Coding

by Jisheng Dai, Yeung Sam Hung, et al. , 2009
"... In this paper, an efficient greedy scheduler for zero-forcing dirty-paper coding (ZF-DPC), which can be incorporated in complex Householder QR factorization of the channel matrix, is proposed. The ratio of the complexity of the proposed scheduler to the complexity of the channel matrix factorizatio ..."
Abstract - Add to MetaCart
In this paper, an efficient greedy scheduler for zero-forcing dirty-paper coding (ZF-DPC), which can be incorporated in complex Householder QR factorization of the channel matrix, is proposed. The ratio of the complexity of the proposed scheduler to the complexity of the channel matrix

Power and Bandwidth Allocation in Cooperative Dirty Paper Coding

by Chris T. K. Ng, Nihar Jindal, Andrea J. Goldsmith, Urbashi Mitra
"... Abstract — The cooperative dirty paper coding (DPC) rate region is investigated in a two-transmitter two-receiver network with full channel state information available at all terminals. The transmitters cooperate by first exchanging messages over an orthogonal cooperation channel, then they mimic a ..."
Abstract - Add to MetaCart
Abstract — The cooperative dirty paper coding (DPC) rate region is investigated in a two-transmitter two-receiver network with full channel state information available at all terminals. The transmitters cooperate by first exchanging messages over an orthogonal cooperation channel, then they mimic a
Results 1 - 10 of 310