An Efficient Joint Source-Channel Decoder with Dynamical Block Priors

Physics – Condensed Matter – Disordered Systems and Neural Networks

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

13 pages, to appear in "Progress in Theoretical Physics Supplement", May 2005

Scientific paper

10.1143/PTPS.157.184

An efficient joint source-channel (s/c) decoder based on the side information of the source and on the MN-Gallager algorithm over Galois fields is presented. The dynamical block priors (DBP) are derived either from a statistical mechanical approach via calculation of the entropy for the correlated sequences, or from the Markovian transition matrix. The Markovian joint s/c decoder has many advantages over the statistical mechanical approach. In particular, there is no need for the construction and the diagonalization of a qXq matrix and for a solution to saddle point equations in q dimensions. Using parametric estimation, an efficient joint s/c decoder with the lack of side information is discussed. Besides the variant joint s/c decoders presented, we also show that the available sets of autocorrelations consist of a convex volume, and its structure can be found using the Simplex algorithm.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

An Efficient Joint Source-Channel Decoder with Dynamical Block Priors does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An Efficient Joint Source-Channel Decoder with Dynamical Block Priors, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Efficient Joint Source-Channel Decoder with Dynamical Block Priors will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-121158

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.