An efficient joint source-channel coding for a D-dimensional array

Physics – Condensed Matter – Statistical Mechanics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

19 pages and 12 figures

Scientific paper

An efficient joint source-channel (S/C) decoder based on the side information of the source and on the MN-Gallager Code over Galois fields, $q$, is presented. The dynamical posterior probabilities are derived either from the statistical mechanical approach for calculation of the entropy for the correlated sequences, or by the Markovian joint S/C algorithm. The Markovian joint S/C decoder has many advantages over the statistical mechanical approach, among them: (a) there is no need for the construction and the diagonalization of a $q \times q$ matrix and for a solution to saddle point equations in $q$ dimensions; (b) a generalization to a joint S/C coding of an array of two-dimensional bits (or higher dimensions) is achievable; (c) 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 coding for a D-dimensional array 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 coding for a D-dimensional array, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An efficient joint source-channel coding for a D-dimensional array will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-329053

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