Rice Digital Scholarship Archive (Rice University) · 2005 · 24 citations · 17 references
Open access
EngineeringComputer ScienceElectrical EngineeringInformation TheoryOptimizationWireless CommunicationsChannel CodingCoding TheoryError Control CodingError-correcting CodesNetwork Information TheoryWireless Channel ModelingBelief PropagationBelief Propagation DecodingDecode-forward RelayingForward RelayingHalf-duplex CommunicationInformation-theoretic CodingLdpc CodesRelay Channel
We propose LDPC code designs for the half-duplex relay channel.Our designs mimic the information theoretic random coding scheme for decode-and-forward relaying.An important advantage of our scheme is that it is built entirely of single-user codes that can be decoded by belief propagation.The optimization of relay LDPC code profiles presents unique challenges, which are met by using the density evolution algorithm with additional constraints for relaying.To speed up our optimization, we use a Gaussian approximation of density evolution that converts the infinite dimensional code profile optimization into a simple linear programming problem.The thresholds of the discovered relay code profiles are within 0.4 dB of the achievable lower bound for decode-and-forward relaying.
17
Low-density parity-check codes
Robert G. Gallager · IEEE Transactions on Information Theory · 1962 · 10.6K citations · Full text
Capacity theorems for the relay channel
Thomas M. Cover, Abbas El Gamal · IEEE Transactions on Information Theory · 1979 · 4.2K citations