Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Extremal Problems of Information Combining Yibo Jiang, Alexei Ashikhmin, Ralf Koetter, Andrew C. Singer
 

Summary: 1
Extremal Problems of Information Combining
Yibo Jiang, Alexei Ashikhmin, Ralf Koetter, Andrew C. Singer
Abstract-- In this paper we study moments of soft-bits of
binary-input symmetric-output channels and solve some extremal
problems of the moments. We use these results to solve the
extremal information combining problem. Further, we extend the
information combining problem by adding a constraint on the
second moment of soft-bits, and find the extremal distributions
for this new problem. The results for this extension problem
are used to improve the prediction of convergence of the belief
propagation decoding of low-density parity-check codes, provided
that another extremal problem related to the variable nodes be
solved.
Index Terms-- EXIT functions, Information combining, LDPC
codes.
I. INTRODUCTION
Low-density parity-check (LDPC) codes were invented by
Gallager [1] in 1960. In recent years, there has been surg-
ing interest in LDPC codes. A lot of work has been done

  

Source: Ashikhmin, Alexei - Enabling Computing Technologies, Bell Laboratories

 

Collections: Engineering; Mathematics; Computer Technologies and Information Sciences