An Efficient Joint Source-Channel Decoder with Dynamical Block Priors | Zendy

Ido Kanter | Zendy; Haggai Kfir | Zendy; Shahar Keren | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

An Efficient Joint Source-Channel Decoder with Dynamical Block Priors

Author(s) -

Ido Kanter,

Haggai Kfir,

Shahar Keren

Publication year - 2005

Publication title -

progress of theoretical physics supplement

Language(s) - English

Resource type - Journals

ISSN - 0375-9687

DOI - 10.1143/ptps.157.184

Subject(s) - saddle point , algorithm , computer science , joint (building) , prior probability , mathematics , entropy (arrow of time) , source code , markov process , artificial intelligence , bayesian probability , geometry , physics , statistics , architectural engineering , quantum mechanics , engineering , operating system

An efficient joint source-channel (s/c) decoder based on the side informationof the source and on the MN-Gallager algorithm over Galois fields is presented.The dynamical block priors (DBP) are derived either from a statisticalmechanical approach via calculation of the entropy for the correlatedsequences, or from the Markovian transition matrix. The Markovian joint s/cdecoder has many advantages over the statistical mechanical approach. Inparticular, there is no need for the construction and the diagonalization of aqXq matrix and for a solution to saddle point equations in q dimensions. Usingparametric estimation, an efficient joint s/c decoder with the lack of sideinformation is discussed. Besides the variant joint s/c decoders presented, wealso show that the available sets of autocorrelations consist of a convexvolume, and its structure can be found using the Simplex algorithm.Comment: 13 pages, to appear in "Progress in Theoretical Physics Supplement", May 200

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research