Design of LDPC codes for binary-input Gaussian interference channels

Due to the existence of multiuser interference, codes optimized for point-to-point links may be unsuitable for multiuser networks. In this paper, we are concerned with the design of low-density parity-check (LDPC) codes for binary-input Gaussian interference channels (GIFC). We utilize a Monte-Carlo...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE International Conference on Communications in China workshops s. 70 - 74
Hlavní autoři: Shancheng Zhao, Xiao Ma, Baoming Bai
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.10.2014
Témata:
Algorithm design and analysis
AWGN channels
Decoding
Gaussian interference channels
Iterative decoding
joint decoding algorithm
Joints
LDPC codes
multiuser systems
Optimization
Tanner graph
ISSN:2377-8644
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Due to the existence of multiuser interference, codes optimized for point-to-point links may be unsuitable for multiuser networks. In this paper, we are concerned with the design of low-density parity-check (LDPC) codes for binary-input Gaussian interference channels (GIFC). We utilize a Monte-Carlo approach based on the downhill-simplex algorithm to obtain good LDPC degree distributions for GIFC. Simulation results show that the constructed codes perform better than codes optimized only for point-to-point links. For symmetric GIFC with coefficient h 2 = 0.75, coding gain about 0.6 dB is obtained. These results indicate that, as opposed to using off-the-shell codes designed for point-to-point links, new codes should be designed in multiuser networks.
ISSN:2377-8644
DOI:10.1109/ICCChina.2014.7008245