Name
Abstract | ||
|---|---|---|
Binary LDPC coded relay systems have been well studied previously with the assumption of infinite codeword length. In this paper, we deal with non-binary LDPC codes which can outperform their binary counterpart especially for practical codeword length. We utilize non-binary LDPC codes and recently invented non-binary coding techniques known as multiplicative repetition to design the low-rate coding strategy for the decode-and-forward half-duplex relay channel. We claim that the proposed strategy is simple since the destination and the relay can decode with almost the same computational complexity by sharing the same structure of decoder. Numerical experiments are carried out to show that the performances obtained by non-binary LDPC coded relay systems surpass the capacity of direct transmission and also approach within less than 1.5 dB from the achievable rate of the relay channels. |
Year | Venue | Keywords |
|---|---|---|
2011 | CoRR | computational complexity,information theory,ldpc code,relay channel |
Field | DocType | Volume |
Relay channel,Mathematical optimization,Low-density parity-check code,Communication channel,Algorithm,Coding (social sciences),Theoretical computer science,Code word,Relay,Mathematics,Binary number,Computational complexity theory | Journal | abs/1108.3285 |
Citations | PageRank | References |
3 | 0.53 | 17 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Puripong Suthisopapan | 1 | 11 | 2.77 |
| K. Kasai | 2 | 319 | 33.57 |
| Anupap Meesomboon | 3 | 11 | 2.43 |
| Virasit Imtawil | 4 | 11 | 3.11 |
| Kohichi Sakaniwa | 5 | 330 | 47.69 |