2003
DOI: 10.1090/dimacs/062/09
|View full text |Cite
|
Sign up to set email alerts
|

Dirty paper coding: Perturbing off the infinite dimensional lattice limit

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
13
0

Year Published

2005
2005
2008
2008

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 19 publications
(13 citation statements)
references
References 0 publications
0
13
0
Order By: Relevance
“…In that case, ZFB only achieves a large fraction (70% − 80%) of the sum-capacity. Therefore, our setting of a fixed N t and a much larger K favors the use of ZFB over RKI in a practical cellular system, since the latter requires nested lattice codes, whose encoding and decoding is not easy, to implement interference pre-subtraction [7], [8]. Comparing the achievable sum-rate of ZFB corresponding to K = 20 and K = 40, we conclude that doubling the number of receive antennas for each user will not significantly increase the achievable sum-rate of ZFB if K N t .…”
Section: Simulation Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…In that case, ZFB only achieves a large fraction (70% − 80%) of the sum-capacity. Therefore, our setting of a fixed N t and a much larger K favors the use of ZFB over RKI in a practical cellular system, since the latter requires nested lattice codes, whose encoding and decoding is not easy, to implement interference pre-subtraction [7], [8]. Comparing the achievable sum-rate of ZFB corresponding to K = 20 and K = 40, we conclude that doubling the number of receive antennas for each user will not significantly increase the achievable sum-rate of ZFB if K N t .…”
Section: Simulation Resultsmentioning
confidence: 99%
“…RKI uses QR decomposition to triangularize the matrix channel and reduce it into at most N t parallel scalar sub-channels associated with different users, where the k -th sub-channel has interference only from subchannels with index less than k. Since the interference is non-causally known in each sub-channel, "writing on dirty paper" type coding is then applied sequentially on each subchannel to pre-subtract interference, which requires a modulus operation and dithering at the encoder and modulus operation at the decoder [7], [8]. It has been shown in [5] that RKI is optimal for asymptotically large SNR regardless of user ordering during the triangularization process if N r = 1 and N t > K. However, for practical values of SNR, RKI may not necessarily achieve the sum-rate capacity; different ordering results in different achievable rate.…”
Section: Practical Schemesmentioning
confidence: 99%
“…It permits application of dirty-paper coding designed for single-input single-output (SISO) systems. We refer the reader to [4,5,6,13,14,15,16] for further details on the DPC schemes. By applying the transformation in (11), the signal intended for terminal 1 is received without interference.…”
Section: Transmitter Optimization Schemesmentioning
confidence: 99%
“…One practical, but suboptimal, single-dimensional DPC solution is described in [14,15]. Starting from that solution we introduce the DPC scheme.…”
Section: B Spatial Prefiltering With Dpcmentioning
confidence: 99%
“…The first class of solutions uses "dirty paper coding" [2], which is a nonlinear precoding scheme for interference precancellation proposed by Costa [3]. The underlying idea is that when a transmitter has advance knowledge of the interference of a channel, an appropriate code can be designed to compensate for it, and the capacity of the channel is the same as if there was no interference.…”
Section: Introductionmentioning
confidence: 99%