Electrical Engineering Systems Seminar

After recalling some simple facts, we show that the erasure channel and the fading channel are equivalent from diversity point of view. The proof does not depend on the type of channel coding neither on the decoding algorithm, i.e. the equivalence is intrinsic to the channel. Then, as an application of this diversity equivalence, we show old and new full-diversity constructions of codes on graphs such as product codes, Tanner codes, and LDPC codes. Finally, the analysis of nonequivalence in terms of coding gain leads to the notion of doping for parity bits.