Combined channel and entropy decoding

Details Combined channel and entropy decoding Combined channel and entropy decoding

2000-09-22

2004-10-05

Chin, Stephen (Department: 2634)

Pulse or digital communications

Receivers

Particular pulse demodulator or detector

C375S233000, C375S232000

Reexamination Certificate

active

06801588

ABSTRACT:

FIELD OF INVENTION
This invention relates to digital communications and, more particularly, to channel and entropy coding.
BACKGROUND OF INVENTION
In digital communication, source information is quantized into bits and entropy-coded into code-words of variable length. This process is generally called redundancy reduction in speech, still image and video. See A. K. Jain, “Fundamentals of Digital Image Processing,” published by Prentice Hall, 1989. The entropy-coded symbols are added with controlled amount of redundancy, which is generally called channel-coding. See R. E. Ziemer and W. H. Tranter, “Principles of Communication Systems, Modulation and Noise,” published by Houghton Mifflin, 1995. The resultant sequence of binary data is converted into analog, modulated and transmitted on an RF carrier.
The received signal is demodulated into base-band signal, which is again converted into digital for channel decoding, through which, using the redundancy added at the transmission side, errors that occurred are corrected. The resultant sequence of binary data is then decoded into source code-words by mapping binary data segment into an element of a variable code.
In the standard implementation of a communication system, channel decoding and entropy decoding are treated as separate function blocks because their counterparts, entropy encoding and channel encoding, are treated separately.
SUMMARY OF INVENTION
In this application, it is taught that a new combined implementation of channel and entropy decoder significantly improves the transmission bit-error rate. The gained improvement is due to the use of maximum-likelihood information generated by the channel decoder and the intrinsic property of the variable-length codes that the code-lengths are variable.


REFERENCES:
patent: 5491479 (1996-02-01), Wilkinson
patent: 6046874 (2000-04-01), Takahashi
patent: 6161209 (2000-12-01), Moher
patent: 6678263 (2004-01-01), Hammons et al.
A.J. Viterbi; An Intuitive Justification and a Simplified Implementation of a MAP Decoder for Convolutional Codes; IEEE Journal on Selected Areas in Communications; vol. 16, No. 2; Feb. 1998; p. 260-264.*
S. Benedetto et al.; A Soft-Input Soft-Output Maximum A Posteriori (MAP) Module to Decode Parallel and Serial Concatenated Codes; TDA Progress Report 42-127; Nov. 15th, 1996; p. 1-20.*
S. Benedetto et al.; A Soft-Input Soft-Output APP Module for Iterative Decoding of Concatenated Codes; IEEE Communications Letters; vol. 1, No. 1; Jan. 1997; p. 22-24.*
M. Park et al.; Improved Joint Source-Channel Decoding for Variable-Length Encoded Data Using Soft Decisions and MMSE Estimation; IEEE Trnscations on Communications; 1999.*
J. Wen et al.; Soft-Input Soft-Output Decoding of Variable Length Codes; IEEE Transcations on Communications; vol. 50, No. 3; May 2002; p. 689-692.*
Jiangtao Wen, et al. “Utilizing Soft Information in Decoding of Variable Length Codes” Data Compression Conference, Proceedings DCC 99, IEEE Computer Society Press, Los Alamitos, California, pp. 131-139, Mar. 29, 1999.
James L. Massey “Variable-Length Codes and the Fano Metric” IEEE Transactions on Information Theory, vol. 18, No. 1, pp. 196-198, Jan. 1972.
N. Demir, et al. “Joint Source/Channel Coding for Variable Length Codes” Data Compression Conference, Proceedings DCC 98, IEEE Computer Society Press, Los Alamitos, California, pp. 139-148, Mar. 30, 1998.
A. Kopansky, et al. “Sequential Decoding of MPEG-4 Coded Bitstreams for Error Resilience” Conference on Information Sciences and Systems, Baltimore, Maryland, Proceedings CISS 99, Mar. 17-19, 1999.
K.P. Subbalakshmi, et al. “Joint Source-Channel Decoding of Entropy Coded Markov Sources Over Binary Symmetric Channels” IEEE International Conference on Communications, Proceedings ICC 99, Vancouver, California, New York, IEEE Inc. New York, vol. 1, pp. 446-450, Jun. 6, 1999.
Vladimir B. Balakirsky “Joint Source-Channel Coding with Variable Length Codes” IEEE International Symposium on Information Theory, Ulm, Germany, Proceedings ISIT 97, IEEE Inc. New York, Jun. 29, 1997—Jul. 4, 1997.
Joachin Hagenauer, et al. “Iterative Decoding of Binary Block and Convolutional Codes” IEEE Transactions on Information Theory, IEEE Inc. New York, vol. 42, No. 2, pp. 429-445, Mar. 1996.

Affiliated with

Also associated with

Rating

Combined channel and entropy decoding does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Combined channel and entropy decoding, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Combined channel and entropy decoding will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3315570