Efficient cooperative transmission scheme for resource-constrained networks
Proceedings of the 6th ACM international symposium on Mobility management and wireless access
Design of joint network-low density parity check codes based on the EXIT charts
IEEE Communications Letters
Optimized low density parity check codes designs for half duplex relay channels
IEEE Transactions on Wireless Communications
Using the Bhattacharyya parameter for design and analysis of cooperative wireless systems
IEEE Transactions on Wireless Communications
Parity forwarding for multiple-relay networks
IEEE Transactions on Information Theory
Design of multi-edge type bilayer-expurgated LDPC codes
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Diversity analysis of irregular fractional cooperation
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Cooperative multiple trellis coded modulation
IEEE Transactions on Communications
Compress-forward coding with BPSK modulation for the half-duplex Gaussian relay channel
IEEE Transactions on Signal Processing
Analysis of the joint network LDPC codes over orthogonal multi-access relay channel
IEEE Communications Letters
On the capacity of the symbol-asynchronous relay channel
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
APCC'09 Proceedings of the 15th Asia-Pacific conference on Communications
Analysis and optimization of a rateless coded joint relay system
IEEE Transactions on Wireless Communications
| Hi-index | 754.90 |
This paper describes an efficient implementation of binning for decode-and-forward (DF) in relay channels using low-density parity-check (LDPC) codes. Bilayer LDPC codes are devised to approach the theoretically promised rate of the DF relaying strategy by incorporating relay-generated parity bits in specially designed bilayer graphical code structures. While conventional LDPC codes are sensitively tuned to operate efficiently at a certain channel parameter, the proposed bilayer LDPC codes are capable of working at two different channel parameters and two different rates: that at the relay and at the destination. To analyze the performance of bilayer LDPC codes, bilayer density evolution is devised as an extension of the standard density evolution algorithm. Based on bilayer density evolution, a design methodology is developed for the bilayer codes in which the degree distribution is iteratively improved using linear programming. Further, in order to approach to the theoretical DF rate for a wide range of channel parameters, this paper proposes two different forms of bilayer codes: the bilayer-expurgated and bilayer-lengthened codes. It is demonstrated that the rate of a properly designed bilayer LDPC code can closely approach the theoretical DF limit. Finally, it is shown that a generalized version of the proposed bilayer code construction is applicable to relay networks with multiple relays.