Name
Abstract | ||
|---|---|---|
This paper studies dirty-paper coding in a Gaussian broadcast channel with two receivers. It finds that an approximate version of dirty-paper coding using low-density lattices can be implemented with a complexity that is polynomial-time on average in the block length. The main difference between this paper and prior work is that a non-binary LDPC-based lattice codebook is used for each user, and one codebook is aligned with the other. The low-density nature enables tractable encoding and decoding algorithms, and the alignment gives structure to the overall signal transmitted and it enables us to perform the encoding and decoding efficiently. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1109/ICASSP.2010.5496012 | ICASSP |
Keywords | Field | DocType |
dirty-paper coding,gaussian channels,broadcast channels,ldpc codes,low-density lattices,polynomial-time,channel coding,tractable encoding,gaussian broadcast channel,structured dirty-paper coding,receivers,decoding algorithms,radio receivers,nested lattice codes,nonbinary ldpc-based lattice codebook,block length,broadcasting,additives,channel state information,hydrogen,ldpc code,decoding,gaussian noise,transmitters,polynomials,encoding,polynomial time,lattices | Dirty paper coding,Computer science,Low-density parity-check code,Theoretical computer science,Coding (social sciences),Decoding methods,Time complexity,Gaussian noise,Codebook,Encoding (memory) | Conference |
ISSN | ISBN | Citations |
1520-6149 E-ISBN : 978-1-4244-4296-6 | 978-1-4244-4296-6 | 1 |
PageRank | References | Authors |
0.36 | 8 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sang Hyun Lee | 1 | 206 | 33.61 |
| Ankit Ghiya | 2 | 1 | 0.36 |
| Sriram Vishwanath | 3 | 4185 | 445.45 |
| Sung Soo Hwang | 4 | 14 | 4.28 |
| Sunghwan Kim | 5 | 40 | 2.87 |