Bounds and lattice-based transmission strategies for the phase-faded dirty-paper channel

Bennatan, A.; Aggarwal, Vaneet; Wu, Yunnan; Calderbank, A.R.; Hoydis, Jakob; Chindapol, A.

doi:10.1109/twc.2009.080569

Cited by 10 publications

(18 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We extend the lower bound derived in [4] and generalize the upper bound that were firstly proposed in [1] for a predetermined values of φ and then generalized to an arbitrary value of φ in [4].…”

Section: Introductionmentioning

confidence: 77%

“…In this paper, we generalize the results of [1,3,4] where we assume that the transmitter has lack of magnitude and phase knowledge. We refer to such a situation as the faded dirty paper channel(F-DPC).…”

Section: Introductionmentioning

confidence: 93%

“…In [4], the autors followed [1] and studied the compound channel formulation instead of outage probabilities. In particular, they derived lower and upper bounds on the achievable bounds when the interference phase is unknown at the transmitter.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Bounds on the Achievable Rates of Faded Dirty Paper Channel

Al-qudah¹,

Shehab²

2017

IJCNC

View full text Add to dashboard Cite

show abstract

Section: Introductionmentioning

confidence: 77%

Section: Introductionmentioning

confidence: 93%

See 1 more Smart Citation

Bounds on the Achievable Rates of Faded Dirty Paper Channel

Al-qudah¹,

Shehab²

2017

IJCNC

View full text Add to dashboard Cite

show abstract

“…The optimal value of the power inflation factor β is derived using Lattice based codes approach similar to [5], [8], [13], [16], [18].…”

Section: A Transmitter Designmentioning

confidence: 99%

“…Such interference cancelation schemes at the transmitter are commonly known as dirty paper coding (DPC) [1] and are being used in a wide range of applications such as MIMO channels and fading channels [2]- [4]. The performance of DPC has been widely studied for the single input single output (SISO) channel with perfect noncausal interference [1], faded non-causal interference [5], and noisy causal interference [6]. These capacity limits have been extended to MIMO systems such as the broadcast channel [4] and the cognitive Z-interference channel [7].…”

Section: Introductionmentioning

confidence: 99%

Multiple input multiple output Dirty paper coding: System design and performance

Al-qudah

Rajan

2012

2012 International Conference on Computing, Networking and Communications (ICNC)

View full text Add to dashboard Cite

Abstract-In this paper, a practical multiple input multiple output Dirty paper coding (MIMO-DPC) scheme is designed to cancel the effect of additive interference that is known perfectly to the transmitter. The proposed system uses a trio of encoders -a LDPC code, a vector quantizer implemented as a convolutional decoder and an Orthogonal space time block code (STBC) to achieve temporal coding gain, interference cancelation and spatial diversity, respectively. First, we derive the equivalent noise seen by the receiver using an equivalent lattice based dirty paper code. Then the optimal value of the power inflation factor, which is one of the key system parameters used to minimize the equivalent noise seen by the receiver is derived. Furthermore, we analytically prove that the equivalent noise seen by the receiver tends to 0 for large number of receive antennas. Performance results in the case of various number of receiver antennas are presented and show that significant reduction in bit error probabilities can be obtained over a system that uses no interference cancelation.

show abstract

A new practical interference mitigation scheme for interference cognitive radio networks

Ghavami

Abolhassani

2012

Int J Communication

View full text Add to dashboard Cite

In this paper, a new practical dirty paper coding scheme and its extension is proposed for interference mitigation of a single TV broadcast station in uplink and downlink of a cognitive radio network using both a single secondary user (SU) and multiple SU scenarios. In the single SU scenario, which is called interference cognitive radio channel, derived simulation results show that the transmission rate of the SU archives the capacity of an AWGN channel with the cost of a 2.5 dB extra signal-to-noise ratio. In the sequel, the proposed scheme is extended to a multiple SU scenario using direct sequence spread spectrum technique in both uplink and downlink considering a TV band. Derived simulation results show that the number of supportable SUs in our proposed scheme increases to a fully loaded scenario of the same multiuser direct sequence spread spectrum system. KEY WORDS: cognitive radio; dirty paper coding; interference suppuration; lattice quantizer R 2 ; meanwhile, S 2 knows the transmitted message of S 1 . To derive achievable rate, authors in [3] used the following ideas: Gel'fand and Pinsker's coding for channel with known interference in the transmitter [8], Costa's dirty paper coding (DPC) [9], achievable scheme for IFC [2] and capacity of Gaussian MIMO channel [10]. Also, achievable rate region for the IFC, which has been described by Han and Kobayashi [11], is used widely by the authors in [3]. Implementation of Costa's DPC idea [9] based on nonrandom codes has been made in [12] and [13] using lattice precoding for a single user scenario. In [12], authors used parallel concatenated code (PCC) or turbo code as a channel

show abstract

Bounds and lattice-based transmission strategies for the phase-faded dirty-paper channel

Cited by 10 publications

References 20 publications

Bounds on the Achievable Rates of Faded Dirty Paper Channel

Bounds on the Achievable Rates of Faded Dirty Paper Channel

Multiple input multiple output Dirty paper coding: System design and performance

A new practical interference mitigation scheme for interference cognitive radio networks

Contact Info

Product

Resources

About