Title :
Binary dirty paper coding
Author :
Castanheira, Daniel ; Gameiro, Atilio
Author_Institution :
Inst. de Telec., Aveiro Univ., Aveiro, Portugal
Abstract :
This paper proposes a practical scheme for implementing binary dirty paper coding (DPC) using a low density generator matrix code (LDGM) concatenated with a high rate low density parity check (LDPC) code. We also propose a new algorithm, a modified version of the belief propagation algorithm (BP), for doing lossy source coding at the encoder, with linear complexity in the block length. In contrast to the superposition coding framework, where high order alphabet codes are used, we propose to implement binary DPC using only binary codes. Through application of approximate density evolution and linear programming we optimize the degree distribution of the proposed code. Simulation results show that our scheme achieves close to state-of-the-art performance with reduced complexity.
Keywords :
binary codes; communication complexity; linear programming; parity check codes; source coding; LDGM; LDPC code; approximate density evolution; belief propagation algorithm; binary DPC; binary codes; binary dirty paper coding; block length; degree distribution; encoder; high order alphabet codes; linear complexity; linear programming; lossy source coding; low density generator matrix code; low density parity check code; reduced complexity; state-of-the-art performance; superposition coding framework; Belief propagation; Binary codes; Complexity theory; Generators; Parity check codes; Source coding;
Conference_Titel :
Future Network and Mobile Summit, 2010
Conference_Location :
Florence
Print_ISBN :
978-1-905824-16-8