Back to Search
Start Over
Practical Dirty Paper Coding With Sum Codes
- Source :
- IEEE Transactions on Communications. 64:441-455
- Publication Year :
- 2016
- Publisher :
- Institute of Electrical and Electronics Engineers (IEEE), 2016.
-
Abstract
- In this paper, we present a practical method to construct dirty paper coding (DPC) schemes using sum codes. Unlike the commonly used approach to DPC where the coding scheme involves concatenation of a channel code and a quantization code, the proposed method embodies a unified approach that emulates the binning method used in the proof of the DPC result. Auxiliary bits are used to create the desired number of code vectors in each bin. Sum codes are obtained when information sequences augmented with auxiliary bits are encoded using linear block codes. Sum-code-based DPC schemes can be implemented using any linear block code, and entail a relatively small increase in decoder complexity when compared to standard communication schemes. They can also lead to significant reduction in transmit power in comparison to standard schemes.
- Subjects :
- Block code
021110 strategic, defence & security studies
Theoretical computer science
Concatenated error correction code
0211 other engineering and technologies
Variable-length code
020206 networking & telecommunications
Data_CODINGANDINFORMATIONTHEORY
02 engineering and technology
Linear code
Systematic code
Cyclic code
0202 electrical engineering, electronic engineering, information engineering
Constant-weight code
Electrical and Electronic Engineering
Low-density parity-check code
Algorithm
Computer Science::Information Theory
Mathematics
Subjects
Details
- ISSN :
- 15580857 and 00906778
- Volume :
- 64
- Database :
- OpenAIRE
- Journal :
- IEEE Transactions on Communications
- Accession number :
- edsair.doi...........d8e39fffd364a86af4791d2ddc65eaad