Joint source-channel decoding based on source residual redundancy has already proven to be an effective mechanism for error-resilient data compression. However, when it comes to memory channel, in most of the cases, cares could not be taken enough to estimate transition probability between received and transmitted signals. In this paper, we present an optimum JSCD algorithm on the context of Markov source and Gilbert channel. Apart from this, on account of complexity and loss of some statistic data gained at the transmitting end, almost none of JSCD techniques are used with FEC. Even so, people know exactly that for noisier channels, JSCD can possibly apply with FEC to reduce the coding rate and also to extend the range of conditions under which the bit stream is adequately protected. Being motivated by the idea, we are going to propose a new concept that uses FEC and JSCD jointly and efficiently so that it could benefit us with better error correcting capabilities.
|Number of pages||6|
|State||Published - 2 Nov 2004|
|Event||Proceedings - 2004 Global Mobile Congress - Shanghai, China|
Duration: 11 Oct 2004 → 13 Oct 2004
|Conference||Proceedings - 2004 Global Mobile Congress|
|Period||11/10/04 → 13/10/04|